An Optimal Routing Algorithm in Multi-domain networks

• Main Authors: Ho, Peter, 何聿昇
• Other Authors: Jean-Lien C. Wu
• Format: Others
• Language: zh-TW
• Published: 1997
• Online Access: http://ndltd.ncl.edu.tw/handle/46015772229042371453

碩士 === 國立台灣工業技術學院 === 電子工程技術研究所 === 85 === In this thesis, we propose a routing method based on the approachesof Dimitrijevic's, Gallager's and Alaettinoglu's. We can observe that in a large and homogeneous network, such as packet switched network orATM network, hierarchical architecture is the key to achieve efficientrouting and management. We construct networks as infinite hierarchical levels, each level is called "domain". Nodes in a domain have the samevision of the whole network and each domain sees its ancestor's siblingas a single node. We develop an optimal and distributed routing algorithmfor such hierarchical networks. The proposed routing algorithm is basedon the prediction of packet queuing delay, and uses the K-T conditions toget the necessary conditions. The sufficient conditions are deduced fromthe necessary conditions. Every node adjusts its traffic from non-shortestpaths onto the shortest paths for each destination Finally we will show the simulation results of our routing algorithmand compare our algorithm with RIP. We found that Our routingalgorithm for flat networks is the most efficient. Our routing algorithmfor hierarchical networks is better than the RIP for flat networks.