By Topic

A QoS network routing algorithm using multiple pheromone tables

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

2 Author(s)
Tadrus, S. ; Sch. of Comput. Sci. & IT, Nottingham Univ., UK ; Li Bai

Quality-of-services routing algorithms that utilize probes are criticized for not being able to achieve optimal path selection for real-time flows. This is because probe-based algorithms do not have a global view of the network. We introduce a new probe-based routing algorithm for packet-switched networks that supports both best-effort and real-time flows. Unlike other probe-based algorithms, probes are routed via routing tables to achieve optimal performance. Simulations were carried out on QColony and other QoS probe-based routing systems under various network traffic loads and irregular network topologies. Simulation results, concerning resource utilization and connection request success rates, show that QColony provides good performance under heavy loads with failure conditions especially for large networks. We also introduce a novel approach for traffic protection in case of network failure conditions.

Published in:

Web Intelligence, 2003. WI 2003. Proceedings. IEEE/WIC International Conference on

Date of Conference:

13-17 Oct. 2003