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]逯昭义,王思明.环形LAN存取方式建模的研究.电子科学学刊,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]赵东风,郑苏民.周期查询式门限服务排队系统中信息分组的延迟分析.通信学报,1994, 15(2): 18-23.[10]赵东风,郑苏民.查询式完全服务排队模型分析.电子学报,1994, 22(5):102-107.[11]赵东风,李必海,郑苏民.周期查询式限定服务排队系统研究.电子科学学刊,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
|