Õ(congestion + dilation) hot-potato routing on leveled networks

Research output: Contribution to conferencePaper

8 Scopus citations

Abstract

We study packet routing problems, in which we route a set of N packets on preselected paths with congestion C and dilation D. For store-and-forward routing, in which nodes have buffers for packets in transit, there are routing algorithms with performance that matches the lower bound Ω(C + D). Motivated from optical networks, we study the extreme case of hot-potato routing in which the nodes are bufferless. In hot-potato routing, packets may be unable to follow the pre-selected paths towards the destination nodes; thus it may take more time for packets to be routed. An interesting question is how much is the performance of routing algorithms affected from the absence of buffers. Here, we answer this question for the general class of leveled networks, in which the nodes are partitioned into L + 1 distinct levels. We present a randomized hot-potato routing algorithm for leveled networks, which routes the packets in Õ(C + L) time with high probability. For routing problems with dilation O(L), this bound is within polylogarithmic factors from the lower bound Ω(C + L). Our algorithm demonstrates that the benefit from using buffers is no more than polylogarithmic; thus, hot-potato routing is an efficient way to route packets in leveled networks. Our algorithm is online, that is, routing decisions are taken at real time at each node, while packets are routed in the network. A novel characteristic of our algorithm is that during the course of routing, packets may deviate from their preselected paths. To our knowledge, this is the first hot-potato algorithm designed and analyzed, in terms of congestion and dilation, for arbitrary leveled networks.

Original languageEnglish (US)
Pages20-30
Number of pages11
DOIs
StatePublished - 2002
Externally publishedYes
EventFourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - Winnipeg, MAN., Canada
Duration: Aug 10 2002Aug 13 2002

Conference

ConferenceFourteenth Annual ACM Symposium on Parallel Algorithms and Architectures
CountryCanada
CityWinnipeg, MAN.
Period8/10/028/13/02

Keywords

  • Congestion
  • Dilation
  • Hot-potato routing
  • Leveled networks

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

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

  • Cite this

    Busch, C. (2002). Õ(congestion + dilation) hot-potato routing on leveled networks. 20-30. Paper presented at Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, MAN., Canada. https://doi.org/10.1145/564871.564874