CHAPTER 3

DISTANCE VECTOR ROUTING PROTOCOLS

3.1 MEANING OF DISTANCE VECTOR

Distance vector means that routes are advertised as vectors of distance and directions. Distance is defined in terms of a metric, such as hop count, and direction is simply the nexthop router or exit interface. A router using a distance vector routing protocols does not have the knowledge of the entire path to a destination network. Instead the router knows only. 1. The direction in which or interface to which packets should be forwarded. 2. The distance to the destination network.

3.2 DISTANCE VECTOR ROUTING PROTOCOLS

Distance vector protocols use router as signposts along the path to the final destination. The only information a router knows about a remote network is the distance or metric to reach that network and which path or interface to use to get there. Distance vector routing protocols do not have an actual map of the network topology. Distance vector protocols work best in situations where 1. The network is simple and flat and does not require a hierarchical design. 2. The administrator does not have enough knowledge to configure and troubleshoot linkstate protocols. 3. Specific types of networks, such as hub-and-spoke topology. 4. Worst case convergence times in a network are not a concern. Distance vector routing protocols include the following.

3.2.1 ROUTING INFORMATION PROTOCOL (RIP)

RIP has the following characteristics. 1. Hop count is used as the metric for path selection. 2. If the hop count for a network is greater than 15, RIP cannot supply a route to that network. 3. Routing updates are broadcast or multicast every 30 seconds, by default.

LOAD SHARING BGP

16

CHAPTER 3

DISTANCE VECTOR ROUTING PROTOCOLS

3.2.2 INTERIOR GATEWAY ROUTING PROTOCOLS (IGRP)

IGRP is a Cisco Proprietary protocols developed by Cisco. IGRP has the following key design characteristics. 1. Bandwidth, delay, load, and reliability are used to create a composite metric. 2. Routing updates are broadcast every 90 seconds, by default. 3. IGRP is the predecessor of EIGRP.

3.2.3 ENHANCED IGRP (EIGRP)

EIGRP is also a Cisco proprietary protocol. EIGRP has the following key characteristics. 1. It can perform unequal-cost load balancing. 2. It uses diffusing updates Algorithm (DUAL) to calculate the shortest path. 3. There are not periodic updates as with RIP and IGRP. Routing updates are sent only when there is a change in the topology.

3.3 OPERATION OF DISTANCE VECTOR ROUTING PROTOCOLS.

Some distance vector routing protocols call for the router to periodically broadcast the entire routing table to each of its neighbors. This method is inefficient because the updates not only consume bandwidth but also consume router CPU resources to process the updates. Distance vector routing protocols share certain characteristics. Periodic updates are sent at regular intervals (30 seconds for rip & 90 seconds for IGRP). Even if the topology has not changed in several days, periodic updates continue to be sent to all neighbors.

3.3.1 INITIAL EXCHANGE OF ROUTING INFORMATION.

If routing protocols is configured, the routers begin exchanging routing updates, as shown in the figure 3.1. Initially these updates include information only about their directly connected networks. Upon receiving an update, the router checks it for new information any router that are not currently in its routing table are added. In the figure 3.1 Routers R1, R2, R3 start their initial exchange. All three routers send their routing tables to their neighbors, which at this point only contain the directly connected networks. Each Router processes updates in the following manner.

LOAD SHARING BGP

17

CHAPTER 3

DISTANCE VECTOR ROUTING PROTOCOLS

FIGURE 3.1(INITIAL EXCHANGE OF INFORMATION)

3.3.1.1. R1:
1. Sends an update about network 10.1.0.0 out the S0/0/0 interface with a metric of 1. 2. Sends an update about network 10.2.0.0 out the Fast Ethernet 0/0 interface with a metric of 1. 3. Receives an update from R2 about network 10.3.0.0 on S0/0/0 with a metric of 1. 4. Stores network 10.3.0.0 in the routing table with a metric of 1.

3.3.1.2. R2:
1. Sends an update about network 10.3.0.0 out the S0/0/0 interface with a metric of 1. 2. Sends an update about network 10.2.0.0 out the S0/0/1 interface with a metric of 1. 3. Receives an update from R1 about network 10.1.0.0 pm S0/0/0 with a metric of 1. 4. Stores network 10.1.0.0 in the routing table with a metric of 1. 5. Receives an update from R3 about network 10.4.0.0 on S0/0/1 with a metric of 1. 6. Stores network 10.4.0.0 in the routing table with a metric of 1.

