1. Netprog 2002 - Routing and the Network Layer1 Routing and the Network Layer (ref: Interconnections by Perlman)

2. Netprog 2002 - Routing and the Network Layer2 Network Service Types Two basic models of the services the network should provide:Two basic models of the services the network should provide: –Connectionless (datagram) –Connection-oriented (virtual circuit)

3. Netprog 2002 - Routing and the Network Layer3 Connectionless Network Each packet is independently routed.Each packet is independently routed. Each packet includes the destination address.Each packet includes the destination address. No guarantee that packets are kept in order.No guarantee that packets are kept in order. No guarantee that packets are not lost or duplicated.No guarantee that packets are not lost or duplicated.

4. Netprog 2002 - Routing and the Network Layer4 Connection-Oriented Network A single path is first established for each new connection.A single path is first established for each new connection. The network guarantees that packets are delivered in order.The network guarantees that packets are delivered in order. No loss or duplication.No loss or duplication. If anything goes wrong the connection is broken.If anything goes wrong the connection is broken. It is possible to limit the number of connections.It is possible to limit the number of connections.

5. Netprog 2002 - Routing and the Network Layer5 Connection-Oriented (cont.) The network can guarantee bandwidth at connect time.The network can guarantee bandwidth at connect time. The network can refuse new connections.The network can refuse new connections.

6. Netprog 2002 - Routing and the Network Layer6 Middle Ground It is possible to design service models that are somewhere in the middle:It is possible to design service models that are somewhere in the middle: –connection-oriented, but without any bandwidth guarantee. –Routers take care of establishing a virtual circuit - hosts view the network as connectionless.

7. Netprog 2002 - Routing and the Network Layer7 Advantages of Connectionless Connection-oriented requires duplication of service at the transport layer (to handle broken connections).Connection-oriented requires duplication of service at the transport layer (to handle broken connections). Host software is much simpler at the network layer.Host software is much simpler at the network layer. Many applications do not require sequential delivery of packets (example: packet voice).Many applications do not require sequential delivery of packets (example: packet voice).

8. Netprog 2002 - Routing and the Network Layer8 Advantages of Connectionless (cont.) Network traffic often comes in bursts, so reserving resources is wasteful.Network traffic often comes in bursts, so reserving resources is wasteful. It is better to provide degraded service to everyone than to limit network access.It is better to provide degraded service to everyone than to limit network access. Server (or router) could become overloaded managing too many connections.Server (or router) could become overloaded managing too many connections.

9. Netprog 2002 - Routing and the Network Layer9 Advantages of Connection- Oriented Most applications requires sequential packet delivery - the network should handle the complexity.Most applications requires sequential packet delivery - the network should handle the complexity. Faster Routers. Once a connection is established each router can reference the connection via a small number.Faster Routers. Once a connection is established each router can reference the connection via a small number. It is better to provide uniform service to a few than to degrade while handling everyone.It is better to provide uniform service to a few than to degrade while handling everyone.

10. Netprog 2002 - Routing and the Network Layer10 Advantages of Connection- Oriented (cont.) Life is easier for the Transport LayerLife is easier for the Transport Layer –possible to calculate round-trip delay –possible to maximize packet size (it never needs to change).

11. Netprog 2002 - Routing and the Network Layer11 IP Routing IP is a connectionless network layer.IP is a connectionless network layer. Each host has a routing table:Each host has a routing table: –routes to specific hosts –routes to specific networks –default route

12. Netprog 2002 - Routing and the Network Layer12 Host route determination Search for a matching host addressSearch for a matching host address Search for a matching network addressSearch for a matching network address Search for a default entry.Search for a default entry.

13. Netprog 2002 - Routing and the Network Layer13 Routing table creation Static routes - Unix “route” command.Static routes - Unix “route” command. ICMP Router DiscoveryICMP Router Discovery –broadcast protocol that discovers routers on the local network. ICMP redirects.ICMP redirects. Run a routing daemon.Run a routing daemon.

14. Netprog 2002 - Routing and the Network Layer14 Dynamic Routing Routers need to tell each other about routes.Routers need to tell each other about routes. Host routing tables can change over time by listening to routers.Host routing tables can change over time by listening to routers. There are many dynamic IP routing protocols in use.There are many dynamic IP routing protocols in use.

15. Netprog 2002 - Routing and the Network Layer15 RIP Routing Information Protocol UDP based messagesUDP based messages Each router sends out a broadcast (possibly a series of broadcasts) that contains the entire routing table of the router.Each router sends out a broadcast (possibly a series of broadcasts) that contains the entire routing table of the router. Typically routers do this every 30 seconds or when something changes.Typically routers do this every 30 seconds or when something changes.

16. Netprog 2002 - Routing and the Network Layer16 RIP routes Each RIP routing table entry includes:Each RIP routing table entry includes: –IP address –metric (hop count 1-15). –timeout (seconds). directly connected networks have a metric of 1.directly connected networks have a metric of 1. If a route times-out the metric is set to 16 (no connection) and deleted after 1 minute.If a route times-out the metric is set to 16 (no connection) and deleted after 1 minute.

