Competitive queue management for latency sensitive packets
暂无分享,去创建一个
[1] Marek Chrobak,et al. Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs , 2004, STACS.
[2] Yishay Mansour,et al. Competitive queueing policies for QoS switches , 2003, SODA '03.
[3] Francis Y. L. Chin,et al. Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help? , 2003, Algorithmica.
[4] Refael Hassin,et al. ON THE OPTIMALITY OF FIRST COME LAST SERVED QUEUES , 1985 .
[5] Yishay Mansour,et al. Competitive Management of Non-preemptive Queues with Multiple Values , 2003, DISC.
[6] 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).
[7] Refael Hassin,et al. To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .
[8] Fei Li,et al. An optimal online algorithm for packet scheduling with agreeable deadlines , 2005, SODA '05.
[9] Fei Li,et al. Better online buffer management , 2007, SODA '07.
[10] Matthias Englert,et al. Considering suppressed packets improves buffer management in QoS switches , 2007, SODA '07.
[11] P. Naor. The Regulation of Queue Size by Levying Tolls , 1969 .
[12] Boaz Patt-Shamir,et al. Buffer overflow management in QoS switches , 2001, STOC '01.