Abstract
In this paper the computational complexity of finding minimum end-to-end delay packet routing schemes is studied. The existence of polynomial-time algorithms able to optimize both the end-to-end delay achievable when the number of packets in the network increases, and the number of packets that can be accepted in the network in order to keep the end-to-end delay within a constant value is investigated. In particular, it is proved the hardness of approximating in polynomial time both the minimum end-to-end delay and the maximum number of accepted packets even within a sublinear error in the number of packets.
Work supported by the “Human Capital and Mobility” MAP project.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Aleliunas, “Randomized parallel communication”, Proc. of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 60–72, 1982.
M. Bellare, M. Sudan, “Improved non-approximability results”, Proc. of the 26th Annual ACM Symposium on Theory of Computing, 184–193, 1994.
I. Cidon, S. Kutten, Y. Mansour, D. Peleg, “Greedy packet scheduling”, Proc. of 4th Workshop on Distributed Algorithms, 1990.
A. Clementi, M. Di Ianni, “Optimum Schedule Problem in Store and Forward networks”, Proc. of the IEEE INFOCOM'94, 1336–1343, 1994.
A. Clementi, M. Di Ianni, “On the hardness of approximating optimum schedule problems in Store and Forward networks”, to appear in IEEE-ACM Transactions on Networking, 1995.
M.R. Garey, D.S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
D. S. Johnson, “Approximation algorithms for combinatorial problems”, Journal of Computer and System Sciences, 9, 256–278, 1974.
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.
D. Krizanc, S. Rajasekaran and T. Tsantilis, “Optimal routing algorithms for mesh-connected processor arrays”, Lecture Notes in Computer Science, Springer-Verlag, New York, vol. 319, 411–422, 1988.
T. Leighton, Introduction to parallel algorithms and architectures: arrays, trees, hypercubes, Morgan Kaufmann Publishers (San Mateo, Ca), 1992.
T. Leighton and B. Maggs, “Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks”, IEEE Trans. on Comput., 41, N. 5, 578–587, 1992.
T. Leighton, F. Makedon and I. Tollis, “A 2N-2 step algorithm for routing in an N × N mesh”, Proc. of the 1989 ACM Symposium on Parallel Algorithms and Architectures, 1989.
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.
T. Leighton, B. Maggs, S. Rao, A.G Ranade “Randomized routing and sorting on fixed-connection networks”, Journal of Algorithms, 17, 157–205, 1994.
T. Leighton, B. Maggs, “Fast algorithms for finding O(congestion + dilation) packet routing schedules”, Unpublished Manuscript, 1994.
T. Leighton, B. Maggs, S. Rao, “Packet routing and job-shop scheduling in O(congestion + dilation) steps”, Combinatorica, 2, 167–186, 1994.
C.E. Leiserson and B. Maggs, “Communication-efficient parallel graph algorithms for distributed random-access machines”, Algorithmica 3, 53–77, 1988.
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.
Y. Mansour, B. Patt-Shamir, “Greedy packet scheduling on shortest paths”, Proc. of the ACM PODC '91, 165–175, 1991.
F. Meyer auf der Heide, B. Vöcking, “A packet routing protocol for arbitrary networks”, Proc. of the 12th Symposium on Theoretical Aspects of Computer Sience, 291–302, 1995.
N. Pippenger, “Parallel communication with limited buffers”, Proc. of the 25th IEEE Annual Symposium on Foundations of Computer Science, 127–136, 1984.
A.G. Ranade, “How to emulate shared memory”, Journal of Computer and System Sciences, 42, 307–326, 1991.
E. Upfal, “Efficient schemes for parallel communication”, Proc. of the ACM SIGACT-SIGOPS 1989 ACM Symposium on Principles of Distributed Computing, 55–59, 1982.
L.G. Valiant, “A schemes for fast parallel communication”, SIAM Journal on Computing, 11/2, 350–361, 1982.
L.G. Valiant and G.J. Brebner, “Universal schemes for parallel communication”, Proc. 13th ACM Symposium on Theory of Computing, 263–277, 1981
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Ianni, M. (1996). Efficient delay routing. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_34
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive