Tight Bounds for the Performance of Longest-in-System on DAGs-Reference-Cited by-同舟云学术

Tight Bounds for the Performance of Longest-in-System on DAGs

Published:2002 Issue: Volume: Page:88-99
ISSN:0302-9743
Container-title:STACS 2002
language:
Short-container-title:

Author:

Adler Micah,Rosén Adi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45841-7_6

Reference19 articles.

1. W. Aiello, E. Kushilevitz, R. Ostrovsky, A. Rosén. Adaptive packet Routing for Bursty Adversarial Trafic. Journal of Computer and System Sciences, Specialissue for STOC 98, Vol. 60, No. 3, pp. 482–509, 2000.

2. M. Andrews, Instability of FIFO in Session Oriented Networks. In Proc. of the 11th SODA, 2000.

3. M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu, “Universal Stability Results for Greedy Contention-Resolution Protocols”, JACM 48(1), pp. 39–69, 2001.

4. M. Andrews, and L. Zhang, The Effect of Temporary Sessions on Network Performance. In Proc. of the 11th SODA, 2000.

5. M. Andrews, A. Fernández, M. Harchol-Balter, and T. Leighton, L. Zhang, “GeneralDynamic Routing with Per-Packet Delay Guarantees of O(distance + 1/session rate),” In Proc. of 38th FOCS, pp. 294–302, 1997.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Packet Forwarding with Swaps;Structural Information and Communication Complexity;2023

2. With Great Speed Come Small Buffers;Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing;2019-07-16

3. The Space Requirement of Local Forwarding on Acyclic Networks;Proceedings of the ACM Symposium on Principles of Distributed Computing;2017-07-25

4. The Necessity of Timekeeping in Adversarial Queueing;Experimental and Efficient Algorithms;2005