Randomized single-target hot-potato routing

Ishai Ben Aroya, Ilan Newman, Assaf Schuster

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages20-29
Number of pages10
ISBN (Electronic)0818669152, 9780818669156
DOIs
StatePublished - 1995
Event3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 - Tel Aviv, Israel
Duration: 4 Jan 19956 Jan 1995

Publication series

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

Conference

Conference3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995
Country/TerritoryIsrael
CityTel Aviv
Period4/01/956/01/95

Bibliographical note

Publisher Copyright:
© 1995 IEEE.

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Fingerprint

Dive into the research topics of 'Randomized single-target hot-potato routing'. Together they form a unique fingerprint.

Cite this