Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.