Survivability and Traffic Grooming in WDM Optical Networks
暫譯: WDM 光學網路中的生存能力與流量整理

The advent of fiber optic transmission systems and wavelength division multiplexing (WDM) have led to a dramatic increase in the usable bandwidth of single fiber systems. This book provides detailed coverage of survivability (dealing with the risk of losing large volumes of traffic data due to a failure of a node or a single fiber span) and traffic grooming (managing the increased complexity of smaller user requests over high capacity data pipes), both of which are key issues in modern optical networks. A framework is developed to deal with these problems in wide-area networks, where the topology used to service various high-bandwidth (but still small in relation to the capacity of the fiber) systems evolves toward making use of a general mesh. Effective solutions, exploiting complex optimization techniques, and heuristic methods are presented to keep network problems tractable. Newer networking technologies and efficient design methodologies are also described.

Covers new design methodologies and solutions ¿ Scalable solutions for complex problems in WDM-based optical fiber networks ¿ Design of mesh-based optical fiber networks

 

Table of Contents

1. Optical networking technology; 2. Design issues; 3. Restoration approaches; 4. The p-cycle protection; 5. Network operation; 6. Managing large networks; 7. Managing multiple link failures; 8. Subgraph-based protection strategy; 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; A1. Optical network components; A2. Network design; A3. Approaches to network design; A4. Graph model for network; A5. Graph algorithms; A6. Linear programming problems (LPPs); A7. Routing algorithm; A8. Network topology design; A9. Quality of service (QoS) requirements; A10. Delays and queuing in network design.