Efficient delay routing

Theoretical Computer Science

Volumn 196, Issue 1-2, 1998, Pages 131-151

  Di Ianni, Miriam ^a  

^a UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347174923     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00198-9     Document Type: Article

References (43)

1. R. Aleliunas, Randomized parallel communication, Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC). 1982, pp. 60-72.
2. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan, Efficient routing and scheduling algorithms for optical networks, Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 1994, pp. 412-423.
3. Y. Aumann, Y. Rabani, Improved bounds for all optical routing, Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 1995, pp. 567-576.
4. B. Awerbuch, Y. Bartal, A. Fiat, A. Rosen, Competitive non-preemptive call control, Proc. 5th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 1994, pp. 312-320.
5. B. Awerbuch, R. Gawlick, F.T. Leighton, Y. Rabani, On-line admission control and circuit routing for high performance computing and communication. Proc. 35th IEEE Ann. Symp. on Foundations of Computer Science (FOCS), 1994, pp. 412-423.
6. A. Bar-Noy, P. Raghavan, B. Schieber, H. Tamaki, Fast deflection routing for packets and worms, Proc. 12th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), 1993, pp. 75-86.
7. J. Beck, An algorithmic approach to the Lovász Local Lemma I, Random Struct. Algorithms 2 (1991) 343-365.
8. I. Cidon, S. Kutten, Y. Mansour, D. Peleg, Greedy packet scheduling, Proc. of the 4th Workshop on Distributed Algorithms (WDAG), 1990.
9. A. Clementi, M. Di lanni, Optimum schedule problems in store-and-forward networks, Proc. IEEE Conf. on Computer Communications (INFOCOM), (1994), pp. 1336-1343.
10. A. Clementi, M. Di Ianni, On the hardness of approximating optimum schedule problems in Store-and-Forward networks, IEEE-ACM Trans. Networking 4 (1996) 272-280.
11. R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, Universal algorithms for store-and-forward and wormhole routing, Proc 28th ACM Symp. on Theory of Computing (STOC), 1996.
12. M. Di Ianni, Efficient delay routing (extended abstract), Proc. of EuroPar '96 Parallel Processing, Lecture Notes in Computer Science, vol. 1123, Springer, Berlin, 1996, pp. 258-269.
13. U. Feige, J. Killian, Zero knowledge and the chromatic number, Proc. of the IEEE Conf. on Computational Complexity, 1996.
14. A. Feldmann, B. Maggs, J. Sgall, D.D. Sleator, A. Tomkins, Competitive analysis of call admission algorithms that allow delay, Tech. Report CMU-CS-95-102, Carnegie Mellon University, 1995.
15. S. Felperin, P. Raghavan, E. Upfal, A theory of wormhole routing in parallel computers, Proc. 33rd IEEE Ann. Symp. on Foundations of Computer Science (FOCS), 1992, pp. 563-572.
16. J.A. Garay, I. Gopal, S Kutten, M. Yung, Efficient on-line call control algorithms, Proc. 2nd Ann. Israel Conf. on Theory of Computing and Systems, 1993, pp. 285-293.
17. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
18. 1-ε, Proc. of the 37th IEEE Ann. Symp on Foundations of Computer Science (FOCS), 1996, pp. 627-636.
19. D.S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974) 256-278.
20. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller, J.W. Thatcher (Eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
21. E. Koutsoupias, C.H. Papadimitriou, Beyond competitive analysis (on-line algorithms), Proc. 35th IEEE Ann. Symp. on Foundations of Computer Science (FOCS), 1994, pp. 394-400.
22. D. Krizanc, S. Rajasekaran, T. Tsantilis, Optimal routing algorithms for mesh-connected processor array, Lecture Notes in Computer Science, vol. 319. Springer, Berlin, 1988, pp. 411-422.
23. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
24. T. Leighton, B. Maggs, Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks, IEEE Trans. Comput. 41 (1992) 578-587.
25. T. Leighton, B. Maggs, S. Rao, Packet routing and jobshop scheduling in O(congestion - dilation) steps, Combinatorica 14 (1994) 167-186. A preliminary version of this paper appeared as "Universal packet routing algorithms", Proc. 29th IEEE Ann. Symp. on Foundations of Computer Science (FOCS), 1988, pp. 256-269,
26. T. Leighton, B. Maggs, S. Rao, A.G Ranade, Randomized routing and sorting on fixed-connection networks, J. Algorithms 17 (1994) 157-205.
27. T. Leighton, B. Maggs, S. Rao, Packet routing and job-shop scheduling in O(congestion + dilation) steps, Combinatorica 2 (1994) 167-186.
28. T. Leighton, B. Maggs, A. Richa, Fast algorithms for finding O(congestion + dilation) packet routing schedules, Tech. report CMU-CS-96-152, School of Computer Science, Carnegie-Mellon University, 1996, Combinatorica, to appear.
29. T. Leighton, F. Makedon I. Tollis, A 2N - 2 step algorithm for routing in an N x N mesh, Proc. 1989 ACM Symp. on Parallel Algorithms and Architectures (SPAA), 1989.
30. C.E. Leiserson, B. Maggs, Communication-efficient parallel graph algorithms for distributed random-access machines, Algorithmica 3 (1988) 53-77.
31. Y. Mansour, B. Patt-Shamir, Greedy packet scheduling on shortest paths, Proc. ACM SIGACT-SIGOPS Principles of Distributed Computing '91 (PODC), 1991, pp. 165-175.
32. F. Meyer auf der Heide, B. Vöcking, A packet routing protocol for arbitrary networks. Proc. of the 12th Symp. on Theoretical Aspects of Computer Sience (STACS), 1995, pp. 291-302.
33. L.M. Ni, P.H. McKinley, A survey of wormhole routing techniques in direct networks. IEEE Comput. 26 (1993) 62-76.
34. 1+N) local control packet switching algorithms", Proc. 29th Ann. ACM Symp. on Theory of Computing (STOC), 1997, pp. 644-653.
35. C.H. Papadimitriou, M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci 43 (1991) 425-440.
36. N. Pippenger, Parallel communication with limited buffers, Proc. 25th IEEE Ann. Symp. on Foundations of Computer Science (FOCS), 1984, pp. 127-136.
37. P. Raghawan, E. Upfal, Efficient routing in all-optical networks, Proc. 26th Ann. ACM Symp. on Theory of Computing (STOC), 1994. pp. 133-143.
38. A.G. Ranade, How to emulate shared memory. J. Comput. System Sci. 42 (1991) 307-326.
39. A. Ranade, S. Schleimer, D.S. Wilkerson, Nearly tight bounds for wormhole routing, Proc. 35th IEEE Ann. Symp. on Foundations of Computer Science (FOCS), 1994, pp. 347-355.
40. A. Srinivasan, C. Teo, A constant factor approximation algorithm for packet routing, and balancing local vs. global criteria, Proc. 29th Ann. ACM Symp. on Theory of Computing (STOC), 1997, pp. 636-643.
41. E. Upfal, Efficient schemes for parallel communication, Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), 1982, pp. 55-59.
42. L.G. Valiant, A scheme for fast parallel communication, SIAM J. Comput. 11/2 (1982) 350-361.
43. L.G. Valiant, G.J. Brebner, Universal schemes for parallel communication, Proc. 13th ACM Symp. on Theory of Computing, 1981, pp. 263-277.