Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
Theoretical Computer Science
Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic partition in WDM/SONET rings to minimize SONET ADMs
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Reactive Search for Traffic Grooming in WDM Networks
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Efficient dynamic traffic grooming in service-differentiated WDM mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Reconfiguration of Traffic Grooming Optical Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
A 10/7 + " Approximation for Minimizing the Number of ADMs in SONET Rings
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
The chord version for SONET ADMs minimization
Theoretical Computer Science
Theoretical Computer Science
Study of signaling effects on Dynamic Traffic Grooming in IP/MPLS over WDM network
Computer Communications
A 10/7 + ε approximation for minimizing the number of ADMs in SONET rings
IEEE/ACM Transactions on Networking (TON)
Approximating the traffic grooming problem
Journal of Discrete Algorithms
Better bounds for minimizing SONET ADMs
Journal of Computer and System Sciences
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
Graph-Theoretic Concepts in Computer Science
Grooming of traffic using improved evolutionary algorithm in universal optical network
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
On hierarchical traffic grooming in WDM networks
IEEE/ACM Transactions on Networking (TON)
Grooming of non-uniform traffic on unidirectional and bidirectional rings
Computer Communications
Grooming of multicast sessions in metropolitan WDM ring networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On Equilibria for ADM Minimization Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
IEEE/ACM Transactions on Networking (TON)
Optimal on-line colorings for minimizing the number of ADMs in optical networks
Journal of Discrete Algorithms
Distributed dynamic grooming routing and wavelength assignment in WDM optical mesh networks
Photonic Network Communications
SONET ADMs minimization with divisible paths
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Better bounds for minimizing SONET ADMs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Minimizing the number of ADMs in SONET rings with maximum throughput
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Traffic grooming in unidirectional WDM ring networks using genetic algorithms
Computer Communications
| Hi-index | 0.08 |
SONET add-drop multiplexers (ADMs) are the dominant cost factor in the SONET/WDM rings. They can potentially be reduced by optical bypass via optical add-drop multiplexers (OADMs) and traffic grooming. In this paper we study the grooming of arbitrary traffic in WDM bidirectional line-switched rings (BLSRs) so as to minimize the ADM cost. Two versions of the minimum ADM cost problem are addressed. In the first version, each traffic stream has a predetermined routing. In the second version, the routing of each traffic stream is not given in advance; however, each traffic stream is fully duplex with symmetric demands, which must be routed along the same path but in opposite directions. In both versions, we further consider two variants depending on whether a traffic stream is allowed to be split at intermediate nodes. All the four combinations are NP-hard even for any fixed line-speed. General lower bounds on the minimum ADM cost are provided. Our traffic grooming follows a two-phased approach. The problem targeted at in each phase is NP-hard itself, except the second phase when the line speed is two. Various approximation algorithms are proposed in both phases, and their approximation ratios are analyzed.