Each mobile node has a home network, home address and home agent

Presentation on theme: "Each mobile node has a home network, home address and home agent"— Presentation transcript:

1 Each mobile node has a home network, home address and home agent
Mobile IP Foreign Agent (FA) Advertisement (FA,COA) Foreign Network Mobile Node Register (HA) Solicitation Correspondent Node (CN) Packets sent by MN go directly to CN Register Home Agent (HA) Home Network Mobile Node Each mobile node has a home network, home address and home agent - Triangle Routing in Mobile IP: - HA may be needed to provides location hiding and security - Inefficient in terms of network overhead and end-to-end delays Courtesy: Ahmed Helmy - USC When mobile node (MN) moves to a foreign network it obtains a care-of-address (COA) from the foreign agent (FA) that registers it with the home agent (HA) COA is used by HA to tunnel packets to MN 19-Sep-18 4/598N: Computer Networks

2 How to Make Routing Scale
Flat versus Hierarchical Addresses Inefficient use of Hierarchical Address Space class C with 2 hosts (2/255 = 0.78% efficient) class B with 256 hosts (256/65535 = 0.39% efficient) Still Too Many Networks routing tables do not scale route propagation protocols do not scale 19-Sep-18 4/598N: Computer Networks

3 Internet Structure Recent Past NSFNET backbone Stanford BARRNET
regional Berkeley P ARC NCAR UA UNM Westnet UNL KU ISU MidNet … 19-Sep-18 4/598N: Computer Networks

4 Internet Structure Today Large corporation “ Consumer ” ISP Peering
point Backbone service provider Peering point Consumer” ISP “ “Consumer” ISP Large corporation Small corporation 19-Sep-18 4/598N: Computer Networks

5 Add another level to address/routing hierarchy: subnet
Subnetting Add another level to address/routing hierarchy: subnet Subnet masks define variable partition of host part Subnets visible only within site Network number Host number Class B address Subnet mask ( ) Subnetted address Host ID Subnet ID 19-Sep-18 4/598N: Computer Networks

6 Subnet Example Forwarding table at router R1
Subnet mask: Subnet number: H1 R1 Subnet mask: Subnet number: H2 R2 H3 Forwarding table at router R1 Subnet Number Subnet Mask Next Hop interface 0 interface 1 R2 Subnet mask: Subnet number: 19-Sep-18 4/598N: Computer Networks

7 Forwarding Algorithm D = destination IP address
for each entry (SubnetNum, SubnetMask, NextHop) D1 = SubnetMask & D if D1 = SubnetNum if NextHop is an interface deliver datagram directly to D else deliver datagram to NextHop Use a default router if nothing matches Not necessary for all 1s in subnet mask to be contiguous Can put multiple subnets on one physical network Subnets not visible from the rest of the Internet 19-Sep-18 4/598N: Computer Networks

8 Assign block of contiguous network numbers to nearby networks
Supernetting Assign block of contiguous network numbers to nearby networks Called CIDR: Classless Inter-Domain Routing Represent blocks with a single pair (first_network_address, count) Restrict block sizes to powers of 2 Use a bit mask (CIDR mask) to identify block size All routers must understand CIDR addressing 19-Sep-18 4/598N: Computer Networks

9 Autonomous System (AS)
Route Propagation Know a smarter router hosts know local router local routers know site routers site routers know core router core routers know everything Autonomous System (AS) corresponds to an administrative domain examples: University, company, backbone network assign each AS a 16-bit number Two-level route propagation hierarchy interior gateway protocol (each AS selects its own) exterior gateway protocol (Internet-wide standard) 19-Sep-18 4/598N: Computer Networks

10 Popular Interior Gateway Protocols
RIP: Route Information Protocol developed for XNS distributed with Unix distance-vector algorithm based on hop-count OSPF: Open Shortest Path First recent Internet standard uses link-state algorithm supports load balancing supports authentication 19-Sep-18 4/598N: Computer Networks

11 EGP: Exterior Gateway Protocol
Overview designed for tree-structured Internet concerned with reachability, not optimal routes Protocol messages neighbor acquisition: one router requests that another be its peer; peers exchange reachability information neighbor reachability: one router periodically tests if the another is still reachable; exchange HELLO/ACK messages; uses a k-out-of-n rule routing updates: peers periodically exchange their routing tables (distance-vector) 19-Sep-18 4/598N: Computer Networks

12 BGP-4: Border Gateway Protocol
AS Types stub AS: has a single connection to one other AS carries local traffic only multihomed AS: has connections to more than one AS refuses to carry transit traffic transit AS: has connections to more than one AS carries both transit and local traffic Each AS has: one or more border routers one BGP speaker that advertises: local networks other reachable networks (transit AS only) gives path information 19-Sep-18 4/598N: Computer Networks

