Abstract
Multipath routing schemes distribute traffic among multiple paths instead of routing all the traffic along a single path. Two key questions that arise in multipath routing are how many paths are needed and how to select these paths. Clearly, the number and the quality of the paths selected dictate the performance of a multipath routing scheme. We address these issues in the context of the proportional routing paradigm where the traffic is proportioned among a few ‘good’ paths instead of routing it all along the ‘best’ path. We propose a hybrid approach that uses both globally exchanged link state metrics — to identify a set of good paths, and locally collected path state metrics — for proportioning traf- fic among the selected paths. We compare the performance of our approach with that of global optimal proportioning and show that the proposed approach yields near-optimal performance using only a few paths. We also demonstrate that the proposed scheme yields much higher throughput with much smaller overhead compared to other schemes based on link state updates.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. Apostolopoulos, R. Guerin, S. Kamat, S. Tripathi, “;Quality of Service Based Routing: A Performance Perspective,”, ACM SIGCOMM, September 1998.
G. Apostolopoulos, R. Guerin, S. Kamat, S. Tripathi, “;Improving QoS Routing Performance under Inaccurate Link State Information,”, ITC’16, June 1999.
Shigang Chen, Klara Nahrstedt, “;An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions,”, IEEE Network Magazine, Special Issue on Transmission and Distribution of Digital Video, Vol. 12, No. 6, November-December 1998, pp. 64–79.
T. Coleman and Y. Li, “;An Interior, Trust Region Approach for Nonlinear Minimization Subject to Bounds,” in Journal on Optimization, Vol. 6, pp. 418–445, SIAM, 1996.
R. Guerin, S. Kamat, A. Orda, T. Przygienda, D. Williams, “;QoS Routing Mechanisms and OSPF Extensions,”, Work in Progress, Internet Draft, March 1997.
F.P. Kelly, “;Routing in Circuit-Switched Networks: Optimization, Shadow Prices and Decentralization,”, Advances in Applied Probability 20, 112–144, 1988.
F.P. Kelly, “;Routing and capacity Allocation in Networks with Trunk Reservation,”, Mathematics of Operations Research, 15:771–793, 1990.
F.P. Kelly, “;Dynamic Routing in Stochastic Networks,”, In Stochastic Networks, ed. F.P. Kellyand R.J. Williams, Springer-Verlag, 169–186, 1995.
F.P. Kelly, “;Fixed Point Models of Loss Networks,” J. Austr. Math. Soc., Ser. B, 31, pp. 204–218, 1989.
Q. Ma, P. Steenkiste, “;On Path Selection for Traffic with Bandwidth Guarantees,”, IEEE ICNP, October 1997.
J. Moy, “;OSPF Version 2,”, Request For Comments 2328, Internet Engineering Task Force, April 1998.
S. Nelakuditi, Z-L. Zhang, R.P. Tsang, “;Adaptive Proportional Routing: A Localized QoS Routing Approach,”, IEEE INFOCOM’00, March 2000.
S. Nelakuditi, S. Varadarajan, and Z-L. Zhang, “;On Localized Control in Quality-of-Service Routing,”, October 2000. Submitted to IEEE Transactions on Automatic Control, Special Issue on Systems and Control Methods for Communication Networks.
S. Nelakuditi, and Z-L. Zhang, “;On Selection of Paths for Multipath Routing,”, Techincal Report, Department of Computer Science, University of Minnesota, April 2001.
M. Powell, “;A Fast Algorithm for Nonlinear Constrained Optimization Calculations,” in Numerical Analysis, ed. G.A. Watson, Lecture Notes in Mathematics, Vol 630, Springer Verlag, 1978.
E. Rosen, A. Viswanathan, and R. Callon, “;Multi-Protocol Label Switching Architecture,”, work in progress, Internet Draft draft-ietf-mpls-arch-06.txt, August 1999.
K.W. Ross, “;Multiservice Loss Models for Broadband Telecommunication Networks,”, Springer-Verlag, 1995.
A. Shaikh, J. Rexford, K. Shin, “;Evaluating the Overheads of Source-Directed Quality-of-Service Routing,”, ICNP, October 1998.
N. Taft-Plotkin, B. Bellur, and R. Ogier, “;Quality-of-Service Routing using Maximally Disjoint Paths,”, IWQOS, June 1999.
C. Villamizar, “;MPLS Optimized Multipath (MPLS-OMP),”, Internet Draft, February 1999.
C. Villamizar, “;OSPF Optimized Multipath (OSPF-OMP),”, Internet Draft, February 1999.
Z. Wang, J. Crowcroft, “;Quality-of-Service Routing for Supporting Multimedia Applications,”, IEEE JSAC, September 1996
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nelakuditi, S., Zhang, ZL. (2001). On Selection of Paths for Multipath Routing. In: Wolf, L., Hutchison, D., Steinmetz, R. (eds) Quality of Service — IWQoS 2001. IWQoS 2001. Lecture Notes in Computer Science, vol 2092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45512-4_13
Download citation
DOI: https://doi.org/10.1007/3-540-45512-4_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42217-4
Online ISBN: 978-3-540-45512-7
eBook Packages: Springer Book Archive