公开(公告)号：AT210907T

公开(公告)日：2001-12-15

申请号：AT93480067

申请日：1993-06-03

Applicant: IBM

Inventor： DERBY JEFFREY HASKELL ,  DRAKE JOHN ELLIS JR ,  DUDLEY JOHN GARY ,  HERVATIC ELIZABETH ANNE ,  JANNIELLO JAMES PATRICK ,  KAPLAN MARC ADAM ,  KESNER BARRY ,  KOPERDA FRANCIS RICHARD ,  PETERS MARCIA LAMBERT ,  POTTER KENNETH HARVEY JR ,  TSIGLER ANDREY LEV ,  MARIN GERALD ARNOLD ,  GOPAL INDER SARAT ,  CIDON ISRAEL

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

公开(公告)号：DE69327017D1

公开(公告)日：1999-12-23

申请号：DE69327017

申请日：1993-05-19

Applicant: IBM

Inventor： AUERBACH JOSHUA SETH ,  CHOW CHEE-SENG ,  PETERS MARCIA LAMBERT ,  DRAKE JOHN ELLIS ,  GOPAL PRABANDHAM MADAN ,  HERVATIC ELIZABETH ANNE ,  KAPLAN MARC ADAM

IPC: H04L12/18 ,  H04L12/24

Abstract: In a multicast network communication system, administration of the communication path making up the multicast tree itself has been separated from control and administration of the network. Creation of a multicast distribution tree and control over the membership thereof, is separately controlled independently from the creation and use of the tree transmission path used to communicate among the members of a multicast set. Transmission distribution trees are set up when a transmission request is received and the properties of the transmission path that is required are known. Transmission paths are created and controlled by all nodes in the communications system, each node having necessary control code and processors for responding to requests from set members to transmit a message to groups of users by creating and activating the necessary tree communication path distribution linkages. A distribution tree is created by the Tree Leader by generating a tree address using a random number generator. A tree address correlator is generated utilizing network and node identifiers unique for the network, and a list of subnodes or users connected for each member of the multicast tree set is generated. Using this information, a tree distribution path is computed to cover all of the subnodes required and a tree set up request message is sent by the Tree Leader along a computed path to each involved subnode. Each subnode returns a message indicating whether the tree address is already in use or is available for use. Successfully negotiated tree addresses are marked at the path link initiation and termination points at each node through the network.

公开(公告)号：AT186803T

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

申请号：AT93480060

申请日：1993-05-19

Applicant: IBM

Inventor： AUERBACH JOSHUA SETH ,  CHOW CHEE-SENG ,  PETERS MARCIA LAMBERT ,  DRAKE JOHN ELLIS JR ,  GOPAL PRABANDHAM MADAN ,  HERVATIC ELIZABETH ANNE ,  KAPLAN MARC ADAM

IPC: H04L12/18 ,  H04L12/24

Abstract: In a multicast network communication system, administration of the communication path making up the multicast tree itself has been separated from control and administration of the network. Creation of a multicast distribution tree and control over the membership thereof, is separately controlled independently from the creation and use of the tree transmission path used to communicate among the members of a multicast set. Transmission distribution trees are set up when a transmission request is received and the properties of the transmission path that is required are known. Transmission paths are created and controlled by all nodes in the communications system, each node having necessary control code and processors for responding to requests from set members to transmit a message to groups of users by creating and activating the necessary tree communication path distribution linkages. A distribution tree is created by the Tree Leader by generating a tree address using a random number generator. A tree address correlator is generated utilizing network and node identifiers unique for the network, and a list of subnodes or users connected for each member of the multicast tree set is generated. Using this information, a tree distribution path is computed to cover all of the subnodes required and a tree set up request message is sent by the Tree Leader along a computed path to each involved subnode. Each subnode returns a message indicating whether the tree address is already in use or is available for use. Successfully negotiated tree addresses are marked at the path link initiation and termination points at each node through the network.

公开(公告)号：DE69325957D1

公开(公告)日：1999-09-16

申请号：DE69325957

申请日：1993-05-19

Applicant: IBM

Inventor： CIDON ISRAEL ,  DAVENPORT DAVID WILLIAM ,  DERBY JEFFREY HASKELL ,  DUDLEY JOHN GARY ,  GOPAL INDER SARAT ,  JANNIELLO JAMES PATRICK ,  KAPLAN MARC ADAM ,  KOPERDA FRANK RICHARD ,  POTTER KENNETH HARVEY ,  KUTTEN SHAY

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.

公开(公告)号：AT183349T

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

申请号：AT93480059

申请日：1993-05-19

Applicant: IBM

Inventor： CIDON ISRAEL ,  DAVENPORT DAVID WILLIAM ,  DERBY JEFFREY HASKELL ,  DUDLEY JOHN GARY ,  GOPAL INDER SARAT ,  JANNIELLO JAMES PATRICK ,  KAPLAN MARC ADAM ,  KOPERDA FRANK RICHARD ,  POTTER KENNETH HARVEY JR ,  KUTTEN SHAY

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.

公开(公告)号：DE69022942T2

公开(公告)日：1996-05-30

申请号：DE69022942

申请日：1990-08-22

Applicant: IBM

Inventor： BARZILAI TSIPORA PIRCHA ,  CHEN MON-SONG ,  KADABA BHARATH KUMAR ,  KAPLAN MARC ADAM

IPC: H04L12/56

Abstract: A method for reducing transmission polling overhead of packets within a node of a communications network. This invention involves setting session ready bits in the line adaptor modules of the node. These bits are then used to inform a given module as to which modules of the node have packets that are bound for the given module. A given module of the node will not transmit a pacing message (YT control message) to another module unless it knows that the other module has a packet to transmit to the given module.

公开(公告)号：DE69022942D1

公开(公告)日：1995-11-16

申请号：DE69022942

申请日：1990-08-22

Applicant: IBM

Inventor： BARZILAI TSIPORA PIRCHA ,  CHEN MON-SONG ,  KADABA BHARATH KUMAR ,  KAPLAN MARC ADAM

IPC: H04L12/56

Abstract: A method for reducing transmission polling overhead of packets within a node of a communications network. This invention involves setting session ready bits in the line adaptor modules of the node. These bits are then used to inform a given module as to which modules of the node have packets that are bound for the given module. A given module of the node will not transmit a pacing message (YT control message) to another module unless it knows that the other module has a packet to transmit to the given module.

公开(公告)号：AU654930B2

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

申请号：AU3838993

申请日：1993-05-06

Applicant: IBM

Inventor： CIDON ISRAEL ,  DAVENPORT DAVID WILLIAM ,  DERBY JEFFREY HASKELL ,  DUDLEY JOHN GARY ,  GOPAL INDER SARAT ,  JANNIELLO JAMES PATRICK ,  KAPLAN MARC ADAM ,  KOPERDA FRANCIS RICHARD ,  KUTTEN SHAY ,  POTTER KENNETH HARVEY 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.

公开(公告)号：AU3838993A

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

申请号：AU3838993

申请日：1993-05-06

Applicant: IBM

Inventor： CIDON ISRAEL ,  DAVENPORT DAVID WILLIAM ,  DERBY JEFFREY HASKELL ,  DUDLEY JOHN GARY ,  GOPAL INDER SARAT ,  JANNIELLO JAMES PATRICK ,  KAPLAN MARC ADAM ,  KOPERDA FRANCIS RICHARD ,  KUTTEN SHAY ,  POTTER KENNETH HARVEY 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.