Randomized single-target hot-potato routing

Ishai Ben Aroya; Ilan Newman; Assaf Schuster

doi:10.1109/ISTCS.1995.377050

Randomized single-target hot-potato routing

Ishai Ben Aroya, Ilan Newman, Assaf Schuster

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › 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
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.
Pages	20-29
Number of pages	10
ISBN (Electronic)	0818669152, 9780818669156
DOIs	https://doi.org/10.1109/ISTCS.1995.377050
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

Publication series

Name	Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

Conference

Conference	3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995
Country/Territory	Israel
City	Tel Aviv
Period	4/01/95 → 6/01/95

Bibliographical note

Publisher Copyright:
© 1995 IEEE.

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture
Software

Access to Document

10.1109/ISTCS.1995.377050

Cite this

Aroya, I. B., Newman, I., & Schuster, A. (1995). Randomized single-target hot-potato routing. In Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems (pp. 20-29). Article 377050 (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISTCS.1995.377050

@inproceedings{6c50fb7f855344eea1b48cdb61b1a517,

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 = "Publisher Copyright: {\textcopyright} 1995 IEEE.; 3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 ; Conference date: 04-01-1995 Through 06-01-1995",

year = "1995",

doi = "10.1109/ISTCS.1995.377050",

language = "English",

series = "Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "20--29",

booktitle = "Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems",

address = "United States",

}

Aroya, IB, Newman, I & Schuster, A 1995, Randomized single-target hot-potato routing. in Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems., 377050, Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems, Institute of Electrical and Electronics Engineers Inc., pp. 20-29, 3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995, Tel Aviv, Israel, 4/01/95. https://doi.org/10.1109/ISTCS.1995.377050

Randomized single-target hot-potato routing. / Aroya, Ishai Ben; Newman, Ilan; Schuster, Assaf.
Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems. Institute of Electrical and Electronics Engineers Inc., 1995. p. 20-29 377050 (Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Randomized single-target hot-potato routing

AU - Aroya, Ishai Ben

AU - Newman, Ilan

AU - Schuster, Assaf

PY - 1995

Y1 - 1995

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 - https://www.scopus.com/pages/publications/85030056212

U2 - 10.1109/ISTCS.1995.377050

DO - 10.1109/ISTCS.1995.377050

M3 - Conference contribution

AN - SCOPUS:85030056212

T3 - Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

SP - 20

EP - 29

BT - Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995

Y2 - 4 January 1995 through 6 January 1995

ER -

Randomized single-target hot-potato routing

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this