公开(公告)号：DE68920490T2

公开(公告)日：1995-07-20

申请号：DE68920490

申请日：1989-05-23

Applicant: IBM

Inventor： CLARK KATHRYN E ,  DRAKE JOHN ELLIS ,  POZEFSKY DIANE PHYLLIS ,  SIDDALL WILLIAM EDWARD

IPC: H04L12/56

Abstract: A least weight route computation algorithm for use in computing routes through a data communications network is improved by recording the number of equally weighted paths to a particular node through different predecessor nodes. If a route must be selected to the particular node, the relative numbers of equally weighted routes through different predecessor nodes determines the probability with which a route will be selected through the particular predecessor node.

公开(公告)号：DE3853022D1

公开(公告)日：1995-03-23

申请号：DE3853022

申请日：1988-04-12

Applicant: IBM

Inventor： BARATZ ALAN EDWARD ,  DRAKE JOHN ELLIS ,  GROVER GEORGE ALLAN ,  RAFALOW LEE MARK ,  GRAY JAMES PEYTON ,  POLLARD MELINDA ROSS ,  POZEFSKY DIANE PHYLIS

IPC: G06F13/00 ,  H04L29/00 ,  G06F15/16

Abstract: Method of disseminating information in a computer network wherein, upon activating any link in the network, a first exchange of signals between nodes attached to said link is automatically initiated for providing each of the attached nodes with information indicating the availability of the node at the other end of the link for participating in a predetermined type session. If both nodes are available for participating in a the session, a second exchange of signals between the nodes is initiated for establishing a session. Then a third exchange is automatically initiated for providing the nodes with information needed to make effective use of the session. Upon completion of said third exchange, internal operations are conducted at said nodes designating the session as a predetermined type session and making said session available to transaction programs at the nodes for exchanging additional network state information as needed.

公开(公告)号：DE68920490D1

公开(公告)日：1995-02-23

申请号：DE68920490

申请日：1989-05-23

Applicant: IBM

Inventor： CLARK KATHRYN E ,  DRAKE JOHN ELLIS ,  POZEFSKY DIANE PHYLLIS ,  SIDDALL WILLIAM EDWARD

IPC: H04L12/56

Abstract: A least weight route computation algorithm for use in computing routes through a data communications network is improved by recording the number of equally weighted paths to a particular node through different predecessor nodes. If a route must be selected to the particular node, the relative numbers of equally weighted routes through different predecessor nodes determines the probability with which a route will be selected through the particular predecessor node.

公开(公告)号：DE3887572D1

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

申请号：DE3887572

申请日：1988-05-27

Applicant: IBM

Inventor： ARROWOOD ANDREW HILLIARD ,  BARATZ ALAN EDWARD ,  CHIMENTO PHILIP FRANCIS ,  DRAKE JOHN ELLIS ,  EISENBIES JOHN LAWRENCE ,  GRAY JAMES PEYTON ,  NORSWORTHY KARLA JEAN ,  POSEFSKY DIANE PHYLIS

IPC: H04L29/00 ,  G06F15/16

Abstract: Each network node in a communications network maintains its own copy of the network topology database defining network resources. Each resource record contains a "timer" field which is initially set to a maximum value but which may be decremented on a daily basis. If the timer field is decremented to zero without being reset, the node unilaterally removes the resource record from its copy of the database. The timer field will normally reach zero only for obsolete resource records since each network node responsible for a resource broadcasts a timer-resetting message for the resource (1) each time the resource status changes, (2) when the node first joins or rejoins the network, and (3) on a periodic (weekly) basis regardless of whether conditions (1) or (2) have occurred.