Competitive analysis of online traffic grooming in WDM rings

Authors:
Karyn Benson;Benjamin Birnbaum;Esteban Molina-Estolano;Ran Libeskind-Hadas
Affiliations:
Department of Computer Science, Johns Hopkins University, Baltimore, MD;Department of Computer Science and Engineering, University of Washington, Seattle, WA;Department of Computer Science, University of California, Santa Cruz, CA;Department of Computer Science, Harvey Mudd College, Claremont, CA
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2008

Citing 14
Cited 3

An optimal algorithm for on-line bipartite matching

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Online computation and competitive analysis

Online computation and competitive analysis
On-line routing in all-optical networks

Theoretical Computer Science
Competitive non-preemptive call control

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An optimal deterministic algorithm for online b-matching

Theoretical Computer Science
On optimal traffic grooming in WDM rings

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Introduction to Algorithms

Introduction to Algorithms
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis of optical networks with heterogeneous grooming architectures

IEEE/ACM Transactions on Networking (TON)
Efficient Online Traffic Grooming Algorithms in WDM Mesh Networks with Drop-and-Continue Node Architecture

BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
AdWords and Generalized On-line Matching

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Throughput-competitive on-line routing

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Online routing and wavelength assignment in single-hub WDM rings

IEEE Journal on Selected Areas in Communications

Optimal on-line colorings for minimizing the number of ADMs in optical networks

Journal of Discrete Algorithms
Effect of sparse grooming on power consumption of optical networks

Proceedings of the 1st Workshop on Green Computing
Survivable impairment-aware traffic grooming in WDM rings

Proceedings of the 23rd International Teletraffic Congress

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of traffic grooming in wavelength-division multiplexing (WDM) rings where connection requests arrive online. Each request specifies a pair of nodes that wish to communicate and also the desired bandwidth of this connection. If the request is to be satisfied, it must be allocated to one or more wavelengths with sufficient remaining capacity. We consider three distinct profit models specifying the profit associated with satisfying a connection request. We give results on offline and online algorithms for each of the three profit models. We use the paradigm of competitive analysis to theoretically analyze the quality of our online algorithms. Finally, experimental results are given to provide insight into the performance of these algorithms in practice.