Randomized Single-Target Hot-Potato Routing

Ishai Ben Aroya; Ilan Newman; Assaf Schuster

doi:10.1006/jagm.1996.0811

Randomized Single-Target Hot-Potato Routing

Ishai Ben Aroya, Ilan Newman, Assaf Schuster

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	101-120
Number of pages	20
Journal	Journal of Algorithms
Volume	23
Issue number	1
DOIs	https://doi.org/10.1006/jagm.1996.0811
State	Published - Apr 1997

Bibliographical note

Funding 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: [email protected]. ³E-mail: [email protected]. §E-mail: [email protected].

ASJC Scopus subject areas

Control and Optimization
Computational Mathematics
Computational Theory and Mathematics

Access to Document

10.1006/jagm.1996.0811

Cite this

@article{be421ff1a97d403a9e0ed69153faf0f4,

title = "Randomized Single-Target Hot-Potato Routing",

abstract = "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.",

author = "Aroya, {Ishai Ben} and Ilan Newman and Assaf Schuster",

note = "Funding 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: [email protected]. ³E-mail: [email protected]. §E-mail: [email protected].",

year = "1997",

month = apr,

doi = "10.1006/jagm.1996.0811",

language = "English",

volume = "23",

pages = "101--120",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Randomized Single-Target Hot-Potato Routing

AU - Aroya, Ishai Ben

AU - Newman, Ilan

AU - Schuster, Assaf

N1 - Funding 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: [email protected]. ³E-mail: [email protected]. §E-mail: [email protected].

PY - 1997/4

Y1 - 1997/4

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0009792556&partnerID=8YFLogxK

U2 - 10.1006/jagm.1996.0811

DO - 10.1006/jagm.1996.0811

M3 - Article

AN - SCOPUS:0009792556

SN - 0196-6774

VL - 23

SP - 101

EP - 120

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 1

ER -

Randomized Single-Target Hot-Potato Routing

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this