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