检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张华[1] 谭献海[1] 赵晋南 刘力浩 Zhang Hua;Tan Xianhai;Zhao Jinnan;Liu Lihao(School of Information Science&Technology,Southwest Jiaotong University,Chengdu 611756,China)
机构地区:[1]西南交通大学信息科学与技术学院,成都611756
出 处:《计算机应用研究》2018年第11期3267-3270,共4页Application Research of Computers
基 金:国家科技支撑计划资助项目(2015BAG14B01)
摘 要:针对列车控制与服务网(TCSN)的区分服务需求,进行了调度算法研究,提出了一种基于动态调整调度配额的算法DWDRR。该算法在原有的WDRR(加权差额轮询算法)算法基础上增加了调度配额的计算,并根据队列的数据流量到达率、时延优先级、丢包优先级和网络的当前状况综合决定各个队列的调度配额,实现比例公平的调度。通过仿真分析证明该调度算法可以根据各队列在不同网络状态下的流量到达率、优先级动态地决定队列的调度配额,从而满足TCSN根据不同到达率、优先级进行区分服务的需求。In view of the differentiated service demand of the train control and service network(TCSN),this paper proposed a dynamic adjustment scheduling quota algorithm DWDRR.The scheduling algorithm increased the scheduling quota calculation based on the original WDRR algorithm.In the algorithm,it comprehensively calculated each queue scheduling quota according to data traffic arrival rate,delay priority,packet loss priority of the queue and network current situation to achieve proportional fair scheduling.Finally,it proves that the algorithm realizes the function that each queue scheduling quota can be dynamically decided by arrival rate or priority when in different network state through the simulation analysis.And it proves that the algorithm meets the requirements of TCSN about the differentiated service according to different arrival rate and priority.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.22.66.60