Name
Abstract | ||
|---|---|---|
Abstract: Network calculus is ad eterministic queuing theory that has gained increas- ing attention in recent time. Founded on min-plus algebra it resorts to intuitive con- volution formulae for efficient concatenation of servers and derivation of related per - formance bounds. Ye t, the pessimistic worst-case analysis of deterministic network calculus gave rise to probabilistic counterparts that aim at utilizing the smoothing,ef- fects 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. 1I ntroduction |
Year | Venue | Keywords |
|---|---|---|
2005 | GI-Jahrestagung | queuing theory,moment generating function,statistical multiplexing |
Field | DocType | Citations |
Theoretical computer science,Network calculus,Probabilistic logic,Mathematics | Conference | 0 |
PageRank | References | Authors |
0.34 | 4 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Markus Fidler | 1 | 268 | 15.13 |