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

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.

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.