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

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.