Bubbles: Adaptive routing scheme for high-speed dynamic networks

Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, David Peleg

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

This paper presents the first dynamic routing scheme for high-speed networks. The scheme is based on a hierarchical bubbles partition of the underlying communication graph. Dynamic routing schemes are ranked by their adaptability, i.e., the maximum number of sites to be updated upon a topology change. An advantage of our scheme is that it implies a small number of updates upon a topology change. In particular, for the case of a bounded degree network it is proved that our scheme is optimal in its adaptability by presenting a matching tight lower bound. Our bubble routing scheme is a combination of a distributed routing database, a routing strategy, and a routing database update. It is shown how to perform the routing database update on a dynamic network in a distributed manner.

Original languageEnglish
Pages (from-to)804-833
Number of pages30
JournalSIAM Journal on Computing
Volume29
Issue number3
DOIs
StatePublished - 1 Jan 2000

Keywords

  • Adaptability
  • Communication network
  • Dynamic
  • Fiber optics
  • Routing

Fingerprint

Dive into the research topics of 'Bubbles: Adaptive routing scheme for high-speed dynamic networks'. Together they form a unique fingerprint.

Cite this