A framework for guaranteeing statistical QoS
IEEE/ACM Transactions on Networking (TON)
Worst case burstiness increase due to FIFO multiplexing
Performance Evaluation
Safe compositional specification of networking systems
ACM SIGCOMM Computer Communication Review
A network service curve approach for the stochastic analysis of networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer 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
A calculus for stochastic QoS analysis
Performance Evaluation
Simplified methods for next generation IP access networks planning
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Asymptotic end-to-end stochastic evaluation for tandem networks with many flows
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
New stochastic network calculus for loss analysis
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Achievable throughput for communication networks: a survey
Proceedings of the 7th International Conference on Frontiers of Information Technology
Analysis of stochastic service guarantees in communication networks: a server model
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Workload loss examinations with a novel probabilistic extension of network calculus
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
| Hi-index | 0.00 |
The deterministic network calculus offers an elegant framework for determining delays and backlog in a network with deterministic service guarantees to individual traffic flows. A drawback of the deterministic network calculus is that it only provides worst-case bounds. Here we present a network calculus for statistical service guarantees, which can exploit the statistical multiplexing gain of sources. We introduce the notion of an effective service curve as a probabilistic bound on the service received by an individual flow, and construct an effective service curve for a network where capacities are provisioned exclusively to aggregates of flows. Numerical examples demonstrate that the calculus is able to extract a significant amount of multiplexing gain in networks with a large number of flows.