Cost-effective traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
On the complexity of the traffic grooming problem in optical networks
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Multiwavelength lightwave networks for computer communication
IEEE Communications Magazine
Grooming of arbitrary traffic in SONET/WDM BLSRs
IEEE Journal on Selected Areas in Communications
Dense wavelength division multiplexing networks: principles and applications
IEEE Journal on Selected Areas in Communications
Epilog-latest advances in dense WDM technology
IEEE Journal on Selected Areas in Communications
Lightpath arrangement in survivable rings to minimize the switching cost
IEEE Journal on Selected Areas in Communications
Review of Fundamentals of Optical Fiber Systems
IEEE Journal on Selected Areas in Communications
Architectural considerations for photonic switching networks
IEEE Journal on Selected Areas in Communications
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Hardness and approximation of traffic grooming
Theoretical Computer Science
Shmuel Zaks: the mathematician, computer scientist and personality
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Traffic grooming in star networks via matching techniques
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Edge-Partitioning Regular Graphs for Ring Traffic Grooming with a Priori Placement of the ADMs
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, this can be viewed as assigning colors to the lightpaths so that at most g of them (g being the grooming factor) can share one edge. The cost of a coloring is the number of optical switches (ADMs); each lightpath uses two ADMs, one at each endpoint, and in case g lightpaths of the same wavelength enter through the same edge to one node, they can all use the same ADM (thus saving g-1 ADMs). The goal is to minimize the total number of ADMs. This problem was shown to be NP-complete for g=1 and for a general g. Exact solutions are known for some specific cases, and approximation algorithms for certain topologies exist for g=1. We present an approximation algorithm for this problem. For every value of g the running time of the algorithm is polynomial in the input size, and its approximation ratio for a wide variety of network topologies-including the ring topology-is shown to be 2lng+o(lng). This is the first approximation algorithm for the grooming problem with a general grooming factor g.