Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths with priorities
IEEE/ACM Transactions on Networking (TON)
Many-Sources Delay Asymptotics with Applications to Priority Queues
Queueing Systems: Theory and Applications
Invited Fluid queues with long-tailed activity period distributions
Computer Communications
Large deviations approximation for fluid queues fed by a large number of on/off sources
IEEE Journal on Selected Areas in Communications
A measurement-analytic approach for QoS estimation in a network based on the dominant time scale
IEEE/ACM Transactions on Networking (TON)
Many Sources Asymptotics for Networks with Small Buffers
Queueing Systems: Theory and Applications
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
ACM SIGMETRICS Performance Evaluation Review
Exact tail asymptotics in a priority queue--characterizations of the preemptive model
Queueing Systems: Theory and Applications
Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
In this paper we study the asymptotics of the tail of the buffer occupancy distribution in buffers accessed by a large number of stationary independent sources and which are served according to a strict HOL priority rule. As in the case of single buffers, the results are valid for a very general class of sources which include long-range dependent sources with bounded instantaneous rates. We first consider the case of two buffers with one of them having strict priority over the other and we obtain asymptotic upper bound for the buffer tail probability for lower priority buffer. We discuss the conditions to have asymptotic equivalents. The asymptotics are studied in terms of a scaling parameter which reflects the server speed, buffer level and the number of sources in such a way that the ratios remain constant. The results are then generalized to the case of M buffers which leads to the source pooling idea. We conclude with numerical validation of our formulae against simulations which show that the asymptotic bounds are tight. We also show that the commonly suggested reduced service rate approximation can give extremely low estimates.