公开(公告)号：CA2100541A1

公开(公告)日：1994-05-25

申请号：CA2100541

申请日：1993-07-14

Applicant: IBM

Inventor： DERBY JEFFREY H ,  DOERINGER WILLIBALD A ,  DRAKE JOHN E JR ,  DYKEMAN DOUGLAS H ,  SANDICK HALDON J ,  VU KEN V

IPC: H04L12/56 ,  H04L12/66

Abstract: The process for determining the best communication route from a source end station to a destination end station is distributed over both source and destination network nodes. Network nodes, at the interface between a wide area network (WAN) and each subnetwork, contain access agents to control the communication flow between the wide area network and an end station in the subnetwork. The task of selecting the best route between two end stations is distributed between the access agents at the WAN interface in the first subnetwork, and the access agents at the WAN interface in the second subnetwork. Each access agent at one WAN interface obtains the best route from itself to the end station in its subnetwork. Each access agent at the other WAN interface finds the best route from each access agent at the first WAN interface through itself to the end station in its subnetwork. One designated access agent collects all the best route information. This best route information is concatenated, and the route with the least weight is selected as the best route between end stations.

公开(公告)号：GB2331679B

公开(公告)日：2003-01-08

申请号：GB9817208

申请日：1998-08-10

Applicant: IBM

Inventor： JEFFRIES CLARK D ,  GHANWANI ANOOP ,  MARIN GERALD A ,  VU KEN V

IPC: H04L12/56 ,  H04L12/413

Abstract: A bin packing algorithm is employed to schedule computer network activities, such as pause times required for operation of an Ethernet network which implements existing IEEE 802.3x standards. In such a network, any node in the network can control the flow of traffic from upstream stations in order to avoid congestion at the flow-controlling node. Upon sensing congestion, the flow-controlling node determines how long each upstream node contributing to the congestion should pause transmission over the next control interval. In accordance with the invention, the pause times are scheduled or staggered by using the bin packing algorithm to sort the sources into one or more bins. One required bin property is that there is no overlap in pause times for the sources within a particular bin. Another required bin property is that the sum of the pause times within a bin can be no greater than the length of the control interval. In a preferred embodiment, the calculated pause times are separated into different groups having different number ranges and no more than one pause time is selected from any particular group for packing into a given bin.

公开(公告)号：CA2100542A1

公开(公告)日：1994-05-17

申请号：CA2100542

申请日：1993-07-14

Applicant: IBM

Inventor： DERBY JEFFREY H ,  DOERINGER WILLIBALD A ,  DRAKE JOHN E JR ,  DYKEMAN DOUGLAS H ,  LI LIANG ,  PETERS MARCIA L ,  SANDICK HALDON J ,  VU KEN V

IPC: H04L12/66

公开(公告)号：GB2331679A

公开(公告)日：1999-05-26

申请号：GB9817208

申请日：1998-08-10

Applicant: IBM

Inventor： JEFFRIES CLARK D ,  GHANWANI ANOOP ,  MARIN GERALD A ,  VU KEN V

IPC: H04L12/56 ,  H04L12/413

Abstract: A bin packing algorithm is employed to schedule computer network activities, such as pause times required for operation of an Ethernet network which implements existing IEEE 802.3x standards. In such a network, any node (42) in the network can control the flow of traffic from upstream stations in order to avoid congestion at the flow-controlling node. Upon sensing congestion (58), the flow-controlling node determines (60) how long each upstream node contributing to the congestion should pause transmission over the next control interval. The pause times are scheduled or staggered (62) by using the bin packing algorithm to sort the sources into one or more bins. One required bin property is that there is no overlap in pause times for the sources within a particular bin. Another required bin property is that the sum of the pause times within a bin can be no greater than the length of the control interval. In a preferred embodiment, the calculated pause times are separated into different groups having different number ranges and no more than one pause time is selected from any particular group for packing into a given bin.

公开(公告)号：CA2105351A1

公开(公告)日：1994-06-15

申请号：CA2105351

申请日：1993-09-01

Applicant: IBM

Inventor： DERBY JEFFREY H ,  DOERINGER WILLIBALD A ,  DYKEMAN HAROLD D ,  LI LIANG ,  SANDICK HALDON J ,  VU KEN V

IPC: H04L12/46 ,  H04L12/66

Abstract: A system for interconnecting widely separated local area networks (LANs) by means of a wide area network (WAN) utilizes network level facilities to establish a connection through the wide area network and to create connection table entries at the WAN access point which allow subsequent data frames to be transmitted through the wide area network without such network level operations. More particularly, the various LANs are combined into search groups, represented by address prefixes, to which LAN-initiated connection requests can be broadcast and which can respond so as to establish the data path connections. This system has the connection flexibility of a prior art router and, at the same time, the low overhead of a prior art bridge.