Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking - Tập 5 Số 5 - Trang 690-704 - 1997
Pawan Goyal1, Harrick M. Vin2, Hsiling Cheng2
1Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
2University of Texas at Austin, Austin

Tóm tắt

Từ khóa


Tài liệu tham khảo

10.1109/90.649514

10.1109/INFCOM.1996.493085

goyal, 1996, Start-time fair queuing A scheduling algorithm for integrated services packet switching networks

10.1109/90.649569

10.1145/146637.146658

10.1145/115992.115995

lee, 1995, performance bounds in communication networks with variable-rate links, Proc ACM SIGCOMM 95, 126

parekh, 1992, A generalized processor sharing approach to flow control in integrated services networks

shenker, 1995, A scheduling service model and a scheduling architecture for an integrated services packet networks

10.1109/90.502236

10.1145/75246.75248

10.1145/381906.381926

10.1109/90.413212

10.1109/49.53013

golestani, 1994, a self-clocked fair queueing scheme for high speed applications, Proc Infocom 94, 636, 10.1109/INFCOM.1994.337677

georgiadis, 1996, efficient network qos provisioning based on per node traffic shaping, Proc INFOCOM 96, 102, 10.1109/INFCOM.1996.497883

10.1109/INFCOM.1996.497885

10.1145/248157.248170

10.1145/238721.238766

stiliadis, 1996, Traffic scheduling in packet-switched networks Analysis design and implementation

10.1109/TCOMM.1994.580218

10.1145/99517.99525