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

公开(公告)号：CA2094405A1

公开(公告)日：1993-12-19

申请号：CA2094405

申请日：1993-04-20

Applicant: IBM

Inventor： SIDON ISRAEL ,  DAVENPORT DAVID W ,  DERBY JEFFREY H ,  DUDLEY JOHN G ,  GOPAL INDER S ,  JANNIELLO JAMES P ,  KAPLAN MARC A ,  KOPERDA FRANK R ,  KUTTEN SHAY ,  POTTER KENNETH H JR

IPC: H04L12/18 ,  H04L12/56

Abstract: A packet communications system provides for point-to-point packet routing and broadcast packet routing to limited subsets of nodes in the network, using a routing field in the packet header which is processed according to two different protocols. A third protocol is provided in which a packet can be broadcast to the limited subset even when launched from a node which is not a member of the subset. The routing field includes a first portion which contains the route labels necessary to deliver the packet to the broadcast subset. A second portion of the routing field contains the broadcast subset identifier which can then be used to deliver the packet to all of the members of the broadcast subset. Provision is made to backtrack deliver the packet to the last node identified before the broadcast subset if that last node is itself a member of the subset.

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

公开(公告)号：CA2100539A1

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

申请号：CA2100539

申请日：1993-07-14

Applicant: IBM

Inventor： DERBY JEFFREY H ,  DRAKE JOHN E JR ,  DUDLEY JOHN G ,  HERVATIC ELIZABETH A ,  JANNIELLO JAMES P ,  KAPLAN MARC A ,  KESNER BARRY A ,  KOPERDA FRANCIS R ,  PETERS MARCIA L ,  POTTER KENNETH H ,  TSIGLER ANDREV L ,  MARIN GERALD A ,  GOPAL INDER S ,  CIDON ISRAEL

IPC: H04L12/18 ,  H04L12/56 ,  H04Q11/04

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

公开(公告)号：CA2099027A1

公开(公告)日：1994-03-11

申请号：CA2099027

申请日：1993-06-23

Applicant: IBM

Inventor： DERBY JEFFREY H ,  GUERIN ROCH ,  GUN LEVENT

IPC: H04L12/56 ,  H04N21/236 ,  H04N21/434 ,  H04Q11/04 ,  H04L12/26 ,  H04Q1/24

Abstract: A packet communications network relies on a few simple parameters to characterize the wide variety of traffic offered to that network, such as peak bit rate, mean bit rate and average packet burst length. A better representation of many types of traffic relies on an equivalent burst length which produces the same loss probability distribution, but assumes that the distribution is uncorrelated and exponential. Access control and bandwidth management based on such an equivalent burst length produces improved decisions due to the more accurate representation of the actual traffic distribution.

公开(公告)号：DE10105626B4

公开(公告)日：2006-07-06

申请号：DE10105626

申请日：2001-02-08

Applicant: IBM

Inventor： DERBY JEFFREY H

IPC: H03M13/09

公开(公告)号：DE10105626A1

公开(公告)日：2001-09-27

申请号：DE10105626

申请日：2001-02-08

Applicant: IBM

Inventor： DERBY JEFFREY H

IPC: H03M13/09

Abstract: The cyclic redundancy code calculation method has a protected data frame used as the input sequence for calculation of a cyclic redundancy code until the last block of the input sequence is reached. If the last block of the input sequence is full, the cyclic redundancy code is supplied, while otherwise a number of the last bits of the last block are set to zero and the cyclic redundancy code is re-calculated, with repetition until the last block is full. Also included are Independent claims for the following: (a) a system for calculation of a cyclic redundancy code; (b) a method for detecting an error in a transmitted data stream

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