An efficient priority service model with two-level-polling scheme  

作　　者：Liu Qianlin Zhao Dongfeng Zhao Yifan 

机构地区：[1]Department of Communications Engineering, Yunnan University, Kunming 650091, P. R. China

出　　处：《High Technology Letters》2011年第3期245-251,共7页高技术通讯（英文版）

基　　金：Supported by the National Natural Science Foundation of China （No. 69862001, F0424104, 60362001 and 61072079）.

摘　　要：This paper considers an efficient priority service model with two-level-polling scheme which the message packets conform to the discrete-time Geom/G/1 queue with multiple vacations and bulk arrival. By the embedded Markov chain theory and the probability generating function method, we set up the mathematics functions and give closed form expressions for obtaining the mean cyclic period （MCP）, the mean queue length （MQL） and the mean waiting time （MWT） characteristics, the analytical results are also verified through extensive computer simulations. The performance analysis reveals that this priority polling scheme can gives better efficiency as well as impartiality in terms of system characteristics, and it can be used for differentiating priority service to guarantee better QoS and system stability in design and improvement of MAC protocol.

关 键 词：priority service Geom/G/1 queue mean queue length（MQL） mean waiting time （MWT） 

分 类 号：TP316.2[自动化与计算机技术—计算机软件与理论] O226[自动化与计算机技术—计算机科学与技术]