Competitive Analysis of Online Traffic Grooming in WDM Rings

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2008-08, Vol.16 (4), p.984-997
Main Authors: Benson, K., Birnbaum, B., Molina-Estolano, E., Libeskind-Hadas, R.
Format: Article
Language:English
Subjects:
Add-drop multiplexers
Algorithm design and analysis
Algorithms
Bandwidth
Competitive analysis
Computer science
Joints
Multiplexing
On-line systems
Online
online algorithms
Optical fiber networks
optical networks
Radio access networks
Telecommunication traffic
Traffic control
Traffic engineering
Traffic flow
Wavelength division multiplexing
wavelength-division multiplexing (WDM) rings
WDM networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2007.901065