3.3.1.3. R3:
1. Sends an update about network 10.4.0.0 out the S0/0/1 interface with a metric of 1. 2. Sends an update about network 10.4.0.0 out the Fast Ethernet 0/0 interface with a metric of 1. 3. Receives an update from R2 about network 10.2.0.0 on S0/0/1 with a metric of 1. 4. Stores network 10.2.0.0 in the routing table with a metric of 1.

LOAD SHARING BGP

18

CHAPTER 3

DISTANCE VECTOR ROUTING PROTOCOLS

As shown in the figure 3.2, after this first round of update exchanges, each router knows about the connected networks of its directly connected neighbors.

FIGURE 3.2 (UPDATED TABLES AFTER INITIAL EXCHANGE) However R1 does not yet know about 10.4.0.0 and that R3 does not yet know about 10.1.0.0. Full knowledge and a converged network will not take place until there is another exchange of Routing information.

3.3.2

EXCHANGE OF ROUTING INFORMATION.

At this point the routers have knowledge about their own directly connected networks and about the connected networks of their immediate neighbors. To achieve the state of convergence, the routers exchange the next round of periodic updates. Each router checks the updates for new information. In Figure 3.3 R1, R2 and R3 send their latest routing tables to their neighbors.

R1 & R3 now have complete routing tables.

FIGURE 3.3 (EXCHANGE OF ROUTING INFORMATION.)

LOAD SHARING BGP

19

CHAPTER 3

DISTANCE VECTOR ROUTING PROTOCOLS

Each router process updates in the following manner.

3.3.2.1. R1:
1. Sends an update about network 10.1.0.0 out the S0/0/0 interface with a metric of 1. 2. Sends an update about networks 10.2.0.0 with a metric of 1 and 10.3.0.0 with a metric of 2 out the Fast Ethernet 0/0 interface. 3. Receives an update from R2 about network 10.4.0.0 on S0/0/0 with a metric of 2. 4. Stores network 10.40.0.0 in the routing table with a metric of 2. 5. Same updates from R2 contain information about network 10.3.0.0 on S0/0/0 with a metric of 1. There is no change; therefore the routing information remains the same.

3.3.2.2. R2:
1. Sends an update about networks 10.3.0.0 with a metric of 1 and 10.4.0.0 with a metric of 2 out S0/0/0 interface. 2. Sends an update about networks 10.1.0.0 with a metric of 2 and 10.2.0.0 with a metric of 1 out the S0/0/1 interface. 3. Receives an update from R1 about network 10.1.0.0 on S0/0/0. There is no change: therefore, the routing information remains the same. 4. Receives an update form R2 about network 10.4.0.0 on S0/0/1.There is no change; therefore, the routing information remains the same.

3.3.2.3. R3:
1. Sends an update about network 10.4.0.0 out the S0/0/1 interface. 2. Sends an update about networks 10.2.0.0 with a metric of 2 and 10.3.0.0 with a metric of 1 out the Fast Ethernet 0/0 interface. 3. Receives an update from R2 about network 10.1.0.0 on S0/0/1 with a metric of 2. 4. Stores network 10.1.0.0 in the routing table with a metric of 2. 5. Same update from R2 contains information about network 10.2.0.0 on S0/0/1 with a metric of 1. There in no change: therefore, the routing information remains the same.

LOAD SHARING BGP

20

CHAPTER 3 3.3.3 CONVERGENCE

DISTANCE VECTOR ROUTING PROTOCOLS

When a routing protocol process is enabled, every participating router will attempt to exchange information about the topology of the network. The extent of this information exchange, the way it is sent and received, and the type of information required vary widely depending on the routing protocol in use. A state of convergence is achieved once all routing protocol-specific information has been distributed to all routers participating in the routing protocol process. Any change in the network that affects routing tables will break the convergence temporarily until this change has been successfully communicated to all other routers. The speed of achieving convergence consists of 1. How quickly the routers propagate a change in the topology in a routing update to their neighbors. 2. The speed of calculation best-path routes using the new routing information collected.

3.4

IMPLEMENTING DISTANCE VECTOR ROUTING PROTOCOL

RIP TOPOLOGY SCENARIO

