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

Authors

Sergey Gorinsky, New Jersey Institute of Technology
Sanjoy Baruah, New Jersey Institute of Technology
Thomas J. Marlowe, New Jersey Institute of Technology
Alexander D. Stoyenko, New Jersey Institute of Technology

Document Type

Conference Proceeding

Publication Date

12-1-1997

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.

Identifier

0031332381 (Scopus)

Publication Title

Proceedings IEEE INFOCOM

ISSN

0743166X

First Page

584

Last Page

591

Volume

2

Recommended Citation

Gorinsky, Sergey; Baruah, Sanjoy; Marlowe, Thomas J.; and Stoyenko, Alexander D., "Exact and efficient analysis of schedulability in fixed-packet networks: A generic approach" (1997). Faculty Publications. 16614.
https://digitalcommons.njit.edu/fac_pubs/16614