ERPS: an enhanced rate-proportional server

As an important mechanism to provide QoS guarantee in packet-switched networks, queueing scheduling algorithms have been widely researched. The rate-proportional server (RPS) is a good fluid model that covers the general processor sharing (GPS) models. We can design corresponding packet-level queueing scheduling algorithms through choosing different system potential correction function of RPS. We present an enhanced rate-proportional server (ERPS), which gives the upper and lower bounds of system potential correction function and compute corresponding fairness index. Thus, we can easily devise the needed packet-level queueing scheduling algorithm based on ERPS. We also give a packet-level queueing scheduling algorithm based on ERPS.

[1]  Keping Long,et al.  SWFQ: a simple weighted fair queueing scheduling algorithm for high-speed packet switched network , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[2]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[3]  Andrea Francini,et al.  Minimum-delay self-clocked fair queueing algorithm for packet-switched networks , 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.

[4]  Andrea Francini,et al.  Advances in Implementing Fair Queueing Schedulers in Broadband Networks , 1999 .

[5]  Anujan Varma,et al.  Efficient fair queueing algorithms for packet-switched networks , 1998, TNET.

[6]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1997, TNET.

[7]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[8]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[9]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[10]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.

[11]  Andrea Francini,et al.  Implementing fair queueing in ATM switches: the discrete-rate approach , 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.

[12]  Mohamed G. Gouda,et al.  Time-shift scheduling—fair scheduling of flows in high-speed networks , 1998, TNET.

[13]  Harrick M. Vin,et al.  Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks , 1996, SIGCOMM '96.

[14]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[15]  Anujan Varma,et al.  Design and analysis of frame-based fair queueing: a new traffic scheduling algorithm for packet-switched networks , 1996, SIGMETRICS '96.

[16]  D. Stiliadis,et al.  Rate-proportional servers: a design methodology for fair queueing algorithms , 1998, TNET.

[17]  George Varghese,et al.  Leap forward virtual clock: a new fair queuing scheme with guaranteed delays and throughput fairness , 1997, Proceedings of INFOCOM '97.