多业务网络中一种新队列调度算法的研究  

A new queuing scheduling algorithm for multi-service network

作　　者：张春风[1] 钱学荣[1] 

机构地区：[1]南京邮电大学通信与信息工程学院,江苏南京210003

出　　处：《微型机与应用》2015年第19期24-26,共3页Microcomputer & Its Applications

摘　　要：在传统加权轮询调度算法和严格优先级调度算法的基础上,加入令牌桶机制,实现了一种改进算法。在多业务并存网络中,该算法能够对不同等级的业务实现不同的Qo S(服务质量),同时,在业务流量发生变化时,能够动态调整相应业务的带宽,且不会对高优先级队列造成影响。仿真实验表明,该算法可以在一定范围内适应网络的变化,有效缓解了突发流量所造成的报文丢包问题,大大提高了网络性能。In this paper, an improved algorithm was proposed based on the traditional weighted round robin algorithm, the strict priority scheduling algorithm and the token bucket mechanism. In coexistence of multi-service network, this algorithm can guarantee the QoS（Quality of Service） requirements of different types of traffic. Mean while, when the traffic changes, the algorithm can adjust the bandwidth corresponding service dynamically, and does not affect the high priority queue. Simulation results show that the algorithm can adapt to the changes in the network within a certain range, and the algorithm can alleviate the problem of packet loss caused by burst traffic effectively, improving network performance greatly.

关 键 词：多业务网络 QOS 动态调整 丢包 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]