Two Adaptive Credit Schemes for adjustment of the R . R . scheduler

Two backup flexible credit methods, for adjustment of the weights instead of a fixed credit method with a lower maximum weight are proposed. A feedback mechanism is used for adjusting the weight size considering the current packet size. The service of various short duration flows with large size packets, (impossible to be serviced in a round), is achieved by using direct or gradual weight increase mechanisms. The Direct Increase Weight (DIW) algorithm and the Proportional Increase Weight (PIW) algorithm are proposed. Simulation experiments especially support the PIW’s significance. Both algorithms can be applied for next generation internet routers.

[1]  Ion Stoica,et al.  Packet fair queueing algorithms for wireless networks with location-dependent errors , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  Salil S. Kanhere,et al.  Fair and Efficient Packet Scheduling Using Elastic Round Robin , 2002, IEEE Trans. Parallel Distributed Syst..

[3]  R. Shreedhar,et al.  Efficient Fair Queuing Using Deficit Round - , 1997 .

[4]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[5]  Andrew S. Tanenbaum,et al.  Computer Networks , 1981 .