Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- 1 Optical networking technology
- 2 Design issues
- 3 Restoration approaches
- 4 p-cycle protection
- 5 Network operation
- 6 Managing large networks
- 7 Subgraph-based protection strategy
- 8 Managing multiple link failures
- 9 Traffic grooming in WDM networks
- 10 Gains of traffic grooming
- 11 Capacity fairness in grooming
- 12 Survivable traffic grooming
- 13 Static survivable grooming network design
- 14 Trunk-switched networks
- 15 Blocking in TSN
- 16 Validation of the TSN model
- 17 Performance of dynamic routing in WDM grooming networks
- 18 IP over WDM traffic grooming
- 19 Light trail architecture for grooming
- Appendix 1 Optical network components
- Appendix 2 Network design
- Appendix 3 Graph model for network
- Appendix 4 Graph algorithms
- Appendix 5 Routing algorithm
- Appendix 6 Network topology design
- References
- Index
13 - Static survivable grooming network design
Published online by Cambridge University Press: 18 December 2009
- Frontmatter
- Contents
- Preface
- Acknowledgments
- 1 Optical networking technology
- 2 Design issues
- 3 Restoration approaches
- 4 p-cycle protection
- 5 Network operation
- 6 Managing large networks
- 7 Subgraph-based protection strategy
- 8 Managing multiple link failures
- 9 Traffic grooming in WDM networks
- 10 Gains of traffic grooming
- 11 Capacity fairness in grooming
- 12 Survivable traffic grooming
- 13 Static survivable grooming network design
- 14 Trunk-switched networks
- 15 Blocking in TSN
- 16 Validation of the TSN model
- 17 Performance of dynamic routing in WDM grooming networks
- 18 IP over WDM traffic grooming
- 19 Light trail architecture for grooming
- Appendix 1 Optical network components
- Appendix 2 Network design
- Appendix 3 Graph model for network
- Appendix 4 Graph algorithms
- Appendix 5 Routing algorithm
- Appendix 6 Network topology design
- References
- Index
Summary
Various lightpath protection schemes for a survivable WDM grooming network with dynamic traffic were investigated in Chapter 12. The nodes in the WDM grooming network are assumed to include ADM (add–drop multiplexer)-constrained grooming nodes. This chapter deals with the static survivable WDM grooming network design with wavelength continuity constrained grooming nodes. For static traffic the problem of grooming subwavelength level requests in mesh-restorable WDM networks, the corresponding path selection and wavelength assignment problems are formulated as ILP optimization problems.
Design problem
To address the survivable grooming network design problem, a network with W wavelengths per fiber and K disjoint alternate paths for each s-d pair can be viewed as W × K networks, with each of them representing a single wavelength network. For K = 2, the first W networks contain the first alternate path for each s-d pair on each wavelength. We number the networks from 1 to W, according to the wavelengths associated with them. The second set of W networks contain the second alternate path for each s-d pair on each wavelength. These networks are numbered from W + 1 to 2W, where the (W + i)th network represents the same wavelength as the ith network, i = 1, 2, …,W. Figure 13.1 illustrates this layered model for a six-node network with three wavelengths and two link-disjoint alternate paths. For each node-pair, it also depicts routing of two alternate paths for two connections in the network.
- Type
- Chapter
- Information
- Survivability and Traffic Grooming in WDM Optical Networks , pp. 224 - 235Publisher: Cambridge University PressPrint publication year: 2006