13 BGP Example Speaker for AS2 advertises reachability to P and Q
network , , , and , can be reached directly from AS2 Speaker for backbone advertises networks , , , and can be reached along the path (AS1, AS2). Speaker can cancel previously advertised paths Backbone network (AS 1) Regional provider A (AS 2) Regional provider B (AS 3) Customer P (AS 4) Customer Q (AS 5) Customer R (AS 6) Customer S (AS 7) 128.96 19-Sep-18 4/598N: Computer Networks

14 IP Version 6 Features Header 128-bit addresses (classless) multicast
real-time service authentication and security autoconfiguration end-to-end fragmentation protocol extensions Header 40-byte “base” header extension headers (fixed order, mostly fixed length) fragmentation source routing other options 19-Sep-18 4/598N: Computer Networks

15 Multicast routing Multicast within LANs is simple because we can use the underlying multicast capabilities of Ethernet. Internet multicast implemented on top of a collection of networks that support broadcast by extending the routers Hosts join multicast groups using Internet Group Management Protocol (IGMP) How receivers and senders agree on a specific multicast address is orthogonal to routing issues SDP – Session description protocol SAP – Session announcement protocol 19-Sep-18 4/598N: Computer Networks

16 Each router monitors its lan for multicast packets
Link state multicast Each router monitors its lan for multicast packets Use this information to build shortest-path multicast tree May have to maintain information about each group (many multicast groups can co-exist at the same time) Usually caches these trees 19-Sep-18 4/598N: Computer Networks

17 Distance Vector Multicast
Two steps broadcast mechanism to forward packets to all the networks Pruning mechanism to remove networks that are not currently participating Reverse-Path Broadcast (RPB) Routers forward packets along all the outgoing links (except ones that route towards to source) Reverse-Path Multicast (RPM) Propagate “no members of G here” back to source 19-Sep-18 4/598N: Computer Networks

18 Protocol Independent Multicast (PIM)
Define operating modes Sparse mode: If few routers are interested in this multicast Dense mode: When most routers want this stream Rendezvous point - RP Somehow choose RP Use RP to forward requests to join and prune multicast groups Creates source-specific tree or shared tree 19-Sep-18 4/598N: Computer Networks

19 Problem – debugging multicast topology
Suppose – multicast transmission from Berkeley to ND, the receiver is not receiving it. How do you debug it? Unicast tools link ping and traceroute do not work because we want to get the whole multicast topology; not if one host can get multicast Just because Stanford is receiving this stream is no help to debug why it is not working for ND 19-Sep-18 4/598N: Computer Networks

20 Receiver to Source direction
Approaches Receiver to Source direction Multicast routing information is used to discover the tree topology Need to know session identities Source to receiver Don’t need the identities of receivers Multicast forwarding information is used to get the tree SNMP based approach Simple Network Management Protocol Each router maintains information. Query all routers to get routing info. 19-Sep-18 4/598N: Computer Networks

21 Approaches (cont.) Use other mechanisms (such as RTCP – Real time Transport Control Protocol – part of RTP Realtime Transport Protocol) RTCP sends announcements periodically and use that to discover topology RTCP is unreliable 19-Sep-18 4/598N: Computer Networks

22 Decisions are made on business goals and $$$
Peering and Transits Thousands of ISPs. ISPs connect using transit providers and backbone providers to route packets Decisions are made on business goals and $$$ Peering does not give access to other peering points, I.e. peering is non-transitive No explicit service level agreement (SLA) Peering can be cheaper For example, Notre Dame can peer with Ameritech and ATT to transfer mutual traffic (from DSL and Cable customers) Lower latency to preferred ISPs 19-Sep-18 4/598N: Computer Networks

23 Notre Dame to Saint Marys
traceroute traceroute to ( ), 30 hops max, 40 byte packets 1 eafs-e06.gw.nd.edu ( ) ms ms ms 2 c245-e01.gw.nd.edu ( ) ms ms ms 3 monk-fe00.gw.nd.edu ( ) ms ms ms 4 klimek-i00.gw.nd.edu ( ) ms ms ms 5 mren-m10-lsd6509.startap.net ( ) ms ms ms 6 chin-mren-ge.abilene.ucaid.edu ( ) ms ms ms 7 iplsng-chinng.abilene.ucaid.edu ( ) ms ms ms 8 ul-abilene.indiana.gigapop.net ( ) ms ms ms 9 ihets-gw-1-ge15-0.ind.net ( ) ms ms ms 10 sbn-fa0-0.ind.net ( ) ms ms ms 11 stmarys-edu-T1.ind.net ( ) ms ms ms 12 * * smcswitch.saintmarys.edu ( ) ms !X 19-Sep-18 4/598N: Computer Networks

24 Reasons why you don’t peer
No explicit SLA Use cold-potato algorithm to offset traffic costs Carry traffic in your local network as much as possible rather than use an optimal (possibly more expensive transit route) Transit points use hot potato algorithm, dumping the packets as soon as possible to the back bone (even if it was not optimal) Don’t want to help potential competitors Ameritech would want your friends to move to Ameritech so that you all can get faster traffic, not peer with AT&T so that you can enjoy the benefit 19-Sep-18 4/598N: Computer Networks