Logo des Repositoriums
 
Konferenzbeitrag

Server models for probabilistic network calculus

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Text/Conference Paper

Zusatzinformation

Datum

2005

Autor:innen

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik e.V.

Zusammenfassung

Network calculus is a deterministic queuing theory that has gained increasing attention in recent time. Founded on min-plus algebra it resorts to intuitive convolution formulae for efficient concatenation of servers and derivation of related performance bounds. Yet, the pessimistic worst-case analysis of deterministic network calculus gave rise to probabilistic counterparts that aim at utilizing the smoothing effects of statistical multiplexing by allowing for certain violation probabilities. Related theories are, however, significantly more complicated and still subject to research. To advance theory this paper evolves server models for probabilistic network calculus that are based on moment generating functions to efficiently utilize statistical multiplexing and the independence of flows.

Beschreibung

Fidler, Markus (2005): Server models for probabilistic network calculus. Informatk 2005. Informatik Live! Band 1. Bonn: Gesellschaft für Informatik e.V.. PISSN: 1617-5468. ISBN: 3-88579-396-2. pp. 400-404. Regular Research Papers. Bonn. 19.-22. September 2005

Schlagwörter

Zitierform

DOI

Tags