Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules

O

(c+d) steps using constant-size queues, where c is the congestion of the paths in the network, and d is the length of the longest path. The proof, however, used the Lovász Local Lemma and was not constructive. In this paper, we show how to find such a schedule in time, with probability , for any positive constant β, where is the sum of the lengths of the paths taken by the packets in the network, and m is the number of edges used by some packet in the network. We also show how to parallelize the algorithm so that it runs in NC. The method that we use to construct the schedules is based on the algorithmic form of the Lovász Local Lemma discovered by Beck.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received: July 8, 1996

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Leighton, T., Maggs, B. & Richa, A. Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules. Combinatorica 19, 375–401 (1999). https://doi.org/10.1007/s004930050061

Download citation

  • AMS Subject Classification (1991) Classes:  68M20, 68M10, 68M07, 60C05