FIGURE 3.4 RIP SCENARIO

LOAD SHARING BGP

21

CHAPTER 3

DISTANCE VECTOR ROUTING PROTOCOLS

3.4. A. ADDRESSING TABLE For RIP CONFIGURATION:

DEVICE
R1

INTERFACE
FA0/0 S0/0/0

IP ADDRESS
192.168.1.1 192.168.2.1 192.168.3.1 192.168.2.2 192.168.4.2 192.168.5.1 192.168.4.1 192.168.1.2 192.168.3.2 192.168.5.2

SUBNET MASK
255.255.255.0 255.255.255.0 255.255.255.0 255.255.255.0 255.255.255.0 255.255.255.0 255.255.255.0 255.255.255.0 255.255.255.0 255.255.255.0

GATEWAY
N/A N/A N/A N/A N/A N/A N/A

R2

FA0/0 S0/0/0 S0/0/1

R3

FA0/0 S0/0/1

PC1 PC2 PC3

NIC NIC NIC

192.168.1.1 192.168.3.1 192.168.5.1

TABLE 3.4 (ADDRESSING TABLE FOR RIP)

3.4.1 CONFIGURING ROUTER R1

Router>enable Router#configure terminal Router(config)#hostname R1 R1(config)#interface fastEthernet 0/0 R1(config-if)#ip address 192.168.1.1 255.255.255.0 R1(config-if)#no shutdown R1(config-if)#exit R1(config)#interface s0/0/0 R1(config-if)#ip address 192.168.2.1 255.255.255.0 R1(config-if)#clock rate 64000 R1(config-if)#no shutdown upR1(config-if)#exit R1(config)#router rip R1(config-router)#network 192.168.1.0 R1(config-router)#network 192.168.2.0 R1(config-router)#exit

LOAD SHARING BGP

22

CHAPTER 3
R1(config)#exit R1#write Building configuration... [OK] R1#

DISTANCE VECTOR ROUTING PROTOCOLS

3.4.2 CONFIGURING ROUTER R2

Router>enable Router#configure terminal Router(config)#hostname R2 R2(config)#interface fastEthernet 0/0 R2(config-if)#ip address 192.168.3.1 255.255.255.0 R2(config-if)#no shutdown R2(config-if)# R2(config-if)#exit R2(config)#interface s0/0/0 R2(config-if)#ip address 192.168.2.2 255.255.255.0 R2(config-if)#no shutdown R2(config-if)#exit R2(config)#interface s0/0/1 R2(config-if)#ip address 192.168.4.2 255.255.255.0 R2(config-if)#clock rate R2(config-if)#clock rate 64000 R2(config-if)#no shutdown R2(config-if)#exit R2(config)#router rip R2(config-router)#network 192.168.2.0 R2(config-router)#network 192.168.3.0 R2(config-router)#network 192.168.4.0 R2(config-router)#exit R2(config)#exit

LOAD SHARING BGP

23

CHAPTER 3
R2# R2#write Building configuration... [OK] R2#

DISTANCE VECTOR ROUTING PROTOCOLS

3.4.3 CONFIGURING ROUTER R3

Router>enable Router#configure terminal Router(config)#hostname R3 R3(config)#interface fastEthernet 0/0 R3(config-if)#ip address 192.168.5.1 255.255.255.0 R3(config-if)#no shutdown R3(config-if)# R3(config-if)#exit R3(config)#interface S0/0/1 R3(config-if)#ip address 192.168.4.1 255.255.255.0 R3(config-if)#no shutdown R3(config-if)#exit R3(config)#router rip R3(config-router)#network 192.168.4.0 R3(config-router)#network 192.168.5.0 R3(config-router)#exit R3(config)#exit R3# R3#write Building configuration... [OK] R3#

LOAD SHARING BGP

24

CHAPTER 3

DISTANCE VECTOR ROUTING PROTOCOLS

3.4.4 VERIFYING RIP BY PING COMMAND

1. VERIFYING CONNECTIVITY FROM PC1 TO PC3

FIGURE 3.5 PING COMMAND

VERIFYING CONNECTIVITY FROM PC1 TO PC2

FIGURE 3.6 PING COMMAND 2. VERIFYING CONNECTIVITY FROM PC2 TO PC1

FIGURE 3.7 PING COMMAND

LOAD SHARING BGP

25