By Topic

A Hierarchical Routing Model for Large Scale Networks Based on Ant Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Guozhen Tan ; Dalian University of Technology, 116023, P.R.China ; Yi Liu ; Hengwei Yao ; Jialin Li
more authors

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.

Published in:

Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies, 2006. ICN/ICONS/MCL 2006. International Conference on

Date of Conference:

23-29 April 2006