ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Networks
Volume 44, Issue 1, 15 January 2004, Pages 79-102
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (491 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S1389-1286(03)00346-3    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2003 Elsevier B.V. All rights reserved.

On selection of candidate paths for proportional routing*1

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Srihari NelakuditiCorresponding Author Contact Information, E-mail The Corresponding Author, a, Zhi-Li ZhangE-mail The Corresponding Author, b and David H. C. DuE-mail The Corresponding Author, b

a Department of Computer Science & Engineering, University of South Carolina, Columbia, SC 29208, USA

b Department of Computer Science & Engineering, University of Minnesota, Minneapolis, MN 55455, USA


Received 2 October 2002; 
revised 9 May 2003; 
accepted 25 June 2003;
Responsible Editor: S. Fdida 
Available online 30 July 2003.

Abstract

QoS routing involves selection of paths for flows based on the knowledge at network nodes about the availability of resources along paths, and the QoS requirements of flows. Several QoS routing schemes have been proposed that differ in the way they gather information about the network state and select paths using this information. Most of these schemes can be categorized as best path routing where a source node selects the “best” path for each incoming flow based on its current view of the global network state. It has been shown that best path routing schemes require frequent exchange of network state, imposing both communication overhead on the network and processing overheads on the core routers. On the other hand, proportional routing schemes proportion incoming flows among a set of candidate paths. Two key questions that arise under proportional routing are how to select candidate paths and how to proportion flows among candidate paths. We propose a scheme that selects a few widest disjoint paths as candidates and equalizes the blocking probabilities of the candidate paths. We show that our proportional routing approach yields higher throughput with lower overhead than best path routing approach. Furthermore, we present a method for aggregating the state of an area and extend the proportional routing approach to provide hierarchical routing across multiple areas in a large network.

Author Keywords: QoS routing; Proportional routing; Widest disjoint paths

Article Outline

1. Introduction
2. Proportional routing framework
2.1. Problem setup
2.2. Global optimal proportioning
2.3. Localized adaptive proportioning
2.4. Hybrid approach to proportional routing
3. Candidate path selection
4. Hierarchical proportional routing
4.1. Topology and state aggregation
4.2. Skeletal path selection
5. Related work
6. Performance analysis
6.1. Simulation environment
6.2. Performance of wdp
6.2.1. Convergence
6.2.2. Sensitivity
6.3. Comparison of wsp and wdp
6.3.1. Blocking probability
6.4. Heterogeneous traffic
6.4.1. Routing overhead
6.5. Performance of hwdp
6.5.1. Simulation environment
6.5.2. Convergence and adaptivity
6.5.3. Blocking performance
7. Conclusions
Acknowledgements
References
Vitae


















Corresponding Author Contact InformationCorresponding author

*1 An earlier abridged version of this paper appeared in the Proceedings of IWQoS’01, June 2001 [18].


Computer Networks
Volume 44, Issue 1, 15 January 2004, Pages 79-102
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.