Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Model-based estimation of buffer overflow probabilities from measurements
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Large deviations and the generalized processor sharing scheduling for a two-queue system
Queueing Systems: Theory and Applications
Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies
Queueing Systems: Theory and Applications
Large deviations analysis of the generalized processor sharing policy
Queueing Systems: Theory and Applications
A flow-based model for internet backbone traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Importance sampling for the estimation of buffer overflow probabilities via trace-driven simulations
IEEE/ACM Transactions on Networking (TON)
The variation of optimal bandwidth and buffer allocation with the number of sources
IEEE/ACM Transactions on Networking (TON)
Non-cooperative games for service differentiation in CDMA systems
Mobile Networks and Applications
Geometric programming for communication systems
Communications and Information Theory
Performance analysis of priority scheduling mechanisms under heterogeneous network traffic
Journal of Computer and System Sciences
Efficient blocking probability computation of complex traffic flows for network dimensioning
Computers and Operations Research
Power control strategy for distributed multiple-hypothesis detection
IEEE Transactions on Signal Processing
Large deviations theory: basic principles and applications to communication networks
Network performance engineering
Class-specific quality of service guarantees in multimedia communication networks
Automatica (Journal of IFAC)
On the effectiveness of the many-sources asymptotic for admission control
Computer Communications
Hi-index | 0.08 |
This paper is an introduction to some large deviations techniques that have been used for analyzing models of communication networks. Starting from the beginning (sequences of i.i.d. random variables), it progresses to some Markov processes in discrete or continuous time. It illustrates the meaning of most theorems by applying them to a common example. Then the AMS model of buffering in ATM is analyzed in a variety of ways. Finally, a few other common models are discussed