Cost-effective traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
Traffic grooming in WDM networks
IEEE Communications Magazine
Power-efficient design of multicast wavelength-routed networks
IEEE Journal on Selected Areas in Communications
Traffic grooming in an optical WDM mesh network
IEEE Journal on Selected Areas in Communications
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
Cost-effective single-hub WDM ring networks: A proposal and analysis
Computer Networks: The International Journal of Computer and Telecommunications Networking
Competitive analysis of online traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Wavelength assignment for all-to-all broadcast in WDM optical linear array with limited drops
Computer Communications
| Hi-index | 0.00 |
As high capacity all-optical networks and WDM technologies advance and merge together, aggregating low-speed traffic streams onto high-speed wavelengths becomes more critical. Efficient aggregation techniques, known as traffic grooming, allow higher bandwidth utilization and can reduce request blocking probability. These algorithms can also result in lower network cost in terms of electronic switching. In this paper we focus on traffic grooming in WDM mesh networks with dynamic traffic patterns. We offer two new grooming concepts called lightpath dropping and lightpath extension. These concepts are based on an alternative node architecture in which incoming optical signals can be dropped at a node, while optically continuing to the next node. Based on these concepts, we develop several grooming algorithms and study them under various network objectives. We also compare their performance with previously proposed lightpath-based grooming algorithms. Through extensive simulation results we show that our proposed approaches lead to lower request blocking probability and lower average number of logical hops when the number of transceivers per node is limited.