周期查询式限定服务排队系统研究
STUDY OF POLLING SYSTEMS WITH LIMITED SERVICE
-
摘要: 本文采用嵌入马尔可夫链理论和概率母函数的方法,在离散时间状态下对周期查询式限定(K=1)服务排队系统进行了分析,讨论了报文的平均排队队长和平均等待时间的特性,改进了H。Tagai(1985)的分析结果。
-
关键词:
- 周期查询系统; 限定服务; 离散时间
Abstract: This paper analyzes a queue model of the polling system with limited service (K = 1) in discrete time. By the imbedded Markov chain theory and the generating function method, the mean values of queue length and message waiting time are explicitly obtained. The results obtained by H. Tagai (1985) are revised. -
Hashida O. Rev. Elec. Commun. Lab., 1972, 20(3,4): 189-199.[2]Ferguson M J, Aminetzah Y J. IEEE Trans. on Commun., 1985,COM-33(3): 223-231.[3]Rubin I. De Moraes L F. IEEE J. of Select. Areas,1983, SAC-1(5): 935-947.[4]赵东风,郑苏民.通信学报1994,15(2): 18-23.[5]赵东风,郑苏民.电子学报,1994, 22(5): 102-107.[6]Tagai H. Performance. Evaluation, 1985, 5(4): 271-277.[7]赵东风,郑苏民.Waiting time analysis for polling and token passing scheme for computer and communication systems. Proc. of 1992 Int. Conf. on Communication Technology, Beijing, China. 1992, 15.04.1-15.04.3.[8]Ibe O C, Cheng X. IEEE Trans. on Automat. Contr., 1988, AC-33(1): 102-103. -
计量
- 文章访问数: 1710
- HTML全文浏览量: 96
- PDF下载量: 452
- 被引次数: 0
下载:
