DocumentCode
1319223
Title
Minimal order loop-free routing strategy
Author
Shin, Kang G. ; Chen, Ming-Syan
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI, USA
Volume
39
Issue
7
fYear
1990
fDate
7/1/1990 12:00:00 AM
Firstpage
870
Lastpage
881
Abstract
A multiorder routing strategy is developed which is loop-free even in the presence of link/node failures. Unlike most conventional methods in which the same routing strategy is applied indiscriminately to all nodes in the network, nodes under this proposal may adopt different routing strategies according to the network structure. Formulas are developed to determine the minimal order of routing strategy for each node to eliminate looping completely. A systematic procedure for striking a compromise between the operational overhead and network adaptability is proposed. Several illustrative examples are presented
Keywords
computer networks; packet switching; minimal order loop free routing strategy; multiorder routing strategy; network adaptability; operational overhead; Delay effects; Maintenance; Packet switching; Proposals; Routing; Tires;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.55689
Filename
55689
Link To Document