RIP Version 2 Carrying Additional Information

Malkin, G.

doi:10.17487/rfc1388

Cited by 59 publications

(14 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The case studies in this paper concern the Border Gateway Protocol (BGP) [29,30] which is the principal exterior gateway protocol, and the protocols for interior gateway such as the Routing Information Protocol (RIP) [16,22,23] which is a table-driven distance vector routing protocol using the asynchronous distributed Bellman-Ford protocol, the Ad hoc On-Demand Distance Vector (AODV) routing protocol [27,28], and the Lightweight Underlay Network Ad-Hoc Routing Protocol (LUNAR) [34] which is a simplified AODV-like protocol.…”

Section: Overviewmentioning

confidence: 99%

A Review of Automated Formal Verification of Ad Hoc Routing Protocols for Wireless Sensor Networks

Chen¹,

Zhang²,

Zhu³

et al. 2013

Sen Lett

View full text Add to dashboard Cite

This paper surveys how formal verification can be used to prove the correctness of ad hoc routing protocols, which are fundamental infrastructure of wireless sensor networks. The existing techniques fall into two classes: verification on small-scale networks and verification on unbounded networks. The former one is always fully automatic and easy to use, thanks to the limited state space generated in verification. However, it cannot prove the correctness over all cases. The latter one can provide a complete proof based on abstractions of unbounded network. However, it usually needs user intervention and expertise in verification. The two kinds of technique are illustrated by verifications against some key properties such as stability, loop-freedom and deadlock-freedom. To conclude, they can be used to find faults and prove correctness, respectively. We believe that they can together aid the development of correct ad hoc routing protocols and their reliable implementations.

show abstract

Section: Overviewmentioning

confidence: 99%

A Review of Automated Formal Verification of Ad Hoc Routing Protocols for Wireless Sensor Networks

Chen¹,

Zhang²,

Zhu³

et al. 2013

Sen Lett

View full text Add to dashboard Cite

show abstract

“…Many proactive routing protocols have their roots in Internet routing protocols. Distance vector protocols, such as Routing Information Protocol (RIP) [62] and Internal Gateway Routing Protocol (IGRP) [63], use the hop count to the destination as the routing metric. In both RIP and IGRP, nodes periodically broadcast their entire routing tables to their direct neighbors, enabling each node to maintain a table with the hop count to every known destination in the network.…”

Section: Proactive Routing Protocolsmentioning

confidence: 99%

Wireless Ad Hoc and Sensor Networks

Labiod¹

2007

Springer Series on Signals and Communication Technology

View full text Add to dashboard Cite

“…: : : ! v (2) x g. v (1) x denotes the first occurrence of v x and v (2) x denotes the second occurrence of the same node v x . After a loop is detected at v (2) x , the loop removal operation described in subsection 4.1 traverses P loop backwards, removing links, until it reaches a node v r whose routing table entry's flag is set to LCPATH.…”

Section: Assume Thatmentioning

confidence: 99%

“…In this paper, we only consider the unicast routing problem. Unicast routing protocols can be classified into two categories: distance-vector protocols, e.g., the routing information protocol (RIP) [1,2], and link-state protocols, e.g., the open shortest path first protocol (OSPF) [3]. Distance-vector routing protocols are based on a distributed version of Bellman-Ford shortest path (SP) algorithm [4].…”

Section: Introductionmentioning

confidence: 99%

A distributed algorithm for delay-constrained unicast routing

Reeves

Salama

2000

IEEE/ACM Trans. Networking

133

View full text Add to dashboard Cite

We define the problem of unicast routing subject to delay constraints in point-to-point connection-oriented networks as a delay-constrained least-cost path problem. This problem is NP-complete, and therefore we propose a simple, efficient, distributed heuristic solution: the delay-constrained unicast routing (DCUR) algorithm. DCUR requires limited information about the network state to be kept at each node. This information is stored in a cost vector and a delay vector which resemble the distance vectors of some existing routing protocols. We prove the correctness of DCUR by showing that it is always capable of constructing a loop-free delay-constrained path within finite time, if such a path exists. The number of computations DCUR performs at each node participating in the path construction process is fixed, irrespective of the size of the network. The message complexity of DCUR is O(jV j 3) messages in the worst case, where jV j is the number of nodes in the network. However, simulation results show that, on the average, much fewer messages are required. Therefore, DCUR scales well to large networks. We also use simulation to compare DCUR to the optimal delay-constrained least-cost path algorithm, and to the least-delay path algorithm. Our results show that DCUR yields satisfactory performance with respect to both path cost and path delay.

show abstract

RIP Version 2 Carrying Additional Information

Cited by 59 publications

References 1 publication

A Review of Automated Formal Verification of Ad Hoc Routing Protocols for Wireless Sensor Networks

A Review of Automated Formal Verification of Ad Hoc Routing Protocols for Wireless Sensor Networks

Wireless Ad Hoc and Sensor Networks

A distributed algorithm for delay-constrained unicast routing

Contact Info

Product

Resources

About