Fast algorithms for finding O(congestion plus dilation) packet routing schedules

In 1988, Leighton, Maggs, and Rao showed that for any network and any set of packets whose paths through the network are fixed and edge-simple, there exists a schedule for routing the packets to their destinations in 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 Lovasz Local Lemma. and was not constructive. In this paper, we show how to find such a schedule in O(m(c+d)(log P)(4)(log log P)) time, with probability 1-1/P-beta for any positive constant beta, where P 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 Lovasz Local Lemma discovered by Beck.