Abstract
A network should deploy QoS-aware path selection algorithms for efficient routing. To this end, measurements of the various characteristics of the network can provide insight into the state and performance of the network. In this paper, we present a new QoS-aware path selection algorithm for flows requiring bandwidth guarantees based on an estimation algorithm for the available bandwidth on the links of the network. The estimation algorithm for the available bandwidth predicts the available bandwidth and also tells the duration for which the estimate is valid with a high degree of confidence. Thus, the path selection algorithm is adaptive and not very computationally intensive.
This work was supported by NASA Goddard and Swales Aerospace under contract number S11201 (NAS5-01090)
Corresponding Author. Research Assistant, 250 14th Street, Suite 556, Atlanta, GA 30318, USA Phone: +1-404-894-6616 Fax: +1-404-894-7883
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
T. Anjali, Scoglio, J. de Oliveira, I. Akyildiz, and G. Uhl, “Optimal Policy forLSP Setup in MPLS Networks,” Computer Networks, vol. 39, no. 2, pp. 165–183, June 2002.
Z. Wang and J. Crowcroft, “Quality-of-Service Routing for Supporting Multimedia Applications,” IEEE Journal on Selected Areas in Communications, vol. 14, no. 7, pp. 1288–1234, September 1996.
R. Guerin, A. Orda, and D. Williams, “QoS Routing Mechanisms and OSPF Extensions,” in Proceedings of 2nd Global Internet Miniconference (joint with GLOBECOM’97), Phoenix, USA, November 1997.
J. de Oliveira, C. Scoglio, I. Akyildiz, and G. Uhl, “A New Preemption Policy for DiffServ-Aware Traffic Engineering to Minimize Rerouting,,” in Proceedings of IEEE INFOCOM’02, New York, USA, June 2002.
V. Jacobson, Pathchar, ftp://ftp.ee.lbl.gov/pathchar/, 1997.
S. Keshav, “A Control-Theoretic Approach to Flow Control,” in Proceedings of ACM SIGCOM’91, Zurich, Switzerland, 1991.
K. Lai and M. Baker, “Nettimer: A Tool for Measuring Bottleneck Link Bandwidth,” in Proceedings of 3rd USENIX Symposium on Internet Technologies and Systems, San Francisco, USA, March 2001.
M. Jain and C. Dovrolis, “Pathload: A Measurement Tool for End-to-End Available Bandwidth,” in A workshop on Passive and Active Measurements, Fort Collins, USA, March 2002.
Iperf Tool, http://dast.nlanr.net/Projects/Iperf/ .
MRTG Website, http://people.ee.ethz.ch/oetiker/webtools/mrtg/ .
I. Matta and A. Bestavros, “A Load Profiling Approach to Routing Guaranteed Bandwidth Flows,” in Proceedings of IEEE INFOCOM’98, San Francisco, USA, April 1998.
K. Kar, M. Kodialam, and T. V. Lakshman, “Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Application,” IEEE Journal on Selected Areas in Communications, vol. 18, no. 12, pp. 2566–2579, December 2000.
P. Barham, S. Crosby, T. Granger, N. Stratford, M. Huggard, and F. Toomey, “Measurement Based Resource Allocation for Multimedia Applications,” in Proceedings of ACM/SPIE MMCN’98, San Jose, USA, January 1998.
J. T. Lewis, R. Russell, F. Toomey, B. McGuirk, S. Crosby, and I. Leslie, “Practical connection Admission Control for ATM Networks based on On-line Measurements,” Computer Communication, vol. 21, no. 1, pp. 1585–1596, 1998.
M. Grossglauser and D. Tse, “A Framework for Robust Measurement-Based Admission Control,” IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 293–309, 1999.
N.S.V. Rao, S. Radhkrishnan, and B. Y. Cheol, “NetLets: Measurement-Based Routing for End-to-End Performance Over the Internet,” in Proceedings of International Conferenceon Networking’2001, 2001.
R. Guerin, “QoS Routing in Networks with Inaccurate Information: Theory and Algorithms,” IEEE/ACM Transactions on Networking, vol. 7, no. 3, June 1999.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anjali, T. et al. (2002). A New Path Selection Algorithm for MPLS Networks Based on Available Bandwidth Estimation. In: Stiller, B., Smirnow, M., Karsten, M., Reichl, P. (eds) From QoS Provisioning to QoS Charging. QofIS ICQT 2002 2002. Lecture Notes in Computer Science, vol 2511. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45859-X_20
Download citation
DOI: https://doi.org/10.1007/3-540-45859-X_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44356-8
Online ISBN: 978-3-540-45859-3
eBook Packages: Springer Book Archive