Off-Line and On-Line Call-Scheduling in Stars and Trees

Off-Line and On-Line Call-Scheduling in Stars and Trees (1997)

Cached

Download Links

[www.informatik.uni-kiel.de]
[www14.informatik.tu-muenchen.de]

Other Repositories/Bibliography

DBLP

by Thomas Erlebach , Klaus Jansen

Venue:	in Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG ‘97, LNCS1335, Springer-Verlag
Citations:	11 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Off-Line and On-Line Call-Scheduling in Stars and Trees	user correction - Legacy Corrections
AUTHOR NAME	Thomas Erlebach	SVM HeaderParse 0.1
AUTHOR AFFIL	1	SVM HeaderParse 0.2
AUTHOR NAME	Klaus Jansen	SVM HeaderParse 0.1
AUTHOR AFFIL	; 2; 1; Institut fur Informatik, TU Munchen, D--80290 Munchen,; 2	SVM HeaderParse 0.2
AUTHOR ADDR	; Fachbereich IV-- Mathematik, Universitat Trier, Postfach 3825, D--54286 Trier,	SVM HeaderParse 0.1
ABSTRACT	. Given a communication network and a set of call requests, the goal is to find a minimum makespan schedule for the calls such that the sum of the bandwidth requirements of simultaneously active calls using the same link does not exceed the capacity of that link. In this paper the call-scheduling problem is studied for star and tree networks. Lower and upper bounds on the worst-case performance of List-Scheduling (LS) and variants of it are obtained for call-scheduling with arbitrary bandwidth requirements and either unit call durations or arbitrary call durations. LS does not require advance knowledge of call durations and, hence, is an on-line algorithm. It has performance ratio (competitive ratio) at most 5 in star networks. A variant of LS for calls with unit durations is shown to have performance ratio at most 2 2 3 . In tree networks with n nodes, a variant of LS for calls with unit durations has performance ratio at most 6, and a variant for calls with arbitrary d...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE	in Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG ‘97, LNCS1335, Springer-Verlag	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	195--213	INFERENCE
CITATIONS	16 found	ParsCit 1.0