1. Networks: Routing1 Network Layer Routing

2. Networks: Routing2 Network Layer Concerned with getting packets from source to destination Network layer must know the topology of the subnet and choose appropriate paths through it. When source and destination are in different networks, the network layer (IP) must deal with these differences. *Key issue: what service does the network layer provide to the transport layer (connection- oriented or connectionless).

3. Networks: Routing3 Figure 7.2 Physical layer Data link layer Physical layer Data link layer End system  Network layer Network layer Physical layer Data link layer Network layer Physical layer Data link layer Network layer Transport layer Transport layer Messages Segments End system  Network service Network service Copyright ©2000 The McGraw Hill CompaniesLeon-Garcia & Widjaja: Communication Networks

4. Networks: Routing4 Application Transport Internet Network Interface Application Transport Internet Network 1 Network 2 Machine A Machine B Router/Gateway Network Interface Figure 8.3

5. Networks: Routing5 R R R R S SS s s s s ss s ss s R s R Backbone To internet or wide area network Organization Servers Gateway Departmental Server Figure 7.6 Copyright ©2000 The McGraw Hill Companies Leon-Garcia & Widjaja: Communication Networks Metropolitan Area Network (MAN)

6. Networks: Routing6 Interdomain level Intradomain level LAN level Autonomous system or domain Border routers Figure 7.7 Internet service provider Copyright ©2000 The McGraw Hill Companies Leon-Garcia & Widjaja: Communication Networks Wide Area Network (WAN)

7. Networks: Routing7 RARA RBRB RCRC Route server NAP National service provider A National service provider B National service provider C LAN NAP (a) (b) Figure 7.8 Copyright ©2000 The McGraw Hill CompaniesLeon-Garcia & Widjaja: Communication Networks National ISPs Network Access Point

8. Networks: Routing8 Packet 2 Packet 1 Packet 2 Figure 7.15 Datagram Packet Switching Copyright ©2000 The McGraw Hill CompaniesLeon-Garcia & Widjaja: Communication Networks

9. Networks: Routing9 Destination address Output port 1345 12 2458 7 0785 6 12 1566 Figure 7.16 Routing Table in Datagram Network Copyright ©2000 The McGraw Hill CompaniesLeon-Garcia & Widjaja: Communication Networks

10. Networks: Routing10 Packet Figure 7.17Copyright ©2000 The McGraw Hill CompaniesLeon-Garcia & Widjaja: Communication Networks Virtual Circuit Packet Switching

11. Networks: Routing11 Identifier Output port 15 58 13 7 27 12 Next identifier 44 23 16 34 Entry for packets with identifier 15 Figure 7.21Copyright ©2000 The McGraw Hill CompaniesLeon-Garcia & Widjaja: Communication Networks Routing Table in Virtual Circuit Network

12. Networks: Routing12 Routing Routing algorithm:: that part of the network layer responsible for deciding on which output line to transmit an incoming packet. Adaptive Routing – based on current measurements of traffic and/or topology. centralized, isolated, distributed Non-adaptive Routing flooding static routing {shortest path}

13. Networks: Routing13 Shortest Path Routing Bellman-Ford Algorithm [Distance Vector] Dijkstra’s Algorithm [Link State]

14. Networks: Routing14 Dijkstra’s Shortest Path Algorithm Initially mark all nodes (except source) with infinite distance. working node = source node Sink node = destination node While the working node is not equal to the sink 1. Mark the working node as permanent. 2. Examine all adjacent nodes in turn If the sum of label on working node plus distance from working node to adjacent node is less than current labeled distance on the adjacent node, this implies a shorter path. Relabel the distance on the adjacent node and label it with the node from which the probe was made. 3. Examine all tentative nodes (not just adjacent nodes) and mark the node with the smallest labeled value as permanent. This node becomes the new working node. Reconstruct the path backwards from sink to source.

15. Networks: Routing15 Internetwork Routing [Halsall] Adaptive Routing CentralizedDistributed Intradomain routingInterdomain routing Distance Vector routingLink State routing [IGP][EGP] [BGP,IDRP] [OSPF,IS-IS,PNNI][RIP] [RCC] Interior Gateway Protocols Exterior Gateway Protocols

16. Networks: Routing16 Distance Vector Routing Historically known as the old ARPANET routing algorithm {also known as Bellman-Ford algorithm}. Basic idea: each network node maintains a table containing the distance between itself and ALL possible destination nodes. Distance are based on a chosen metric and are computed using information from the neighbors’ distance vectors. Metric: usually hops or delay

17. Networks: Routing17 Distance Vector Information needed by node : each router has an ID associated with each link connected to a router there is a link cost (static or dynamic) the metric issue! Each router starts with: DV = 0 {distance measure to itself} DV = infinity number {for ALL other destinations}

18. Networks: Routing18 Distance Vector Algorithm [Perlman] 1.Router transmits its distance vector to each of its neighbors. 2.Each router receives and saves the most recently received distance vector from each of its neighbors. 3.A router recalculates its distance vector when: a.It receives a distance vector from a neighbor containing different information than before. b.It discovers that a link to a neighbor has gone down.

19. Networks: Routing19 Routing Information Protocol (RIP) RIP had widespread use because it was distributed with BSD Unix in “routed”, a router management daemon. RFC1058 June1988. Sends packets every 30 seconds or faster. Runs over UDP. Metric = hop count BIG problem = max. hop count =16  RIP limited to running on small networks Upgraded to RIPv2

20. Networks: Routing20 Link State Routing Algorithm 1.Each router is responsible for meeting its neighbors and learning their names. 2.Each router constructs a link state packet (LSP) which consists of a list of names and cost for each of its neighbors. 3.The LSP is transmitted to all other routers. Each router stores the most recently generated LSP from each other router. 4.Each router uses complete information on the network topology to compute the shortest path route to each destination node.

21. Networks: Routing21 Open Shortest Path First (OSPF) OSPF runs on top of IP, i.e., OSPF packet is transmitted with IP data packet header. Level 1 and Level 2 routers Has: backbone routers, area border routers, and AS boundary routers LSPs referred to as LSAs (Link State Advertisements) Complex due to five LSA types.

22. Networks: Routing22 Area 0.0.0.1 Area 0.0.0.2 Area 0.0.0.3 R1 R2 R3 R4 R5 R6R7 R8 N1 N2 N3 N4 N5 N6 N7 To another AS Area 0.0.0.0 R = router N = network Figure 8.33 OSPF Areas Copyright ©2000 The McGraw Hill Companies Leon-Garcia & Widjaja: Communication Networks

23. Networks: Routing23 Border Gateway Protocol (BGP) The replacement for EGP is BGP. Current version is BGP-4. BGP assumes the Internet is an arbitrary interconnected set of Ass In interdomain routing the goal is to find ANY path to the intended destination that is loop-free. The protocols are more concerned with reachability than optimality.