Exact and efficient analysis of schedulability in fixed-packet networks: a generic approach

Author

Gorinsky, Sergey ; Baruah, Sanjoy ; Marlowe, Thomas J. ; Stoyenko, Alexander D.

Author_Institution

Dept. of Comput. & Inf. Sci., New Jersey Inst. of Technol., Newark, NJ, USA

Volume

2

fYear

1997

fDate

7-12 Apr 1997

Firstpage

584

Abstract

A general model for traffic flows on packet-switched, virtual-circuit based, fixed-packet networks is introduced, and an exact schedulability test is obtained for systems of such flows. Rules are derived that make the evaluation of this schedulability test feasible and efficient under certain circumstances. The practical relevance of this approach is demonstrated by applying it to a number of standard traffic models

Keywords

computer networks; packet switching; scheduling; telecommunication congestion control; telecommunication traffic; efficient analysis; exact schedulability test; fixed-packet networks; generic approach; standard traffic models; traffic flows; virtual-circuit based networks; Computer networks; Computer science; Delay; Information science; Intelligent networks; Laboratories; Processor scheduling; Real time systems; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE

Conference_Location

Kobe

ISSN

0743-166X

Print_ISBN

0-8186-7780-5

Type

conf

DOI

10.1109/INFCOM.1997.644509

Filename

644509