The Community for Technology Leaders
Green Image
<p><it>Abstract</it>—We consider the problem of finding the worst case packet transit delay in networks using deflection routing. Several classes of networks are studied, including many topologies for which deflection routing has been proposed or implemented (e.g., hypercube, Manhattan Street Network, shuffle-exchange network). We derive new upper bounds on the evacuation time of batch admissions, and present simple proofs for several existing bounds. Also derived are bounds on worst case transit delay for certain networks admitting packets continuously. To demonstrate the practical utility of our results, we compare a new delay bound to the maximum delay observed in simulations. The results have application in both protocol design and the determination of the required capacity of packet resequencing buffers.</p>
Hot-potato routing, deflection networks, hypercube, Manhattan Street Network, shuffle-exchange, livelock, performance analysis.

J. T. Brassil and R. L. Cruz, "Bounds on Maximum Delay in Networks with Deflection Routing," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 724-732, 1995.
85 ms
(Ver 3.3 (11022016))