Abstract
Finding a path in the network for a new incoming connection able to guarantee some quality parameters such as bandwidth and delay is the task of QoS routing techniques developed for new IP networks based on label forwarding.
In this paper we focus on the routing of bandwidth guaranteed flows in a dynamic scenario where new connection requests arrive at the network edge nodes. When more than a path satisfying the bandwidth demand exists, the selection of the path is done in order to minimize the blocking probability of future requests.
We propose a new routing algorithm named Virtual Flow Deviation (VFD) which exploits the information of the ingress and egress nodes of the network and the traffic statistics. We show that this new algorithm allows to reduce remarkably the blocking probability in most scenarios with respect to previously proposed schemes.
This is a preview of subscription content, log in via an institution to check access.
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
S. Chen and K. Nahrstedt. An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions, 1998.
Z. Wang and J. Crowcroft. QoS Routing for Supporting Resource Reservation. In IEEE JSAC, Sept.1996.
A. Orda. Routing with End to End QoS Guarantees in Broadband Networks. In IEEE INFOCOM’98, Mar.1998.
B. Awerbuch et al. Throughput Competitive On Line Routing. In 34th Annual Symp. Foundations of Computer Science, Palo Alto, CA, Nov.1993.
E. Rosen, A. Viswanathan, and R. Callon. Multiprotocol Label Switching Architecture. In RFC 3031, January 2001.
D.O. Awduche, L. Berger, D. Gain, T. Li, G. Swallow, and V. Srinivasan. Extensions to RSVP for LSP Tunnels. In Internet Draft draft-ietf-mpls-rsvp-lsp-tunnel-04.txt, September 1999.
R. Guerin, D. Williams, and A. Orda. QoS Routing Mechanisms and OSPF Extensions. In Proceedings of Globecom, 1997.
Murali S. Kodialam and T. V. Lakshman. Minimum Interference Routing with Applications to MPLS Traffic Engineering. In Proceedings of INFOCOM (2), pages 884–893, 2000.
L. Fratta, M. Gerla, and L. Kleinrock. The Flow Deviation Method: An Approach to Store-and-forward Network Design. In Networks 3, pages 97–133, 1973.
D. Bertsekas and R. Gallager. Data Networks. Prentice-Hall, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Capone, A., Fratta, L., Martignon, F. (2003). Virtual Flow Deviation: Dynamic Routing of Bandwidth Guaranteed Connections. In: Marsan, M.A., Corazza, G., Listanti, M., Roveri, A. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2003. Lecture Notes in Computer Science, vol 2601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36480-3_43
Download citation
DOI: https://doi.org/10.1007/3-540-36480-3_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00604-6
Online ISBN: 978-3-540-36480-1
eBook Packages: Springer Book Archive