周期查詢式限定服務排隊系統(tǒng)研究
STUDY OF POLLING SYSTEMS WITH LIMITED SERVICE
-
摘要: 本文采用嵌入馬爾可夫鏈理論和概率母函數(shù)的方法,在離散時間狀態(tài)下對周期查詢式限定(K=1)服務排隊系統(tǒng)進行了分析,討論了報文的平均排隊隊長和平均等待時間的特性,改進了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. -
計量
- 文章訪問數(shù): 1757
- HTML全文瀏覽量: 113
- PDF下載量: 454
- 被引次數(shù): 0
下載:
