Presentation is loading. Please wait.

Presentation is loading. Please wait.

Computer Networks Chapter 4: Advanced Internetworking.

Similar presentations


Presentation on theme: "Computer Networks Chapter 4: Advanced Internetworking."— Presentation transcript:

1 Computer Networks Chapter 4: Advanced Internetworking

2 CN_4.2 Problems n How do we build a routing system that can handle hundreds of thousands of networks and billions of end nodes? n How to handle address space exhaustion of IPv4? n How to enhance the functionalities of Internet?

3 CN_4.3 Chapter Outline n Global Internet n Multicast n Mobile IP

4 CN_4.4 Chapter Goal n Understanding the scalability of routing in the Internet n Discussing IPv6 n Understanding the concept of multicasting n Discussing Mobile IP

5 CN_4.5 The Global Internet The tree structure of the Internet in 1990

6 CN_4.6 The Global Internet A simple multi-provider Internet

7 CN_4.7 Interdomain Routing (BGP) n Internet is organized as autonomous systems (AS) each of which is under the control of a single administrative entity n Autonomous System (AS) l corresponds to an administrative domain l examples: University, company, backbone network n A corporation’s internal network might be a single AS, as may the network of a single Internet service provider

8 CN_4.8 Interdomain Routing A network with two autonomous system

9 CN_4.9 Route Propagation n Idea: Provide an additional way to hierarchically aggregate routing information is a large internet. l Improves scalability n Divide the routing problem in two parts: l Routing within a single autonomous system l Routing between autonomous systems n Another name for autonomous systems in the Internet is routing domains l Two-level route propagation hierarchy  Inter-domain routing protocol (Internet-wide standard)  Intra-domain routing protocol (each AS selects its own)

10 CN_4.10 EGP and BGP n Inter-domain Routing Protocols l Exterior Gateway Protocol (EGP)  Forced a tree-like topology onto the Internet  Did not allow for the topology to become general – Tree like structure: there is a single backbone and autonomous systems are connected only as parents and children and not as peers l Border Gateway Protocol (BGP)  Assumes that the Internet is an arbitrarily interconnected set of ASs.  Today’s Internet consists of an interconnection of multiple backbone networks (they are usually called service provider networks, and they are operated by private companies rather than the government)  Sites are connected to each other in arbitrary ways

11 CN_4.11 BGP n Some large corporations connect directly to one or more of the backbone, while others connect to smaller, non-backbone service providers. n Many service providers exist mainly to provide service to “consumers” (individuals with PCs in their homes), and these providers must connect to the backbone providers n Often many providers arrange to interconnect with each other at a single “peering point”

12 CN_4.12 The Global Internet A simple multi-provider Internet Stub AS Multihomed AS Transit AS

13 CN_4.13 BGP-4: Border Gateway Protocol n Assumes the Internet is an arbitrarily interconnected set of AS's. n Define local traffic as traffic that originates at or terminates on nodes within an AS, and transit traffic as traffic that passes through an AS. n We can classify AS's into three types: l Stub AS: an AS that has only a single connection to one other AS; such an AS will only carry local traffic (small corporation in the figure of the previous page). l Multihomed AS: an AS that has connections to more than one other AS, but refuses to carry transit traffic (large corporation at the top in the figure of the previous page). l Transit AS: an AS that has connections to more than one other AS, and is designed to carry both transit and local traffic (backbone providers in the figure of the previous page).

14 CN_4.14 n The goal of Inter-domain routing is to find any loop free path to the intended destination l Reachability is more concerned than optimality l Finding path close to optimal is considered to be a great achievement n Why? BGP

15 CN_4.15 n Scalability: An Internet backbone router must be able to forward any packet destined anywhere l Having a routing table that will provide a match for any valid IP address n Autonomous nature of the domains l Not possible to calculate meaningful path costs for a path that crosses multiple ASs l A cost of 1000 across one provider might imply a great path but it might mean an unacceptable bad one from another provider n Issues of trust l Provider A might be unwilling to believe certain advertisements from provider B BGP

16 CN_4.16 Each AS has: n One BGP speaker that advertises: l local networks l other reachable networks (transit AS only) l gives path information n In addition to the BGP speakers, the AS has one or more border “gateways” which need not be the same as the speakers n The border gateways are the routers through which packets enter and leave the AS BGP

17 CN_4.17 n BGP does not belong to either of the two main classes of routing protocols (distance vectors and link-state protocols) n BGP advertises complete paths as an enumerated lists of ASs to reach a particular network BGP

18 CN_4.18 BGP Example Example of a network running BGP

19 CN_4.19 BGP Example n Speaker for AS 2 advertises reachability to P and Q l Network , , , and , can be reached directly from AS 2. n Speaker for backbone network then advertises l Networks , , , and can be reached along the path. n Speaker can also cancel previously advertised paths

