DOCSLIB.ORG

Unicast Multicast IP Multicast Introduction

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Unicast Multicast IP Multicast Introduction Outline 11: ❒ IP Multicast ❒ Multicast routing IP Multicast ❍ Design choices ❍ Distance Vector Multicast Routing Protocol (DVMRP) Last Modified: ❍ Core Based Trees (CBT) ❍ Protocol Independent Multicast (PIM) 4/9/2003 1:15:00 PM ❍ Border Gateway Multicast Protocol (BGMP) ❒ Issues in IP Multicast Deplyment Based on slides by Gordon Chaffee Berkeley Multimedia Research Center URL: http://bmrc.berkeley.edu/people/chaffee 4: Network Layer 4a-1 4: Network Layer 4a-2 What is multicast? Unicast ❒ ❒ 1 to N communication Problem Sender ❍ ❒ Nandwidth-conserving technology that Sending same data to reduces traffic by simultaneously many receivers via unicast is inefficient delivering a single stream of information to R multiple recipients ❒ Example ❒ Examples of Multicast ❍ Popular WWW sites ❍ Network hardware efficiently supports become serious multicast transport bottlenecks • Example: Ethernet allows one packet to be received by many hosts ❍ Many different protocols and service models • Examples: IETF IP Multicast, ATM Multipoint 4: Network Layer 4a-3 4: Network Layer 4a-4 Multicast IP Multicast Introduction ❒ Efficient one to many Sender ❒ Efficient one to many data distribution data distribution ❍ Tree style data distribution ❍ Packets traverse network links only once R ❒ Location independent addressing ❍ IP address per multicast group ❒ Receiver oriented service model ❍ Applications can join and leave multicast groups ❍ Senders do not know who is listening ❍ Similar to television model ❍ Contrasts with telephone network, ATM 4: Network Layer 4a-5 4: Network Layer 4a-6 1 IP Multicast Internet Group Management Protocol (IGMP) ❒ Service ❒ Protocol for managing group membership ❍ All senders send at the same time to the same ❍ IP hosts report multicast group memberships to group neighboring routers ❍ Receivers subscribe to any group ❍ Messages in IGMPv2 (RFC 2236) ❍ Routers find receivers • Membership Query (from routers) ❒ • Membership Report (from hosts) Unreliable delivery • Leave Group (from hosts) ❒ Reserved IP addresses ❒ Announce-Listen protocol with Suppression ❍ 224.0.0.0 to 239.255.255.255 reserved for ❍ Hosts respond only if no other hosts has multicast responded ❍ Static addresses for popular services (e.g. ❒ Session Announcement Protocol) Soft State protocol 4: Network Layer 4a-7 4: Network Layer 4a-8 IGMP Example (1) IGMP Example (2) MembershipLeave ReportGroup 1 3 1 3 Network 1 Network 2 Network 1 Network 2 Router Router 2 4 2 4 ❒ Host 3 joins conference ❍ Sends IGMP Membership Report message ❒ Host 1 begins sending packets ❒ Router begins forwarding packets onto Network 2 ❍ No IGMP messages sent ❒ Host 3 leaves conference ❍ Packets remain on Network 1 ❍ Sends IGMP Leave Group message ❒ Router periodically sends IGMP Membership Query ❍ Only sent if it was the last host to send an IGMP Membership Report message 4: Network Layer 4a-9 4: Network Layer 4a-10 Source Specific Filtering: IGMPv3 Multicast Routing Discussion ❒ Adds Source Filtering to group selection ❒ What is the problem? ❍ Receive packets only from specific source ❍ Need to find all receivers in a multicast group addresses ❍ Need to create spanning tree of receivers ❍ Receive packets from all but specific source ❒ Design goals addresses ❍ Minimize unwanted traffic ❒ Benefits ❍ Minimize router state ❍ Helps prevent denial of service attacks ❍ Scalability ❍ Better use of bandwidth ❍ Reliability ❒ Status: Internet Draft? 4: Network Layer 4a-11 4: Network Layer 4a-12 2 Data Flooding Reverse Path Forwarding (RPF) ❒ Send data to all nodes in network ❒ Simple technique for building trees ❒ Problem ❒ Send out all interfaces except the one with ❍ Need to prevent cycles the shortest path to the sender ❍ Need to send only once to all nodes in network ❍ Could keep track of every packet and check if it had ❒ In unicast routing, routers send to the previously visited node, but means too much state destination via the shortest path ❒ In multicast routing, routers send away R2 from the shortest path to the sender R1 R3 Sender 4: Network Layer 4a-13 4: Network Layer 4a-14 Reverse Path Forwarding Example Data Distribution Choices 1. Router R1 checks: Did the data Sender packet arrive on the interface ❒ with the shortest path to the Source rooted trees 2. Router R2 accepts packets Sender? Yes, so it accepts the ❍ sent from Router R1 because packet, duplicates it, and State in routers for each sender forwards the packet out all other that is the shortest path to the ❍ Sender. The packet gets sent interfaces except the interface Forms shortest path tree from each sender to out all interfaces. that is the shortest path to the R1 sender (i.e the interface the receivers packet arrived on). ❍ Minimal delays from sources to destinations Drop ❒ Shared trees 3. Router R2 drops R2 R3 packets that arrive from Drop ❍ All senders use the same distribution tree Router R3 because that is not the shortest path to ❍ State in routers only for wanted groups the sender. Avoids cycles. ❍ No per sender state (until IGMPv3) R4 R5 R6 R7 ❍ Greater latency for data distribution 4: Network Layer 4a-15 4: Network Layer 4a-16 Source Rooted vs Shared Trees Distance Vector Multicast Routing (DVMRP) Often does not use optimal path from ❒ Steve Deering, 1988 A A source to destination. ❒ Source rooted spanning trees ❍ Shortest path tree ❍ Minimal hops (latency) from source to receivers B C B C ❒ Extends basic distance vector routing ❒ Flood and prune algorithm ❍ Initial data sent to all nodes in network(!) using Reverse D D Path Forwarding Source Shared Tree Routers maintain ❍ Rooted Trees state for each sender Prunes remove unwanted branches in a group. Traffic is heavily ❍ concentrated on State in routers for all unwanted groups some links while ❍ Periodic flooding since prune state times out (soft state) others get little utilization. 4: Network Layer 4a-17 4: Network Layer 4a-18 3 DVMRP Algorithm Truncated Reverse Path Multicast Example Sender ❒ Truncated Reverse Path Multicast Router R2 accepts packets sent from ❍ Router R1 because that is the Optimized version of Reverse Path Forwarding shortest path to the Sender. ❍ Truncating Unlike Reverse Path Forwarding, • No packets sent onto leaf networks with no receivers which simply forwards out all but R1 the incoming interface, DVMRP’s ❍ Still how “truncated” is this? Reverse Path Multicast maintains a list of child links for each sender. It ❒ sends packets only out child links, Pruning not parent or sibling links. This Siblings ❍ means Router R2 will not forward R2 R3 Prune messages sent if no downstream receivers data from the Sender to Router R3. ❍ State maintained for each unwanted group ❒ Grafting ❍ On join or graft, remove prune state and propagate graft R4 R5 R6 R7 message Receiver Truncation: no packets forwarded onto leaf networks with no receivers 4: Network Layer 4a-19 4: Network Layer 4a-20 DVMRP Pruning Example DVMRP Grafting Example Sender Sender R1 R1 Prune Graft Join from Receiver 2 causes router to remove R2 R3 R2 R3 its prune state and send a Join message up Prune State toward the Sender. Prune Prune Prune Graft R4 R5 R6 R7 R4 R5 R6 R7 Receiver 2 joins Receiver Receiver 1 multicast Membership group Report 4: Network Layer 4a-21 Receiver4: Network 2 Layer 4a-22 DVMRP Problems Core Based Trees (CBT) ❒ State maintained for unwanted groups ❒ Attributes ❒ Bandwidth intensive ❍ Single shared tree per group => sparse trees ❍ Periodic data flooding per group ❍ Large number of senders • No explicit joins, and prune state times out ❍ Routing tables scale well, size = O(Groups) ❍ Not suitable for heterogeneous networks ❍ Bi-directional tree ❒ Poorly handles large number of senders ❍ Scaling = O(Senders, Groups) ❒ Problems of distance vector routing ❍ slow convergence ❍ cycles due to lack of global knowledge 4: Network Layer 4a-23 4: Network Layer 4a-24 4 Group Management in CBT Sending Data in CBT (1) Core Case 1: Sender is a member Core Join Ack of the multicast group, and the first hop router is on the Ack R R shared tree. R R Join R R R4 R R R4 Ack Ack Join Join Sender R1 R R2 R3 R R1 R R2 R3 R5 2. Receiver 2 also joins the multicast Packets from the Sender are 1. Receiver 1 joins the multicast group, causing Router R3 to join the propagated by routers on the group, causing Router R2 to join the shared tree by sending a Join shared tree by sending out all shared tree by sending a Join message toward the Core. Router interfaces that are branches of message toward the Core. The Core R4 is already part of the shared the tree except the interface the sends an explicit ACK back to to Receiver 1 Receiver 2 tree, so it adds R3 to the shared tree Receiver 1 Receiver 2 packet arrived on. Router R2. and sends back an ACK. 4: Network Layer 4a-25 4: Network Layer 4a-26 Sending Data in CBT (2) Protocol Independent Multicast (PIM) 2. The Core decapsulates the encapsulated packets, and it Case 2: Sender is not a Core distributes them out the shared ❒ member of the multicast tree. Uses unicast routing table for topology group, and the first hop ❒ router is not on the shared R R Dense mode (PIM-DM) tree. ❍ For groups with many receivers in local/global region R R R4 ❍ Encapsulated Like DVMRP, a flood and prune algorithm Data Packet ❒ Sparse mode (PIM-SM) Receiver ❍ R1 R R2 R3 R5 For groups with few widely distributed receivers Sender 1. Router R1 is not on the shared ❍ tree, so it does an IP-in-IP Builds shared tree per group, but may construct encapsulation of packets from the source rooted tree for efficiency Sender, and it unicasts the encapsulated packets to the Core. ❍ Explicit join Receiver Receiver 4: Network Layer 4a-27 4: Network Layer 4a-28 PIM Sparse Mode Group Management in PIM-SM Rendezvous Point ❒ Hybrid protocol that combines features of RP DVMRP and CBT Join R R ❒ Suited to widely distributed, heterogeneous networks Join R R R ❒ Shared tree centered at Rendezvous Point (RP) Join ❒ Shared tree introduces sources to receivers DR1 R DR2 R R ❒ Source specific trees for heavy traffic flows 1.
Load more

