Call Control on Lines

R. Sai  Anand; Thomas   Erlebach

1st International ICST Conference on Communication System Software and MiddleWare

Research Article

Call Control on Lines

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/COMSWA.2006.1665178,
    author={R. Sai  Anand and Thomas   Erlebach},
    title={Call Control on Lines},
    proceedings={1st International ICST Conference on Communication System Software and MiddleWare},
    publisher={IEEE},
    proceedings_a={COMSWARE},
    year={2006},
    month={8},
    keywords={},
    doi={10.1109/COMSWA.2006.1665178}
}

R. Sai Anand
Thomas Erlebach
Year: 2006
Call Control on Lines
COMSWARE
IEEE
DOI: 10.1109/COMSWA.2006.1665178

R. Sai Anand^1,2^,*, Thomas Erlebach³^,*

1: Computer Engineering and Networks Laboratory (TIK), Eidgen
2: ossische Technische Hochschule Zurich,
3: Department of Computer Science, University of Leicester,

*Contact email: anand@tik.ee.ethz.ch, t.erlebach@mcs.le.ac.uk

Abstract

Call admission control, call control for short, is a fundamental optimization problem arising in communication networks. The objective of the problem is to maximize the profit of call requests that can be accommodated in the network without violating the bandwidth constraints on the links. We study the offline variant of the problem on line networks. We provide polynomial time approximation schemes (PTAS) or algorithms with good approximation ratios for the problem when varying restrictions are imposed

Published: 2006-08-07
Publisher: IEEE

: http://dx.doi.org/10.1109/COMSWA.2006.1665178