Wireless Networking & Mobile Computing Network Layer Overview ECE 256

1. Wireless Networking & Mobile ComputingNetwork Layer OverviewECE 256 Romit Roy Choudhury Dept. of ECE and CS

2. transport segment from sending to receiving host on sending side encapsulates segments into datagrams on rcving 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 Recall Layering

3. Routing - Why Difficult ? • Several algorithmic problems: • Many many paths - which is the best? • Each path has changing characteristics • Queuing time varies, losses happen, router down … • How do you broadcast (find where someone is) • How do you multicast (webTV, conference call) • How do routers perform routing at GBbps scale • Several management problems: • How do you detect/diagnose faults • How do you do pricing, accounting

4. 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Chapter 4: Network Layer

5. 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 actual traffic intersections

6. routing algorithm local forwarding table header value output link 0100 0101 0111 1001 3 2 2 1 value in arriving packet’s header 1 0111 2 3 Interplay between routing and forwarding

7. Two types of Network Architecture • Connection-OrientedandConnection-Less Virtual Circuit Switching Example:ATM, X.25 Analogy: Telephone Datagram forwarding Example: IP networks Analogy: Postal service

8. 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 application transport network data link physical Virtual circuits: signaling protocols 6. Receive data 5. Data flow begins 4. Call connected 3. Accept call 1. Initiate call 2. incoming call

9. No call setup at network layer @ routers: no state about end-to-end connections no concept of “connection” packets forwarded using destination host address May take different path for same source-dest pair application transport network data link physical application transport network data link physical Datagram networks 1. Send data 2. Receive data

10. Design Decisions • Thoughts on why VC isn’t great? • Thoughts on why dataram may not be great? • Think of an application that’s better with VC

11. Internet data traffic “elastic” service, no strict timing req. “smart” end computers simple network complexity at “edge” many link types different characteristics uniform service difficult ATM evolved from telephony Call admission control human conversation: strict timing, reliability requirements need for guaranteed service “dumb” end systems telephones complexity inside network Datagram or VC network: why?

12. IP Addressing Chapter 4: Network Layer

13. IP address: 32-bit identifier for host, router interface interface: connection between host/router and physical link router’s typically have multiple interfaces host typically has one interface IP addresses associated with each interface 223.1.1.2 223.1.2.1 223.1.3.27 223.1.3.1 223.1.3.2 223.1.2.2 IP Addressing: introduction 223.1.1.1 223.1.2.9 223.1.1.4 223.1.1.3 223.1.1.1 = 11011111 00000001 00000001 00000001 223 1 1 1

14. IP address: subnet part (high order bits) host part (low order bits) What’s a subnet ? device interfaces with same subnet part of IP address can physically reach each other without intervening router Subnets 223.1.1.1 223.1.2.1 223.1.1.2 223.1.2.9 223.1.1.4 223.1.2.2 223.1.1.3 223.1.3.27 subnet 223.1.3.2 223.1.3.1 network consisting of 3 subnets

15. host part subnet part 11001000 0001011100010000 00000000 200.23.16.0/23 IP addressing: CIDR CIDR:Classless InterDomain Routing • subnet portion of address of arbitrary length • address format: a.b.c.d/x, where x is # bits in subnet portion of address

16. IP addresses: how to get one? Q: How does network get subnet part of IP addr? A: gets allocated portion of its provider ISP’s address space ISP's block 11001000 00010111 00010000 00000000 200.23.16.0/20 Organization 0 11001000 00010111 00010000 00000000 200.23.16.0/23 Organization 1 11001000 00010111 00010010 00000000 200.23.18.0/23 Organization 2 11001000 00010111 00010100 00000000 200.23.20.0/23 ... ….. …. …. Organization 7 11001000 00010111 00011110 00000000 200.23.30.0/23

17. Network Address Translation

18. Scalability Problem • Internet growing very fast • Many million devices • Each device needs an address for communication • Question is • How do you address each of them • IP addresing can give you 232 • May not be enough

19. NAT: Network Address Translation rest of Internet local network (e.g., home network) 10.0.0/24 10.0.0.1 10.0.0.4 10.0.0.2 138.76.29.7 10.0.0.3 Datagrams with source or destination in this network have 10.0.0/24 address for source, destination (as usual) All datagrams leaving local network have same single source NAT IP address: 138.76.29.7, different source port numbers

20. NAT makes Globally non-routable hosts • Non-routable • Means you cannot ping 192.168.0.3 (your home machines) from Duke Lab • But, Skype, GotoMyPC, etc. can access / call your home machine • How ?

