## MDVA: A Distance-Vector Multipath Routing Protocol

### Cached

### Download Links

- [cs.uccs.edu]
- [www.cse.ucsc.edu]
- [www.ieee-infocom.org]
- [www.cse.ucsc.edu]
- [www.soe.ucsc.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 59 - 0 self |

### BibTeX

@MISC{Vutukury_mdva:a,

author = {Srinivas Vutukury and J. J. Garcia-Luna-Aceves},

title = {MDVA: A Distance-Vector Multipath Routing Protocol},

year = {}

}

### Years of Citing Articles

### OpenURL

### Abstract

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].

### Citations

1788 |
Data Networks
- Bertsekas, Gallagher
- 1991
(Show Context)
Citation Context ...ed (2) some link costs increase, resulting in an increase in distances to some destinations. MDVA works identical to DBF when distances to destinations only decrease and the same proof of DBF applies =-=[2]-=-. To state this formally, assume the network is stable up to time t and all nodes have the correct distances. At time t, the costs of some links decrease. Since the distances in the tables are such th... |

251 |
Termination detection for diffusing computations
- Dijkstra, Scholten
- 1980
(Show Context)
Citation Context ... computes its distance using distances reported by the "downstream" nodes and reports its distance to "upstream" nodes. This method called diffusing computations was first suggeste=-=d by Dijkstra et al [4]-=- to ensure termination of distributed computation; a diffusion computation always terminates due to the acyclic ordering of the nodes. DUAL [5], the algorithm on which EIGRP [1] is based, uses diffusi... |

92 |
A failsafe distributed routing protocol
- Merlin, Segall
- 1979
(Show Context)
Citation Context ...stantaneous loop-freedom which is desirable especially when on-line link-cost measurement is used. Several routing algorithms based on distance vectors have been proposed in the literature ([7], [8], =-=[9]-=-, [11], [16] to name a few). However, with the exception of DASM[16], all of them are single-path algorithms. A few routing algorithms have been proposed that use partial topology information (refer [... |

82 |
Loop-free routing using diffusing computations
- Garcia-Luna-Aceves
- 1993
(Show Context)
Citation Context ...using computations was first suggested by Dijkstra et al [4] to ensure termination of distributed computation; a diffusion computation always terminates due to the acyclic ordering of the nodes. DUAL =-=[5]-=-, the algorithm on which EIGRP [1] is based, uses diffusing computations to solve the count-to-infinity problem. Several other distance vector algorithms have been proposed that use diffusing computat... |

71 | A simple approximation to minimum-delay routing
- Vutukury, Garcia-Luna-Aceves
- 1999
(Show Context)
Citation Context ...ur 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]-=-. I. INTRODUCTION Routing protocols construct tables at each node that specify for each destination the next-hop to use for data packet forwarding. It is required that the routing tables computed by t... |

66 | A responsive distributed routing algorithm for computer networks
- Jaffe, Moss
- 1982
(Show Context)
Citation Context ...de instantaneous loop-freedom which is desirable especially when on-line link-cost measurement is used. Several routing algorithms based on distance vectors have been proposed in the literature ([7], =-=[8]-=-, [9], [11], [16] to name a few). However, with the exception of DASM[16], all of them are single-path algorithms. A few routing algorithms have been proposed that use partial topology information (re... |

57 |
Fault-Tolerant Broadcast of Routing Information
- Perlman
- 1983
(Show Context)
Citation Context ...t between each source-destination pair, which means the full connectivity of the network is still not used for load-balancing. Also, OSPF and other algorithms based on topology-broadcast (e.g., [13], =-=[10]-=- ) incur too much communication overhead when link costs change frequently. Also they This work was supported in part by the Defense Advanced Research Projects Agency (DARPA) under grants F30602-97-1-... |

47 | Distributed, scalable routing based on vectors of link states
- Garcia-Lunes-Aceves, Behrens
- 1995
(Show Context)
Citation Context ...], [11], [16] to name a few). However, with the exception of DASM[16], all of them are single-path algorithms. A few routing algorithms have been proposed that use partial topology information (refer =-=[6]-=-, [12] and the references therein) to eliminate the main limitation of topology-broadcast algorithms; however, these algorithms are not loop-free at every instant. Recently, we introduced MPDA [15], w... |

