Multiplexing packets with arbitrary deadlines in bounded buffers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4059 LNCS, Issue , 2006, Pages 5-16

  Azar, Yossi ^a   Levy, Nir ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; BUFFER STORAGE; CONSTRAINT THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PACKET NETWORKS;

ARBITRARY DEADLINE CONSTRAINTS; BUFFER SPACES; MULTI-BUFFER SWITCHES; MULTIPLEXING PACKETS;

MULTIPLEXING;

EID: 33746460320     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785293_4     Document Type: Conference Paper

References (12)

1. S. Albers and M. Schmidt. On the performance of greedy algorithms in packet buffering. In Proc. 36th ACM Symp. on Theory of Computing, 35-44, 2004.
2. N. Andelman, Y. Mansour, and A. Zhu. Competitive queueing policies for QoS switches. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, 761-770, 2003.
3. Y. Azar and A. Litichevskey. Maximizing throughput in multi-queue switches. In Proc. 12th Annual European Symposium on Algorithms, 53-64, 2004.
4. Y. Azar and Y. Richter. Management of multi-queue switches in QoS networks. In Proc. 35th ACM Symp. on Theory of Computing, 82-89, 2003.
5. Y. Azar and Y. Richter. The zero-one principle for switching networks. In Proc. 36th ACM Symp. on Theory of Computing, 2004. 64-71.
6. Y. Bartal, F. Y. L. Chin, M. Chrobak, S. P. Y. Pung, W. Jawor, R. Lavi, J. Sgall, and T. Tichy. Online competitive algorithms for maximizing weighted throughput of unit jobs. In Proc. 21st Symp. on Theoretical Aspects of Computer Science (STAGS), volume 2996 of LNCS, 187-198. Springer, 2004.
7. Francis Y. L Chin and Stanley P. Y. Fung. Online scheduling for partial job values: Does timesharing or randomization help? Algorithmica, 37:149-164, 2003.
8. M. Chrobak, W. Jawor, J. Sgall, and T. Tichy. Improved online algorithms for buffer management in QoS switches. In Proc. 12th European Symp. on Algorithms (ESA), volume 3221 of LNCS, 204-215. Springer, 2004.
9. B. Hajek. On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In Conference in Information Sciences and Systems, 434-438, 2001.
10. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Buffer overflow management in QoS switches. In Proc. 33rd ACM Symp. on Theory of Computing, 520-529, 2001.
11. F.Li, J. Sethuraman, and C.Stein. An optimal online algorithm for packet scheduling with agreeable deadlines. In Proc. 16th Symp. on Discrete Algorithms (SODA), 801-802, 2005.
12. M. Schmidt. Packet buffering: Randomization beats deterministic algorithms. In Proc. 22st Symp. on Theoretical Aspects of Computer Science (STAGS), volume 3404 of LNCS, 293-304. Springer, 2005.