21. An Alternate Approach: IPv6 • Initial motivation:Make space for 64 bit address space • How can this be made compatible to IPv4 routers? • IPv6 not flying • NAT coping fine with today’s needs

22. Routing Algorithms Chapter 4: Network Layer

23. 5 3 5 2 2 1 3 1 2 1 x z w u y v Graph abstraction Graph: G = (N,E) N = set of routers = { u, v, w, x, y, z } E = set of links ={ (u,v), (u,x), (v,x), (v,w), (x,w), (x,y), (w,y), (w,z), (y,z) } Remark: Graph abstraction is useful in other network contexts Example: P2P, where N is set of peers and E is set of TCP connections

24. 5 3 5 2 2 1 3 1 2 1 x z w u y v Graph abstraction: costs What factors influence this cost ? Should costs be only on links ? Cost of path (x1, x2, x3,…, xp) = c(x1,x2) + c(x2,x3) + … + c(xp-1,xp) Question: What’s the least-cost path between u and z ? Routing algorithm: algorithm that finds least-cost path

25. 2 main classes: Centralized all routers have complete topology, link cost info “link state” algorithms Distributed: Each router knows link costs to neighbor routers only “distance vector” algorithms Routing Algorithm classification

26. Dijkstra’s algorithm Link costs known to all nodes computes least cost paths from one node (‘source”) to all other nodes gives forwarding table for that node iterative: after k iterations, know least cost path to k dest.’s A Link-State Routing Algorithm

27. 5 3 5 2 2 1 3 1 2 1 x z y u w v Dijkstra’s Algorithm Notation: • c(x,y): link cost from node x to y; = ∞ if not direct neighbors • D(v): current value of cost of path from source to dest. v 1 Initialization: 2 N' = {u} 3 for all nodes v 4 if v adjacent to u 5 then D(v) = c(u,v) 6 else D(v) = ∞ 7 8 Loop 9 find w not in N' s.t. D(w) is a minimum 10 add w to N' 11 update D(v) for all v adjacent to w and not in N' : 12 D(v) = min( D(v), D(w) + c(w,v) ) 13 /* new cost to v is either old cost to v or known 14 shortest path cost to w plus cost from w to v */ 15 until all nodes in N'

28. x z w u y v destination link (u,v) v (u,x) x y (u,x) (u,x) w z (u,x) Dijkstra’s algorithm: example (2) Resulting shortest-path tree from u: Resulting forwarding table in u:

29. Distributed: Distance Vector • To find D, node S asks each neighbor X • How far X is from D • X asks its neighbors … comes back and says C(X,D) • Node S deduces C(S,D) = C(S,X) + C(X,D) • S chooses neighbor Xi that provides min C(S,D) • Later, Xj may find better route to D • Xj advertizes C(Xj,D) • All nodes update their cost to D if new min found

30. Distance Vector Algorithm Bellman-Ford Equation (dynamic programming) Define dx(y) := cost of least-cost path from x to y Then dx(y) = min {c(x,v) + dv(y) } where min is taken over all neighbors v of x v1 y x v2 v

31. 5 3 5 2 2 1 3 1 2 1 x z w u y v Bellman-Ford example Clearly, dv(z) = 5, dx(z) = 3, dw(z) = 3 B-F equation says: du(z) = min { c(u,v) + dv(z), c(u,x) + dx(z), c(u,w) + dw(z) } = min {2 + 5, 1 + 3, 5 + 3} = 4 Node that achieves minimum is next hop in shortest path ➜ forwarding table

32. 1 4 1 50 x z y Distance Vector: link cost changes Link cost changes: • if DV changes, notify neighbors At time t0, y detects the link-cost change, updates its DV, and informs its neighbors. At time t1, z receives the update from y and updates its table. It computes a new least cost to x and sends its neighbors its DV. At time t2, y receives z’s update and updates its distance table. y’s least costs do not change and hence y does not send any message to z. When can it get complicated ?

33. 60 4 1 50 x z y Distance Vector: link cost changes Link cost changes: • Y thinks Z’s best cost is 5 • Thus C(y,x) = 5 + 1 = 6 • Announces this cost • Z thinks C(z,x) = 6 + 1 … Poissoned reverse: • If Z routes through Y to get to X : • Z tells Y its (Z’s) distance to X is infinite (so Y won’t route to X via Z) • will this completely solve count to infinity problem? Food for thought … Will this converge ? If so, after how many rounds ? How can this be solved? Should Y announce change from 4 to 60?

