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.
|Title of host publication||Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||10|
|ISBN (Electronic)||0818669152, 9780818669156|
|State||Published - 1995|
|Event||3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 - Tel Aviv, Israel|
Duration: 4 Jan 1995 → 6 Jan 1995
|Name||Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems|
|Conference||3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995|
|Period||4/01/95 → 6/01/95|
Bibliographical noteFunding Information:
*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.
© 1995 IEEE.
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture