1.4 Introduction to RIPng 15
The following points summarize the key characteristics of the RIPng protocol:
• The routing algorithm selects a best route for each possible destination using distance
as the main selection criteria.
• Each piece of routing information consists of a destination, a gateway and the distance
to the destination.
• A router exchanges routing information with only directly connected routers. Route
information from a new neighboring router can be dynamically reflected, but the state
of each router is not maintained.
• Distribution of routing information is unreliable because the routing information is
exchanged over UDP without any application-level acknowledgments.
• Origin of a route cannot be identified.
• Route computation is