34. Routing in Internet • Similar to international FedEx routing • FedEx figures out best route within country • Uses google maps say • This is link state -- All info available • USA FedEx does not have international map, also no permission to operate outside USA • Gets price quote from Germany FedEx, Japan FedEx etc. to route to India • Chooses minimum price and handles package to say Germany (Distance Vector) • Germany has country map (link state) • Germany asks for cost from Egypt, South Africa …

35. Internet Routing • Think of each country FedEx as ISPs • Routing on internet very similar to prior example • The link state and DV routing protocols used in internet routing • RIP (routing information protocol) • OSPF (Open shortest path first) • BGP (Border gateway protocol) • They utilize the concepts of • Link state • Distance vector routing

36. How is this different in wireless?

37. Routing in wireless Mobile Networks • Imagine hundreds of hosts moving • Routing algorithm needs to cope up with varying wireless channel and node mobility Where’s RED guy

38. Questions ?

39. Backup Slides

40. Message complexity LS: with n nodes, E links, O(nE) msgs sent DV: exchange between neighbors only convergence time varies Speed of Convergence LS: O(n2) algorithm requires O(nE) msgs may have oscillations DV: convergence time varies may be routing loops count-to-infinity problem Robustness: what happens if router malfunctions? LS: node can advertise incorrect link cost each node computes only its own table DV: DV node can advertise incorrect path cost each node’s table used by others error propagate thru network Comparison of LS and DV algorithms

41. 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Chapter 4: Network Layer

42. scale: with 200 million destinations: can’t store all dest’s in routing tables! routing table exchange would swamp links! administrative autonomy internet = network of networks each network admin may want to control routing in its own network Hierarchical Routing Our routing study thus far - idealization • all routers identical • network “flat” … not true in practice

43. aggregate routers into regions, “autonomous systems” (AS) routers in same AS run same routing protocol “intra-AS” routing protocol routers in different AS can run different intra-AS routing protocol Gateway router Direct link to router in another AS Hierarchical Routing

44. Forwarding table is configured by both intra- and inter-AS routing algorithm Intra-AS sets entries for internal dests Inter-AS & Intra-As sets entries for external dests 3a 3b 2a AS3 AS2 1a 2c AS1 2b 3c 1b 1d 1c Inter-AS Routing algorithm Intra-AS Routing algorithm Forwarding table Interconnected ASes

45. Suppose router in AS1 receives datagram for which dest is outside of AS1 Router should forward packet towards one of the gateway routers, but which one? AS1 needs: to learn which dests are reachable through AS2 and which through AS3 to propagate this reachability info to all routers in AS1 Job of inter-AS routing! 3a 3b 2a AS3 AS2 1a AS1 2c 2b 3c 1b 1d 1c Inter-AS tasks

46. Suppose router in AS1 receives datagram for which dest is outside of AS1 Router should forward packet towards one of the gateway routers, but which one? AS1 needs: to learn which dests are reachable through AS2 and which through AS3 to propagate this reachability info to all routers in AS1 Job of inter-AS routing! 3a 3b 2a AS3 AS2 1a AS1 2c 2b 3c 1b 1d 1c Inter-AS tasks

47. Example: Setting forwarding table in router 1d • Suppose AS1 learns from the inter-AS protocol that subnet x is reachable from AS3 (gateway 1c) but not from AS2. • Inter-AS protocol propagates reachability info to all internal routers. • Router 1d determines from intra-AS routing info that its interface I is on the least cost path to 1c. • Puts in forwarding table entry (x,I).

48. Determine from forwarding table the interface I that leads to least-cost gateway. Enter (x,I) in forwarding table Use routing info from intra-AS protocol to determine costs of least-cost paths to each of the gateways Learn from inter-AS protocol that subnet x is reachable via multiple gateways Hot potato routing: Choose the gateway that has the smallest least cost Example: Choosing among multiple ASes • Now suppose AS1 learns from the inter-AS protocol that subnet x is reachable from AS3 and from AS2. • To configure forwarding table, router 1d must determine towards which gateway it should forward packets for dest x. • This is also the job on inter-AS routing protocol! • Hot potato routing: send packet towards closest of two routers.

49. 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms Link state Distance Vector Hierarchical routing 4.6 Routing in the Internet RIP OSPF BGP 4.7 Broadcast and multicast routing Chapter 4: Network Layer

50. Intra-AS Routing • Also known as Interior Gateway Protocols (IGP) • Most common Intra-AS routing protocols: • RIP: Routing Information Protocol • OSPF: Open Shortest Path First • IGRP: Interior Gateway Routing Protocol (Cisco proprietary)