发明名称 |
ROUTING BANDWIDTH-RESERVED CONNECTIONS IN INFORMATION NETWORKS |
摘要 |
This invention defines a routing method which allows to determine best paths from link weights in situations where these weights are not additive, but the characteristic of a concatenated path is determined mainly by single "bottleneck" links. To be compatible, the metric must be chosen from a specific set of metrics, called bottleneck metrics in this description. The new widest-path method has some characteristics in common with the known Dijkstra method for additive weights. Implementations in communication networks are disclosed which lead to new nodes, new networks and new network protocols. The widest-path method, however, can solve many other routing problems not necessarily related to electronic communication.
|
申请公布号 |
CA2179713(A1) |
申请公布日期 |
1995.07.06 |
申请号 |
CA19932179713 |
申请日期 |
1993.12.24 |
申请人 |
BUSINESS MACHINES CORPORATION |
发明人 |
LE BOUDEC, JEAN-YVES;PRZYGIENDA, ANTONI;SULTAN, ROBERT |
分类号 |
H04L12/729;H04L12/733;(IPC1-7):H04L12/56 |
主分类号 |
H04L12/729 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|