A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks
2004
Theory of Computing Systems
We study packet routing problems, in which we are given a set of N packets which will be sent on preselected paths with congestion C and dilation D. For store-and-forward routing, in which nodes have buffers for packets in transit, there are routing algorithms with performance that matches the lower bound Ω(C + D). Motivated from optical networks, we study hot-potato routing in which the nodes are bufferless. Due to the lack of buffers, in hot-potato routing the packets may be delayed more than
doi:10.1007/s00224-004-1136-8
fatcat:es76ccjztnctrmwgel26zwdsli