On computing per-session performance bounds in high-speed multi-hop computer networks
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
Exponential bounds with applications to call admission
Journal of the ACM (JACM)
Second moment resource allocation in multi-service networks
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Some properties of variable length packet shapers
IEEE/ACM Transactions on Networking (TON)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Scaling properties of statistical end-to-end bounds in the network calculus
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A basic stochastic network calculus
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Stochastically bounded burstiness for communication networks
IEEE Transactions on Information Theory
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
Exponential supermartingales for evaluating end-to-end backlog bounds
ACM SIGMETRICS Performance Evaluation Review
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Network calculus and queueing theory: two sides of one coin: invited paper
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
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
Perspectives on network calculus: no free lunch, but still good value
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
On applying stochastic network calculus
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
The purpose of this paper is to shed light on the accuracy of probabilistic delay bounds obtained with network calculus. In particular, by comparing calculus bounds with exact results in a series of M/M/1 queues with cross traffic, we show that reasonably accurate bounds are achieved when the percentage of cross traffic is low. We use recent results in network calculus and, in addition, propose novel bounds based on Doob's maximal inequality for supermartingales. In the case of single M/M/1 and M/D/1 queues, our results improve existing bounds by Ω(log(1-ρ)-1/1-ρ) when the utilization factor ρ converges to one.