A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Packet Routing in Networks with Long Wires

1995
*
Journal of Parallel and Distributed Computing
*

In this paper, we examine the packet routing problem for networks with wires of di ering length. We consider this problem in a network independent context, in which routing time is expressed in terms of \congestion" and \dilation" measures for a set of packet paths. We give, for any constant > 0, a randomized on-line algorithm for routing any set of N packets in O((C lg (Nd) + D lg(Nd))= lg lg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire

doi:10.1006/jpdc.1995.1153
fatcat:d6brnssi45ayljvwtolkxbcdne