| Fast Algorithms for Finding O(Congestion+Dilation) Packet Routing Schedules (1996) | |||||||||||||||||
Abstract | |||||||||||||||||
| 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 Lov'asz Local Lemma and was not constructive. In this paper, we show how to find such a schedule in O(P(log log P) log P) time, with probability 1 \Gamma 1=P fi , for any positive constant fi, where P is the sum of the lengths of the paths taken by the packets 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'asz Local Lemma discovered by Beck. Tom Leighton is supported in part by ARPA Contracts N00014-91-J-1698 and N00014-92-J-1799. Bruce Maggs and Andr'ea Richa are supported i... | |||||||||||||||||
Details der Publikation | |||||||||||||||||
| |||||||||||||||||