发明名称 |
ROUTING COSTS IN DATA NETWORKS |
摘要 |
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. |
申请公布号 |
WO0243324(A3) |
申请公布日期 |
2002.09.06 |
申请号 |
WO2001IB02078 |
申请日期 |
2001.11.12 |
申请人 |
INTERNATIONAL BUSINESS MACHINES CORPORATION;BAUER, DANIEL;DAIGLE, JOHN;ILIADIS, ILIAS;SCOTTON, PAOLO |
发明人 |
BAUER, DANIEL;DAIGLE, JOHN;ILIADIS, ILIAS;SCOTTON, PAOLO |
分类号 |
H04L12/18;H04L12/721;H04Q11/04 |
主分类号 |
H04L12/18 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|