Efficient Delay Routing (Extended 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.

[1]  Bruce M. Maggs,et al.  Randomized Routing and Sorting on Fixed-Connection Networks , 1994, J. Algorithms.

[2]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[3]  Romas Aleliunas,et al.  Randomized parallel communication (Preliminary Version) , 1982, PODC '82.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Andrea E. F. Clementi,et al.  On the hardness of approximating optimum schedule problems in store and forward networks , 1996, TNET.

[6]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[7]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[8]  Mihir Bellare,et al.  Improved non-approximability results , 1994, STOC '94.

[9]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[10]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[11]  Bruce M. Maggs,et al.  Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks , 1992, IEEE Trans. Computers.

[12]  Shay Kutten,et al.  Greedy Packet Scheduling , 1990, WDAG.

[13]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[14]  Friedhelm Meyer auf der Heide,et al.  A Packet Routing Protocol for Arbitrary Networks , 1995, STACS.

[15]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[16]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[17]  Boaz Patt-Shamir,et al.  Greedy packet scheduling on shortest paths (preliminary version) , 1991, PODC '91.

[18]  Boaz Patt-Shamir,et al.  Greedy Packet Scheduling on Shortest Paths , 1993, J. Algorithms.

[19]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[20]  Nicholas Pippenger,et al.  Parallel Communication with Limited Buffers (Preliminary Version) , 1984, FOCS.