Queue-Length Analysis of Continuous-Time Polling System with Vacations Using M-Gated Services

Article Preview

Abstract:

In this paper we consider the polling system with multiple vacations an bulk arrival using M-gated services in continuous time. By the imbedded Markov chain theory, the generating functions of queue length at the station is obtained. Then computational equations are explicitly determined for the mean queue length. Especially we can obtain some corresponding results under some especial cases. The results reveal that our system model can guarantee better QoS and system stability, and it has better efficiency than that of traditional gated service.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

427-431

Citation:

Online since:

January 2010

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Yang Zhijun, Zhao Dongfeng, Ding Hongwei, Zhao Yifan. Research on Two-class Priority Based Polling Systm[J]. Acta. Electronica Sinica, 2009, 37(7): 1452-1456. (in Chinese).

Google Scholar

[2] Tang Yinghui, Huang Shujuan, Yun Xi. Queue-Length Distribution for Discrete Time Geom/G/1 Queue with Multiple Vacations and Bulk Arrival[J]. Acta. Electronica Sinica, 2009, 37(7): 1407-1411. (in Chinese).

Google Scholar

[3] Eldad P. IEEE 802. 11n development: History, process and technology[J]. IEEE Commun. Mag., 2008, 46(7): 48-55.

Google Scholar

[4] Hashida O. Analysis of Multiqueue[J]. Rev Elec Commun Lab, 1972, 20(3, 4): 189-199.

Google Scholar

[5] Takagi H. Analysis of Polling Systems[M]. Cambridge, MA: The M.I.T. Press, (1986).

Google Scholar

[6] O.C. Ibe, Xian Cheng. Stability conditions for multiqueue systems with cyclic service[J]. IEEE Tran. Automat Control, 1988. 33(1): 102-103.

DOI: 10.1109/9.370

Google Scholar

[7] H. Levy and M. Sidi. Polling Systems: Applications, Modeling, and Optimization[J]. IEEE Transactions on Communications, 1990, 38(10): 1750-1759.

DOI: 10.1109/26.61446

Google Scholar

[8] Hideaki Takagi. Application of Polling Models to Computer Networks[J]. Computer Networks, 1991, 22(3): 193-211.

DOI: 10.1016/0169-7552(91)90087-s

Google Scholar

[9] Hwang L.C. An exact analysis of an asymmetric polling system with mixed service discipline and general service order[J]. Computer Communication, 1997, 20(10): 1293-1299.

DOI: 10.1016/s0140-3664(97)00110-2

Google Scholar

[10] Zhao Dongfeng, Zheng Sumin, Message Waiting Time Analysis for a Polling System with Gated Service[J]. Journal of China Institute of Communications, 1994, 15(2): 18-23. (inChinese).

Google Scholar

[11] Zhao Dongfeng, Zheng Sumin. Analysis of a Polling Model with Exhaustive Service[J]. Acta. Electronica Sinica, 1994, 22(5): 02-107. (in Chinese).

Google Scholar

[12] Zhao Dongfeng. Performance Analysis of Polling Systems with Limited Service[J]. Journal of Electronics, 1998, 15(1): 43-49.

Google Scholar

[13] Liu qiang, Zhang Zhongzhao, Zhang Naitong. Mean cyclic time of queueing priority station polling system[J]. Journal of China Institute of Communications, 1999, 20(2): 86-91. (in Chinese).

Google Scholar

[14] Zhi Wang, Haibin Yu, Yeqiong Song, Youxian Sun, Characteristics of Mean Period of M1+M2/G/1 Polling System under Mixed Service. Journal of China Institute of Communications, 2002, 23(7): 8-18. (in Chinese).

DOI: 10.1109/acc.2002.1025405

Google Scholar

[15] Oran Sharon, Eitan Altman. An Efficient Polling MAC for Wireless LANs[J]. IEEE/ACM Trans. Networking, 2001, 9(4): 439-451.

DOI: 10.1109/90.944342

Google Scholar

[16] Li Jian, Hu Bo, Zhao Dongfeng. A Medium Access Control Protocol for Delay QoS Provisioning in Wireless Network. Acta Electronica Sinica, 2005, 33(7): 1168-1172. (in Chinese).

DOI: 10.1109/casset.2004.1322933

Google Scholar

[17] Tao Li Logothetis D, Veeraraghavan M. Analysis of a polling system for telephony traffic with application to wireless LANs. IEEE Transactions on Wireless Communications, 2006, 5(6): 1284- 1293.

DOI: 10.1109/twc.2006.1638649

Google Scholar

[18] E. Winands, I. Adan, G. -J. van Houtum, Mean value analysis for polling systems, Queueing Systems, 2006, 54 (1): 45-54.

DOI: 10.1007/s11134-006-7898-8

Google Scholar

[19] V M Vishnevskii and O V Semenova. Mathematical methods to study the polling systems, Automation and Remote Control, 2006, 67(2): 173-220.

DOI: 10.1134/s0005117906020019

Google Scholar

[20] A Wierman, E M M Winands, and O J Boxma. Scheduling in polling systems. Performance Evaluation, 2007, 64: 1009-1028.

DOI: 10.1016/j.peva.2007.06.015

Google Scholar

[21] Mei R D van der, and Winands E M M. Heavy traffic analysis of polling models by mean value analysis. Performance Evaluation, 2008, 65(6-7): 400-416.

DOI: 10.1016/j.peva.2007.12.002

Google Scholar

[22] Beekhuizen P, Denteneer D, and Resing J A C. Reduction of a polling network to a single node. Queueing Systems: Theory and Applications, 2008, 58(4): 303-319.

DOI: 10.1007/s11134-008-9071-z

Google Scholar

[23] Boxma O J, Wal J van der, and Yechiali U. Polling with batch service. Stochastic Models, 2008, 24(4): 604-625.

DOI: 10.1080/15326340802427497

Google Scholar

[24] S. -C. Horng, S. -Y. Lin. Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service Discipline. Journal of Optimization Theory and Applications, 2009, 140(2): 213-231.

DOI: 10.1007/s10957-008-9444-9

Google Scholar