Predictable path establishment in multimedia communication networks

Author

Simon, Robert

Author_Institution

Dept. of Comput. Sci., George Mason Univ., Fairfax, VA, USA

Volume

1

fYear

1999

fDate

36342

Firstpage

289

Abstract

Deadline-driven packet scheduling policies provide highly flexible methods for real-time communication support of distributed multimedia applications. This paper presents a probabilistic approach for analyzing admission control and communication establishment for the general class of non-preemptive deadline-oriented packet scheduling policies. The prediction method can be used for communication and scheduling policy evaluation, routing for multimedia traffic and capacity planning. A large-scale simulation study demonstrates that our method provides highly accurate predictions of acceptance rates for multiple types of multimedia connection requests

Keywords

multimedia communication; quality of service; real-time systems; scheduling; telecommunication network routing; telecommunication traffic; admission control; capacity planning; deadline-driven packet scheduling; distributed multimedia applications; multimedia communication networks; multimedia connection requests; multimedia traffic routing; nonpreemptive packet scheduling; predictable path establishment; probabilistic approach; quality of service; real-time communication; simulation; Admission control; Capacity planning; Communication networks; Communication system traffic control; Large-scale systems; Multimedia communication; Prediction methods; Routing; Scheduling algorithm; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Multimedia Computing and Systems, 1999. IEEE International Conference on

Conference_Location

Florence

Print_ISBN

0-7695-0253-9

Type

conf

DOI

10.1109/MMCS.1999.779219

Filename

779219