Discrete Mathematics - Kleitman and combinatorics: a celebration
IEEE/ACM Transactions on Networking (TON)
Dynamic wavelength assignment for WDM all-optical tree networks
IEEE/ACM Transactions on Networking (TON)
Uniform versus non-uniform band switching in WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks
IEEE/ACM Transactions on Networking (TON)
Research note: On the complexity and algorithm of grooming regular traffic in WDM optical networks
Journal of Parallel and Distributed Computing
Achieving 100% throughput in reconfigurable optical networks
IEEE/ACM Transactions on Networking (TON)
Uniform versus non-uniform band switching in WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
Wavelength rerouting in survivable WDM networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Dynamic routing and wavelength assignment with optical bypass using ring embeddings
Optical Switching and Networking
Hi-index | 0.07 |
Through the use of configurable wavelength-division-multiplexing (WDM) technology including tunable optical transceivers and frequency selective switches, next-generation WDM networks will allow multiple virtual topologies to be dynamically established on a given physical topology. For N node P port networks, we determine the number of wavelengths required to support all possible virtual topologies (PN lightpaths) on a bidirectional ring physical topology. We show that if shortest path routing is used, approximately N wavelengths are needed to map N lightpaths. We then present novel adaptive lightpath routing and wavelength assignment strategies that reduce the wavelength requirements to [(N/2)] working wavelengths per port for protected networks and [(N/3)] wavelengths in each direction per port for unprotected networks. We show that this reduced wavelength requirement is optimal in the sense that it is the minimum required to support the worst case logical topology. Furthermore, we prove that a significant number of logical topologies require this minimum number of wavelengths. We also develop joint routing and wavelength assignment strategies that not only minimize the number of wavelengths required to implement the worst case logical topologies but also reduce average wavelength requirements. Finally, methods for extending these routing and wavelength assignment results to general two-connected and three-connected physical topologies are presented