By Topic

Distributed dynamic routing using ant algorithm for telecommunication networks

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

3 Author(s)
Lu Guoying ; Dept. of Telecommun. Eng., Beijing Univ. of Posts & Telecommun., China ; Zhang Subing ; Liu Zemin

In telecommunication networks, routing is an important issue. For this reason, we study a distributed dynamic routing (DDR) approach, and propose a novel distributed real-time dynamic routing (DRDR) approach which considers not only the utilization of resources but also the load balance in telecommunication networks. In the approach, according to the concrete problems of dynamic routing, we construct a globally-optimizing ant algorithm, which is based on the ability of ants to find the shortest path between their nest and the food source when looking for food, to realize the route optimization. Simulation results show that the proposed approach can realize distributed dynamic routing effectively according to the current traffic states in the networks and the user-specified delay requirements

Published in:

Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on  (Volume:2 )

Date of Conference:

2000