A Non-Preemptive Priority Queueing System with a Single Server Serving Two Queues M/G/1 and M/D/1 with Optional Server Vacations Based on Exhaustive Service of the Priority Units

Madan, Kailash C.

doi:10.4236/am.2011.26106

Cited by 7 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [18], the worst‐case scenario of the non‐pre‐emptive model for M/G/1 is compared to the average result model. A two‐queue system of M/G/1 and M/D/1 models, employing vacation queueing approach is studied in [19] and the traffic behaviour of SU is analysed in [20] for a pre‐emptive model. Similarly, the pre‐emptive priority model is considered in [21], but with a retrial rate of the user packet.…”

Section: Literature Reviewmentioning

confidence: 99%

Improving the quality of service for users in cognitive radio network using priority queueing analysis

Bassoo

Khedun

2016

IET Communications

View full text Add to dashboard Cite

The usage of the radio spectrum for wireless communication is considered to be inefficient. Therefore, through cognitive radio, unlicensed users can occupy idle spectrum bands without interference with the primary user. Generally, when the arrival rate of licensed users is high, secondary users may starve. In this paper, we propose two models to improve the average total waiting time for the secondary user. They are the M/D/1 model of a primary user delay system with non-pre-emptive priority and pre-emptive priority. They are compared to an M/D/1 model with primary user delay. Numerical analysis and Monte Carlo simulation are performed for all results. Improvements in the average total waiting time of 13%-18% for primary user and 24%-32% for secondary user in the non-pre-emptive priority scheme are obtained. In the pre-emptive priority scheme, 19%-22% and 5%-7% improvement are obtained for the primary and secondary user respectively. Furthermore, same models, but with finite buffer capacity for both users are investigated to model a real-time system. In these schemes, the system improves the average total waiting time by 20%-42% for the primary user and 34%-42% for the cognitive radio with non-pre-emptive priority. Similarly, the pre-emptive model shows 25%-44% and 6%-24% reduction in the primary and secondary user waiting times respectively.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Improving the quality of service for users in cognitive radio network using priority queueing analysis

Bassoo

Khedun

2016

IET Communications

View full text Add to dashboard Cite

show abstract

“…Many researchers including Borthakur and Choudhury [1], Choudhury [2,3], Madan and Choudhury [15], Gaver [5], Kielson and Servi [6], Lee and Srinivan [8], Rosenberg and Yechialli [18] and Tegham [22] have studied queues with Bernoulli schedule vacations or modified Bernoulli schedule vacations. Among the authors who studied queueing systems with vacation policies other than the Bernoulli type vacations, we mention Shanthikumar [19] who studied generalized vacations, Takagi [20] and, Madan and Abu-Rub [12][13][14] who studied vacations based exhaustive service and Madan [9] considered a priority queueing system with exhaustive service in which the server cannot take a vacation till all priority units present in the system are served. Recently, Krishnamoorthy and Sreeniwan [7] and Tao et al [21] studied queueing system with working vacations wherein they assume that the server is on vacation but keeps working in the system at a lower arte.…”

Section: Introductionmentioning

confidence: 99%

On optional deterministic server vacations in a batch arrival queueing system with a single server providing first essential service followed by one of the two types of additional optional service

Madan

2016

Malaya J. Mat.

View full text Add to dashboard Cite

We analyze a batch arrival queue with a single server providing first essential service (FES) followed by one of the two types of additional optional service (AOS). After completion of the FES, a customer has the option to leave the system or to choose one of the two types of AOS and as soon as a customer leaves (either after the FES or after completing one of the chosen AOS, the server may take a vacation or may continue staying in the system. The vacation times are assumed to be deterministic and the server vacations are based on Bernoulli schedules under a single vacation policy. We obtain explicit queue size distribution at a random epoch under the steady state. In addition, some important performance measures such as the steady state expected queue size and the expected waiting time of a customer at a random epoch are obtained. Further, some interesting particular cases are also discussed.

show abstract

An Algorithmic Approach for Multiserver Retrial Queues with Two Customers Classes and Non-preemptive Priority

Gharbi

Charabi²

2017

Analytical and Stochastic Modelling Techniques and Applications

View full text Add to dashboard Cite

A Non-Preemptive Priority Queueing System with a Single Server Serving Two Queues M/G/1 and M/D/1 with Optional Server Vacations Based on Exhaustive Service of the Priority Units

Cited by 7 publications

References 11 publications

Improving the quality of service for users in cognitive radio network using priority queueing analysis

Improving the quality of service for users in cognitive radio network using priority queueing analysis

On optional deterministic server vacations in a batch arrival queueing system with a single server providing first essential service followed by one of the two types of additional optional service

An Algorithmic Approach for Multiserver Retrial Queues with Two Customers Classes and Non-preemptive Priority

Contact Info

Product

Resources

About