Performance evaluation of a hierarchical hybrid adaptive routing algorithm for large scale computer communication networks

A hierarchical hybrid adaptive routing algorithm (HHARA) is presented for dynamic large-scale computer communication networks (LSCCN). The performance of the proposed algorithm is evaluated and compared to that of nonhierarchical routing algorithms by simulation experiments on a 50-node network model. The major evaluation criteria are reliability, communication overhead, computation overhead, and average packet delay. A fixed routing algorithm, the most recent ARPANET routing algorithm, and HHARA are compared using simulation experiments. The simulation study indicates that HHARA makes a good balance between the reduction of routing database maintenance overhead, and the global routing capability as well as the local adaptivity to the network changes.<<ETX>>

[1]  Harry Rudin,et al.  On Routing and "Delta Routing": A Taxonomy and Performance Comparison of Techniques for Packet-Switched Networks , 1976, IEEE Trans. Commun..

[2]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[3]  Caldwell McCoy.  Improvements in Routing for Packet-Switched Networks , 1975 .

[4]  Jeffrey M. Jaffe,et al.  Establishing Virtual Circuits in Large Computer Networks , 1986, Comput. Networks.

[5]  B. Leiner,et al.  The DARPA internet protocol suite , 1985, IEEE Communications Magazine.

[6]  Mischa Schwartz,et al.  Routing and flow control in data networks , 1981, Perform. Evaluation.

[7]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[8]  Lixia Zhang,et al.  Designing a new architecture for packet switching communication networks , 1987, IEEE Communications Magazine.

[9]  Robert E. Lyons,et al.  Military Requirements for Packet-Switched Networks and Their Implications for Protocol Standardization , 1983, Comput. Networks.

[10]  William Stallings,et al.  Data and Computer Communications , 1985 .

[11]  Gary Lee Fultz,et al.  Adaptive routing techniques for message switching computer-communication networks , 1972 .

[12]  Farouk Kamoun,et al.  Stochastic Performance Evaluation of Hierarchical Routing for Large Networks , 1979, Comput. Networks.

[13]  C. V. Ramamoorthy,et al.  ADAPTIVE HIERARCHICAL ROUTING ALGORITHM. , 1983 .

[14]  George I. Stassinopoulos.  Optimal Dynamic Routing in Multidestination Networks , 1987, IEEE Trans. Commun..

[15]  Daniel Uri Friedman,et al.  Communication complexity of distributed shortest path algorithms , 1979 .

[16]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..