首页 | 本学科首页   官方微博 | 高级检索  
     

轮询门限服务系统中信息分组等待时间的公平性问题分析
引用本文:赵进晓,赵东风,丁洪伟. 轮询门限服务系统中信息分组等待时间的公平性问题分析[J]. 云南大学学报(自然科学版), 2006, 28(2): 108-112
作者姓名:赵进晓  赵东风  丁洪伟
作者单位:云南大学,通信工程系,云南,昆明,650091
基金项目:国家863/CIM主题资助项目(60362001,F0424104),云南省自然科学基金资助项目(2003F0014M)
摘    要: 采用概率母函数和随机过程的方法对轮询式门限服务系统中信息分组的等待时间的公平性问题进行分析,对FIFO与FILO 2种服务规则下的信息分组等待时间方差进行了对比,证明了轮询门限服务系统信息分组等待时间在FIFO服务规则下较FILO规则下有更好的公平性.

关 键 词:排队模型  平均等待时间  等待时间方差
文章编号:0258-7971(2006)02-0108-05
修稿时间:2005-06-07

The impartiality of waiting time analysis for a polling system with gated service
ZHAO Jin-xiao,ZHAO Dong-feng,DING Hong-wei. The impartiality of waiting time analysis for a polling system with gated service[J]. Journal of Yunnan University(Natural Sciences), 2006, 28(2): 108-112
Authors:ZHAO Jin-xiao  ZHAO Dong-feng  DING Hong-wei
Affiliation:Department of Communication Engineering, Yunnan University, Kunming 650091, China
Abstract:It is analyzed the impartiality of waiting time during message grouping in the polling system with gated services.Our analysis is based on the generating function and stochastic process methods.The variances of waiting during message grouping are compared with respect to the strategies under FIFO and FILO rules respectively.Consequertly,the analysis proves that the waiting time under FIFO has better impartiality than that under FILO in the polling system with gated services.
Keywords:queueing model  expected value of waiting time  mellowness of waiting time
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《云南大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《云南大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号