Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
Experimental queueing analysis with long-range dependent packet traffic
IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
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
A Service-Curve Model with Loss and a Multiplexing Problem
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
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
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
Stochastically bounded burstiness for communication networks
IEEE Transactions on Information Theory
A Min-Plus Calculus for End-to-End Statistical Service Guarantees
IEEE Transactions on Information Theory
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
On the use of fractional Brownian motion in the theory of connectionless networks
IEEE Journal on Selected Areas in Communications
Admission control for statistical QoS: theory and practice
IEEE Network: The Magazine of Global Internetworking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Closed-form analysis of end-to-end network delay with Markov-modulated Poisson and fluid traffic
Computer Communications
Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
FISTE: A black box approach for end-to-end QoS management
ACM Transactions on Modeling and Computer Simulation (TOMACS)
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
End-to-end delay approximation in cascades of generalized processor sharing schedulers
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Sample path bounds for long memory FBM traffic
INFOCOM'10 Proceedings of the 29th conference on Information communications
Essay on teletraffic models (I)
ACACOS'10 Proceedings of the 9th WSEAS international conference on Applied computer and applied computational science
FGN based telecommunication traffic models
WSEAS Transactions on Computers
Leveraging statistical multiplexing gains in single- and multi-hop networks
Proceedings of the Nineteenth International Workshop on Quality of Service
On superlinear scaling of network delays
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
An end-to-end stochastic network calculus with effective bandwidth and effective capacity
Computer Networks: The International Journal of Computer and Telecommunications Networking
On applying stochastic network calculus
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
This paper establishes a link between two principal tools for the analysis of network traffic, namely, effective bandwidth and network calculus. It is shown that a general version of effective bandwidth can be expressed within the framework of a probabilistic version of the network calculus, where both arrivals and service are specified in terms of probabilistic bounds. By formulating well-known effective bandwidth expressions in terms of probabilistic envelope functions, the developed network calculus can be applied to a wide range of traffic types, including traffic that has self-similar characteristics. As applications, probabilistic lower bounds are presented on the service given by three different scheduling algorithms: Static Priority, Earliest Deadline First, and Generalized Processor Sharing. Numerical examples show the impact of specific traffic models and scheduling algorithms on the multiplexing gain in a network.