Potential Function Analysis of Greedy Hot-Potato Routing

  • Authors:

  • A. Ben-Dor;S. Halevi;A. Schuster

  • Affiliations:

  • Computer Science Department, Technion, Haifa 32000, Israel amirbd@cs.technion.ac.il, assaf@cs.technion.ac.il, Israel;Laboratory for Computer Science, MIT, 545 Technology Square, Cambridge, MA 02142, USA shaih@theory.lcs.mit.edu, USA;Computer Science Department, Technion, Haifa 32000, Israel amirbd@cs.technion.ac.il, assaf@cs.technion.ac.il, Israel

  • Venue:
  • Theory of Computing Systems
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the problem of packet routing in synchronous networks. We put forward a notion of greedy hot-potato routing algorithms and devise tech- niques for analyzing such algorithms. A greedy hot-potato routing algorithm is one where:驴 The processors have no buffer space for storing delayed packets. Therefore, each packet must leave any intermediate processor at the step following its arrival.驴 Packets always advance toward their destination if they can. Namely, a packet must leave its current intermediate node via a link which takes it closer to its destination, unless all these links are taken by other packets. Moreover, in this case all these other packets must advance toward their destinations.We use potential function analysis to obtain an upper bound of O(n k 1/2 ) on the running time of a wide class of algorithms in the two-dimensional n 脳 n mesh, for routing problems with a total of k packets. The same techniques can be generalized to obtain an upper bound of O(exp(d) n d-1 k 1/d ) on the running time of a wide class of algorithms in the d -dimensional n d mesh, for routing problems with a total of k packets.