Computer Networks Chapter 4: Advanced Internetworking.

Slides:



Advertisements
Similar presentations
The University of Adelaide, School of Computer Science
Advertisements

Computer Networks Chapter 4: Advanced Internetworking
COS 461 Fall 1997 Routing COS 461 Fall 1997 Typical Structure.
1 Interdomain Routing Protocols. 2 Autonomous Systems An autonomous system (AS) is a region of the Internet that is administered by a single entity and.
CSCI 4550/8556 Computer Networks Comer, Chapter 25: Internet Routing.
CS 164: Global Internet Slide Set In this set... More about subnets Classless Inter Domain Routing (CIDR) Border Gateway Protocol (BGP) Areas with.
Spring 2003CS 4611 Routing Outline Algorithms Scalability.
Routing So how does the network layer do its business?
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 23 Introduction to Computer Networks.
Chapter 4 IP Multicast Professor Rick Han University of Colorado at Boulder
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
CS335 Networking & Network Administration Tuesday, May 18, 2010.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 Exterior Gateway Protocols: EGP, BGP-4, CIDR Shivkumar Kalyanaraman Rensselaer Polytechnic Institute.
Routing and Routing Protocols
Delivery, Forwarding, and Routing
MULTICASTING Network Security.
Spring 2002CS 4611 Routing Outline Algorithms Scalability.
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
CSS 432: Subnetting, CIDR, and Global Internet
1 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 4 Advanced Internetworking Computer Networks, 5th Edition.
Inter-domain Routing Outline Border Gateway Protocol.
NETWORK LAYER (2) T.Najah AlSubaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System NET331.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Dr. John P. Abraham Professor University of Texas Pan American Internet Routing and Routing Protocols.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Multicast routing.
22.1 Chapter 22 Network Layer: Delivery, Forwarding, and Routing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Multicast Routing Protocols NETE0514 Presented by Dr.Apichan Kanjanavapastit.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
Introduction to BGP.
Network Layer introduction 4.2 virtual circuit and datagram networks 4.3 what’s inside a router 4.4 IP: Internet Protocol  datagram format  IPv4.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Net-Centric Computing Division Department of Computer Science Bogor Agricultural University KOM 312 K OMUNIKASI D ATA DAN J ARINGAN K OMPUTER Internet.
CSC 600 Internetworking with TCP/IP Unit 8: IP Multicasting (Ch. 17) Dr. Cheer-Sun Yang Spring 2001.
Interior Gateway Protocol. Introduction An IGP (Interior Gateway Protocol) is a protocol for exchanging routing information between gateways (hosts with.
14-Oct-154/598N: Computer Networks Internet Structure - Past NSFNET backbone Stanford BARRNET regional Berkeley PARC NCAR UA UNM Westnet regional UNL KU.
Lecture 4: BGP Presentations Lab information H/W update.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing Part 5 Multicasting protocol.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
© J. Liebeherr, All rights reserved 1 Multicast Routing.
CSC 600 Internetworking with TCP/IP Unit 7: IPv6 (ch. 33) Dr. Cheer-Sun Yang Spring 2001.
Network Layer4-1 The Internet Network layer forwarding table Host, router network layer functions: Routing protocols path selection RIP, OSPF, BGP IP protocol.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
Routing and Routing Protocols
Network Layer4-1 Today Collect homework New homework: Ch4 #16,19,21-24,26,27,29,31 (half graded, as usual) Due Wednesday Oct 15 in class Final programming.
23-Dec-154/598N: Computer Networks Overview 4.2: Routing Forwarding vs Routing –forwarding: to select an output port based on destination address and routing.
Routing in the Inernet Outcomes: –What are routing protocols used for Intra-ASs Routing in the Internet? –The Working Principle of RIP and OSPF –What is.
Transport Layer3-1 Network Layer Every man dies. Not every man really lives.
Spring 2010CS 3321 Interdomain Routing. Spring 2010CS 3322 How to Make Routing Scale Flat versus Hierarchical Addresses Inefficient use of Hierarchical.
Chapter 21 Multicast Routing
Spring 2006CS 3321 Multicast Outline Link-state Multicast Distance-vector Multicast Protocol Independent Multicast.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
The Internet Network layer
Spring 2006CS 3321 Interdomain Routing. Spring 2006CS 3322 How to Make Routing Scale Flat versus Hierarchical Addresses Inefficient use of Hierarchical.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
Chapter 25 Internet Routing. Static Routing manually configured routes that do not change Used by hosts whose routing table contains one static route.
Spring 2008CPE Computer Networks1 Routing: Part II Outline Algorithms Scalability Reading: Section 4.3.
Inter-domain Routing Outline Border Gateway Protocol.
Multicasting EECS June Multicast One-to-many, many-to-many communications Applications: – Teleconferencing – Database – Distributed computing.
22.1 Network Layer Delivery, Forwarding, and Routing.
1 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
TRANSPORT LAYER BY, Parthasarathy.g.
Chapter 4: Advanced Internetworking
Routing BY, P.B.SHANMATHI.
(How the routers’ tables are filled in)
Chapter 4: Advanced Internetworking
The University of Adelaide, School of Computer Science
UNIT III ROUTING.
Inter-domain Routing Outline Homework #3 solutions
Presentation transcript:

Computer Networks Chapter 4: Advanced Internetworking

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?

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

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

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

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

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

CN_4.8 Interdomain Routing A network with two autonomous system

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)

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

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”