47 | Garcia-Luna-Aceves, â€śLoop-free Multipath Routing Using Generalized Diffusing Computations - Zaumen, J - 1998 |

46 |
Computer Networks, 3rd Ed
- Tanenbaum
- 1996
(Show Context)
Citation Context ... However, convergence is slow if link-costs increase, and in the extreme case when link failures result in network partitions, DBF never converges. This is the well-known countingto -infinity problem =-=[14]. Intuitiv-=-ely, the count-to-infinity problem results due to "circular" computation of distances; that is, a node computes its distance to destination using a distance communicated by a neighbor, that ... |

41 | Another adaptive distributed shortest path algorithm
- Humblet
- 1991
(Show Context)
Citation Context ...provide instantaneous loop-freedom which is desirable especially when on-line link-cost measurement is used. Several routing algorithms based on distance vectors have been proposed in the literature (=-=[7]-=-, [8], [9], [11], [16] to name a few). However, with the exception of DASM[16], all of them are single-path algorithms. A few routing algorithms have been proposed that use partial topology informatio... |

31 |
EIGRP-a fast routing protocol based on distance vectors
- Albrightson, Garcia-Luna-Aceves, et al.
- 1994
(Show Context)
Citation Context ...ear-optimal framework mentioned above. The widely deployed routing protocol RIP provides only one next-hop choice for each destination and does not prevent temporary loops from forming. Cisco's EIGRP =-=[1]-=- ensures instantaneous loop-freedom but can provide only a single loop-free path to each destination at any given router. The link-state protocol OSPF offers a router multiple choices for packet-forwa... |

28 |
Event driven topology broadcast without sequence numbers
- Spinelli, Gallager
- 1989
(Show Context)
Citation Context ...e exist between each source-destination pair, which means the full connectivity of the network is still not used for load-balancing. Also, OSPF and other algorithms based on topology-broadcast (e.g., =-=[13]-=-, [10] ) incur too much communication overhead when link costs change frequently. Also they This work was supported in part by the Defense Advanced Research Projects Agency (DARPA) under grants F30602... |

27 |
A Responsive Distributed ShortestPath Routing Algorithm Within Autonomous Systems
- Rajagopalan, Faiman
- 1991
(Show Context)
Citation Context ...aneous loop-freedom which is desirable especially when on-line link-cost measurement is used. Several routing algorithms based on distance vectors have been proposed in the literature ([7], [8], [9], =-=[11]-=-, [16] to name a few). However, with the exception of DASM[16], all of them are single-path algorithms. A few routing algorithms have been proposed that use partial topology information (refer [6], [1... |

17 | Garcia-Luna-Aceves. Using minimal source trees for on-demand routing in ad hoc networks
- Roy, J
- 2001
(Show Context)
Citation Context ...1], [16] to name a few). However, with the exception of DASM[16], all of them are single-path algorithms. A few routing algorithms have been proposed that use partial topology information (refer [6], =-=[12]-=- and the references therein) to eliminate the main limitation of topology-broadcast algorithms; however, these algorithms are not loop-free at every instant. Recently, we introduced MPDA [15], which i... |

12 | Data Networks - Bersekas, Gallager - 1992 |

3 |
Transient and Steady-State Performance of Routing Protocols: Distance Vectors vs
- al
- 1995
(Show Context)
Citation Context ...teresting to see how convergence times and control message overheads are effected by the synchronization mechanisms. A comparison of several algorithms that does not include MPDA and MDVA is given in =-=[3]-=-. Simulations are performed on the topology shown in Fig.(2). The simulator used is an event-driven real-time simulator called CPT 1 . We assume the computation time to be negligible compared to the c... |

1 | Transient and Steady-State Performance of Routing Protocols: Distance Vectors vs - Matta - 1995 |