By Topic

Exact analysis of hot-potato routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Feige, U. ; Weizmann Inst. of Sci., Rehovot, Israel ; Raghavan, P.

The authors consider a form of packet routing known as hot potato routing or deflection routing. Its striking feature is that there are no buffers at intermediate nodes. Thus packets are always moving (possibly in the `wrong' direction), giving rise to the term `hot potato'. They give a simple deterministic algorithm that on a n×n torus will route a random instance in 2n+O(log n) steps with high probability. They add random delays to this algorithm so that it solves the permutation routing problem on the torus in 9n steps with high probability, on every instance. On a hypercube with N=2n nodes, they give a simple deterministic algorithm that will route a random instance in O( n) steps with high probability. Various other results are discussed

Published in:

Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on

Date of Conference:

24-27 Oct 1992