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

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

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

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

Department of Computer Science & Engineering

Research output: Contribution to journal › Conference article › peer-review

8 Scopus citations

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.

Original language	English
Pages (from-to)	584-591
Number of pages	8
Journal	Proceedings - IEEE INFOCOM
Volume	2
State	Published - 1997
Event	Proceedings of the 1997 16th IEEE Annual Conference on Computer Communications, INFOCOM. Part 1 (of 3) - Kobe, Jpn Duration: Apr 7 1997 → Apr 12 1997

Cite this

@article{54445c5e0f3344c1887b7036ea13cba9,

title = "Exact and efficient analysis of schedulability in fixed-packet networks: A generic approach",

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.",

author = "Sergey Gorinsky and Sanjoy Baruah and Marlowe, {Thomas J.} and Stoyenko, {Alexander D.}",

year = "1997",

language = "English",

volume = "2",

pages = "584--591",

journal = "Proceedings - IEEE INFOCOM",

issn = "0743-166X",

note = "Proceedings of the 1997 16th IEEE Annual Conference on Computer Communications, INFOCOM. Part 1 (of 3) ; Conference date: 07-04-1997 Through 12-04-1997",

}

TY - JOUR

T1 - Exact and efficient analysis of schedulability in fixed-packet networks

T2 - Proceedings of the 1997 16th IEEE Annual Conference on Computer Communications, INFOCOM. Part 1 (of 3)

AU - Gorinsky, Sergey

AU - Baruah, Sanjoy

AU - Marlowe, Thomas J.

AU - Stoyenko, Alexander D.

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031332381&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0031332381

SN - 0743-166X

VL - 2

SP - 584

EP - 591

JO - Proceedings - IEEE INFOCOM

JF - Proceedings - IEEE INFOCOM

Y2 - 7 April 1997 through 12 April 1997

ER -

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

Abstract

Other files and links

Fingerprint

Cite this