一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級(jí)搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁(yè)添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號(hào)碼
標(biāo)題
留言內(nèi)容
驗(yàn)證碼

兩類周期查詢式完全服務(wù)排隊(duì)系統(tǒng)研究

趙東風(fēng)

趙東風(fēng). 兩類周期查詢式完全服務(wù)排隊(duì)系統(tǒng)研究[J]. 電子與信息學(xué)報(bào), 1999, 21(2): 262-266.
引用本文: 趙東風(fēng). 兩類周期查詢式完全服務(wù)排隊(duì)系統(tǒng)研究[J]. 電子與信息學(xué)報(bào), 1999, 21(2): 262-266.
Zhao Dongfeng. STUDY ON TWO POLLING SYSTEMS WITH EXHAUSTIVE SERVICE[J]. Journal of Electronics & Information Technology, 1999, 21(2): 262-266.
Citation: Zhao Dongfeng. STUDY ON TWO POLLING SYSTEMS WITH EXHAUSTIVE SERVICE[J]. Journal of Electronics & Information Technology, 1999, 21(2): 262-266.

兩類周期查詢式完全服務(wù)排隊(duì)系統(tǒng)研究

STUDY ON TWO POLLING SYSTEMS WITH EXHAUSTIVE SERVICE

  • 摘要: 本文對(duì)時(shí)間連續(xù)型非對(duì)稱周期查詢式完全服務(wù)排隊(duì)系統(tǒng)進(jìn)行了分析,并與時(shí)間離散型周期查詢式完全服務(wù)排隊(duì)系統(tǒng)(趙東風(fēng),1994)進(jìn)行了對(duì)比研究。在兩種系統(tǒng)取相同的系統(tǒng)參數(shù)值的條件下,給出兩類排隊(duì)服務(wù)系統(tǒng)的分析結(jié)果。
    Abstract: This paper presents the analysis of a continuous-time model of the asymmetric polling system with exhaustive service. Compared with the discrete-time model of the polling system with exhaustive service(by Zhao Dongfeng, 1994), the results of two polling systems are given.
    • HTML全文
  • Rubin I, De Moraes L F. Message delay analysis for polling and token multiple-access schemes for local communication networks[J].IEEE J. of Select Areas Commun.1983, 1(5):935-947[2]Ferguson M J, Aminetzah Y J. Exact results for nonsymmetric token ring systems. IEEE Trans. on COM., 1985, COM-33(3): 223-231.[3]Takinc T, Takahashi Y. Exact analysis of asymmetric polling systems with single buffers. IEEE Trans. on COM., 1988, COM-36(10): 1119-1127.[4]逯昭義,王思明.環(huán)形LAN存取方式建模的研究.電子科學(xué)學(xué)刊,1994, 16(2): 148-156.[5]Ibe O C, Cheng X. Approximate analysis of asymmetric single-server token-passing systems. IEEE Trans. on COM., 1989, COM-37(6): 572-577.[6]Alan G K, Hanocb L, Mandyam M S. Descendant set: An efficient approach for the analysis of polling systems. IEEE Trans. on COM., 1994, COM-42(2,3,4): 1245-1253.[7]Woo Y J, Chong K U. Analysis of a finite-buffer polling system with exhaustive service based on[8]virtual buffering. IEEE Trans. on COM., 1994, COM-42(12): 3144-3149.[9]趙東風(fēng),鄭蘇民.周期查詢式門限服務(wù)排隊(duì)系統(tǒng)中信息分組的延遲分析.通信學(xué)報(bào),1994, 15(2): 18-23.[10]趙東風(fēng),鄭蘇民.查詢式完全服務(wù)排隊(duì)模型分析.電子學(xué)報(bào),1994, 22(5):102-107.[11]趙東風(fēng),李必海,鄭蘇民.周期查詢式限定服務(wù)排隊(duì)系統(tǒng)研究.電子科學(xué)學(xué)刊,1997, 19(1): 44-49.[12]Lainchyr H, Cliungju C. An exact analysis of an asymmetric polling system with mixed service discipline and general service order[J].Computer Communication.1997, 20(5):1292-1300[13]Zhao Dongfeng, Li Bihai, Zheng Sumin. Performance analysis of polling systems with limited service[J].Journal of Electronics (CHINA.1998, 15(1):43-49
  • 加載中
計(jì)量
  • 文章訪問數(shù):  1982
  • HTML全文瀏覽量:  77
  • PDF下載量:  361
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  1997-02-27
  • 修回日期:  1998-08-15
  • 刊出日期:  1999-03-19

目錄

    /

    返回文章
    返回