17. Netprog 2002 - Routing and the Network Layer17 Convergence When something changes (for example when a link or router goes down), it takes a while before the change is propagated to all affected routers.When something changes (for example when a link or router goes down), it takes a while before the change is propagated to all affected routers. RIP suffers from slow convergence - there is not enough information in RIP routing tables to avoid this problem.RIP suffers from slow convergence - there is not enough information in RIP routing tables to avoid this problem.

18. Netprog 2002 - Routing and the Network Layer18 A’s Routing Table: B’s Routing Table: A is 1 hop away (directly connected) C is 1 hop away (directly connected) B is 1 hop away (directly connected) C is 2 hops away (via B). ABC What happens when C dies?

19. Netprog 2002 - Routing and the Network Layer19 OSPF vs. RIP Open Shortest Path First is an alternative IP routing protocol.Open Shortest Path First is an alternative IP routing protocol. RIP is a distance-vector protocol.RIP is a distance-vector protocol. OSPF is link-state protocol.OSPF is link-state protocol. –a router checks the condition of each of it’s connections (links) and reports this information to neighbors.

20. Netprog 2002 - Routing and the Network Layer20 OSPF advantages Each router has a picture of the network topology.Each router has a picture of the network topology. Faster convergence.Faster convergence. support for independent routes for each IP type-of-service.support for independent routes for each IP type-of-service. load balancing (distribute traffic among equal cost routes)load balancing (distribute traffic among equal cost routes)

21. Netprog 2002 - Routing and the Network Layer21 X.25 - Connection-Oriented Network Layer DCE DTE DTE: Data Terminal Equipment (host). DCE: Data Circuit-Terminating Equipment (router)

22. Netprog 2002 - Routing and the Network Layer22 X.25 Network Service Allows a DTE to establish multiple simultaneous connections (over a single link to a DCE).Allows a DTE to establish multiple simultaneous connections (over a single link to a DCE). Can also be used to connect 2 DTEs directly.Can also be used to connect 2 DTEs directly. Can support permanent connections.Can support permanent connections.

23. Netprog 2002 - Routing and the Network Layer23 X.25 Switched Virtual Circuit DTE A tells DCE A that it wants a connection to DTE B.DTE A tells DCE A that it wants a connection to DTE B. DCE B tells DTE B that a new connection has been requested.DCE B tells DTE B that a new connection has been requested. DCE A DCE A DCE B DCE B DTE A DTE A DTE B DTE B

24. Netprog 2002 - Routing and the Network Layer24 Virtual Circuit Numbers Each Virtual Circuit is assigned a number at setup time.Each Virtual Circuit is assigned a number at setup time. A virtual circuit number identifies a connection between a DTE and its DCE only.A virtual circuit number identifies a connection between a DTE and its DCE only. The other end of the connection can use a different virtual circuit number.The other end of the connection can use a different virtual circuit number.

25. Netprog 2002 - Routing and the Network Layer25 Virtual Circuit Numbers Each data packet includes a virtual circuit number rather than a destination address.Each data packet includes a virtual circuit number rather than a destination address. 12 bit identifier.12 bit identifier. Virtual circuit numbers are smaller than addresses and much faster for a router to process (just a table lookup).Virtual circuit numbers are smaller than addresses and much faster for a router to process (just a table lookup).

26. Netprog 2002 - Routing and the Network Layer26 Virtual Circuit Numbers 0 is reserved for control packets.0 is reserved for control packets. non-overlapping ranges of numbers:non-overlapping ranges of numbers: –permanent virtual circuits –incoming connections –outgoing connections

27. Netprog 2002 - Routing and the Network Layer27 Connection request DTE A selects an unused outgoing vc number.DTE A selects an unused outgoing vc number. DTE A creates a call request packet and sends to DCE A.DTE A creates a call request packet and sends to DCE A. DCE A contacts DCE B (via an unspecified mechanism) and requests the connection.DCE A contacts DCE B (via an unspecified mechanism) and requests the connection. DCE A notifies DTE A when the connection is established.DCE A notifies DTE A when the connection is established.

28. Netprog 2002 - Routing and the Network Layer28 Data Transfer Each connection (call) is full duplex.Each connection (call) is full duplex. Each packet sent by a DTE includes:Each packet sent by a DTE includes: –virtual circuit number –sequence number (3 or 7 bits). –fragmentation information ( M bit). –ACK sequence number.

29. Netprog 2002 - Routing and the Network Layer29 Data Transfer Fragmentation can happen at DTE or DCE.Fragmentation can happen at DTE or DCE. Sequence numbers do not necessarily coincide at DTEs.Sequence numbers do not necessarily coincide at DTEs. Seq# 2Seq# 1 DCE A DTE A DCE B DTE B Seq# 1Seq# 2Seq# 3Seq# 4 M M MM

30. Netprog 2002 - Routing and the Network Layer30 Flow Control Each packet includes an acknowledgement number (ACK).Each packet includes an acknowledgement number (ACK). The ack# indicates that the send has recieved all packets with sequence number <= ack#.The ack# indicates that the send has recieved all packets with sequence number <= ack#. Each sender has a window size w that determines how many unacknowledged packets can be outstanding.Each sender has a window size w that determines how many unacknowledged packets can be outstanding.

31. Netprog 2002 - Routing and the Network Layer31 DCE DCE The interface between DCE is not part of the X.25 standard.The interface between DCE is not part of the X.25 standard. Thought Exercise:Thought Exercise: –How could you design a network to route based on circuit numbers ?