An optimal online algorithm for packet scheduling with agreeable deadlines

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 801-802

  Li, Fei ^a   Sethuraman, Jay ^a   Stein, Clifford ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER MANAGEMENT; ONLINE ALGORITHMS; PACKET SCHEDULING; PACKET TRANSMISSION;

ONLINE SYSTEMS; PACKET NETWORKS; PROBLEM SOLVING; QUALITY OF SERVICE; ROUTERS; SCHEDULING;

ALGORITHMS;

EID: 20744459903     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. N. Andelman, Y. Mansour, and A. Zhu, Competitive Queuing Polices for QoS Switches, SODA 2003.
2. Y. Bartal, F. Y. L. Chin, M. Chrobak, S. P. Y. Fung, W. Jawor, R. Lavi, J. Sgall, and T. Tichy, Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs, 21st Annual Symposium on Theoretical Aspects of Computer Science, pp.190-210, 2004.
3. M. Chrobak, W. Jawor, J. Sgall, and T. Tichy, Improved Online Algorithms for Buffer Management in QoS Switches, ESA 2004.
4. F. Y. L. Chin and S. P. Y. Fung, Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?, Algorithmica, 2003.
5. B. Hajek, On the Competitiveness of Online Scheduling of Unit-Length Packets with Hard Deadlines in Slotted Time, Proceedings of 2001 Conference on Information Sciences and Systems, The John Hopkins U., 2001.
6. A. Kesselman, Z. Lotker, Y. Mansour, B. P. Shamir, B. Schieber, and M. Sviridenko, Buffer Overflow Management in QoS Switches, STOC 2001, pp.520-529.