Abstract
In this paper, we consider a tandem of two head-of-line (HOL) non-preemptive priority queuing systems, each with a single server and a deterministic service-time. Two classes of traffic are considered, namely high priority and low priority traffic. By means of a generating function approach, we present a technique to derive closed-form expressions for the mean buffer occupancy at each node and mean delay. Finally, we illustrate our solution technique with some numerical examples, whereby we illustrate the starvation impact of the HOL priority scheduling discipline on the performance of the low-priority traffic stream. Our research highlights the important fact that the unfairness of the HOL priority scheduling becomes even more noticeable at the network level. Thus this priority mechanism should be used with caution.
Highlights
In this contribution, we consider two discrete-time priority queuing systems in tandem
We consider a tandem of two head-of-line (HOL) non-preemptive priority queuing systems, each with a single server and a deterministic service-time
It is well known that generation telecommunications networks are being built around the inspiration of having a single costeffective packet-based network that is capable of supporting diverse classes of services, each with its own Quality of Service (QoS) requirement
Summary
We consider two discrete-time priority queuing systems (hereafter referred to as PQS1 and PQS2) in tandem. F. KAMOUN queuing model being considered, the solution technique being developed to extract explicit expressions for the various performance measures, and the new insights provided on the performance of HOL priority queuing systems in a small “network” environment: First, we add to the existing literature on non-preemptive priority models by considering two priority-based queuing systems in tandem. KAMOUN queuing model being considered, the solution technique being developed to extract explicit expressions for the various performance measures, and the new insights provided on the performance of HOL priority queuing systems in a small “network” environment: First, we add to the existing literature on non-preemptive priority models by considering two priority-based queuing systems in tandem This tandem configuration of two PQS stages makes the resulting model more practical and flexible in studying more realistic priority-based queuing systems.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
