Achieving Fairness in Generalized Processor Sharing for Network Switches
暂无分享,去创建一个
[1] Frank Kelly,et al. Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..
[2] Sanjoy K. Baruah,et al. The case for fair multiprocessor scheduling , 2003, Proceedings International Parallel and Distributed Processing Symposium.
[3] Cheng-Shang Chang,et al. Birkhoff-von Neumann input buffered crossbar switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[4] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[5] Analysis and Simulation of a Fair Queuing Algorithm , 2008 .
[6] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.
[7] Banu Ozden,et al. Fair queuing for aggregated multiple links , 2001, SIGCOMM 2001.
[8] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[9] Harish Sethu,et al. On achieving fairness in the joint allocation of processing and bandwidth resources , 2003, IWQoS'03.