论文部分内容阅读
文章基于优先权处理和队列式加权平均流量分配提出一种在Internet上有效地传送带优先权数据的方法,该方法包括两个路由器优先权加权平均算法(PWFQ):单队列记数排序算法(SQSS)和多队列布谷鸟轮换算法(MQRR)。路由器使用PWFQ公平有效地为超流(superflow)分配和调整带宽,并实现了网络阻塞时传输质量的平缓缩减,同时为子流(flow)提供优先权服务,高优先权的子流将被优先服务,从而保证传输的QoS。MQRR还融入RED算法以在阻塞时得到更好的链路利用率、吞吐率和数据流缩减.这种方法融合了Guaranteed服务和Differential服务的优点,算法的计算复杂度不高,实现较易。实验表明这个方法是有效实用的。
This paper proposes a method of effective conveyor belt priority data on the Internet based on priority processing and queue weighted average traffic distribution. The method includes two routers weighted average priority algorithm (PWFQ): Single Queue Count Ranking (SQSS ) And the multi-queue cuckoo rotation algorithm (MQRR). Routers use PWFQ to fairly and efficiently allocate and adjust bandwidth for superflows and achieve a smooth reduction of transmission quality when the network is blocked, while providing priority services for subflows, with high priority sub-streams being prioritized Service, thereby ensuring the transmission of QoS. MQRR also incorporates the RED algorithm to get better link utilization, throughput and data stream reduction in blocking.This method combines the advantages of the Guaranteed service and the Differential service, and the algorithm has a low computational complexity and is easy to implement. Experiments show that this method is effective and practical.