Telecommunication networks: protocols, modeling and analysis
Telecommunication networks: protocols, modeling and analysis
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
IEEE/ACM Transactions on Networking (TON)
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Analysis on Generalized Stochastically Bounded Bursty Traffic for Communication Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
A Calculus for End-to-end Statistical Service Guarantees
A Calculus for End-to-end Statistical Service Guarantees
A Service-Curve Model with Loss and a Multiplexing Problem
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
On deterministic traffic regulation and service guarantees: a systematic approach by filtering
IEEE Transactions on Information Theory
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
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
A network calculus with effective bandwidth
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 5th ACM symposium on QoS and security for wireless and mobile networks
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
Network calculus delay bounds in queueing networks with exact solutions
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
An analytical expression for service curves of fading channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Sample path bounds for long memory FBM traffic
INFOCOM'10 Proceedings of the 29th conference on Information communications
Non-asymptotic delay bounds for networks with heavy-tailed traffic
INFOCOM'10 Proceedings of the 29th conference on Information communications
Leveraging statistical multiplexing gains in single- and multi-hop networks
Proceedings of the Nineteenth International Workshop on Quality of Service
Poster: on the capacity delay error tradeoff of source coding
ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation
On superlinear scaling of network delays
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The stochastic network calculus is an evolving new methodology for backlog and delay analysis of networks that can account for statistical multiplexing gain. This paper advances the stochastic network calculus by deriving a network service curve, which expresses the service given to a flow by the network as a whole in terms of a probabilistic bound. The presented network service curve permits the calculation of statistical end-to-end delay and backlog bounds for broad classes of arrival and service distributions. The benefits of the derived service curve are illustrated for the exponentially bounded burstiness (EBB) traffic model. It is shown that end-to-end performance measures computed with a network service curve are bounded by O (H log H), where H is the number of nodes traversed by a flow. Using currently available techniques, which compute end-to-end bounds by adding single node results, the corresponding performance measures are bounded by O (H3).