|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| K.G. Shin, M.S Chen, "Minimal Order Loop-Free Routing Strategy," IEEE Transactions on Computers, vol. 39, no. 7, pp. 870-881, July, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/12.55689, author = {K.G. Shin and M.S Chen}, title = {Minimal Order Loop-Free Routing Strategy}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {7}, issn = {0018-9340}, year = {1990}, pages = {870-881}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.55689}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Minimal Order Loop-Free Routing Strategy IS - 7 SN - 0018-9340 SP870 EP881 EPD - 870-881 A1 - K.G. Shin, A1 - M.S Chen, PY - 1990 KW - minimal order loop free routing strategy; multiorder routing strategy; operational overhead; network adaptability; computer networks; packet switching. VL - 39 JA - IEEE Transactions on Computers ER - | |||
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.
[1] J. M. McQuillan, "Routing algorithms for computer networks--A survery," inProc. 1977 Nat. Telecommun. Conf., Dec. 1977, p. 28.
[2] M. Schwartz and T. E. Stern, "Routing technique used in computer communication networks,"IEEE Trans. Commun., vol. COM-28, no. 4, pp. 539-552, Apr. 1980.
[3] J. M. McQuillan and D. C. Walden, "The ARPA network design decisions,"Comput. Networks, vol. 1, no. 5, pp. 243-289, Aug. 1977.
[4] K. G. Shin and M.-S. Chen, "Performance analysis of distributed routing strategies free of ping-pong-type looping,"IEEE Trans. Comput., vol. C-36, no. 2, pp. 129-137, Feb. 1987.
[5] P. M. Merlin and A. Segall, "A failsafe distributed routing protocol,"IEEE Trans. Commun., vol. COM-27, no. 9, pp. 1280-1287, Sept. 1979.
[6] W. D. Tajibnapis, "A correctness proof of a topology information maintenance protocol for distributed computer networks,"Commun. ACM, vol. 20, pp. 477-485, 1977.
[7] J. M. Jaffe and F. H. Moss, "A responsive distributed routing algorithm for computer networks,"IEEE Trans. Commun., vol. COM- 30, no. 7, pp. 1758-1762, July 1982.
[8] J. M. McQuillan, I. Richer, and E. C. Rosen, "The new routing algorithm for the ARPANET,"IEEE Trans. Commun., vol. COM- 28, no. 5, pp. 711-719, May 1980.
[9] T. Cegrell, "A routing procedure for the TIDAS message-switching network,"IEEE Trans. Commun., vol. COM-23, no. 6, pp. 575-585, June 1975.
[10] W. E. Naylor, "A loop-free adaptive routing algorithm for packet switched networks," inProc. 4th Data Commun. Symp, P. Q., Canada, Oct. 1975, pp. 7-9 to 7-14.
[11] L. Kleinrock and H. Opderbeck, "Throughput in the ARPANET-protocols and measurement,"IEEE Trans. Commun., vol. COM-25, no. 1, pp. 367-376, Jan. 1977.
[12] M. J. Johnson, "Updating routing tables after resource failure in a distributed computer network,"Networks, vol. 14, pp. 379-391, 1984.
[13] K. G. Shin and M.-S. Chen, "On the number of acceptable task assignments in distributed computing systems,"IEEE Trans. Comput., vol. 39, no. 1, pp. 99-110, Jan. 1990.