Show simple item record

dc.contributor.authorFidler, Markus
dc.contributor.editorCremers, Armin B.
dc.contributor.editorManthey, Rainer
dc.contributor.editorMartini, Peter
dc.contributor.editorSteinhage, Volker
dc.date.accessioned2019-10-11T07:41:27Z
dc.date.available2019-10-11T07:41:27Z
dc.date.issued2005
dc.identifier.isbn3-88579-396-2
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/28069
dc.description.abstractNetwork 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.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofInformatk 2005. Informatik Live! Band 1
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-67
dc.titleServer models for probabilistic network calculusen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages400-404
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBonn
mci.conference.date19.-22. September 2005


Files in this item

Thumbnail

Show simple item record