1. EEC-484/584 Computer Networks Lecture 11 Wenbing Zhao wenbing@ieee.org (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer Networking book, and on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall)

2. 2 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Outline Quiz#2 results Network layer design issues Router architecture Routing algorithm –Link state routing –Distance vector routing

3. 3 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao EEC484 Results High: 96, low: 68, average: 86 Q1: mean 24 Q2: mean 25 Q3: mean 10 Q4: mean 9 Q5: mean 17

4. 4 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao EEC584 (TTh) Results High: 99, low: 70, average: 89 Q1: mean 27 Q2: mean 28 Q3: mean 9 Q4: mean 10 Q5: mean 16

5. 5 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao EEC584(MW) Results High: 94, low: 75, average: 86 Q1: mean 24 Q2: mean 26 Q3: mean 10 Q4: mean 9 Q5: mean 17

6. 6 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Q5 (TTh) Six stations, A through F, communicate using the MACA protocol. The 6 stations are aligned along a line, with gap slightly shorter than the radio range in between two adjacent stations, as shown below. Is it possible for stations B and C, and stations D and E to communicate with each other simultaneously? Elaborate your answer with respect to the MACA protocol. A B C D E F Radio Range

7. 7 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Network Layer Main concern: end-to-end transmission –Perhaps over many hops at intermediate nodes Services provided to the transport layer –Routing & congestion control –Internetworking – connection of multiple networks Goals – services should –Be independent of subnet technologies –Shield transport layer from number, type, topology of subnets –Uniform network addresses across LAN/WAN

8. 8 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Network Layer Transport segment from sending to receiving host On sending side encapsulates segments into datagrams On receiving side, delivers segments to transport layer Network layer protocols in every host, router Router examines header fields in all IP datagrams passing through it network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical network data link physical application transport network data link physical application transport network data link physical

9. 9 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Two Key Network-Layer Functions Forwarding: move packets from router’s input to appropriate router output Routing: determine route taken by packets from source to dest. –Routing algorithms Analogy: Routing: process of planning trip from source to dest Forwarding: process of getting through single intersection

10. 10 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao 1 2 3 0111 value in arriving packet’s header routing algorithm local forwarding table header value output link 0100 0101 0111 1001 32213221 Interplay between Routing & Forwarding Forwarding table is also referred to as routing table

11. 11 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Network Service Model Q: What service model for “channel” transporting datagrams from sender to receiver? Example services for individual datagrams: Guaranteed delivery Guaranteed delivery with less than 40 msec delay Best effort Example services for a flow of datagrams: In-order datagram delivery Guaranteed minimum bandwidth to flow Restrictions on changes in inter-packet spacing No guarantee whatsoever

12. 12 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Network Layer Connection and Connection-less Service Datagram network provides network-layer connectionless service Virtual Circuit network provides network-layer connection-oriented service

13. 13 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Datagram Networks No call setup at network layer Routers: no state about end-to-end connections –no network-level concept of “connection” Packets forwarded using destination host address –packets between same source-dest pair may take different paths application transport network data link physical 1. Send data 2. Receive data application transport network data link physical

14. 14 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Routing within a Datagram Subnet Router has forwarding table telling which outgoing line to use for each possible destination router Each datagram has full destination address When packet arrives, router looks up outgoing line to use and transmits packet

15. 15 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Virtual Circuits Call setup, teardown for each call before data can flow Each packet carries VC identifier (not destination host address) Every router on source-dest path maintains “state” for each passing connection Link, router resources (bandwidth, buffers) may be allocated to VC (dedicated resources = predictable service) “source-to-dest path behaves much like telephone circuit” –performance-wise –network actions along source-to-dest path

16. 16 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao VC Implementation A VC consists of: 1.Path from source to destination 2.VC numbers, one number for each link along path 3.Entries in forwarding tables in routers along path Packet belonging to VC carries VC number (rather than destination address) VC number can be changed on each link –New VC number comes from forwarding table

17. 17 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Virtual Circuit Network Routers maintain connection state information!

18. 18 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Virtual Circuits: Signaling Protocols Used to setup, maintain teardown VC Used in ATM, frame-relay, X.25 Not used in today’s Internet application transport network data link physical 1. Initiate call 2. incoming call 3. Accept call 4. Call connected 5. Data flow begins 6. Receive data application transport network data link physical

19. 19 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Datagram or VC Network: Why? Internet (datagram) data exchange among computers –“elastic” service, no strict timing requirement “smart” end systems (computers) –can adapt, perform control, error recovery –simple inside network, complexity at “edge” ATM (VC) evolved from telephony human conversation: –strict timing, reliability requirements –need for guaranteed service “dumb” end systems –telephones –complexity inside network

20. 20 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao What’s in a Router? Run routing algorithms/protocol (RIP, OSPF, BGP) Forwarding datagrams from incoming to outgoing link

21. 21 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Input Port Functions Decentralized switching: given datagram dest., lookup output port using forwarding table in input port memory queuing: newly arrived datagrams might be queued before processing Physical layer: bit-level reception Data link layer: e.g., Ethernet

22. 22 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Types of Switching Fabrics

23. 23 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Output Ports Buffering required when datagrams arrive from fabric faster than the transmission rate Scheduling discipline chooses among queued datagrams for transmission

24. 24 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Routing Algorithms Least-cost in what sense? –Number of hops, geographical distance, least queueing and transmission delay Desirable properties –Correctness, simplicity –Robustness to faults –Stability – converge to equilibrium Routing algorithm: algorithm that finds least-cost path

