Distributed path computation without transient loops: An intermediate variables approach

  • Saikat Ray
  • , Roch Guérin
  • , Rute Sofia

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Paths with loops, even transient ones, pose significant stability problems in networks. As a result, much effort has been devoted over the past thirty years to designing distributed algorithms capable of avoiding loops. We present a new algorithm, Distributed Path Computation with Intermediate Variables (DIV), that guarantees that no loops, transient or steady-state, can ever form. DIVs novelty is in that it is not restricted to shortest paths, can easily handle arbitrary sequences of changes and updates, and provably outperforms earlier approaches in several key metrics. In addition, when used with distance-vector style path computation algorithms, DIV also prevents counting-to-infinity; hence further improving convergence. The paper introduces DIV and its key properties. Simulation quantifying its performance gains are also presented.

Original languageEnglish
Title of host publicationManaging Traffic Performance in Converged Networks - 20th International Teletraffic Congress, ITC20 2007, Proceedings
PublisherSpringer Verlag
Pages104-116
Number of pages13
ISBN (Print)9783540729891
DOIs
StatePublished - 2007
Event20th International Teletraffic Congress, ITC20 2007 - Ottawa, ON, Canada
Duration: Jun 17 2007Jun 21 2007

Publication series

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

Conference

Conference20th International Teletraffic Congress, ITC20 2007
Country/TerritoryCanada
CityOttawa, ON
Period06/17/0706/21/07

Fingerprint

Dive into the research topics of 'Distributed path computation without transient loops: An intermediate variables approach'. Together they form a unique fingerprint.

Cite this