A SCHEDULING ALGORITHM USING COMPENSATING ROUND ROBIN IN PACKET-SWTICHING BROADBAND NETWORKS  

作　　者：Lan Julong Wang Binqiang Li Ou Wu Jiangxing(National Digital Switching System Eng. & Technological Research Center.Zhengzhou 450002) 

出　　处：《Journal of Electronics(China)》2002年第2期139-145,共7页电子科学学刊（英文版）

摘　　要：A new approximation of fair queuing called Compensating Hound Robin (CRR) is presented in this paper. The algorithm uses packet-by-packet scheduler with a compensating measure. It achieves good fairness in terms of throughput, requires only O( I) time complexity to process a packet, and is simple enough to be implemented in hardware. After the performances are analyzed, the fairness and packet loss rate of the algorithm are simulated. Simulation results show that the CRR can effectively isolate the effects of contending .sources.A new approximation of fair queuing called Compensating Round Robin (CRR)is presented in this paper. The algorithm uses packet-by-packet scheduler with a compensating measure. It achieves good fairness in terms of throughput, requires only O(1) time complexity to process a packet, and is simple enough to be implemented in hardware. After the performances are analyzed, the fairness and packet loss rate of the algorithm are simulated. Simulation results show that the CRR can effectively isolate the effects of contending sources.

关 键 词：Broadband networks Round robin SCHEDULING Bandwidth allocation QUEUING 

分 类 号：TN915.0[电子电信—通信与信息系统]