Distributed Path Computation without Transient Loops: An Intermediate Variables Approach

Loading...
Thumbnail Image
Penn collection
Departmental Papers (ESE)
Degree type
Discipline
Subject
routing
loop
distributed
Funder
Grant number
License
Copyright date
Distributor
Related resources
Contributor
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. DIV’s 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.

Advisor
Date of presentation
2007-06-17
Conference name
Departmental Papers (ESE)
Conference dates
2023-05-17T00:27:28.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Postprint version. Published in Lecture Notes in Computer Science, Managing Traffic Performance in Converged Networks, Proceedings of the 20th International Teletraffic Congress, ITC20 2007, Volume 4625, June 2007, pages 104-116. Publisher URL: http://dx.doi.org/10.1007/978-3-540-72990-7_13
Recommended citation
Collection