Effective bandwidths at multi-class queues
Queueing Systems: Theory and Applications
Effective bandwidths for the multi-type UAS channel
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Large deviations and the generalized processor sharing scheduling for a two-queue system
Queueing Systems: Theory and Applications
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Large deviations in high-speed communication networks
Large deviations in high-speed communication networks
Bandwidth allocation for multiple qualities of service using generalized processor sharing
IEEE Transactions on Information Theory
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
Resource allocation for broadband networks
IEEE Journal on Selected Areas in Communications
An introduction to large deviations for communication networks
IEEE Journal on Selected Areas in Communications
Statistical multiplexing of multiple time-scale Markov streams
IEEE Journal on Selected Areas in Communications
Statistical analysis of the generalized processor sharing scheduling discipline
IEEE Journal on Selected Areas in Communications
Congestion-dependent pricing of network services
IEEE/ACM Transactions on Networking (TON)
Model-based estimation of buffer overflow probabilities from measurements
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE/ACM Transactions on Networking (TON)
Large deviations analysis of the generalized processor sharing policy
Queueing Systems: Theory and Applications
Importance sampling for the estimation of buffer overflow probabilities via trace-driven simulations
IEEE/ACM Transactions on Networking (TON)
Tail asymptotics for policies favoring short jobs in a many-flows regime
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
A note on the delay distribution in GPS
Operations Research Letters
| Hi-index | 22.14 |
We consider the problem of quality-of-service (QoS) provisioning in modern high-speed, multimedia, communication networks. We quantify QoS by the probabilities of loss and excessive delay of an arbitrary packet, and introduce the model of a multiclass node (switch) which provides network access to users that may belong to multiple service classes. We treat such a node as a stochastic system which we analyze and control. In particular, we develop an analytical approach to estimate both the delay and the buffer overflow probability per service class, based on ideas from large deviations and optimal control. We exploit these performance analysis results by devising a call admission control algorithm which can provide per class QoS guarantees. We compare the proposed approach to alternative worst-case and effective bandwidth-based schemes and argue that it leads to increased efficiency. Finally, we discuss extensions to the network case in order to provide end-to-end QoS guarantees.