A Tutorial on Optical Networks
Advanced Lectures on Networking, NETWORKING 2002 [This book presents the revised version of seven tutorials given at the NETWORKING 2002 Conference in Pisa, Italy in May 2002]
A tutorial on optical networks
Advanced lectures on networking
IEEE/ACM Transactions on Networking (TON)
IP Over WDM
Collaborative User-Centric Lambda-Grid over Wavelength-Routed Network
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Bandwidth guaranteed routing with fast restoration against link and node failures
IEEE/ACM Transactions on Networking (TON)
Locally restorable routing of highly variable traffic
IEEE/ACM Transactions on Networking (TON)
Evaluation of restoration techniques incorporating optimal principle in WDM optical networks
Computer Communications
Guaranteed performance routing of unpredictable traffic with fast path restoration
IEEE/ACM Transactions on Networking (TON)
An optimization solution for packet scheduling: a pipeline-based genetic algorithm accelerator
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Routing and grooming in two-tier survivable optical mesh networks
IWQoS'03 Proceedings of the 11th international conference on Quality of service
Hi-index | 0.00 |
This article presents a broad overview of the architectural and algorithmic aspects involved in deploying an optical cross-connect mesh network, starting from the network design and capacity planning phase to the real-time network operation phase involving dynamic provisioning and restoration of lightpaths and online algorithms for route computation. Frameworks for offline design and capacity planning of optical networks based on projected future lightpath demands are discussed. The essential components of an IP-centric control architecture for dynamic provisioning and restoration of lightpaths in optical networks are outlined. These include neighbor discovery, topology discovery, route computation, lightpath establishment, and lightpath restoration. Online algorithms for route computation of unprotected, 1+1 protected and mesh-restored lightpaths are discussed in both the centralized and distributed scenarios