动态大型计算机网络的路由通信协议

THE ROUTING PROTOCOL FOR DYNAMIC AND LARGE COMPUTER NETWORKS

本文提出了一种基于离散动态规划原理的分层动态路由协议（HDRP），它适应于分簇拓扑的动态大型计算机网络（DLCN）．文中给出了该协议路由信息更新和路由决策的实现过程，以及它的正确性证明和复杂性分析．通过仿真实验，研究了该协议的吞吐量和平均报文延迟等特性．文中还提出了一种基于学习自动机的网络故障概率估计方法及其路由策略．本文的研究表明，分层动态路由协议为动态大型计算机网络的路由决策提供了一种新的有效途径．

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.