Statistical analysis of generalized processor sharing scheduling discipline
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Exponential bounds with applications to call admission
Journal of the ACM (JACM)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Stochastic Network Calculus
On superlinear scaling of network delays
IEEE/ACM Transactions on Networking (TON)
Perspectives on network calculus: no free lunch, but still good value
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
| Hi-index | 0.00 |
The practicality of the stochastic network calculus (SNC) is often questioned on grounds of potential looseness of its performance bounds. In this paper it is uncovered that for bursty arrival processes (specifically Markov-Modulated On-Off (MMOO)), whose amenability to per-flow analysis is typically proclaimed as a highlight of SNC, the bounds can unfortunately indeed be very loose (e.g., by several orders of magnitude off). In response to this uncovered weakness of SNC, the (Standard) per-flow bounds are herein improved by deriving a general sample-path bound, using martingale based techniques, which accommodates FIFO, SP, and EDF scheduling disciplines. The obtained (Martingale) bounds capture an additional exponential decay factor of O(e-α n) in the number of flows $n$, and are remarkably accurate even in multiplexing scenarios with few flows.