Call control and routing in SONET rings

Authors:
Shuqiang Chen;Qizhi Fang
Affiliations:
Department of Mathematics, Ocean University of China, Shandong, P. R. China;Department of Mathematics, Ocean University of China, Shandong, P. R. China
Venue:
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Year:
2007

Citing 6
Cited 0

The Ring Loading Problem

SIAM Journal on Discrete Mathematics
Ring routing and wavelength translation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optical networks: a practical perspective

Optical networks: a practical perspective
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Call Control in Rings

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Multicommodity demand flow in a tree

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we provide a polynomial-time approximation algorithm for Call Control and Routing problems in SONET rings. In this problem, we are given a SONET ring and a set of calls, each of which is described by a source-destination pair of nodes together with an integer specifying the call demand, the aim is to devise a routing scheme such that the total demand transmitted is maximum subject to the bandwidth restriction. We first give an NP-hardness proof for this problem. Then a polynomial-time approximation algorithm is provided. When dmax ≤ 1/K d* (where K 2 is a constant, d* is the available bandwidth of the ring and dmax is the largest call demand among all the calls), the algorithm outputs a routing scheme with total demand transmitted at least as (1 - 7/2K+3 ) times the optimum.