公开(公告)号：DE60026400D1

公开(公告)日：2006-05-04

申请号：DE60026400

申请日：2000-07-13

Applicant: IBM

Inventor： DYKEMAN DOUGLAS ,  OSBORNE MICHAEL ,  SCOTTON PAOLO ,  STOKES OLEN ,  BASSO CLAUDE ,  AUBRY MARIANNE ,  KHAC MINH-TRI DO

IPC: G06F9/44 ,  G06F12/08 ,  G06F13/00 ,  H04L45/02 ,  H04L49/111 ,  H04Q11/04

Abstract: Address management methods and apparatus are provided for a node serving as peer group leader for a peer group of nodes in one level of the hierarchy of a PNNI hierarchical network, whereby the peer group leader represents the peer group to one or more neighboring nodes in the next level up of the hierarchy. The peer group leader has a memory (2) for storing peer group topology data (4), comprising address data which is supplied to the peer group leader from nodes in the peer group and represents addresses for access by the network, and peer group leader topology data (5), comprising address data which is supplied to said neighboring nodes by the peer group leader and represents addresses accessible via the peer group. The address management method comprises: checking whether addresses represented by said address data are accessible via the peer group; notifying said neighboring nodes of changes in the accessibility of addresses so identified; and updating said peer group leader topology data (5) in accordance with said changes.

公开(公告)号：BR0115551A

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

申请号：BR0115551

申请日：2001-11-12

Applicant: IBM

Inventor： BAUER DANIEL ,  DAIGLE JOHN ,  ILIADIS ILIAS ,  SCOTTON PAOLO

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

Abstract: A method for deriving a set of efficient path costs for a group of nodes comprising a source node and a plurality of destination nodes in a data communications networks, wherein the path costs for paths between nodes in the group are defined in the network and each path cost comprises a restrictive cost and an additive cost, comprises iteratively identifying the paths of higher bandwidth first and, when two or more paths of equal bandwidth are encountered, selecting the path having a lower transit delay associated therewith.

公开(公告)号：DE69331054D1

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

申请号：DE69331054

申请日：1993-07-30

Applicant: IBM

Inventor： GALAND CLAUDE ,  SCOTTON PAOLO

IPC: H04L12/24 ,  H04L12/56

Abstract: The object of the invention is to perform an automatic decomposition of a packet switching network in backbone nodes and subareas nodes to speed up the routing path search without degrading the optimization criterion of the routing algorithm and without generating additional control messages on the network. Currently, routing algorithms compute all the available paths in the network, from the source node to the destination node before to select an optimal route. However, networks are rarely fully meshed. They are usually built around a hierarchical structure : a set of nodes, interconnected by high throughput lines, are used to build a backbone with a high degree of meshing and then, local nodes are grouped in geographical subareas themselves attached to the backbone. Routing algorithms can take advantage of this particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are defined as usable and are taken in account by the algorithm in its path calculation.

公开(公告)号：CA2123441A1

公开(公告)日：1995-01-31

申请号：CA2123441

申请日：1994-05-12

Applicant: IBM

Inventor： GALAND CLAUDE ,  SCOTTON PAOLO

IPC: H04L12/24 ,  H04L12/56

Abstract: The object of the invention is to perform an automatic decomposition of a packet switching network in backbone nodes and subareas nodes to speed up the routing path search without degrading the optimization criterion of the routing algorithm and without generating additional control messages on the network. Currently, routing algorithms compute all the available paths in the network, from the source node to the destination node before to select an optimal route. However, networks are rarely fully meshed. They are usually built around a hierarchical structure : a set of nodes, interconnected by high throughput lines, are used to build a backbone with a high degree of meshing and then, local nodes are grouped in geographical subareas themselves attached to the backbone. Routing algorithms can take advantage of this particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are defined as usable and are taken in account by the algorithm in its path calculation.