1. Distance vector routing protocol This concept gives a brief idea about the one type of forwarding protocol followed in routing. Subject: Communication Networks/ Computer networks Authors Parul Goradia Mentor Prof. Saravanan

2. Learning Objectives After interacting with this Learning Object, the learner will be able to: • Explain forwarding. • Explain distance vector routing protocol. • Complete the routing table of a given node. • Identify the forwarding routes from one node to another node.

3. Master Layout 1: 1 B D 2 A F E 3 C 4 5

4. Step 1: 1 T1: Analogy of postal office B D C 2 A F E 3 4 5

5. Master Layout 2: routing network 1 B D 2 A F E 3 C Nodes 4 5

6. Master Layout 2: routing tables 1 2 3 4 5

7. Step 2: 1 T1: Forwarding B D 2 A F E 3 C 4 5

8. Master Layout 3: forwarding interactivity 1 B B D D 2 A A K K H H E E F F Fig 2: 3 C C 4 I I J J 5

9. Step 3: 1 T1: Forwarding interactivity 2 3 4 5

10. Master Layout 4: 1 B D 2 A K H E F 3 C 4 I J 5

11. Step 4: 1 T1: Forwarding 2 3 4 5

12. Master Layout 5: 1 B D 2 A E 3 C 4 5

13. Master Layout 6: 1 2 3 4 5

14. Master Layout 7: 1 2 This entry after B sends packet 3 4 5

15. Master Layout 8: 1 2 3 This entry after B sends packet 4 5

16. Step 5: 1 T1: Forwarding 2 3 4 5

17. Step 6: 1 T1: Forwarding 2 3 4 5

18. Step 7: 1 T1: Forwarding 2 3 4 5

19. Step 8: 1 T1: Forwarding 2 3 4 5

20. Master Layout 9: 1 2 FIG 1 FIG 2 FIG 3 3 4 FIG 4 FIG 5 5

21. Step 9: 1 T1: Distance vector routing protocol interactivity B 2 D 2 2 3 C A 1 2 5 E 3 F 4 5

22. Step 10: 1 T1: Distance vector routing protocol interactivity Vertices Cost of this links (value between 1 and 10) 2 ok 3 Done 4 5

23. Concepts: 1 • RN; Reachable node: All the destinations/ nodes that can be reached by a node. • NH; Next hop: The next hop, or gateway, is the address of the next station to which the packet is to be sent on the way to its final destination • RC; Routing Cost: The cost or metric of the path through which the packet is to be sent • Routing table: • When a node needs to send data to another node on a network, it must know where to send it, first. If the node cannot directly connect to the destination node, it has to send it via other nodes along a proper route to the destination node. • Most nodes do not try to figure out which route(s) might work; instead, a node will send an IP packet to a gateway in the LAN, which then decides how to route the "package" of data to the correct destination. Each gateway will need to keep track of which way to deliver various packages of data, and for this it uses a Routing Table. • A routing table is a database which keeps track of paths, like a map, and allows the gateway to provide this information to the node requesting the information. 2 3 4 5

24. Concepts: 1 • Route:As the size of a network grows, many pairs of nodes will not be directly connected to each other • and will depend on intermediate nodes to relay packets between them. A sequence of relay • nodes which transfer information between a source-destination node pair is called a route. • Routing: Routing is the process of constructing the routing tables in a network such that packets ex-changed between pairs of nodes take paths which have lowest cost among all available paths. • Distance vector routing protocol: The main idea behind DVRP is that each node constructs a vector containing the shortest distances from itself to all the nodes it knows are reachable from it and distributes this vector to its immediate neighboring nodes. The assumption is that a node knows which nodes are its immediate neighbors and also the costs to these neighboring nodes. The neighboring nodes upon receiving the distance vector update their own distance vectors if they find shorter routes • to nodes which are reachable from them or if they find that new nodes which are not present in their distance vector. 2 3 4 5

25. Questionnaire 1 1. Consider the six-node communication network shown in the below figure. (a) List all routes from node S to node D. [2 points] (b) The number alongside a link indicates the packet delay incurred on that link in seconds. Taking the routing cost of a route to be the sum of the delays of the links which constitute the route, write down the minimum-delay routing tables for the nodes S, R1, R2 and R3 in the format shown in the table below. 2 3 1 s R1 R3 5 s 3 S 4 S D 1 s 1 S 3 S R2 R4 1 S 4 S 5

26. Questionnaire- Answer 1 1. Consider the six-node communication network shown in the below figure. • List all routes from node S to node D. [2 points] 2 3 1 S R1 R3 5 S 3 S 4 S D 1 S 1 S 3 S R2 R4 1 S 4 S 5

27. Questionnaire- Answer 1 (b) The number alongside a link indicates the packet delay incurred on that link in seconds. Taking the routing cost of a route to be the sum of the delays of the links which constitute the route, write down the minimum-delay routing tables for the nodes S, R1, R2 and R3 in the format shown in the table below. 2 3 1 S R1 R3 5 S 3 S 4 S D 1 S 1 S 3 S R2 R4 1 S 4 S 5

28. Linksfor further reading Reference websites: Books: Computer Networks – Andrew S. Tanenbaum fourth edition Communication networks – Leon-Garcia and Widijaja second edition Research papers:

29. Summary • The transfer of packet from one node to the other is known a forwarding. • Routing is the process of constructing the routing tables in a network such that packets ex-changed between pairs of nodes take paths which have lowest cost among all available paths. • There are two main classes of routing protocols: • Distance vector routing protocol and • Link state routing protocols. • Distance vector routing protocol: In this protocol each node constructs a vector containing the shortest distances from itself to all the nodes it knows are reachable from it and distributes this vector to its immediate neighboring nodes. • The assumption is that a node knows which nodes are its immediate neighbors and also the costs to these neighboring nodes. • The neighboring nodes upon receiving the distance vector update their own distance vectors if they find shorter routes to nodes which are reachable from them or if they find that new nodes which are not present in their distance vector. • Each node sends its distance vector to its neighbors periodically resulting in a periodic update even when there are no changes in its routing table. • When a change occurs in a node’s routing table it immediately sends its new distance vector resulting in a triggered update. • The periodic update is useful in identifying a node failure which can be characterized by the absence of the periodic update message in the last few update cycles.