公开(公告)号：EP0618708A3

公开(公告)日：1998-06-24

申请号：EP94480016

申请日：1994-02-22

Applicant: IBM

Inventor： BOYLES RAY WILLIAM ,  GIERLACH MICHAEL FRANCIS ,  GOPAL PRABANDHAM MADAN ,  SULTAN ROBERT ,  VACEK GARY MICHAEL

IPC: G06F13/00 ,  H04L29/06 ,  H04L29/08

CPC classification number: H04L29/06 ,  H04L67/10 ,  H04L67/16

Abstract: A computer network in which resources are dynamically located through the use of LOCATE requests includes multiple cache server nodes, network nodes which have an additional obligation to build and maintain large caches of directory entries. Cache server nodes play a key role in the LOCATE process and can prevent redundant network-wide broadcasts of LOCATE requests. Where an origin cache server node receives a request from a served node, the cache server node searches its local directories first, then forwards the request to alternate cache server nodes if necessary. If the necessary information isn't found locally or in alternate cache server nodes, the LOCATE request is then broadcast to all network nodes in the network. If the broadcast results are negative, the request is forwarded to selected gateway nodes to permit the search to continue in adjacent networks.

公开(公告)号：DE69325398D1

公开(公告)日：1999-07-22

申请号：DE69325398

申请日：1993-12-24

Applicant: IBM

Inventor： LE BOUDEC JEAN-YVES ,  PRZYGIENDA ANTONI ,  SULTAN ROBERT

IPC: H04Q3/00 ,  H04L12/70 ,  H04L12/721 ,  H04Q3/66 ,  H04Q11/04 ,  H04L12/56

Abstract: PCT No. PCT/EP93/03683 Sec. 371 Date Sep. 12, 1996 Sec. 102(e) Date Sep. 12, 1996 PCT Filed Dec. 24, 1993 PCT Pub. No. WO95/18498 PCT Pub. Date Jul. 6, 1995This invention defines a routing method which allows a determination of best paths from link weights in situations where these weights are not additive, but the characteristic of a concatenated path is determined mainly by single "bottleneck" links. To be compatible, the metric must be chosen from a specific set of metrics, called bottleneck metrics in this description. The new widest-path method has some characteristics in common with the known Dijkstra method for additive weights. Implementations in communication networks are disclosed which lead to new nodes, new networks and new network protocols.

公开(公告)号：DE69325398T2

公开(公告)日：2000-01-20

申请号：DE69325398

申请日：1993-12-24

Applicant: IBM

Inventor： LE BOUDEC JEAN-YVES ,  PRZYGIENDA ANTONI ,  SULTAN ROBERT

IPC: H04Q3/00 ,  H04L12/70 ,  H04L12/721 ,  H04Q3/66 ,  H04Q11/04 ,  H04L12/56

Abstract: PCT No. PCT/EP93/03683 Sec. 371 Date Sep. 12, 1996 Sec. 102(e) Date Sep. 12, 1996 PCT Filed Dec. 24, 1993 PCT Pub. No. WO95/18498 PCT Pub. Date Jul. 6, 1995This invention defines a routing method which allows a determination of best paths from link weights in situations where these weights are not additive, but the characteristic of a concatenated path is determined mainly by single "bottleneck" links. To be compatible, the metric must be chosen from a specific set of metrics, called bottleneck metrics in this description. The new widest-path method has some characteristics in common with the known Dijkstra method for additive weights. Implementations in communication networks are disclosed which lead to new nodes, new networks and new network protocols.