公开(公告)号：WO0243324A3

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

申请号：PCT/IB0102078

申请日：2001-11-12

Applicant: IBM ,  BAUER DANIEL ,  DAIGLE JOHN ,  ILIADIS ILIAS ,  SCOTTON PAOLO

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

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

CPC classification number: H04Q11/0478 ,  H04L45/124

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.

Abstract translation: 一种用于导出包括数据通信网络中的源节点和多个目的地节点的节点组的一组有效路径成本的方法，其中，所述组中的节点之间的路径的路径开销在网络中定义，并且每个路径 成本包括限制性成本和附加成本，包括首先迭代地识别较高带宽的路径，并且当遇到两个或更多个相等带宽的路径时，选择具有与之相关联的较低传输延迟的路径。

公开(公告)号：AU1259602A

公开(公告)日：2002-06-03

申请号：AU1259602

申请日：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.

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