Efficient delay routing

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

Volumn 1123, Issue , 1996, Pages 258-269

  Di Ianni, Miriam ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSTANT VALUES; END TO END DELAY; PACKET ROUTING; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SUBLINEAR;

POLYNOMIAL APPROXIMATION;

EID: 21344461864     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61626-8_34     Document Type: Conference Paper

References (25)

1. R. Aleliunas, "Randomized parallel communication", Proc. of the A CM SIGA CTSIGOPS Symposium on Principles of Distributed Computing, 60-72, 1982.
2. M. Bellare, M. Sudan, "Improved non-approximability results", Proc. of the 26th Annual ACM Symposium on Theory of Computing, 184-193, 1994.
3. I. Cidon, S. Kutten, Y. Mansour, D. Peleg, "Greedy packet scheduling", Proc. of 4th Workshop on Distributed Algorithms, 1990.
4. A. Clementi, M. Di Ianni, "Optimum Schedule Problem in Store and Forward networks", Proc. of the IEEE INFOCOM'94, 1336-1343, 1994.
5. A. Clementi, M. Di lanni, "On the hardness of approximating optimum schedule problems in Store and Forward networks", to appear in IEEE-A CM Transactions on Networking, 1995.
6. M.R. Garey, D.S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
7. D. S. Johnson, "Approximation algorithms for combinatorial problems", Journal of Computer and System Sciences, 9, 256-278, 1974.
8. E. Koutsoupias, C. H. Papadimitriou, "Beyond competitive analysis (on-line algorithms)", Proc.of the 35th IEEE Annual Symposium on Foundations of Computer Science, 394-400, 1994.
9. D. Krizanc, S. Rajasekaran and T. Tsantilis, "Optimal routing algorithms for meshconnected processor arrays", Lecture Notes in Computer Science, Springer-Verlag, New York, vol. 319, 411-422, 1988.
10. T. Leighton, Introduction to parallel algorithms and architectures: arrays, trees, hypercubes, Morgan Kaufmann Publishers (San Mateo, Ca), 1992.
11. T. Leighton and B. Maggs, "Fast algorithms for routing around faults in multibutterffies and randomly-wired splitter networks", IEEE Trans. on Comput., 41, N. 5, 578-587, 1992.
12. T. Leighton, F. Makedon and I. Tollis, "A 2N - 2 step algorithm for routing in an N x N mesh", Proc. of the 1989 ACM Symposium on Parallel Algorithms and Architectures, 1989.
13. T. Leighton, B. Maggs, S. Rao, "Universal packet routing algorithms", Proc. of the 29th IEEE Annual Symposium on Foundations of Computer Science, 256-269, 1988.
14. T. Leighton, B. Maggs, S. Rao, A.G Ranade "Randomized routing and sorting on fixed-connection networks", Journal of Algorithms, 17, 157-205, 1994.
15. T. Leighton, B. Maggs, "Fast algorithms for finding O(congestion + dilation) packet routing schedules", Unpublished Manuscript, 1994.
16. T. Leighton, B. Maggs, S. Rao, "Packet routing and job-shop scheduling in O(congestion + dilation) steps", Combinatorica, 2, 167-186, 1994.
17. C.E. Leiserson and B. Maggs, "Communication-efficient parallel graph algorithms for distributed random-access machines", Algorithmica 3, 53-77, 1988.
18. C. Lund, M. Yannakakis, "On the hardness of approximating minimization problems", Proc. of 25th Annual ACM Symposium on Theory of Computing, pp. 286-293, 1993.
19. Y. Mansour, B. Patt-Shamir, "Greedy packet scheduling on shortest paths", Proc. of the ACM PODC '91, 165-175, 1991.
20. F. Meyer auf der Heide, B. VScking, "A packet routing protocol for arbitrary networks", Proc. of the 12th Symposium on Theoretical Aspects of Computer Sience, 291-302, 1995.
21. N. Pippenger, "Parallel communication with limited buffers", Proc. of the 25th IEEE Annual Symposium on Foundations of Computer Science, 127-136, 1984.
22. A.G. Ranade, "How to emulate shared memory", Journal of Computer and System Sciences, 42, 307-326, 1991.
23. E. Upfal, "Efficient schemes for parallel communication", Proc. of the ACM SIGACT-SIGOPS 1989 ACM Symposium on Principles of Distributed Computing, 55-59, 1982.
24. L.G. Valiant, "A schemes for fast parallel communication", SIAM Journal on Computing, 11/2, 350-361, 1982.
25. L.G. Valiant and G.J. Brebner, "Universal schemes for parallel communication", Proc. 13th ACM Symposium on Theory of Computing, 263-277, 1981