RIP Version 2

Malkin, G.

doi:10.17487/rfc2453

Cited by 287 publications

(136 citation statements)

References 8 publications

Supporting

Mentioning

124

Contrasting

Unclassified

Order By: Relevance

“…(7) Acceptable messages are now truncated to the RIPv2 message itself, minus the authentication trailer, and are processed normally (i.e., in accordance with the RIPv2 base specification in RFC 2453 [Mal98]). The last received sequence number for this RIPv2 Security Association and sender is also updated.…”

Section: Message Receptionmentioning

confidence: 99%

RIPv2 Cryptographic Authentication

Fanto¹,

Atkinson²

2007

View full text Add to dashboard Cite

Section: Message Receptionmentioning

confidence: 99%

RIPv2 Cryptographic Authentication

Fanto¹,

Atkinson²

2007

View full text Add to dashboard Cite

“…Usually, the conventional routing protocols are based on shortest path, such as OSPF [15] and RIP [13]. This makes the path predictable and results in the interception or eavesdropping attack.…”

Section: Literature Reviewmentioning

confidence: 99%

Stochastic Security in Wireless Mesh Networks via Saddle Routing Policy

Wang

2007

International Conference on Wireless Algorithms, Systems and Applications (WASA 2007)

View full text Add to dashboard Cite

The security problem in multihop wireless networks is more severe than that in wired networks since its transmission media is the unprotected air. In this paper, we show how to increase the effective throughput via carefully choosing the multi-path routing for given source and destination nodes, where we call the total packets from the mesh routers to the gateway nodes that are not attacked by an attacker as effective throughput. We assume that the attacker has limited resources for attacking while attacking a node or a link will incur some certain costs. We show that it is NP-hard to find an optimum multipath routing policy even if the attacking strategy is given a prior. We model the problem as a two-player game between the routing policy designer and the attacker and propose a randomized multi-path routing protocol that achieves good effective throughputs under several possible attacking scenarios. More specifically, we theoretically prove that our routing protocols can achieve an effective network throughput (with packets which are not attacked) within a constant factor of the optimum in the worst case. Our theoretic results are confirmed by extensive simulations studies.

show abstract

“…We mentioned previously the similarities with the IEEE 802.1d protocol [10], which is a layer 2 protocol. We can also find some heartbeat capability added to standard routing protocols, such as RIP [11], OSPF [4], DVMRP [5], PIM-SM [12]. The heartbeating capability of these protocols is usually an added feature to the main protocol, provided to give the protocol the capability of coping with router failures.…”

Section: Recovering From Failures Of Links In the Hierarchical Treementioning

confidence: 99%

Beacon: A Hierarchical Network Topology Monitoring System Based on IP Multicast

Novaes

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper presents Beacon, a technique that exploits the advantages of IP multicast to provide a low overhead system for network topology monitoring. Beacon is a self-organizing system which builds a self similar network topology that enables the system to converge very quickly even at a high degree of scalability. Another property of the Beacon system is that it does not require any interdomain routing protocol for IP multicast, making its deployment possible even in subnetworks which are interconnected by domains which do not support IP multicast routing or that deploy different routing protocols. One desirable side effect of the deployment of beacon is that it acts as a self configuring IP multicast tunneling facility which provides a distributed system with fault tolerant IP multicast reacheability. A comparison of Beacon with several other routing and gateway protocols is discussed.

show abstract

RIP Version 2

Abstract: This document specifies an extension of the Routing Information Protocol (RIP), as defined in [1], to expand the amount of useful information carried in RIP messages and to add a measure of security.

Cited by 287 publications

References 8 publications

RIPv2 Cryptographic Authentication

RIPv2 Cryptographic Authentication

Stochastic Security in Wireless Mesh Networks via Saddle Routing Policy

Beacon: A Hierarchical Network Topology Monitoring System Based on IP Multicast

Contact Info

Product

Resources

About