Fast algorithms for finding O(congestion + dilation) packet routing schedules

Combinatorica

Volumn 19, Issue 3, 1999, Pages 375-401

  Leighton, Tom ^a   Maggs, Bruce ^c   Richa, Andréa W ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Arizona State University   (United States)

^c Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000897531     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930050061     Document Type: Article

References (21)

1. N. ALON: A parallel algorithmic version of the Local Lemma, Random Structures and Algorithms, 2(4) (1991), 367-378.
2. D. ANGLUIN and L. G. VALIANT: Fast probabilistic algorithms for hamiltonian circuits and matchings, Journal of Computer and System Sciences, 18(2) (1979), 155-193.
3. J. BECK: An algorithmic approach to the Lovász Local Lemma I, Random Structures and Algorithms, 2(4) (1991), 343-365.
4. R. P. BRENT: The parallel evaluation of general arithmetic expressions, Journal of the ACM, 21(2) (1974), 201-208.
5. H. CHERNOFF: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Annals of Mathematical Statistics, 23 (1952), 493-507.
6. P. ERDOS and L. LOVÁSZ: Problems and results on 3-chromatic hypergraphs and some related questions, in: Infinite and Finite Sets (A. Hajnal et al., eds.), Volume 11 of Colloq. Math. Soc. J. Bolyai, pages 609-627, North Holland, Amsterdam, The Netherlands, 1975.
7. R. R. KOCH, F. T. LEIGHTON, B. M. MAGGS, S. B. RAO, A. L. ROSENBERG, and E. J. SCHWABE: Work-preserving emulations of fixed-connection networks, Journal of the ACM, 44(1) (1997), 104-147.
8. F. T. LEIGHTON, B. M. MAGGS, A. G. RANADE, and S. B. RAO: Randomized routing and sorting on fixed-connection networks, Journal of Algorithms, 17(1) (1994), 157-205.
9. F. T. LEIGHTON, B. M. MAGGS, and S. B. RAO: Packet routing and job-shop scheduling in O(congestion + dilation) steps, Combinatorica, 14(2) (1994), 167-180.
10. F. T. LEIGHTON, B. M. MAGGS, and A. W. RICHA: Fast algorithms for finding O(congestion + dilation) packet routing schedules, Technical Report CMU-CS-96-152, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, July 1996.
11. B. M. MAGGS and E. J. SCHWABE: Real-time emulations of bounded-degree networks, Information Processing Letters, 1998. To appear.
12. Y. MANSOUR and B. PATT-SHAMIR: Greedy packet scheduling on shortest paths, Journal of Algorithms, 14 (1993), 449-65.
13. F. MEYER AUF DER HEIDE and C. SCHEIDELER: Routing with bounded buffers and hot-potato routing in vertex-symmetric networks, in: Proceedings of the Third European Symposium on Algorithms, pages 341-354, 1995.
14. F. MEYER AUF DER HEIDE and B. VÖCKING: A packet routing protocol for arbitrary networks, in: Proceedings of the Twelfth Symposium on Theoretical Aspects of Computer Science Volume 439 of Lecture Notes in Computer Science, pages 291-302. Springer-Verlag, Heidelberg, Germany, March 1995.
15. 1+∈ N) local control packet switching algorithms, in: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 644-653, May 1997.
16. Y. RABANI and É. TARDOS: Distributed packet switching in arbitrary networks, in: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 366-375, May 1996.
17. P. RAGHAVAN: Probabilistic construction of deterministic algorithms: Approximate packing integer programs, Journal of Computer and System Sciences, 37(4) (1988), 130-143.
18. C. SCHEIDELER: Universal Routing Strategies for Interconnection Networks, Vol. 1390 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, Germany, 1998.
19. D. B. SHMOYS, C. STEIN, and J. WEIN: Improved approximation algorithms for shop scheduling problems, in: Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 148-157, January 1991.
20. J. SPENCER: Ten Lectures on the Probabilistic Method, SIAM, Philadelphia, PA, 1987.
21. A. SRINIVASAN and C.-P. TEO: A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria, in: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 636-643, May 1997.