Journal of Computer Applications ›› 2019, Vol. 39 ›› Issue (5): 1416-1420.DOI: 10.11772/j.issn.1001-9081.2018051122

• Network and communications • Previous Articles     Next Articles

Two-level polling control system for distinguishing site status

YANG Zhijun1,2, SUN Yangyang1   

  1. 1. School of Information Science and Engineering, Yunnan University, Kunming Yunnan 650500, China;
    2. Yunnan Provincial Department of Education, Kunming Yunnan 650223, China
  • Received:2018-06-01 Revised:2018-07-30 Online:2019-05-14 Published:2019-05-10
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (61461054, 61461053).


杨志军1,2, 孙洋洋1   

  1. 1. 云南大学 信息学院, 昆明 650500;
    2. 云南省教育厅, 昆明 650223
  • 通讯作者: 杨志军
  • 作者简介:杨志军(1968-),男,云南保山人,研究员,博士,主要研究方向:计算机网络;孙洋洋(1993-),男,河南周口人,硕士研究生,主要研究方向:轮询控制模型、无线网络。
  • 基金资助:

Abstract: To improve the work efficiency of polling control model and distinguish network priorities, an Exhaustive-Threshold Two-stage Polling control model based on Site Status (ETTPSS) was proposed. Based on two levels of priority, parallel processing was used to only send information to busy sites according to busy and idle states of sites. The model could not only distinguish the priorities of transmission services but also avoid the queries to the idle sites without information packets, thereby improving model resource utilization and work efficiency. The method of probabilistic generating function and Markov chain was used to analyze the model theoretically, and the important performance parameters of the model were analyzed accurately. The simulation results show that the simulation values and the theoretical values are approximately equal, indicating that the theoretical analysis is correct and reasonable. Compared with normal polling model, the model performance is greatly improved.

Key words: priority, busy site, polling model, utilization, work efficiency

摘要: 针对提高轮询控制模型工作效率和区分网络优先级的问题,提出了区分站点忙闲状态的完全-门限两级轮询控制模型(ETTPSS)。模型以两级优先级为基础,依据站点的忙闲状态采用并行处理方式只对忙站点进行信息分组发送服务。模型既能区分传输服务优先级又能避开对无信息分组的空闲站点的查询,从而提高了模型资源利用率和工作效率。运用概率母函数与马尔可夫链相结合的方法对该模型进行理论分析研究,精确解析了模型各个重要性能参数。仿真实验结果表明,仿真值与理论值近似相等,说明理论分析正确合理。与普通轮询模型相比,该模型性能大幅度提高。

关键词: 优先级, 忙站点, 轮询模型, 利用率, 工作效率

CLC Number: