MDVA: a distance-vector multipath routing protocol

Abstract

Abstract-Routing protocols using the Distributed Bellman-Ford (DBF) algorithm converge very slowly to the correct routes when link costs increase, and in the case when a set of link failures results in a network partition, DBF simply fails to converge, a problem which is commonly referred to as the count-to-infinity problem. In this paper, we present the first distance vector routing algorithm MDVA that uses a set of loop-free invariants to prevent the count-to-infinity problem. MDVA, in addition, computes multipaths that are loop-free at every instant. In our earlier work we shows how such loop-free multipaths can be used in traffic load-balancing and minimizing delays, which otherwise are impossible to perform in current single-path routing algorithms [15].

On Finding Maximum Disjoint Paths for Many-to-One Routing in Wireless Multi-Hop Network

“…For example, DASM [14] builds loop-free multipath routing by means of a generalization of Dijkstra and Scholten's diffusing computations. MDVA [15] also takes diffusing computation to build paths. MPATH [16] proposes that routers exchange second-to-last hop on the shortest path to destinations in addition to shortest distances to build loopfree multipath.…”

“…MARA is an optimal algorithm to solve the All-to-One Maximum Connectivity Routing Problem. MDVA [15] is the first distance vector routing algorithm that uses a set of loop-free invariants to prevent the count-to-infinity problem. Dijkstra calculates equal cost multipath (ECMPs) for shortest paths.…”

Distributed Path Computation Using DIV Algorithm

“…Section III). Update mechanisms are required to maintain the LFI conditions: [7] introduces Multiple-path Partial-topology Dissemination Algorithm (MPDA) that uses a link-state type approach whereas [6] introduces Multipath Distance Vector Algorithm (MDVA) that uses a distance vector type approach. Similar to DUAL, MDVA uses a diffusing update approach to increase its cost-to-destination, thus it also handles multiple overlapping cost-changes sequentially.…”

“…DIV is not by itself a routing algorithm; rather, it can run on top of any routing algorithm to provide loop-freedom. DIV generalizes the Loop Free Invariant (LFI) based algorithms, [6] and outperforms previous solutions including known LFI and Diffusing Computation based algorithms, such as the Diffusing Update Algorithm. The rules and update mechanism of DIV and their correctness proofs are rather simple, which hopefully will also facilitate correct and efficient implementations.…”

An extended link reversal protocol in dynamic networks

“…In this way, a replacement ( substitute) operation is performed only after all descendants have completed their updates. This approach was first proposed in [7], [8].…”