Name
Abstract | ||
|---|---|---|
The aim of the stochastic network calculus is to comprehend statistical multiplexing and scheduling of non-trivial traffic sources in a framework for end-to-end analysis of multi-node networks. To date, several models, some of them with subtle yet important differences, have been explored to achieve these objectives. Capitalizing on previous works, this paper contributes an intuitive approach to the stochastic network calculus, where we seek to obtain its fundamental results in the possibly easiest way. In detail, the method that is assembled in this work uses moment generating functions, known from the theory of effective bandwidths, to characterize traffic arrivals and network service. Thereof, affine envelope functions with an exponentially decaying overflow profile are derived to compute statistical end-to-end backlog and delay bounds for networks. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/COMST.2014.2337060 | Communications Surveys & Tutorials, IEEE |
Keywords | Field | DocType |
calculus of communicating systems,statistical analysis,statistical multiplexing,stochastic processes,telecommunication scheduling,telecommunication services,telecommunication traffic,multinode network analysis,network service,nontrivial traffic source scheduling,stochastic network calculus,theory of effective bandwidth,user moment generating function,end-to-end performance evaluation,moment generating functions,scheduling,calculus,random processes,servers,convolution | Affine transformation,Network service,Scheduling (computing),Computer science,Convolution,Computer network,Stochastic process,Theoretical computer science,Network calculus,Statistical time division multiplexing,Moment-generating function,Distributed computing | Journal |
Volume | Issue | ISSN |
17 | 1 | 1553-877X |
Citations | PageRank | References |
29 | 1.02 | 34 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Markus Fidler | 1 | 268 | 15.13 |
| Amr Rizk | 2 | 209 | 27.28 |