By Topic

On-demand QoS multipath 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
$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)
Chee Kheong Siew ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Gang Wu ; Gang Feng

We propose an efficient multipath routing algorithm for a given quality of service (QoS) in carrying delay-sensitive traffic. The proposed algorithm takes advantage of available alternate routes that can be used in the network without violating end-to-end delay and bandwidth constraint. The objective of our routing scheme is to minimize the maximum of link utilization. For an arriving connection request, a set of feasible paths is found without re-routing the existing traffic flows and the corresponding ratio in allocation of traffic for each path is determined. The algorithm is very efficient and can be used for the arrival connection request on-the-fly. Extensive simulation results show that 13-27% gains of additional connections can be achieved when compared to the shortest path routing.

Published in:

Communication Systems, 2002. ICCS 2002. The 8th International Conference on  (Volume:1 )

Date of Conference:

25-28 Nov. 2002