CN_4.12 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).

CN_4.13 n The goal of Inter-domain routing is to find any path to the intended destination that is loop free l We are concerned with reachability than optimality l Finding path anywhere close to optimal is considered to be a great achievement n Why? BGP

CN_4.14 n Scalability: An Internet backbone router must be able to forward any packet destined anywhere in the Internet l Having a routing table that will provide a match for any valid IP address n Autonomous nature of the domains l It is impossible 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

CN_4.15 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

CN_4.16 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

CN_4.17 BGP Example Example of a network running BGP

CN_4.18 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

CN_4.19 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

CN_4.20 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

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

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

CN_4.23 Next Generation IP (IPv6)

CN_4.24 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

CN_4.25 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

CN_4.26 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

CN_4.27 Internet Multicast

CN_4.28 Overview n IPv4 l class D addresses l demonstrated with MBone l uses tunneling n Integral part of IPv6 l problem is making it scale

CN_4.29 Overview n One-to-many l Radio station broadcast l Transmitting news, stock-price l Software updates to multiple hosts n Many-to-many l Multimedia teleconferencing l Online multi-player games l Distributed simulations

CN_4.30 Overview n Without support for multicast l A source needs to send a separate packet with the identical data to each member of the group  This redundancy consumes more bandwidth  Redundant traffic is not evenly distributed, concentrated near the sending host l Source needs to keep track of the IP address of each member in the group  Group may be dynamic n To support many-to-many and one-to-many IP provides an IP-level multicast

CN_4.31 Overview n Basic IP multicast model is many-to-many based on multicast groups l Each group has its own IP multicast address l Hosts that are members of a group receive copies of any packets sent to that group’s multicast address l A host can be in multiple groups l A host can join and leave groups

CN_4.32 Overview n Using IP multicast to send the identical packet to each member of the group l A host sends a single copy of the packet addressed to the group’s multicast address l The sending host does not need to know the individual unicast IP address of each member l Sending host does not send multiple copies of the packet

CN_4.33 Overview n IP’s original many-to-many multicast has been supplemented with support for a form of one-to- many multicast n One-to-many multicast l Source specific multicast (SSM) l A receiving host specifies both a multicast group and a specific sending host n Many-to-many model l Any source multicast (ASM)

CN_4.34 Overview n A host signals its desire to join or leave a multicast group by communicating with its local router using a special protocol l In IPv4, the protocol is Internet Group Management Protocol (IGMP) l In IPv6, the protocol is Multicast Listener Discovery (MLD) n The router has the responsibility for making multicast behave correctly with regard to the host

CN_4.35 Multicast Routing n A router’s unicast forwarding tables indicate for any IP address, which link to use to forward the unicast packet n To support multicast, a router must additionally have multicast forwarding tables that indicate, based on multicast address, which links to use to forward the multicast packet n Unicast forwarding tables collectively specify a set of paths n Multicast forwarding tables collectively specify a set of trees l Multicast distribution trees

CN_4.36 Multicast Routing n To support source specific multicast, the multicast forwarding tables must indicate which links to use based on the combination of multicast address and the unicast IP address of the source n Multicast routing is the process by which multicast distribution trees are determined

CN_4.37 Distance-Vector Multicast n Each router already knows that shortest path to source S goes through router N. n When receive multicast packet from S, forward on all outgoing links (except the one on which the packet arrived), iff packet arrived from N. n Eliminate duplicate broadcast packets by only letting l “parent” for LAN (relative to S) forward  shortest path to S (learn via distance vector)  smallest address to break ties

CN_4.38 Reverse Path Broadcast (RPB) n Goal: Prune networks that have no hosts in group G n Step 1: Determine if LAN is a leaf with no members in G l leaf if parent is only router on the LAN l determine if any hosts are members of G using IGMP n Step 2: Propagate “no members of G here” information augment update sent to neighbors with set of groups for which this network is interested in receiving multicast packets. l only happens when multicast address becomes active. Distance-Vector Multicast

CN_4.39 Protocol Independent Multicast (PIM) Shared Tree Source specific tree

CN_4.40 Protocol Independent Multicast (PIM) Delivery of a packet along a shared tree. R1 tunnels the packet to the RP, which forwards it along the shared tree to R4 and R5.

CN_4.41 Inter-domain Multicast Multicast Source Discovery Protocol (MSDP)

CN_4.42 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

CN_4.43 Routing for Mobile Hosts

CN_4.44 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?

CN_4.45 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

CN_4.46 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

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

End of Chapter 4