Content deleted Content added
m Fixed a couple of typos |
start review: compound modifier. add redlink. has ELs that could serve as refs. |
||
Line 1:
{{No footnotes}}
'''Reverse path forwarding (RPF)''' is a technique used in modern [[router (computing)|router]]s for the purposes of ensuring loop-free forwarding of [[multicast]] packets in multicast [[routing]] and to help prevent [[IP address spoofing]] in [[unicast]] routing.▼
▲'''Reverse
In standard unicast IP routing, the router forwards the packet away from the source to make progress along the distribution tree and prevent routing loops. In contrast, the router's multicast forwarding state runs more logically by organizing tables based on the reverse path, from the receiver back to the root of the distribution tree at the source of the multicast. This process is known as reverse-path forwarding (RPF).▼
▲In standard unicast IP routing, the router forwards the packet away from the source to make progress along the distribution tree and prevent routing loops. In contrast, the router's multicast forwarding state runs more logically by organizing tables based on the reverse path, from the receiver back to the root of the distribution tree at the source of the multicast. This
== Multicast RPF ==
Line 15 ⟶ 16:
* the path used from a sender to a router and the reverse path from the router back to the sender are symmetric.
If the first assumption is not true, the RPF check will fail because it depends upon the router's unicast routing table as a fallback. If the second assumption is not true, the RPF check would reject multicast traffic on all but the shortest path from the sender to the router and would eventually lead to non-optimal multicast tree. In cases where the links are unidirectional, the reverse
== Unicast RPF (uRPF) ==
Line 28 ⟶ 29:
Unfortunately, it is often the case on the larger Internet backbone that routing is asymmetric and the routing tables cannot be relied upon to point to the best route for a source to get to a router. Routing tables specify the best forward path and only in the symmetric case does that equate to the best reverse path. Because of this asymmetry it is important when implementing uRPF to be aware of the potential for asymmetry to exist to prevent accidental filtering of legitimate traffic.
RFC 3704 gives more details on how to extend the most basic "this source address must be seen in the routing table for the input interface" concept known as '''strict reverse
===Strict mode===
Line 41 ⟶ 42:
== {{anchor|Filtering}}Unicast RPF confusion ==
RPF is often incorrectly defined as
While uRPF is used as an ingress
== See also ==
|