A routing protocol for dynamic and large computer networks with clustering topology

The routing decision is one of the important research issues in the network fields. With the rapid development of high-speed networks, multimedia communication networks and mobile computer networks, the hierarchical routing techniques for the dynamic and large networks or high-speed networks have triggered interests among many people worldwide. This paper proposes a hierarchical dynamic routing protocol (HDRP), which can adapt to dynamic and large computer networks (DLCN) with clustering topology. It also gives the main procedures for realizing routing update and routing decision, and the proof of correctness and complexity analysis of the protocol. The performance measures of HDRP, including throughput and average message delay, are evaluated using simulation. The study shows that HDRP provides a new available approach to routing decision for DLCN with clustering topology.