文献类型：期刊文献

英文题名：Approximation on MAP/G/1 queue with N-policy working vacation

作者：Zhao, Guoxi[1]; Cui, Guangyun[1]

第一作者：赵国喜

通讯作者：Zhao, G.

机构：[1] Department of Mathematics, Xinxiang University, Xinxiang, China

第一机构：新乡学院数学与信息科学学院

年份：2011

卷号：6

期号：6

起止页码：110-118

外文期刊名：Journal of Convergence Information Technology

收录：EI(收录号：20112814133784);Scopus(收录号：2-s2.0-79959981369)

语种：英文

外文关键词：Markov processes - Queueing theory

摘要：MAP/G/1 Queue with N-Policy Working Vacation (N-PWV) is investigated. The input process of the queue model is markovian arrival process (MAP), and server has working vacation with N-Policy. The server starts a vacation only when the system is empty, and the busy period stars on the point just when there are N customers in the queuing system, furthermore the service rate in the vacation is not zero. Using the good character of PH distribution, which is dense in the set of all probability distribution on(0,+∞), which can be used to approximate any probability distribution, we simplify the MAP/G/1 Queue with N-PWV into a quasi-birth-death process (QBD). By matrix-geometric theory of Neuts, the stationary performance measures are got. Finally, we give a table with the change of system parameters by numerical example.