Issue No. 07 - July (1990 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.55689
<p>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.</p>
minimal order loop free routing strategy; multiorder routing strategy; operational overhead; network adaptability; computer networks; packet switching.
K.G. Shin, M.S Chen, "Minimal Order Loop-Free Routing Strategy", IEEE Transactions on Computers, vol. 39, no. , pp. 870-881, July 1990, doi:10.1109/12.55689