We present randomized hot-potato routing algorithms on d-dimensional meshes and on the n-dimensional hypercube. The algorithms are designed for routing many packets to a single destination, or a relatively small number of destinations. The important feature, which was not obtained previously, is that the algorithms utilize the higher in-degree of the nodes and are asymptotically optimal.
|Number of pages||20|
|Journal||Journal of Algorithms|
|State||Published - Apr 1997|
Bibliographical noteFunding Information:
UA preliminary version was presented at the 3rd ISTCS 1995 Israeli Symposium on the Theory of Computing Systems). This work was supported in part by the French—Israeli grant for cooperation in Computer Science, and by a grant from the Israeli Ministry of Science. ²E-mail: firstname.lastname@example.org. ³E-mail: email@example.com. §E-mail: firstname.lastname@example.org.
ASJC Scopus subject areas
- Control and Optimization
- Computational Mathematics
- Computational Theory and Mathematics