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.<>