Algorithm for traffic grooming in optical networks to minimize the number of transceivers

We study the problem of traffic grooming to reduce the number of transceivers in optical networks. We show that this problem is equivalent to a certain traffic maximization problem. We give an intuitive interpretation of this equivalence and use this interpretation to derive a greedy algorithm for t...

Full description

Saved in:
Bibliographic Details
Published in2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) pp. 218 - 221
Main Authors Konda, V.R., Chow, T.Y.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2001
Subjects
Costs
Intelligent networks
Network topology
Optical fiber networks
Optical interconnections
Optical network units
Telecommunication traffic
Transceivers
Wavelength division multiplexing
WDM networks
Online AccessGet full text

Cover

More Information
Summary:We study the problem of traffic grooming to reduce the number of transceivers in optical networks. We show that this problem is equivalent to a certain traffic maximization problem. We give an intuitive interpretation of this equivalence and use this interpretation to derive a greedy algorithm for transceiver minimization. We discuss implementation issues and present computational results comparing the heuristic solutions with the optimal solutions for several small example networks. For larger networks, the heuristic solutions are compared with known bounds on the optimal solution obtained using integer programming tools.
ISBN:0780367111
9780780367111
DOI:10.1109/HPSR.2001.923635