An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
Computers and Operations Research
Differentiated Services for the Internet
Differentiated Services for the Internet
A finite buffer queue with priorities
Performance Evaluation
Priority queueing with finite buffer size and randomized push-out mechanism
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Service differentiation and guarantees for TCP-based elastic traffic
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
Hi-index | 0.00 |
The non-preemptive priority queueing with a finite buffer is considered. We introduce a randomized push-out buffer management mechanism which allows to control very efficiently the loss probability of priority packets. The packet loss probabilities for priority and non-priority traffic are calculated using the generating function approach. In the particular case of the standard non-randomized push-out scheme we obtain explicit analytic expressions. The theoretical results are illustrated by numerical examples. The randomized push-out scheme is compared with the threshold based push-out scheme. It turns out that the former is much easier to tune than the latter. The proposed scheme can be applied to the Differentiated Services of the Internet.