Õ(Congestion + Dilation) hot-potato routing on leveled networks

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


The packet routing problems while sending a set of packets through a path with congestion and dilation are discussed. Hot-potato routing in which nodes are bufferless so the packets may be delayed for more time is also analyzed. In hot-potato method, routing decisions are taken locally at each node while packets are routed in the network. It is found that the hot-potato algorithm is designed and analyzed in terms of congestion and dilation for leveled networks.

Original languageEnglish (US)
Pages (from-to)371-396
Number of pages26
JournalTheory of Computing Systems
Issue number3
StatePublished - May 2004
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'Õ(Congestion + Dilation) hot-potato routing on leveled networks'. Together they form a unique fingerprint.

Cite this