Island hopping and path colouring with applications to WDM network design

Authors:
Andrew McGregor;Bruce Shepherd
Affiliations:
-;-
Venue:
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2007

Citing 21
Cited 2

Theory of linear and integer programming

Theory of linear and integer programming
Approximating the minimum-degree Steiner tree to within one of optimal

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks

SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems

SIAM Journal on Computing
Efficient routing in optical networks

Journal of the ACM (JACM)
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the approximation of finding a(nother) hamiltonian cycle in cubic hamiltonian graphs

Journal of Algorithms
Improved access to optical bandwidth in trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Ring routing and wavelength translation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks

Journal of Algorithms
Multiwavelength Optical Networks: A Layered Approach

Multiwavelength Optical Networks: A Layered Approach
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees

SIAM Journal on Computing
Directed graphs requiring large numbers of shortcuts

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Wavelength assignment and generalized interval graph coloring

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
On Shortcutting Digraphs

WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Efficient access to optical bandwidth

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Methods and Problems of Wavelength-Routing in All-Optical Networks

Methods and Problems of Wavelength-Routing in All-Optical Networks
Approximation algorithms for wavelength assignment

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Lighting fibers in a dark network

IEEE Journal on Selected Areas in Communications

Path decomposition under a new cost measure with applications to optical network design

ACM Transactions on Algorithms (TALG)
Buy-at-Bulk Network Design with Protection

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wavelength division multiplexed (WDM) optical communication offers the advantages of increased capacity and decreased latency for signals (traffic) carried across such networks. The devices used for "switching", however, force additional constraints on the mathematical design of such networks. In this paper we explore two such constaints: (i) optical lightpaths must be assigned individual wavelengths and (ii) sometimes lightpaths must unavoidably go through an optical-electronic-optical (OEO) conversion by means of an expensive piece of equipment called an optical transponder. We term the graph theoretical problems related to these constraints path colouring and island hopping. We present a range of upper and lower bounds for these problems. In particular, we extend the work of Winkler and Zhang (2003) and Anshelevich and Zhang (2004).