time, with probability
@math<1#@Sub#1/P@+[b]>, for any positive constant @math**, where @math**
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 @math.
The method that we use to construct the schedules is based on the algorithmic
form of the Lov@aac()sz Local Lemma discovered by Beck.
@blankspace(2line)
@begin(transparent,size=10)
@b(Keywords:@ )@c
@end(transparent)
@blankspace(1line)
@end(text)
@flushright(@b[(15 pages)])