发明名称 |
LOOP-FREE MULTIPATH ROUTING ALGORITHM USING DISTANCE VECTORS |
摘要 |
A routing methodology for constructing multiple loop-free routes within a network of nodes executing the methodology. The method is capable of generating shortest-distance routing within the network and is not subject to the counting-to-infinity problem to which conventional distance-vector routing protocols are subject. By way of example the method comprises computing link distances D j< to generate routing graph SG>j< . The nodes exchange distance and status information and upon receiving increasing distance information diffusing computations are performed. The information collected is used to maintain routing tables, from which shortest-path routes may be selected according to loop-free invariant (LFI) conditions. |
申请公布号 |
WO02089402(A2) |
申请公布日期 |
2002.11.07 |
申请号 |
WO2001US51611 |
申请日期 |
2001.10.29 |
申请人 |
THE REGENTS OF THE UNIVERSITY OF CALIFORNIA |
发明人 |
GARCIA-LUNA-ACEVES, JOSE, JOAQUIN;VUTUKURY, SRINIVAS |
分类号 |
H04L12/56 |
主分类号 |
H04L12/56 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|