On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms
暂无分享,去创建一个
[1] Scott Shenker,et al. Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM '89.
[2] Donald E. Knuth,et al. The art of computer programming: sorting and searching (volume 3) , 1973 .
[3] Costas Courcoubetis,et al. Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..
[4] Hui Zhang,et al. WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[5] Lixia Zhang. VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..
[6] Anujan Varma,et al. Design and analysis of frame-based fair queueing: a new traffic scheduling algorithm for packet-switched networks , 1996, SIGMETRICS '96.
[7] Qi Zhao,et al. On the computational complexity of maintaining GPS clock in packet scheduling , 2004, IEEE INFOCOM 2004.
[8] 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.
[9] Richard J. Lipton,et al. A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem , 1976, MFCS.
[10] DAVID DOBKIN,et al. A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem , 1978, J. Comput. Syst. Sci..
[11] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[12] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[13] George Varghese,et al. Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.
[14] Albert G. Greenberg,et al. How fair is fair queuing , 1992, JACM.
[15] J. Turner. New directions in communications (or which way to the information age?) , 2002, IEEE Communications Magazine.
[16] Gideon Yuval,et al. Finding Nearest Neighbors , 1976, Inf. Process. Lett..
[17] Srinivasan Keshav,et al. On the Efficient Implementation of Fair Queueing , 1991 .
[18] Ion Stoica,et al. Providing guaranteed services without per flow management , 1999, SIGCOMM '99.
[19] Hui Zhang,et al. Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.
[20] G. Chuanxiong. SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks , 2001, SIGCOMM '01.
[21] Harrick M. Vin,et al. Core-stateless guaranteed rate scheduling algorithms , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[22] Hui Zhang,et al. Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.
[23] J. Turner,et al. New directions in communications (or which way to the information age?) , 1986, IEEE Communications Magazine.
[24] Hui Zhang,et al. Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.
[25] George Varghese,et al. Efficient fair queueing using deficit round-robin , 1996, TNET.