Abstract
The previous chapter explored survivable traffic grooming with dedicated protection. This chapter investigates survivable traffic grooming with shared protection.
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
A SRLG is a set of links which share the same risk [Strand et al., 2001].
The conflict set defined here is related to the conflict vector in [Mohan et al., 2001], the aggregated square matrix in [Liu et al., 2001], and the “bucket” link metric in [Su and Su, 2001b, Su and Su, 2001a].
We remark that, if we apply Yen’s algorithm to the original graph G instead of the auxiliary graph, then the grooming constraints may not be accommodated without appropriate mechanisms such as the graph model. Please refer to [Zhu and Mukherjee, 2002a, Zhu et al., 2002] for more details.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Ou, C.S., Mukherjee, B. (2005). Survivable Traffic Grooming-Shared Protection. In: Survivable Optical WDM Networks. Optical Networks. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-24499-0_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-24499-0_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-24498-3
Online ISBN: 978-0-387-24499-0
eBook Packages: EngineeringEngineering (R0)