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