This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Adaptive Hierarchical Routing Protocol
August 1989 (vol. 38 no. 8)
pp. 1059-1075
An adaptive hierarchical routing protocol based on the extension of the new Arpanet scheme is proposed and its simulated performance is presented. The protocol can adapt to rapidly changing environments and works for arbitrarily large networks. A number of existing schemes as well as the proposed scheme are simulated under many different environments and clustering structures. The proposed prot

[1] A. Baratz and J. Jaffe, "Establishing virtual circuits in large computer networks," inProc. IEEE INFOCOM, 1983, pp. 311-318.
[2] W. Chou, J. D. Powell, and A. W. Bragg, "Comparative evaluation of deterministic and adaptive routing," inFlow Control in Computer Networks, J.-L. Grange and M. Gien, Eds. IFIP, North-Holland, 1979, pp. 257-279.
[3] W. Chou, A. W. Bragg, and A. A. Nilsson, "The need for adaptive routing in the chaotic and unbalanced traffic environment,"IEEE Trans. Commun., vol. COM-29, pp. 481-490, Apr. 1981.
[4] W. Chu and M. Shen "A hierarchical routing and flow control policy (HRFC) for packet switched networks,"IEEE Trans. Comput., vol. C-29, Nov. 1980.
[5] S. E. Dreyfus and A. M. Law,The Art and Theory of Dynamic Programming. New York: Academic, 1977.
[6] G. P. A. Gomberget al., "A design study of a hierarchical connected packet switching network using simulation techniques,"Comput. Networks, vol. 3, pp. 114-135, 1979.
[7] J. Hagouel, "Routing issues in large networks," Ph.D. dissertation, Dep. Elec. Eng., Columbia University, 1983.
[8] R. R. Heritsch, "A distributed routing protocol for a packet radio network," S. M. Thesis, Naval Postgraduate School, Mar. 1982.
[9] F. Kamoun, "Design considerations for large computer communication networks," UCLA-ENG-7642, Dep. Comput. Sci., Univ. of California, Los Angeles, 1976.
[10] F. Kamoun and L. Kleinrock, "Stochastic performance evaluation of hierarchical routing for large networks,"Comput. Networks, vol. 3, pp. 337-353, 1979.
[11] L. Kleinrock and F. Kamoun, "Hierarchical routing for large networks-performance evaluation and optimizations,"Comput. Networksvol. 1, pp. 155-174, 1977.
[12] J. M. McQuillan, "Adaptive routing algorithms for distributed computer networks," BBN Rep. 2831, Cambridge, MA, May 1974.
[13] 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.
[14] R. Perlman, "Hierarchical networks and the subnetwork partition problem," inProc. Int. Conf. Syst. Sci., Jan 1982.
[15] M. Schwartz,Telecommunication Networks: Protocols, Modeling and Analysis. Reading, MA: Addison-Wesley, 1988.
[16] C. V. Ramamoorthy, O. Nishiguchi, and W. T. Tsai, "Simulation of hierarchical routing algorithms," Comput. Sci. Div., Dep. Elec. Eng. Comput. Sci., Univ. of California, Berkeley, CA, 1984.
[17] W. K. Tsai, G. M. Huang, J. K. Antonio, and W. T. Tsai, "Distributed iterative aggregation algorithms for box-constrained minimization problems and optimal routing in data networks,"IEEE Trans. Automat. Contr., Jan. 1989.
[18] W. T. Tsai, "Control and management of large and dynamic networks," Ph.D. dissertation, Dep. EECS, UC Berkeley, 1985.
[19] W. T. Tsai, C. V. Ramamoorthy, W. K. Tsai, and O. Nishiguchi, "A new adaptive hierarchical routing protocol," TR 88-80, Dep. Comput. Sci., Univ. of Minnesota, Minneapolis, MN 55455, 1988.

Index Terms:
adaptive hierarchical routing protocol; Arpanet scheme; simulated performance; arbitrarily large networks; clustering structures; routing performance; response speed; communication overhead; computer networks; protocols.
Citation:
W.T. Tsai, C.V. Ramamoorthy, W.K. Tsai, O. Nishiguchi, "An Adaptive Hierarchical Routing Protocol," IEEE Transactions on Computers, vol. 38, no. 8, pp. 1059-1075, Aug. 1989, doi:10.1109/12.30862
Usage of this product signifies your acceptance of the Terms of Use.