Competitive Management of Non-preemptive Queues with Multiple Values
暂无分享,去创建一个
[1] Yishay Mansour,et al. Competitive queueing policies for QoS switches , 2003, SODA '03.
[2] Yishay Mansour,et al. Competitve buffer management for shared-memory switches , 2001, SPAA '01.
[3] QUTdN QeO,et al. Random Early Detection Gateways for Congestion Avoidance , 1993 .
[4] Yishay Mansour,et al. Harmonic buffer management policy for shared memory switches , 2004, Theor. Comput. Sci..
[5] Yishay Mansour,et al. Competitive queue policies for differentiated services , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[6] David Clark,et al. An Approach to Service Allocation in the Internet , 1997 .
[7] Boaz Patt-Shamir,et al. Buffer overflow management in QoS switches , 2001, STOC '01.
[8] Yishay Mansour,et al. Loss-bounded analysis for differentiated services , 2001, ACM-SIAM Symposium on Discrete Algorithms.
[9] Boaz Patt-Shamir,et al. Nearly optimal FIFO buffer management for DiffServ , 2002, PODC '02.
[10] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[11] Van Jacobson,et al. A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.
[12] Yishay Mansour,et al. Improved Competitive Guarantees for QoS Buffering , 2003, Algorithmica.
[13] Yossi Azar,et al. Management of Multi-Queue Switches in QoS Networks , 2003, STOC '03.