检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国南方电网有限责任公司,广东广州510623
出 处:《电信科学》2017年第7期151-158,共8页Telecommunications Science
基 金:国家高技术研究发展计划("863"计划)基金资助项目(No.2012AA050801);国家电网公司科技基金资助项目(No.5455H7150035)~~
摘 要:针对网络中业务数据流过大、分布不均匀所造成的网络拥塞,提出一种优先级感知的动态网络流量调度机制。利用令牌桶算法,根据业务优先级的不同为不同业务分配不同速率的令牌,以实现业务优先级的划分;综合考虑业务的优先级及用户节点剩余缓存空间,对不同的业务采取不同的处理方式;同时,以流量到达因素、服务因素及节点缓存为指标定义了一种网络流量调度机制性能指标——分组丢失率。数值结果表明,所提机制可以对网络中业务优先级进行合理的划分,从而有效利用网络资源,预防网络拥塞,提升网络性能,为用户提供更加稳定可靠的网络服务。In view of the problem that network congestion which caused by the uneven distribution in large traffic data,a priority-aware dynamic network traffic scheduling mechanism was proposed. By using the token bucket algo- rithm, different buckets of different rates were assigned to different services according to the service priorities. The priorities of the service and the remaining buffer space of the user nodes was taken into account to deal with different services. At the same time, the traffic arrival factor, service factor and node cache were regarded as target to define a network traffic scheduling mechanism performance indicator: packet loss rate. The numerical results show that the proposed mechanism can rationally divide the service priorities in the network, effectively utilize the network re- sources, prevent the network congestion, enhance the network performance, and provide the users with more stable and reliable network service.
关 键 词:网络拥塞 流量调度 令牌桶 节点缓存 分组丢失率
分 类 号:TN915[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.133.141.1