Ex2 Chapter 7 – RIP version 2

The routing algorithm used in RIP, the Bellman-Ford algorithm, was first deployed in a computer network in 1967, as the initial routing algorithm of the ARPANET.Due to the deficiencies of the original RIP specification, RIP version 2 (RIPv2) was developed in 1993 and last standardized in 1998 It included the ability to carry subnet information, thus supporting Classless Inter-Domain Routing (CIDR). To maintain backward compatibility, the hop count limit of 15 remained. RIPv2 has facilities to fully interoperate with the earlier specification if all Must Be Zero protocol fields in the RIPv1 messages are properly specified. In addition, a compatibility switch feature allows fine-grained interoperability adjustments.

Ex2 Chapter 6 - Classful/classless, CIDR and FLSM/VLSM

Ex2 Chapter 5 – RIP version 1

RIP – Routing Information Protocol

RIP is the oldest routing protocol still in use today.  It is available on many platforms and is not a protocol that will be deprecated anytime soon.  It is a useful protocol for networks that are large enough for a routing protocol but not large enough for some of the more powerful and expensive protocols available.  RIP even has a new RIPng version to handle IPv6 networks.

Ex2 Chapter 4 – Distance Vector Routing Protocols

Ex2 Chapter 3 - Introduction to Dynamic Routing

Ex2 Chapter 2 - Static Routing, CDP

Role of Router
1.  Determine best path to send packets.
2.  Forward packets toward their destinations.

Ex2 Chapter 1 - Introduction to Routing and Packet Forwarding

Static and Dynamic Routing
Routers know of networks that are only directly connected to them.  Obviously, routers need some method of learning about distant networks they need to access.  There are two methods of learning about these distant networks, static and dynamic route learning. Static routes are when an administrator adds specific network routes to a router or multiple routers.