DocumentCode
1886633
Title
A Hierarchical Routing Model for Large Scale Networks Based on Ant Algorithm
Author
Tan, Guozhen ; Liu, Yi ; Yao, Hengwei ; Li, Jialin ; Han, Ningning
Author_Institution
Dalian University of Technology, 116023, P.R.China
fYear
2006
fDate
23-29 April 2006
Firstpage
88
Lastpage
88
Abstract
To satisfy the requirements of applications in large scale network, the network layer needs to provide corresponding support. Great efforts have been made to provide services over the Internet which is developing rapidly. In this paper, we propose a new hierarchical routing model - Network Tree Model, which can solve the best effort routing effectively and efficiently in large scale network. It achieves a sharp reduction in communication complexity and routing table scale with a high routing accuracy. Simulation results show that the proposed model and algorithm obtains high performance in traffic for convergence and routing accuracy as expected.
Keywords
Application software; Complexity theory; Computer science; Degradation; IP networks; Large-scale systems; Network topology; Routing; Telecommunication traffic; Web and internet services;
fLanguage
English
Publisher
ieee
Conference_Titel
Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies, 2006. ICN/ICONS/MCL 2006. International Conference on
Print_ISBN
0-7695-2552-0
Type
conf
DOI
10.1109/ICNICONSMCL.2006.16
Filename
1628334
Link To Document