分忙闲站点的限定(K=2)轮询控制系统分析研究  

Analysis and Study on Limited(K=2)Polling Control System with Busy and Idle Sites

作　　者：杨志军[1] 孙洋洋 YANG Zhi-jun;SUN Yang-yang(School of Information Science and Engineering,Yunnan University,Kunming 650500,China)

机构地区：[1]云南大学信息学院,昆明650500

出　　处：《计算机科学》2018年第11期70-74,共5页Computer Science

基　　金：国家自然科学基金项目(61461054;61461053)资助

摘　　要：为了保障系统公平性并提高轮询控制系统的工作效率,提出了区分忙闲站点的限定(K=2)轮询控制系统。系统在限定(K=2)轮询服务的基础上,依托站点忙闲状态,采用并行调度控制方式仅对有数据分组的忙站点提供发送服务。采用概率母函数和嵌入式马尔科夫链的方法建立了系统的数学模型,并精确解析了系统平均排队队长和平均等待时延等重要性能参数。仿真实验结果表明:理论计算值与模拟仿真值近似相等,说明理论分析正确合理。该模型既能保障系统公平性,又能避免对空闲站点查询,同时还能节省转换查询时间,从而提高了系统利用率和工作效率。与已有限定(K=1)轮询控制方式相比,所提系统具有更好的QoS保障。From the perspective of ensuring the fairness of the system and improving the efficiency of the polling control system,this paper proposed a limited(K=2)polling control system with busy and idle sites.Based on the limited(K=2)polling service,the system adopts parallel control mode to send service only to the busy sites with data group.The model can not only guarantee the fairness of the system,but also avoid the query of idle sites,and save the conversion query time,thereby improving the system utilization and work efficiency.This paper established the mathematical model of the system by using the probabilistic mother function and the embedded Markov chain method,and dissected the important performance parameters such as average queue leader and average waiting delay.The theoretical calculation is approximately equal to the simulation value,which indicates that the theoretical analysis is correct and reasonable.Compared with the existing limited(K=1)polling control method,the proposed model has better QoS guarantee.

关 键 词：K=2 分忙闲 工作效率 并行调度 QOS保障 

分 类 号：TN911[电子电信—通信与信息系统]