Near-optimal hot-potato routing on trees

Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer

Research output: Chapter in Book/Report/Conference proceedingChapter

5 Scopus citations

Abstract

In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within poly-logarithmic factors from optimal). Both algorithms are distributed and greedy; so, routing decisions are made locally, and packets are advanced towards their destinations whenever possible.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsMarco Danelutto, Marco Vanneschi, Domenico Laforenza
PublisherSpringer Verlag
Pages820-827
Number of pages8
ISBN (Print)3540229248
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3149
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Near-optimal hot-potato routing on trees'. Together they form a unique fingerprint.

Cite this