20 CN_4.20 BGP Issues n It should be apparent that the AS numbers carried in BGP need to be unique n For example, AS 2 can only recognize itself in the AS path in the example if no other AS identifies itself in the same way n AS numbers are 16-bit numbers assigned by a central authority

21 CN_4.21 Integrating Interdomain and Intradomain Routing All routers run iBGP and an intradomain routing protocol. Border routers (A, D, E) also run eBGP to other ASs

22 CN_4.22 Integrating Interdomain and Intradomain Routing BGP routing table, IGP routing table, and combined table at router B

23 CN_4.23 Routing Areas A domain divided into areas Backbone area Area border router (ABR)

24 CN_4.24 Next Generation IP (IPv6)

25 CN_4.25 Major Features n 128-bit addresses n Multicast n Real-time service n Authentication and security n Auto-configuration n End-to-end fragmentation n Enhanced routing functionality, including support for mobile hosts

26 CN_4.26 IPv6 Addresses n Classless addressing/routing (similar to CIDR) n Notation: x:x:x:x:x:x:x:x (x = 16-bit hex number) l contiguous 0s are compressed: 47CD::A456:0124 l IPv6 compatible IPv4 address: :: n Address assignment l provider-based l geographic

27 CN_4.27 IPv6 Header n 40-byte “base” header n Extension headers (fixed order, mostly fixed length) l fragmentation l source routing l authentication and security l other options

28 CN_4.28 Internet Broadcast/ Multicast Routing

29 CN_4.29 R1 R2 R3R4 source duplication R1 R2 R3R4 in-network duplication duplicate creation/transmission duplicate Broadcast Routing n Deliver packets from source to all other nodes n Source duplication is inefficient: r source duplication: how does source determine recipient addresses?

30 CN_4.30 In-network duplication n Flooding: when node receives broadcast packet, sends copy to all neighbors l Problems: cycles & broadcast storm n Controlled flooding: node only broadcasts packet if it hasn’t broadcast same packet before l Node keeps track of packet ids already broadcasted l Or reverse path forwarding (RPF): only forward packet if it arrived on shortest path between node and source n Spanning tree l No redundant packets received by any node

31 CN_4.31 A B G D E c F A B G D E c F (a) Broadcast initiated at A (b) Broadcast initiated at D Spanning Tree n First construct a spanning tree n Nodes forward copies only along spanning tree

32 CN_4.32 A B G D E c F (a)Stepwise construction of spanning tree A B G D E c F (b) Constructed spanning tree Spanning Tree: Creation n Center node n Each node sends unicast join message to center node l Message forwarded until it arrives at a node already belonging to spanning tree

33 CN_4.33 Multicast Routing: Problem Statement n Goal: find a tree (or trees) connecting routers having local multicast group members l tree: not all paths between routers used l source-based: different tree from each sender to receivers l shared-tree: same tree used by all group members Shared treeSource-based trees

34 CN_4.34 Approaches for building multicast trees Approaches: n source-based tree: one tree per source l shortest path trees l reverse path forwarding n group-shared tree: group uses one tree l minimal spanning (Steiner) l center-based trees …We first look at basic approaches, then specific protocols adopting these approaches

35 CN_4.35 Shortest Path Tree n Multicast forwarding tree: tree of shortest path routes from source to all receivers l Dijkstra’s algorithm R1 R2 R3 R4 R5 R6 R i router with attached group member router with no attached group member link used for forwarding, i indicates order link added by algorithm LEGEND S: source

36 CN_4.36 Reverse Path Forwarding if (multicast datagram received on incoming link on shortest path back to sender) then flood datagram onto all outgoing links else ignore datagram  Rely on router’s knowledge of unicast shortest path from it to sender  Each router has simple forwarding behavior:

37 CN_4.37 Reverse Path Forwarding: example Result is a source-specific reverse SPT –may be a bad choice with asymmetric links R1 R2 R3 R4 R5 R6 R7 router with attached group member router with no attached group member datagram will be forwarded LEGEND S: source datagram will not be forwarded

38 CN_4.38 Reverse Path Forwarding: pruning n Forwarding tree contains subtrees with no multicast group members l no need to forward datagrams down subtree l “prune” messages sent upstream by router with no downstream group members R1 R2 R3 R4 R5 R6 R7 router with attached group member router with no attached group member prune message LEGEND S: source links with multicast forwarding P P P

39 CN_4.39 Shared-Tree: Steiner Tree n Steiner Tree: minimum cost tree connecting all routers with attached group members n problem is NP-complete n excellent heuristics exists n not used in practice: l computational complexity l information about entire network needed l monolithic: rerun whenever a router needs to join/leave

40 CN_4.40 Center-based trees n Single delivery tree shared by all n One router identified as “center” of tree n to join: l edge router sends unicast join-msg addressed to center router l join-msg “processed” by intermediate routers and forwarded towards center l join-msg either hits existing tree branch for this center, or arrives at center l path taken by join-msg becomes new branch of tree for this router

