1. Objectives After completing this chapter you will be able to: Understand how routers operate Describe Distance Vector and Link State Algorithms Describe hierarchies in IP routing Outline the advantages and disadvantages of routing

2. Path Taken by an IP Packet in an Internetwork 3 2 12 3 A B C Destination Host (Protocol Address) Router 1 (Physical address) Destination Host (Protocol Address) Router 2 (Physical address) Destination Host (Protocol Address) Destination Host (Physical address)

3. IP Version 4 Message Header Source Address Version Type of Service Total LengthIHL IdentificationFragment Offset ProtocolTime to LiveHeader Checksum Destination address Padding Options (variable) IP header is normally 20 bytes long Flags DATA (variable)

4. Default Gateway IP Address Subnet Mask Default Gateway 160.30.100.20 255.255.255.0 160.30.100.1 IP Address Subnet Mask Default Gateway 160.30.100.10 255.255.255.0 160.30.100.1 IP Address Subnet Mask Default Gateway 160.30.200.10 255.255.255.0 160.30.200.1 160.30.100.1255.255.255.0 160.30.200.1255.255.255.0

5. Proxy ARP IP Address Subnet Mask Default Gateway 160.30.100.20 255.255.0.0 IP Address Subnet Mask Default Gateway 160.30.100.10 255.255.0.0 IP Address Subnet Mask Default Gateway 160.30.200.10 255.255.0.0 160.30.100.1255.255.255.0 160.30.200.1255.255.255.0

6. Routing Tables

7. Routing Algorithms Distance Vector Algorithms - calculate the best path to each destination separately, usually trying to find a path that minimises a simple metric, such as the number of hop counts to the destination. Example is Routing Information Protocol (RIP). Link State Algorithms - Instead of advertising a list of distances to each known destination, a router running link-state algorithm advertises the states of its local network links. Example is Open Shortest Path First (OSPF).

8. Commonly used Metrics in IP Routing Path Length / Hop Count Reliability Delay Bandwidth Load Communications Cost

9. Distance Vector Algorithm 3 3 4 4 1 1 6 6 A B DE C 5 5 2 2

10. IP Routing Protocol Hierarchies Area 1 Router 4 Router 1 Router 5 H2 Router 8 Router 7 Router 11 Router 13 H1 Area 2 Area 3 Router 12 Area 0 (Backbone) Router 2 Router 3 Router 6 Router 9 Router 10

11. Neighbour Acquisition, Neighbour Reachability and Network Reachability Neighbour Acquisition Neighbour Reachability Network Reachability Acquisition Request / Hello Acquisition Reply / Hello Hello Polling List

12. Advantages of Routers Flexible - can differentiate between paths using metrics. Can load share over redundant paths. Network Devices understand routers - they understand congestion messages. Easier to administer and control because each segment has a different address. Provide a protective firewall.

13. Disadvantages of Routers Because routers are protocol-dependent devices, they require software for each protocol that they run. Routers make movement of network devices between network segments more difficult. Some low level protocols, for example, DEC LAT and NetBIOS cannot be routed because they do not contain a network layer address.