NDLI: Wavelength Management in WDM Rings to Maximize the Number of Connections

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Caragiannis, Ioannis
Copyright Year	2009
Abstract	We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneously served in a wavelength division ultiplexing (WDM) optical network. In such networks, WDM technology can satisfy a set of connections by computing a route and assigning a wavelength to each connection so that no two connections routed through the same fiber are assigned the same wavelength. Each fiber supports a limited number of w wavelengths and in order to fully exploit the parallelism provided by the technology, one should select a set of connections of maximum cardinality which can be satisfied using the available wavelengths. This is known as the maximum routing and path coloring (maxRPC) problem. Our main contribution is a general analysis method for a class of iterative algorithms for a more general coloring problem. A lower bound on the benefit of the solution computed by such an algorithm in terms of the optimal benefit and the number of available wavelengths is given by a benefit-revealing linear program. We apply this method to maxRPC in both undirected and bidirected rings to obtain upper bounds on the approximation ratio of several algorithms. The best bounds obtained are $4/3$ and $103/73\approx1.41096$ for undirected and bidirected rings; these results improve known bounds of $3/2$ and $11/7\approx1.57143$, respectively. Our results extend to multifiber ring networks and also apply to the maximum path coloring (maxPC) problem, where paths instead of connection requests are given as part of the input. We also study the profit version of maxPC in rings where each path has a profit and the objective is to satisfy a set of paths of maximum total profit. We present an algorithm based on linear programming and randomized rounding with approximation ratio 1.49015, improving on the $\frac{e}{e-1}\approx1.58198$ bound obtained by a simple iterative algorithm.
Starting Page	959
Ending Page	978
Page Count	20
File Format	PDF
ISSN	08954801
DOI	10.1137/06067660X
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	2
Volume Number	23
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2009-05-20
Access Restriction	Subscribed
Subject Keyword	wavelength management WDM optical networks Network models, deterministic approximation algorithms Combinatorics Coloring of graphs and hypergraphs
Content Type	Text
Resource Type	Article
Subject	Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Improved Approximation of the Achromatic Number on Bipartite Graphs

Coloring rings

Wavelength management in WDM rings to maximize the number of connections (2007)

Tight bounds for wavelength assignment on trees of rings

Routing and Wavelength Assignment in WDM Networks with Bounded-Degree Tree and Tree of Rings Topologies

On Approximating the Achromatic Number

Models, Complexity and Algorithms for The Design of Multifiber WDM Networks (2003)

Wavelength assignment on bounded degree trees of rings

Models, Complexity and Algorithms for the Design of Multifiber WDM Networks (2003)

Wavelength Management in WDM Rings to Maximize the Number of Connections

Similar Documents

An Improved Approximation of the Achromatic Number on Bipartite Graphs

Coloring rings

Wavelength management in WDM rings to maximize the number of connections (2007)

Tight bounds for wavelength assignment on trees of rings

Routing and Wavelength Assignment in WDM Networks with Bounded-Degree Tree and Tree of Rings Topologies

On Approximating the Achromatic Number

Models, Complexity and Algorithms for The Design of Multifiber WDM Networks (2003)

Wavelength assignment on bounded degree trees of rings

Models, Complexity and Algorithms for the Design of Multifiber WDM Networks (2003)

Wavelength Management in WDM Rings to Maximize the Number of Connections