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
11 - Capacity fairness in 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
In the last chapter, the characteristics of traffic grooming WDM networks with arbitrary topologies were studied from the perspective of blocking performance. It has been shown that the blocking performance is not only affected by the link traffic and the routing and wavelength assignment strategy, it is also affected by the arrival rates of different low-rate traffic streams, their respective holding times and more importantly, the capacity distribution of the wavelengths on the links. In such networks, call requests arrive randomly and can request for a low-rate traffic connection to be established between the source and the destination. Under dynamic traffic conditions, call requests that ask for capacity nearer to that of the full wavelength experience a higher probability of blocking than those that ask for a smaller fraction. In fact, the difference in blocking performance between the high- and low-capacity traffic streams becomes more significant as the traffic stream switching capability of the network increases. This difference in blocking performance for different capacities is directly affected by the routing and wavelength assignment policy that is used to route the call request. Hence, it is important that a call request is provided with its service in a fair manner commensurate with the capacity it requests. This capacity fairness is different from the fairness measure based on hop count that has traditionally been addressed in the literature.
In optical networks without wavelength conversion, due to the wavelength continuity constraint there is an increase in probability of a call request being blocked.
- Type
- Chapter
- Information
- Survivability and Traffic Grooming in WDM Optical Networks , pp. 201 - 209Publisher: Cambridge University PressPrint publication year: 2006