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
10 - Gains of traffic grooming
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
The focus of this chapter is to provide an analytical framework and to obtain some insight into how traffic grooming affects performance in terms of the call blocking probability in different network topologies. Specifically, the performance of constrained and sparse grooming networks are compared using simulation-based studies. Constrained grooming corresponds to the case where grooming is performed only at the SONET-ADMs on an end-to-end basis. Sparse grooming corresponds to the case where, in addition to grooming at the SONET-ADMs, the cross-connects at some or all of the nodes are provided with a traffic stream switching capability. The goal is to develop techniques to minimize electronic equipment costs and to provide solutions for efficient WDM network designs.
It has been established that wavelength conversion, that is, the ability of a routing node to convert one wavelength to another, reduces wavelength conflicts and improves the performance by reducing the blocking probability. Lower bounds on the blocking probability for an arbitrary network for any routing and wavelength assignment algorithm are known. It is further shown that the use of wavelength converters results in a 10–40% increase in wavelength reuse. A reduced load approximation scheme to calculate the blocking probabilities for the optical network model for two routing schemes, fixed routing and least-loaded routing, has been used in. This model does not consider the load correlation between the links. Analytical models of networks, using fixed routing and random wavelength assignment, taking wavelength correlation into account, have been developed in.
- Type
- Chapter
- Information
- Survivability and Traffic Grooming in WDM Optical Networks , pp. 184 - 200Publisher: Cambridge University PressPrint publication year: 2006