Approximation algorithms for traffic grooming in WDM rings

Authors:
Kevin Corcoran;Seth Flaxman;Mark Neyer;Peter Scherpelz;Craig Weidert;Ran Libeskind-Hadas
Affiliations:
Department of Computer Science, University of Oregon;Media and Design Laboratory at Ecole Polytechnique;Department of Computer Science, University of North Carolina;Department of Physics, University of Chicago;School of Computer Science, Simon Fraser University;Department of Computer Science, Harvey Mudd College
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 9
Cited 0

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Journal of the ACM (JACM)
Cost-effective traffic grooming in WDM rings

IEEE/ACM Transactions on Networking (TON)
The Multiple Subset Sum Problem

SIAM Journal on Optimization
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
The ring grooming problem

Networks
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

SIAM Journal on Computing
Traffic grooming in WDM ring networks to minimize the maximum electronic port cost

Optical Switching and Networking
Online routing and wavelength assignment in single-hub WDM rings

IEEE Journal on Selected Areas in Communications
On optimal traffic grooming in WDM rings

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "one-to-many" scenario arises in metropolitan access networks in which one node serves as a "hub" connecting the ring to a larger network as well as in video-on-demand and other multimedia services where a single source node serves a collection of subscriber nodes. The ring comprises a given number of wavelengths of uniform capacity and a variable number of tunable Add-Drop Multiplexers (ADMs) at each node. Given a set of requests at the destination nodes, where each request comprises a bandwidth demand and a profit for fulfilling the request, our objective is to select a subset of the requests and pack ("groom") them onto the wavelengths such that no wavelength's capacity is exceeded and the total profit of the selected requests is maximized. Although this problem is NP-complete, we give polynomial time approximation algorithms with excellent theoretical performance validated with experimental results.