Distributed Path Computation Without Transient Loops: An Intermediate Variables Approach

Abstract— Paths with loops, even transient ones, pose significant stability problems in high-speed networks. We present a new algorithm, named Distributed Path Computation with Intermediate Variables (DIV), which guarantees that no transient or steadystate loops can ever form. Like earlier algorithms, DIV prevents loops by laying down an additional rule-set over existing path computation algorithms. The rule-set of DIV maintains a “value” of each node for each destination and allows a node to choose one of its neighboring nodes as the successor (next-hop) node for that destination only if the value of the neighbor is less than its own value. The main challenge is in designing an efficient update mechanism that preserves the ordering of values as they are modified to reflect topological changes. This is DIV’s main contribution, which involves a simple exchange of value-update messages between neighboring nodes that offers several advantages. DIV is not restricted to shortest...

• Type: Conference
• Year: 2007
• Where: TELETRAFFIC
• Authors: Saikat Ray, Roch Guérin, Rute Sofia
• Keywords: Computer Networks, Neighboring Nodes, Path Computation, Path Computation Algorithms, TELETRAFFIC 2007