Call scheduling in trees, rings and meshes

Author

Erlebach, T. ; Jansen, K.

Author_Institution

Tech. Univ. Munchen, Germany

Volume

1

fYear

1997

fDate

7-10 Jan 1997

Firstpage

221

Abstract

The problem of establishing and completing a given set of calls as early as possible is studied for bidirectional and directed calls in various classes of networks. Even under the assumption of unit bandwidth requirements and unit call durations, call scheduling is NP-hard for trees with unbounded degree, for rings, and for meshes. Whereas bidirectional calls can be scheduled optimally in polynomial time for trees of constant degree, the problem for directed calls is already NP-hard for binary trees. Approximation algorithms with a constant performance ratio are known for many NP-hard variants of call scheduling

Keywords

asynchronous transfer mode; communication complexity; computer networks; directed graphs; scheduling; telecommunication congestion control; trees (mathematics); ATM communication; NP-hard; approximation algorithms; bidirectional calls; binary trees; call admission control; call scheduling; constant degree trees; constant performance ratio; directed calls; directed graph; meshes; polynomial time; rings; trees; unit bandwidth requirements; unit call durations; Approximation algorithms; Asynchronous transfer mode; Bandwidth; Binary trees; Call admission control; High-speed networks; Intelligent networks; Motion pictures; Polynomials; Scheduling algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1997, Proceedings of the Thirtieth Hawaii International Conference on

Conference_Location

Wailea, HI

ISSN

1060-3425

Print_ISBN

0-8186-7743-0

Type

conf

DOI

10.1109/HICSS.1997.667220

Filename

667220