THE ROUTING PROTOCOL FOR DYNAMIC AND LARGE COMPUTER NETWORKS
Li La · Chinese Journal of Computers · 1998
This paper presents a hierarchical dynamic routing protocol (HDRP)based on the discrete dynamic programming principle. The proposed protocol canadapt to dynamic and large computer networks (DLCN) with clustering topology.The procedures for realizing routing update and routing decision are given. Theproof of correctness and complexity analysis of the protocol are also made. Theperformance measures including throughput and average message delay are evaluatedusing simulation. Meanwhile,a method for estimating the link error probability andthe relative routing policy that are based on the learning automation theory are alsopresented. The study shows that HDRP provides a new available approach torouting decision for DLCN.