41 CN_4.41 Center-based trees: an example Suppose R6 chosen as center: R1 R2 R3 R4 R5 R6 R7 router with attached group member router with no attached group member path order in which join messages generated LEGEND

42 CN_4.42 Internet Multicasting Routing: DVMRP n DVMRP: Distance Vector Multicast Routing Protocol, RFC1075 n Flood and prune: reverse path forwarding, source- based tree l RPF tree based on DVMRP’s own routing tables constructed by communicating DVMRP routers l no assumptions about underlying unicast routing protocols (RIP, OSPF, etc) l initial datagram to multicast group flooded everywhere via RPF l routers not wanting group: send upstream prune messages

43 CN_4.43 DVMRP: continued… n Soft state: DVMRP router periodically (1 min.) “forgets” branches are pruned: l Multicast data again flows down unpruned branch l downstream router: reprune or else continue to receive data n routers can quickly regraft to tree l following IGMP join at leaf n odds and ends l commonly implemented in commercial routers l Mbone routing done using DVMRP

44 CN_4.44 Tunneling Q: How to connect “islands” of multicast routers in a “sea” of unicast routers? Multicast datagram encapsulated inside “normal” (non- multicast-addressed) datagram Normal IP datagram sent thru “tunnel” via regular IP unicast to receiving multicast router receiving multicast router unencapsulates to get multicast datagram physical topology logical topology

45 CN_4.45 PIM: Protocol Independent Multicast n Not dependent on any specific underlying unicast routing algorithm (works with all) n Two different multicast distribution scenarios : Dense ( 密 ): group members densely packed, in “close” proximity. bandwidth more plentiful Sparse( 疏 ): Number of networks with group members small wrt number of interconnected networks group members “widely dispersed” bandwidth not plentiful

46 CN_4.46 Consequences of Sparse-Dense Dichotomy: Dense n group membership by routers assumed until routers explicitly prune n data-driven construction on multicast tree (e.g., RPF) n bandwidth and non- group-router processing profligate Sparse : n no membership until routers explicitly join n receiver- driven construction of multicast tree (e.g., center-based) n bandwidth and non- group-router processing conservative

47 CN_4.47 PIM- Dense Mode Flood-and-prune RPF, similar to DVMRP but underlying unicast routing protocol provides RPF information for incoming datagram less complicated (less efficient) downstream flood than DVMRP reduces reliance on underlying routing algorithm has protocol mechanism for router to detect it is a leaf-node router

48 CN_4.48 PIM - Sparse Mode n Center-based approach n Router sends join message to rendezvous point (RP) l intermediate routers update state and forward join n after joining via RP, router can switch to source- specific tree l increased performance: less concentration, shorter paths R1 R2 R3 R4 R5 R6 R7 join all data multicast from rendezvous point rendezvous point

49 CN_4.49 PIM - Sparse Mode Sender(s): n unicast data to RP, which distributes down RP- rooted tree n RP can extend multicast tree upstream to source n RP can send stop message if no attached receivers l “no one is listening!” R1 R2 R4 R5 R6 R7 join all data multicast from rendezvous point rendezvous point

50 CN_4.50 Routing for Mobile Hosts n Mobile IP l home agent: Router located on the home network of the mobile hosts l home address: The permanent IP address of the mobile host. Has a network number equal to that of the home network and thus of the home agent l foreign agent: Router located on a network to which the mobile node attaches itself when it is away from its home network

51 CN_4.51 Routing for Mobile Hosts

52 CN_4.52 Routing for Mobile Hosts n Problem of delivering a packet to the mobile node l How does the home agent intercept a packet that is destined for the mobile node ?  Proxy ARP l How does the home agent then deliver the packet to the foreign agent ?  IP tunnel  Care-of-address l How does the foreign agent deliver the packet to the mobile node ?

53 CN_4.53 Routing for Mobile Hosts n Route optimization in Mobile IP l The route from the sending node to mobile node can be significantly sub-optimal l One extreme example  The mobile node and the sending node are on the same network, but the home network for the mobile node is on the far side of the Internet – Triangle Routing Problem

54 CN_4.54 Routing for Mobile Hosts l Solution  Let the sending node know the care-of-address of the mobile node. The sending node can create its own tunnel to the foreign agent  Home agent sends binding update message  The sending node creates an entry in the binding cache  The binding cache may become out-of-date – The mobile node moved to a different network – Foreign agent sends a binding warning message

55 CN_4.55 Summary n We have talked about the following issues l Scalability routing in the Internet l IPv6 l Broadcast/Multicasting l Mobile IP

56 End of Chapter 4


Download ppt "Computer Networks Chapter 4: Advanced Internetworking."

Similar presentations


Ads by Google