Recommended publications
  • 15-744: Computer Networking Multicast Routing Example Applications Overview
    Multicast Routing • Unicast: one source to one destination • Multicast: one source to many destinations 15-744: Computer Networking • Two main functions: • Efficient data distribution • Logical naming of a group L-20 Multicast 2 Example Applications Overview • Broadcast audio/video • IP Multicast Service Basics • Push-based systems • Software distribution • Multicast Routing Basics • Web-cache updates • Teleconferencing (audio, video, shared • Overlay Multicast whiteboard, text editor) • Multi-player games • Reliability • Server/service location • Other distributed applications • Congestion Control 3 4 1 IP Multicast Architecture Multicast – Efficient Data Distribution Src Src Service model Hosts Host-to-router protocol (IGMP) Routers Multicast routing protocols (various) 5 6 Multicast Router Responsibilities IP Multicast Service Model (rfc1112) • Learn of the existence of multicast groups • Each group identified by a single IP address (through advertisement) • Groups may be of any size • Identify links with group members • Members of groups may be located anywhere in the Internet • Establish state to route packets • Members of groups can join and leave at will • Replicate packets on appropriate interfaces • Senders need not be members • Routing entry: • Group membership not known explicitly • Analogy: Src, incoming interface List of outgoing interfaces • Each multicast address is like a radio frequency, on which anyone can transmit, and to which anyone can tune-in. 7 8 2 IP Multicast Addresses Multicast Scope Control – Small TTLs • Class
    [Show full text]
  • IP Multicast Routing Technology Overview
    IP Multicast Routing Technology Overview • Information About IP Multicast Technology, on page 1 • Additional References for IP Multicast, on page 15 Information About IP Multicast Technology This section provides information about IP multicast technology. About IP Multicast Controlling the transmission rate to a multicast group is not supported. At one end of the IP communication spectrum is IP unicast, where a source IP host sends packets to a specific destination IP host. In IP unicast, the destination address in the IP packet is the address of a single, unique host in the IP network. These IP packets are forwarded across the network from the source to the destination host by devices. At each point on the path between source and destination, a device uses a unicast routing table to make unicast forwarding decisions, based on the IP destination address in the packet. At the other end of the IP communication spectrum is an IP broadcast, where a source host sends packets to all hosts on a network segment. The destination address of an IP broadcast packet has the host portion of the destination IP address set to all ones and the network portion set to the address of the subnet. IP hosts, including devices, understand that packets, which contain an IP broadcast address as the destination address, are addressed to all IP hosts on the subnet. Unless specifically configured otherwise, devices do not forward IP broadcast packets, so IP broadcast communication is normally limited to a local subnet. IP multicasting falls between IP unicast and IP broadcast communication. IP multicast communication enables a host to send IP packets to a group of hosts anywhere within the IP network.
    [Show full text]
  • Empirical Analysis of the Effects and the Mitigation of Ipv4 Address Exhaustion
    TECHNISCHE UNIVERSITÄT BERLIN FAKULTÄT FÜR ELEKTROTECHNIK UND INFORMATIK LEHRSTUHL FÜR INTELLIGENTE NETZE UND MANAGEMENT VERTEILTER SYSTEME Empirical Analysis of the Effects and the Mitigation of IPv4 Address Exhaustion vorgelegt von M.Sc. Philipp Richter geboren in Berlin von der Fakultät IV – Elektrotechnik und Informatik der Technischen Universität Berlin zur Erlangung des akademischen Grades DOKTOR DER NATURWISSENSCHAFTEN -DR. RER. NAT.- genehmigte Dissertation Promotionsausschuss: Vorsitzender: Prof. Dr.-Ing. Sebastian Möller, Technische Universität Berlin Gutachterin: Prof. Anja Feldmann, Ph.D., Technische Universität Berlin Gutachter: Prof. Vern Paxson, Ph.D., University of California, Berkeley Gutachter: Prof. Steve Uhlig, Ph.D., Queen Mary University of London Tag der wissenschaftlichen Aussprache: 2. August 2017 Berlin 2017 Abstract IP addresses are essential resources for communication over the Internet. In IP version 4, an address is represented by 32 bits in the IPv4 header; hence there is a finite pool of roughly 4B addresses available. The Internet now faces a fundamental resource scarcity problem: The exhaustion of the available IPv4 address space. In 2011, the Internet Assigned Numbers Authority (IANA) depleted its pool of available IPv4 addresses. IPv4 scarcity is now reality. In the subsequent years, IPv4 address scarcity has started to put substantial economic pressure on the networks that form the Internet. The pools of available IPv4 addresses are mostly depleted and today network operators have to find new ways to satisfy their ongoing demand for IPv4 addresses. Mitigating IPv4 scarcity is not optional, but mandatory: Networks facing address shortage have to take action in order to be able to accommodate additional subscribers and customers. Thus, if not confronted, IPv4 scarcity has the potential to hinder further growth of the Internet.
    [Show full text]
  • 74 Network Addressin
    CSC414 Communication Models Computer Network Client/Server Model System - Server Program Fundamentals Addressing - Runs on computer that has files to be shared - Web Server, Mail Server, Warcraft Server Server Client - Client Program Apache Firefox - Computer that needs to access remote files - Web Browser, Mail Client, World of Warcraft Digital Forensics Center Department of Computer Science and Statics THINK BIG WE DO Peer to Peer Model - Single program U R I - makes files on computer available Peer Peer http://www.forensics.cs.uri.edu - accesses remote files LimeWire LimeWire Addressing Data Domain Names http://www.uri.edu:80/courses/cs/index.html Hierarchical system for name creation and registration protocol computer directory file - Created so users would not have to memorize IP addresses address port - Global domain name system provides global scope for user friendly addresses OSI Model Domain Name Application Layer Country Codes Country Domain Type Common .us United States .biz Business File requested by client Presentation Layer Top Level .uk United Kingdom .com Commercial .au Australia .edu US Educational Folder or directory path on server Session Layer Maps to special directory used by Port Domains .cn China .gov US Government application .mil Military Transport Layer .ca Canada Mailbox on the machine the .de Germany .net Network server or peer is checking Top level Network Layer .org Nonprofit Organization IP Address (Logical) domains are .ru Russia What machine has the shared data .info Info Domain approved by .in India Where
    [Show full text]
  • AX1800 Wifi 6 Router Model RAX15
    User Manual AX1800 WiFi 6 Router Model RAX15 NETGEAR, Inc. August 2021 350 E. Plumeria Drive 202-12029-02 San Jose, CA 95134, USA AX1800 WiFi 6 Router Support and Community Visit netgear.com/support to get your questions answered and access the latest downloads. You can also check out our NETGEAR Community for helpful advice at community.netgear.com. Regulatory and Legal Si ce produit est vendu au Canada, vous pouvez accéder à ce document en français canadien à https://www.netgear.com/support/download/. (If this product is sold in Canada, you can access this document in Canadian French at https://www.netgear.com/support/download/.) For regulatory compliance information including the EU Declaration of Conformity, visit https://www.netgear.com/about/regulatory/. See the regulatory compliance document before connecting the power supply. For NETGEAR’s Privacy Policy, visit https://www.netgear.com/about/privacy-policy. By using this device, you are agreeing to NETGEAR’s Terms and Conditions at https://www.netgear.com/about/terms-and-conditions. If you do not agree, return the device to your place of purchase within your return period. Trademarks ©NETGEAR, Inc. NETGEAR and the NETGEAR Logo are trademarks of NETGEAR, Inc. Any non-NETGEAR trademarks are used for reference purposes only. 2 Contents Chapter 1 Hardware Setup Unpack your router...............................................................................9 Front panel LEDs and buttons..........................................................10 Rear panel and side panel.................................................................12
    [Show full text]
  • WAN-LAN PIM Multicast Routing and LAN IGMP FEATURE OVERVIEW and CONFIGURATION GUIDE
    Technical Guide WAN-LAN PIM Multicast Routing and LAN IGMP FEATURE OVERVIEW AND CONFIGURATION GUIDE Introduction This guide describes WAN-LAN PIM Multicast Routing and IGMP on the LAN and how to configure WAN-LAN PIM multicast routing and LAN IGMP snooping. The AlliedTelesis Next Generation Firewalls (NGFWs) can perform routing of IPv4 and IPv6 multicast, using PIM-SM and PIM-DM. Also, switching interfaces of the NGFWs are IGMP aware, and will only forward multicast steams to these switch ports that have received reports. IGMP snooping allows a device to only forward multicast streams to the links on which they have been requested. PIM Sparse mode requires specific designated routers to receive notification of all streams destined to specific ranges of multicast addresses. When a router needs to get hold of a given group, it sends a request to the designated Rendezvous Point for that group. If there is a source in the network that is transmitting a stream to this group, then the Rendezvous Point will be receiving it, and will forward it to the requesting router. C613-22042-00 REV A alliedtelesis.com x Products and software version that apply to this guide Contents Introduction.............................................................................................................................................................................1 Products and software version that apply to this guide .......................................................................2 Configuring WAN-LAN PIM Multicast Routing and LAN IGMP Snooping........................................3
    [Show full text]
  • Routing Review Autonomous System Concept
    Routing Review Autonomous System Concept • Term Autonomous System (AS) to specify groups of routers • One can think of an AS as a contiguous set of networks and routers all under control of one administrative authority – For example, an AS can correspond to an ISP, an entire corporation, or a university – Alternatively, a large organization with multiple sites may choose to define one AS for each site – In particular, each ISP is usually a single AS, but it is possible for a large ISP to divide itself into multiple ASs • The choice of AS size can be made for – economic, technical, or administrative reasons The Two Types of Internet Routing Protocols • All Internet routing protocols are divided into two major categories: – Interior Gateway Protocols (IGPs) – Exterior Gateway Protocols (EGPs) • After defining the two categories – we will examine a set of example routing protocols that illustrate each category • Interior Gateway Protocols (IGPs) • Exterior Gateway Protocols (EGPs) The Two Types of Internet Routing Protocols Interior Gateway Protocols (IGPs) • Routers within an AS use an IGP exchange routing information • Several IGPs are available – each AS is free to choose its own IGP • Usually, an IGP is easy to install and operate • IGP may limit the size or routing complexity of an AS The Two Types of Internet Routing Protocols Exterior Gateway Protocols (EGPs) • A router in one AS uses an EGP to exchange routing information with a router in another AS • EGPs are more complex to install and operate than IGPs – but EGPs offer more flexibility
    [Show full text]
  • Broadcast and Multicast Routing
    Broadcast and Multicast Routing Daniel Zappala CS 460 Computer Networking Brigham Young University Broadcast Multicast Service Model DVMRP CBT PIM Status Group Communication • How can the Internet provide efficient group communication? • send the same copy of a data stream (e.g. TV show, teleconference) to a group of users • need to find where everyone is located (routing) • need to avoid sending a separate copy to everyone 2/34 Broadcast Multicast Service Model DVMRP CBT PIM Status Choices • unicast: send a separate copy of each packet to each host • broadcast: send one copy of each packet, the network will replicate it and deliver it to all hosts • broadcast provides efficient network flooding • multicast: send one copy of each packet, the network will replicate it and deliver it to only those hosts that want it • multicast provides efficient group communication 3/34 Broadcast Broadcast Multicast Service Model DVMRP CBT PIM Status Broadcast • send a copy of each packet to all your neighbors • need to eliminate duplicates • sequence numbers: drop a sequence number previously seen • reverse path forwarding: accept the packet only on the incoming interface used to send packets to the source 5/34 Broadcast Multicast Service Model DVMRP CBT PIM Status Spanning and Steiner Trees • spanning tree • connect all routers in the entire Internet • easy to build a minimum cost tree • Steiner Tree • connect only those routers with multicast members for a particular group • NP-complete (one of the original 21!) • many different heuristics, but often centralized
    [Show full text]
  • Introduction to IP Multicast Routing
    Introduction to IP Multicast Routing by Chuck Semeria and Tom Maufer Abstract The first part of this paper describes the benefits of multicasting, the Multicast Backbone (MBONE), Class D addressing, and the operation of the Internet Group Management Protocol (IGMP). The second section explores a number of different algorithms that may potentially be employed by multicast routing protocols: - Flooding - Spanning Trees - Reverse Path Broadcasting (RPB) - Truncated Reverse Path Broadcasting (TRPB) - Reverse Path Multicasting (RPM) - Core-Based Trees The third part contains the main body of the paper. It describes how the previous algorithms are implemented in multicast routing protocols available today. - Distance Vector Multicast Routing Protocol (DVMRP) - Multicast OSPF (MOSPF) - Protocol-Independent Multicast (PIM) Introduction There are three fundamental types of IPv4 addresses: unicast, broadcast, and multicast. A unicast address is designed to transmit a packet to a single destination. A broadcast address is used to send a datagram to an entire subnetwork. A multicast address is designed to enable the delivery of datagrams to a set of hosts that have been configured as members of a multicast group in various scattered subnetworks. Multicasting is not connection oriented. A multicast datagram is delivered to destination group members with the same “best-effort” reliability as a standard unicast IP datagram. This means that a multicast datagram is not guaranteed to reach all members of the group, or arrive in the same order relative to the transmission of other packets. The only difference between a multicast IP packet and a unicast IP packet is the presence of a “group address” in the Destination Address field of the IP header.
    [Show full text]
  • Advanced Network Training Multicast Larry Mathews Systems Engineer [email protected] Training Objectives
    Division of Brocade Advanced Network Training Multicast Larry Mathews Systems Engineer [email protected] Training Objectives ‒ Session will concentrate on Multicast with emphasis on Protocol Independent Multicast Protocol (PIM) ‒ Multicast in a ITS environment will be emphasized ‒ Attendees will have a good understanding on how multicast works ‒ Primary focus is on technology not vendor specifics 2 Agenda ‒ Multicast Overview • What is a multicast • Why use it • Multicast elements • Multicast IPv4 addressing ‒ Internet Group Management Protocol (IGMP) Overview • Where and why is IGMP used • IGMP packet structure • IGMPv2 vs. IGMPv3 • How does IGMP work ‒ Protocol Independent Multicast Protocol Overview • Layer 2 vs Layer 3 protocols • Where does PIM function • PIM-Dense Mode (DM) vs PIM-Sparse Mode (SM) • PIM-Source Specific Multicast (SSM) overview 3 Agenda Continued ‒ Protocol Independent Multicast (PIM) Protocol Operation • PIM components • Reverse Path Forwarding (RPF) – Multicast vs Unicast routing • PIM packet formats ‒ Demonstration of Router configuration and operation • Best practice • Configuration requirements • Demonstration of successful PIM operation ‒ Diagnostics and Troubleshooting • Multicast packet capture • Using command line to identify issues 4 Multicast Overview 5 What is a Multicast ‒ In computer networking, multicast is a one-to-many or many-to-many distribution ‒ M/C is group communication where information is addressed to a group of destination computers simultaneously. ‒ IP multicast is a technique for one-to-many
    [Show full text]
  • Understand Ipv4
    LESSON 3.2 98-366 Networking Fundamentals UnderstandUnderstand IPv4IPv4 LESSON 3.2 98-366 Networking Fundamentals Lesson Overview In this lesson, you will learn about: APIPA addressing classful IP addressing and classless IP addressing gateway IPv4 local loopback IP NAT network classes reserved address ranges for local use subnetting static IP LESSON 3.2 98-366 Networking Fundamentals Anticipatory Set 1. Write the address range and broadcast address for the following subnet: Subnet: 192.168.1.128 / 255.255.255.224 Address Range? Subnet Broadcast Address? 2. Check your answer with those provided by the instructor. If it is different, review the method of how you derived the answer with your group and correct your understanding. LESSON 3.2 98-366 Networking Fundamentals IPv4 A connectionless protocol for use on packet-switched Link Layer networks like the Ethernet At the core of standards-based internetworking methods of the Internet Network addressing architecture redesign is underway via classful network design, Classless Inter-Domain Routing, and network address translation (NAT) . Microsoft Windows uses TCP/IP for IP version 4 (a networking protocol suite) to communicate over the Internet with other computers. It interacts with Windows naming services like WINS and security technologies. IPsec helps facilitate the successful and secure transfer of IP packets between computers. An IPv4 address shortage has been developing. LESSON 3.2 98-366 Networking Fundamentals Network Classes Provide a method for interacting with the network All networks have different sizes so IP address space is divided in different classes to meet different requirements. Each class fixes a boundary between the network prefix and the host within the 32-bit address.
    [Show full text]
  • Chapter 4 Network Layer
    Chapter 4 Network Layer A note on the use of these ppt slides: We’re making these slides freely available to all (faculty, students, readers). Computer They’re in PowerPoint form so you see the animations; and can add, modify, and delete slides (including this one) and slide content to suit your needs. Networking: A Top They obviously represent a lot of work on our part. In return for use, we only ask the following: Down Approach v If you use these slides (e.g., in a class) that you mention their source th (after all, we’d like people to use our book!) 6 edition v If you post any slides on a www site, that you note that they are adapted Jim Kurose, Keith Ross from (or perhaps identical to) our slides, and note our copyright of this Addison-Wesley material. March 2012 Thanks and enjoy! JFK/KWR All material copyright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved Network Layer 4-1 Chapter 4: outline 4.1 introduction 4.5 routing algorithms 4.2 virtual circuit and § link state datagram networks § distance vector 4.3 what’s inside a router § hierarchical routing 4.4 IP: Internet Protocol 4.6 routing in the Internet § datagram format § RIP § IPv4 addressing § OSPF § BGP § ICMP § IPv6 4.7 broadcast and multicast routing Network Layer 4-2 Interplay between routing, forwarding routing algorithm determines routing algorithm end-end-path through network forwarding table determines local forwarding table local forwarding at this router dest address output link address-range 1 3 address-range 2 2 address-range 3 2 address-range 4 1 IP destination
    [Show full text]