The Impact of Priority Policy in a Two-Queue Markovian Polling System with Multi-Class Priorities
In this paper,we consider a two-queue Markovian polling system attended by a single server.For this model,multiple-class customers with priorities are concerned in each queue.We first present the exact LST(Laplace-Stieltjes transformation)expressions and means of the waiting times of each type customers by utilizing the concept of delaycycle.Furthermore,we prove that prioritizing customers with smaller mean service times could shorten the mean response time,especially in the heavy traffic regime.With the LSTs of waiting times,we also concentrate on the derivation of the exact asymptotics of the scaled delay in the heavy-traffic scenario.It is illustrated that the priority policy generates a mixture distribution of the limiting scaled delay in comparison with the non-priority policy.Lastly,simulations are used for validation of the limiting results and the impact of priority policy.
Polling system Markovian routing Priority Waiting time Simevents
Yuqing Chu Zaiming Liu
School of Science,Wuhan University of Technology,Wuhan 430070,China School of Mathematics and Statistics,Central South University,Changsha 410083,China
国际会议
河北秦皇岛
英文
282-296
2017-08-21（万方平台首次上网日期，不代表论文的发表时间）