Abstract
We present a new algorithm and framework for dynamic routing of bandwidth guaranteed flows. The problem is motivated by the need to dynamically set up bandwidth guaranteed paths in carrier and ISP networks. Traditional routing algorithms such as minimum hop routing or widest path routing do not take advantage of any knowledge about the traffic distribution or ingress-egress pairs, and therefore can often lead to severe network underutilization. Our work is inspired by the recently proposed “minimum interference routing” algorithm (MIRA) of Kodialam and Lakshman, but it improves on their approach in several ways. Our main idea is to use a “traffic profile” of the network, obtained by measurements or service level agreements (SLAs), as a rough predictor of the future traffic distribution. We use this profile to solve a multicom-modity network flow problem, whose output is used both to guide our online path selection algorithm as well as impose admission control. The offline multicommodity solution seems very effective at distributing the routes and avoiding bottlenecks around hot spots. In particular, our algorithm can anticipate a flow’s blocking effect on groups of ingress-egress pairs, while MIRA only considers one ingress-egress pair at a time. Our simulation results show that the new algorithm outperforms shortest path, widest path, and minimum interference routing algorithms on several metrics, including the fraction of requests routed and the fraction of requested bandwidth routed. Finally, the framework is quite general and can be extended in numerous ways to accommodate a variety of traffic management priorities in the network.
Research performed at Washington University in St. Louis, partially supported by NSF grant ANI 9813723.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Andersson, et al. LDP Specification. Internet RFC 3036, 2001.
R. K. Ahuja, T. L. Magnanti and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
R. Braden, D. Clark, and S. Shenker. RSVP: A New Resource ReSerVation Protocol. IEEE Network, 7(9), 1993.
J. Castro and N. Nabona. Nonlinear multicommodity network flows through primal partitioning and comparison with alternative methods. In Proc. of the 16th IFIP Conference,System Modeling and Optimization, 1994.
M. R. Garey and D. S. Johnson. Computers and Intractability: A guide to the theory of NP-Completeness. W. H. Freeman and Company, 1979.
B. Gleeson, et. al. A Framework for IP Based Virtual Private Networks. Internet RFC 2764, 2000.
R. Guerin, A. Orda and D. Williams. QoS routing mechanisms and OSPF extensions. In Proc. 2nd Global Internet Miniconference, 1997.
M. Kodialam and T. V. Lakshman. Minimum Interference Routing with Applications to MPLS Traffic Engineering. In Proc. of IEEE Infocom, 2000.
T. V. Lakshman and D. Stidialis. High Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching. Proc. of ACM Sigcomm, 1998.
E. Rosen, A. Vishwanathan and R. Callon. Multi-Protocol Label Switching Architecture. Internet RFC 3031, 2001.
V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel. Fast Scalable Level Four Switching. Proc. of Sigcomm, 1998.
V. Srinivasan, S. Suri and G. Varghese. Packet Classification using Tuple Space Search. Proc. of Sigcomm, 1999.
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
Suri, S., Waldvogel, M., Warkhede, P.R. (2001). Profile-Based Routing: A New Framework for MPLS Traffic Engineering. In: Smirnov, M.I., Crowcroft, J., Roberts, J., Boavida, F. (eds) Quality of Future Internet Services. QofIS 2001. Lecture Notes in Computer Science, vol 2156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45412-8_11
Download citation
DOI: https://doi.org/10.1007/3-540-45412-8_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42602-8
Online ISBN: 978-3-540-45412-0
eBook Packages: Springer Book Archive