Universal O ( congestion + dilation + log 1 + N ) Local Control Packet Switching Algorithms

@inproceedings{Rabani1997UniversalO,
  title={Universal O ( congestion + dilation + log 1 + N ) Local Control Packet Switching Algorithms},
  author={Yuval Rabani and Bellcore},
  year={1997}
}
In 1988, Leighton, Maggs and Rao proved a much celebrated result: that for any network, given any collection of packets with a specified route for each packet, there exists an “optimal” schedule for all these packets. That is, there exists a schedule of the motion of the packets such that at each step, every edge is crossed by at most one packet, and all… CONTINUE READING