Abstract
One way to guaranteeing service for an application flow even if a network happens to fail is to establish a restoration path with the bandwidth that amounts to the same of the flow. If the flows can share the bandwidth for their restoration paths with others, we can reduce bandwidth consumption required for restoration. It is also required that deciding sharable bandwidth among flows should be done using controllable link information at each node. This paper proposes an algorithm to determine the sharable bandwidth among application flows given local link usage information at each node, validates the results of the algorithm and analyze the conditions required to achieve the goal by simulation.
Chapter PDF
Similar content being viewed by others
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.
References
V. Sharma et al, “ Framework for Multi-protocol Label Switching(MPLS)-based Recovery,” RFC 3469, February 2003
R. Bhandari, “Survivable Networks: Algorithms for Diverse Routing,” Kluwer Academic Publishers, 1999
M. Kodialam and T.V. Lakshman, “Dynamic Routing of Bandwidth Guaranteed Tunnels with Restoration,” INFOCOM 2000
K. Kar, M. Kodialam, and T. V. Laskshman, “Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications,” IEEE, J. of Selected Area of Com. Vol. 16(12), pp2566–2579, December 2000
K. Murakami, “Optical Capacity and Flow Assignment for Self-Healing ATM Networks Based on Line and End-to-End Restoration,” IEEE/ACM Trans. On Networking 6(2), April 1998
J.W. Suurballe R.E. Tarjan “A Quick Method for Finding Shortest Pairs of Disjoint Paths,” Networks, vol. 14, pp325–226, 1984
C.-L. Li, S. T. McCormick, and D. Simchi-Levi, “Finding Disjoint Paths with Different Path-Costs: Complexity and Algorithms,” NETWORKS, vol. 22, pp653–667, 1992
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Hong, S., Lee, HK., Paek, S. (2006). Algorithms for network service guarantee under minimal link usage information. In: Gaïti, D. (eds) Network Control and Engineering for Qos, Security and Mobility, V. NetCon 2006. IFIP International Federation for Information Processing, vol 213. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34827-8_17
Download citation
DOI: https://doi.org/10.1007/978-0-387-34827-8_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34825-4
Online ISBN: 978-0-387-34827-8
eBook Packages: Computer ScienceComputer Science (R0)