Matrix analysis
Large deviations of uniformly recurrent Markov additive processes
Advances in Applied Mathematics
The queue M/G/1 with Markov modulated arrivals and services
Mathematics of Operations Research
Effective bandwidths at multi-class queues
Queueing Systems: Theory and Applications
Effective bandwidths for the multi-type UAS channel
Queueing Systems: Theory and Applications
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
The Fourier-series method for inverting transforms of probability distributions
Queueing Systems: Theory and Applications - Numerical computations in queues
IEEE/ACM Transactions on Networking (TON)
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
The Internet and interactive television
Communications of the ACM
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
The Markov-modulated Poisson process (MMPP) cookbook
Performance Evaluation
Risk theory in a periodic environment: the Crame´r-Lundberg approximation and Lundberg's inequality
Mathematics of Operations Research
Effective bandwidth and fast simulation of ATM intree networks
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Diffusion based statistical call admission control in ATM
Performance Evaluation
Upper and lower bounds for the multiplexing of multiclass Markovian on/off sources
Performance Evaluation
Local Allocation of End-to-End Quality-of-Service in High-Speed Networks
Proceedings of the IFIP TC6 Task Group/WG6.4 International Workshop on Performance of Communication Systems: Modelling and Performance Evaluation of ATM Technology
Computable exponential bounds for intree networks with routing
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Decoupling Bandwidths for Networks: A Decomposition Approach to
Decoupling Bandwidths for Networks: A Decomposition Approach to
Bounds on finite horizon QoS metrics with application to call admission
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Tail probabilities for a multiplexer with self-similar traffic
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Control mechanisms for packet audio in the internet
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
IEEE Journal on Selected Areas in Communications
Large deviations approximation for fluid queues fed by a large number of on/off sources
IEEE Journal on Selected Areas in Communications
Applications of SMP Bounds to Multi-class Traffic in High-speed Networks
Queueing Systems: Theory and Applications
A Note on Bounds in the SMP Fluid Models
Queueing Systems: Theory and Applications
BOUNDS FOR FLUID MODELS DRIVEN BY SEMI-MARKOV INPUTS
Probability in the Engineering and Informational Sciences
Call packing bound for overflow loss systems
Performance Evaluation
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
Analysis of transient queues with semidefinite optimization
Queueing Systems: Theory and Applications
Sharp bounds in stochastic network calculus
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Hi-index | 0.01 |
In this paper, we develop a framework for computing upper and lower bounds of an exponential form for a large class of single resource systems with Markov additive inputs. Specifically, the bounds are on quantities such as backlog, queue length, and response time. Explicit or computable expressions for our bounds are given in the context of queuing theory and numerical comparisons with other bounds and exact results are presented. The paper concludes with two applications to admission control in multimedia systems.