公开(公告)号：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.

公开(公告)号：CA2089790A1

公开(公告)日：1993-10-28

申请号：CA2089790

申请日：1993-02-18

Applicant: IBM

Inventor： LE BOUDEC JEAN-YVES ,  TRUONG HONG L ,  OECHSLE RAINER

IPC: H04L12/56 ,  H04Q11/04 ,  H04Q3/42

Abstract: Method and apparatus are disclosed for supporting the Asynchronous Transfer Mode (ATM) connectionless service by means of Partial Connections (PCs) in an ATM system (18). These PCs are established between the source users (10, 11, 17) of said ATM system (18) and the destination switching nodes (14) to which the destination users (15) are linked. The use of PCs has no constraints on the size of the domain because the information, which the source user (10, 11, 17) includes in the ConnectionLess (CL) cells to be transmitted to a destination user (15), is local to the source switching node (12).

公开(公告)号：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.

公开(公告)号：CA2089790C

公开(公告)日：1998-04-21

申请号：CA2089790

申请日：1993-02-18

Applicant: IBM

Inventor： TRUONG HONG LINH ,  LE BOUDEC JEAN-YVES ,  OECHSLE RAINER

IPC: H04L12/56 ,  H04Q11/04 ,  H04Q3/42

Abstract: Method and apparatus for supporting the Asynchronous Transfer Mode (ATM) connectionless service by means of Partial Connections (PCs) in an ATM system. These PCs are established between the source users of said ATM system and the destination switching nodes to which the destination users are linked. The use of PCs has no constraints on the size of the domain, because the information the source user includes in the ConnectionLess (CL) cells to be transmitted to a destination user, is local to the source switching node.