Abstract
The spare capacity allocation schemes introduced in Chapter 7 either take a specific group of working paths or all working paths into consideration at a time during the optimization process. However, as any connection request arrives, an on-line algorithm is still required to allocate it. The on-line algorithm should be able to guarantee derivation of a link- or node-disjoint or link-disjoint working and protection (W-P) path-pair for a connection request if any exists. Since the reconfiguration or reallocation of spare capacity in the networks may not be frequently performed, the on-line algorithm of path selection needs to be both computation- and capacity efficient so that networks can accommodate as many subsequent connection calls as possible without losing the ability to deal with dynamic traffic requests that arrive one after the other.
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
Y. Liu, D. Tipper, and P. Siripongwutikorn, “Approximating Optimal Spare Capacity Allocation by Successive Survivable Routing,” Proceedings IEEE Infocom’01, vol. 2, pp. 699–708, 2001.
R. Bhandari, “Survivable networks: algorithms for diverse routing” The Kluwer international series in engineering and computer science. Kluwer Academic Publishers, Boston, 1999.
J. W. Surrballe and R. E. Tarjan, “A Quick Method for Finding Shortest pairs of Disjoint Paths,” Networks, 14(2):325–336, 1984.
J. Y. Yen, “Finding the k shortest loop-less paths in a network,” Management Science 1971; 17:712–716.
A. V. Goldberg, “An Efficient Implementation if a Scaling Minimum-Cost Flow Algorithm,” J. Algorithms, 22(1): 1–29, 1997.
J. Tapolcai, P. Laborczi, P. -H. Ho, T. Cinkler, A. Recski, and H. T. Mouftah, “Approaches for solving asymmetrically weighted optimal or near-optimal disjoint path pair for the survivable optical networks”, in Proceedings of the third International Workshop on Design of Reliable Communication Networks (DRCN 2001), Budapest, Oct. 2001.
J. W. Suurballe, “Disjoint Paths in a Network,” Networks, 4:125–145, 1974.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Mouftah, H.T., Ho, PH. (2003). Survivable Routing with Dynamic Traffic. In: Optical Networks. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1169-4_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1169-4_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5426-0
Online ISBN: 978-1-4615-1169-4
eBook Packages: Springer Book Archive