25. 25 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Routing Algorithm Classification Static or dynamic? Non-adaptive (static) - Route computed in advance, off-line, downloaded to routers Adaptive (dynamic) - Route based on measurements or estimates of current traffic and topology

26. 26 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Routing Algorithm Classification Global or decentralized information? Global: –all routers have complete topology & link cost info –“link state” algorithms Decentralized: –router knows physically-connected neighbors, link costs to neighbors –iterative process of computation, exchange of info with neighbors –“distance vector” algorithms

27. 27 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Link State Routing Basic idea Assumes net topology, link costs known to all nodes –Accomplished via “link state broadcast” –All nodes have same info Computes least cost paths from one node (‘source”) to all other nodes, using Dijkstra ’ s Algorithm –Gives forwarding table for that node

28. 28 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Dijkstra ’ s Algorithm Each node labeled with distance from source node along best known path Initially, no paths known so all nodes labeled with infinity As algorithm proceeds, labels may change reflecting shortest path Label may be tentative or permanent, initially, all tentative When label represents shortest path from source to node, label becomes permanent

29. 29 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Compute Shortest Path from A to D Start with node A as the initial working node Examine each of the nodes adjacent to A, i.e., B and G, relabeling them with the distance to A Examine all the tentatively labeled nodes in the whole graph and make the one with the smallest label permanent, i.e., B. B is the new working node

30. 30 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Compute Shortest Path from A to D

31. 31 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Step Permanently labeled BGECFHD 1 A 2,A6,G∞∞∞∞∞ 2 AB 6,G4,B9,B∞∞∞ 3 ABE 5,E9,B6,E∞∞ 4 ABEG 9,B6,E9,G∞ 5 ABEGF 9,B8,F∞ 6 ABEGFH 9,B10,H 7 ABEGFHC 10,H 8 ABEGFHCD

32. 32 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Computation Results BCDEFGHBCDEFGH (A,B) Destination link A B C D E F G H Routing Table in A

33. 33 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Dijkstra ’ s Algorithm : Exercise Given the subnet shown below, using the Dijkstra ’ s Algorithm, determine the shortest path tree from node u and its routing table u y x wv z 2 2 1 3 1 1 2 5 3 5

34. 34 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Distance Vector Routing Also called Bellman-Ford or Ford-Fulkerson Each router maintains a table (a vector), giving best known distance to each destination and which line to use to get there –Table is updated by exchanging info with neighbors –Table contains one entry for each router in network with Preferred outgoing line to that destination Estimate of time or distance to that destination –Once every T msec, router sends to each neighbor a list of estimated delays to each destination and receives same from those neighbors

35. 35 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Distance Vector Routing d(A,X) d(A,Y) A X Z d(Y,Z) d(X,Z) At router A, for Z Compute d(A,X) + d(X,Z) and d(A,Y) + d(Y,Z), take minimum Y d(A,Z) = min {d(A,v) + d(v,Z) } where min is taken over all neighbors v of A

36. 36 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao x y z x y z 0 2 7 ∞∞∞ ∞∞∞ from cost to from x y z x y z 0 from cost to x y z x y z ∞∞ ∞∞∞ cost to x y z x y z ∞∞∞ 710 cost to ∞ 2 0 1 ∞ ∞ ∞ 2 0 1 7 1 0 time x z 1 2 7 y node x table node y table node z table d(x,y) = min{d(x,y) + d(y,y), d(x,z) + d(z,y)} = min{2+0, 7+1} = 2 d(x,z) = min{d(x,y) + d(y,z), d(x,z) + d(z,z)} = min{2+1, 7+0} = 3 32

37. 37 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao x y z x y z 0 2 7 ∞∞∞ ∞∞∞ from cost to from x y z x y z 0 2 3 from cost to x y z x y z 0 2 3 from cost to x y z x y z ∞∞ ∞∞∞ cost to x y z x y z 0 2 7 from cost to x y z x y z 0 2 3 from cost to x y z x y z 0 2 3 from cost to x y z x y z 0 2 7 from cost to x y z x y z ∞∞∞ 710 cost to ∞ 2 0 1 ∞ ∞ ∞ 2 0 1 7 1 0 2 0 1 7 1 0 2 0 1 3 1 0 2 0 1 3 1 0 2 0 1 3 1 0 2 0 1 3 1 0 time x z 1 2 7 y node x table node y table node z table d(x,y) = min{d(x,y) + d(y,y), d(x,z) + d(z,y)} = min{2+0, 7+1} = 2 d(x,z) = min{d(x,y) + d(y,z), d(x,z) + d(z,z)} = min{2+1, 7+0} = 3

38. 38 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Distance Vector Routing Delay A to B 12ms, to C 25ms, to D 40ms, to G 18ms Delay J to A 8ms, to I 10ms, to H 12ms, to K 6ms Delay J to A to G 8+18 = 26ms to I to G 10+31 = 41ms to H to G 12+6=18ms to K to G 6+31=37ms

39. 39 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Distance Vector Routing Good news travels fast Bad news travels slow Count to infinity problem: Takes too long to converge upon router failure ×

40. 40 Spring Semester 2006EEC-484/584: Computer NetworksWenbing Zhao Distance Vector Routing: Exercise Consider the subnet shown below. Distance vector routing is used, and the following vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0, 4). The measured delays to B, D, and E, are 6, 3, and 5, respectively. What is C's new routing table? Give both the outgoing line to use and the expected delay.