Cart (Loading....) | Create Account
Close category search window
 

Quality-of-service routing using maximally disjoint paths

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)
Taft-Plotkin, N. ; Sprint Adv. Technol. Labs., Burlingame, CA, USA ; Bellur, B. ; Ogier, R.

We apply and evaluate a new efficient algorithm for finding maximally link disjoint pairs of paths in a network. We apply this algorithm for QoS routing in connection-oriented networks that support calls with multiple QoS requirements. Our algorithm (called MADSWIP) is applied for precomputing paths in advance of call arrivals. Through simulations, we compare our QoS routing method to another method that is typical of what a switch vendor might implement today. We then examine the performance of three different policies for selecting a path among multiple potential paths. We also study the effects of decreasing the density of a network topology. We study two styles of topologies: commercial-style and random topologies. We demonstrate that precomputing paths that have minimal overlap is more important than precomputing paths that explicitly address all QoS metrics in a network. We also show that load balancing policies outperform call packing policies in networks that support diverse applications

Published in:

Quality of Service, 1999. IWQoS '99. 1999 Seventh International Workshop on

Date of Conference:

1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.