By Topic

A Distributed Ant Colony Algorithm Based on Cross-Entropy for Multi-Constraints QoS Routing

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
$33 $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

4 Author(s)
Hua Wang ; School of Computer Science and Technology, Shandong University, Jinan, Shandong Province, P. R. China. ; Gang Wang ; Jun Ma ; Zhao Shi

Many applications in the network have strict demands for QoS, such as bandwidth, delay, packet loss rate, etc. Finding the best routing to satisfy those requirements is, in general, an NP-hard problem. Many heuristic algorithms are used to solve this problem, which, however, either belonging to local search or centralized algorithms, cannot guarantee the finding of best solutions in real networks. In this paper, we propose a distributed ant colony algorithm based on cross-entropy for multi-constraints routing. Simulation results in NS-2 environment indicate that this algorithm can quickly find the best solution.

Published in:

The 9th International Conference on Advanced Communication Technology  (Volume:3 )

Date of Conference:

12-14 Feb. 2007