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

公开(公告)号：AT177890T

公开(公告)日：1999-04-15

申请号：AT93480163

申请日：1993-10-19

Applicant: IBM

Inventor： DERBY JEFFREY HASKELL ,  DRAKE JOHN ELLIS JR ,  SANDICK HALDON J ,  DOERINGER WILLIBALD A ,  DYKEMAN DOUGLAS H ,  VU KEN VAN

IPC: H04L12/56

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.

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

公开(公告)号：DE69323963T2

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

申请号：DE69323963

申请日：1993-10-19

Applicant: IBM

Inventor： DERBY JEFFREY HASKELL ,  DRAKE JOHN ELLIS ,  SANDICK HALDON J ,  DOERINGER WILLIBALD A ,  DYKEMAN DOUGLAS H ,  VU KEN VAN

IPC: H04L12/56

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.

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

公开(公告)号：DE69332185T2

公开(公告)日：2003-04-30

申请号：DE69332185

申请日：1993-10-19

Applicant: IBM

Inventor： SANDICK HALDON J ,  DERBY JEFFREY HASKELL ,  DOERINGER WILLIBALD A ,  DRAKE JR ,  DYKEMAN DOUGLAS H ,  LI LIANG ,  PETERS MARCIA LAMBERT

IPC: H04L12/66

公开(公告)号：DE69332185D1

公开(公告)日：2002-09-12

申请号：DE69332185

申请日：1993-10-19

Applicant: IBM

Inventor： SANDICK HALDON J ,  DERBY JEFFREY HASKELL ,  DOERINGER WILLIBALD A ,  DRAKE JR ,  DYKEMAN DOUGLAS H ,  LI LIANG ,  PETERS MARCIA LAMBERT

IPC: H04L12/66

公开(公告)号：DE69323963D1

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

申请号：DE69323963

申请日：1993-10-19

Applicant: IBM

Inventor： DERBY JEFFREY HASKELL ,  DRAKE JOHN ELLIS ,  SANDICK HALDON J ,  DOERINGER WILLIBALD A ,  DYKEMAN DOUGLAS H ,  VU KEN VAN

IPC: H04L12/56

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.

公开(公告)号：CA2069710C

公开(公告)日：1996-08-20

申请号：CA2069710

申请日：1992-05-27

Applicant: IBM

Inventor： BIRD RAYMOND F ,  BRITTON KATHRYN H ,  CHUNG TEIN-YAW D ,  EDWARDS ALLAN K ,  MATHEW JOHNY ,  POZEFSKY DIANE P ,  SARKAR SOUMITRA ,  TURNER ROGER D ,  CHUNG WINSTON W-K ,  YEUNG YUE T ,  GRAY JAMES P ,  DYKEMAN HAROLD D ,  DOERINGER WILLIBALD A ,  AUERBACH JOSHUA S ,  WILSON JOHN H

IPC: G06F13/00 ,  H04L29/06 ,  G06F13/42 ,  H04L12/28

Abstract: A Transport Layer Protocol Boundary (TLPB) architecture is described which will permit an application program to run over a non-native transport protocol without first generating a protocol compensation package tailored to the transport protocols assumed by the program's application programming interface and by the available transport provider. All transport functions required by the program are converted to standardized or TLPB representations. When a connection between the first application program and a second remote application is requested, the individual required TLPB transport functions are compared to corresponding functions supported by the transport provider. Compensations are invoked only where there is a mismatch. The node on which the remote application program runs is informed of the compensations so that necessary de-compensation operations can be performed before the data is delivered to the remote application program.

公开(公告)号：BR9304797A

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

申请号：BR9304797

申请日：1993-11-23

Applicant: IBM

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

IPC: H04L12/56 ,  G06F15/20

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.