轮询门限服务系统中信息分组等待时间的公平性问题分析  

The impartiality of waiting time analysis for a polling system with gated service

作　　者：赵进晓[1] 赵东风[1] 丁洪伟[1] 

机构地区：[1]云南大学通信工程系,云南昆明650091

出　　处：《云南大学学报（自然科学版）》2006年第2期108-112,共5页Journal of Yunnan University(Natural Sciences Edition)

基　　金：国家863/CIM主题资助项目(60362001;F0424104);云南省自然科学基金资助项目(2003F0014M)

摘　　要：采用概率母函数和随机过程的方法对轮询式门限服务系统中信息分组的等待时间的公平性问题进行分析,对FIFO与FILO 2种服务规则下的信息分组等待时间方差进行了对比,证明了轮询门限服务系统信息分组等待时间在FIFO服务规则下较FILO规则下有更好的公平性.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.

关 键 词：排队模型 平均等待时间 等待时间方差 

分 类 号：TN913.2[电子电信—通信与信息系统]