摘要
提出了基于队长参数的动态限定轮询多址协议(DPBQ).该协议根据各节点内队列长度动态的控制轮询过程,每个轮询周期对具有最长队列的节点进行服务.通过采用嵌入马尔可夫链理论和休假排队模型,给出该协议的理论模型和性能分析,并且通过限定服务的基本轮询系统和DPBQ系统的对比分析,可以看出DPBQ系统缩短了分组的平均等待时间,能更好地保证时延性能.
Dynamic limited polling protocol based on length of queue （DPBQ） is proposed. This protocol adaptively controls the polling process according to the queue length of each stations and serves the one with the longest queue firstly in each polling cycle. By means of imbedded Markov chain theory and vacation queue model, the theoretical model and performance analysis of that protocol are given. By comparing the polling system of DPBQ and basic polling system with limited service, it is shown that DPBQ system can decrease the mean waiting time of packet, so it can guarantee the delay performance better.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2007年第3期54-57,共4页
Journal of Beijing University of Posts and Telecommunications
基金
国家自然科学基金项目(60362001F0424104)
关键词
队长参数
限定轮询
DPBQ系统
平均时延
休假排队模型
parameter of queue length
limited polling
dynamic limited polling protocol based on length of queue system
mean waiting time
vacation queue model
