Traffic-Engineered Distribution of Multimedia Content

Total Page:16

File Type:pdf, Size:1020Kb

Traffic-Engineered Distribution of Multimedia Content Traffic-Engineered Distribution of Multimedia Content by Khaled Diab B.Sc., Cairo University, 2011 Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in the School of Computing Science Faculty of Applied Science c Khaled Diab 2019 SIMON FRASER UNIVERSITY Summer 2019 Copyright in this work rests with the author. Please ensure that any reproduction or re-use is done in accordance with the relevant national copyright legislation. Approval Name: Khaled Diab Degree: Doctor of Philosophy Title: Traffic-Engineered Distribution of Multimedia Content Examining Committee: Chair: Steven Bergner University Research Associate Mohamed Hefeeda Senior Supervisor Professor Jiangchuan Liu Supervisor Professor Shervin Shirmohammadi Internal Examiner Adjunct Professor Mostafa Ammar External Examiner Professor School of Computer Science Georgia Institute of Technology Date Defended: 15 August, 2019 ii Abstract The amount of video traffic transmitted over the Internet has been steadily increasing over the past decade. This is due to the recent interest in streaming high-definition (HD), 4K, and immersive videos to many users. Streaming such multimedia content at large scale faces multiple challenges. For example, streaming systems need to handle users heterogeneity and interactivities in varying network conditions. In addition, large-scale video streaming stresses the ISP network that carries the video traffic, because the ISP needs to carefully direct traffic flows through its network to sat- isfy various service level agreements. This increases the complexity of managing the network and system resources. To address these challenges, we first propose a novel client-based rate adapta- tion algorithm for streaming multiview videos. Our algorithm achieves high video quality, smooth playback and efficient bandwidth utilization. For example, it achieves up to 300% improvement in the average quality compared to the algorithm used by YouTube. Then, we propose an algorithm to efficiently solve the resource management problem in the emerging ISP-managed Content Dis- tribution Networks (CDNs). Our solution achieves up to 64% reduction in the inter-domain traffic. To reduce the network load of live streaming sessions, ISPs use multicast to efficiently carry the traffic through their networks. Finally, we propose a label-based multicast forwarding approach to implement traffic-engineered multicast trees in ISP networks. We prove that the proposed approach is scalable as it imposes minimal state and processing overheads on routers. We implemented the proposed multicast approach in a high-speed network testbed, and our results show that it can sup- port thousands of concurrent multicast sessions. Keywords: Multi-view videos; adaptive video streaming; traffic engineering; telco-CDNs; multi- cast forwarding; efficient data planes. iii To Dina, Jana, and my parents and brothers. To my cousin Hazem. iv Acknowledgements I would like to express my sincere gratitude to my senior supervisor, Dr. Mohamed Hefeeda. When I met him in 2012, I only had a good knowledge in computer science and a mere interest in sys- tems and networking. Ever since this moment, Dr. Hefeeda has been pushing my limits to gain the research skills to be a successful scientist. His continuous support, critical reviews and scientific knowledge as well as devotion and enthusiasm to research have contributed greatly to this thesis. I will be always indebted to Dr. Hefeeda. I would like to express my gratitude to Dr. Jiangchuan Liu, my supervisor, for his valuable comments and discussions whenever I needed them. My thanks go to Dr. Shervin Shirmohammadi, my internal examiner, and Dr. Mostafa Ammar, my external examiner, for being on my committee and reviewing the thesis. I would like as well to thank Dr. Steven Bergner for taking the time to chair my thesis defense. I would like to thank my colleagues at the Network Systems Lab who made this journey pleas- ant. Special thanks go to Dr. Joseph Peters, Ahmed Hamza, Kiana Calagari, Saleh Almowuena, Alaa Eldin Abdelaal, Omar Eltobgy, Omar Arafa, Mohammad Amin Arab, and Mohamed Hegazy. In addition, I am grateful for the help of all collaborators since I started my research. I am espe- cially grateful to Mustafa Rafique for his valuable insights and discussions. I also like to thank the administrative and technical staff at the School of Computing Science for their help and support. My special thanks go to Lee Greenough, Johnny Zhang, Dana Brand, Stephen Nix, Chingtai Wong, Allison MacKinnon and Clare McKenna. More importantly, I cannot find the right words to express my heartfelt gratitude to my parents and wife. I would like to thank my wonderful parents for their endless love and support throughout my life. I will be always grateful to my amazing wife, Dina, who has been supporting me to pursue my life and career goals. She has immersed me with her eternal love, support, and encouragement. This thesis would not have been possible without the support of my family. v Bibliographic Notes Publications: 1. Khaled Diab and Mohamed Hefeeda. Joint content distribution and traffic engineering of adaptive videos in telco-CDNs. In Proc. of IEEE INFOCOM’19, Paris, France, April 2019. 2. Khaled Diab and Mohamed Hefeeda. MASH: A rate adaptation algorithm for multiview video streaming over HTTP. In Proc. of IEEE INFOCOM’17, Atlanta, GA, May 2017. 3. Khaled Diab and Mohamed Hefeeda. Efficient multicast forwarding. 2019. (Under submis- sion). 4. Khaled Diab and Mohamed Hefeeda. STEM: stateless traffic-engineered multicast forward- ing. 2019. (Under submission). 5. Mohamed Hegazy, Khaled Diab, Mehdi Saeedi, Boris Ivanovic, Ihab Amer, Yang Liu, Gabor Sines, and Mohamed Hefeeda. Content-aware video encoding for cloud gaming. In Proc. of ACM MMSys’19, Amherst, MA, June 2019. 6. Kiana Calagari, Tarek Elgamal, Khaled Diab, Krzysztof Templin, Piotr Didyk, Wojciech Matusik, and Mohamed Hefeeda. Depth personalization and streaming of stereoscopic sports videos. ACM Trans. on Multimedia Comput. Commun. Appl. (TOMM), vol. 12, no. 3, pp. 41:1–41:23, March 2016. 7. Kiana Calagari, Krzysztof Templin, Tarek Elgamal, Khaled Diab, Piotr Didyk, Wojciech Matusik, and Mohamed Hefeeda. Anahita: A system for 3d video streaming with depth cus- tomization. In Proc. of ACM MM’14, Orlando, Fl, November 2014. 8. Khaled Diab, Tarek Elgamal, Kiana Calagari, and Mohamed Hefeeda. Storage optimization for 3D streaming systems. In Proc. of ACM MMSys’14, Singapore, Singapore, March 2014. 9. Khaled Diab, M. Mustafa Rafique, and Mohamed Hefeeda. Dynamic sharing of GPUs in cloud systems. In Proc. of IEEE IPDPS Workshops’13, Cambridge, MA, May 2013. vi Table of Contents Approval ii Abstract iii Dedication iv Acknowledgements v Bibliographic Notes vi Table of Contents vii List of Tables x List of Figures xi 1 Introduction 1 1.1 Overview . 1 1.2 Thesis Contributions . 3 1.2.1 Adaptive Multiview Video Streaming over HTTP . 3 1.2.2 Joint Content Distribution and Traffic Engineering in Telco-CDNs . 4 1.2.3 Traffic-Engineered Multicast Forwarding . 5 1.3 Thesis Organization . 9 2 Background 10 2.1 Introduction . 10 2.2 Adaptive Video Streaming . 11 2.2.1 History of Video Streaming . 11 2.2.2 HTTP Adaptive Streaming . 11 2.2.3 Immersive Multimedia Content . 12 2.2.4 Quality of Experience (QoE) in HAS Systems . 13 2.3 Rate Adaptation Algorithms . 15 2.3.1 Single-view Videos . 15 2.3.2 Immersive Videos . 19 vii 2.4 Content Distribution Networks (CDNs) . 21 2.4.1 Challenges of CDNs . 22 2.4.2 Collaboration Space in CDNs . 23 2.5 Multicast Systems . 26 2.5.1 Application-layer Multicast . 26 2.5.2 Network-based Multicast . 27 3 MASH: A Rate Adaptation Algorithm for Multiview Video Streaming over HTTP 30 3.1 Introduction . 30 3.2 Related Work . 32 3.3 Overview . 33 3.4 View Switching Models . 34 3.5 Details of MASH . 36 3.6 Analysis and Overheads of MASH . 38 3.7 Evaluation . 39 3.7.1 Experimental Setup . 40 3.7.2 MASH vs. YouTube Multiview Rate Adaptation . 41 3.7.3 Fairness and Comparisons vs. others . 44 3.8 Summary . 46 4 Joint Content Distribution and Traffic Engineering of Adaptive Videos in Telco-CDNs 48 4.1 Introduction . 48 4.2 Related Work . 50 4.3 System Models and Problem Definition . 51 4.3.1 Multimedia Content Model . 51 4.3.2 Telco-CDN Model . 53 4.3.3 Problem Definition . 53 4.4 Overview of CAD . 54 4.5 Details of CAD . 55 4.6 Evaluation . 59 4.6.1 Implementation . 59 4.6.2 Experimental Setup . 60 4.6.3 Results . 63 4.7 Summary . 68 5 Stateless Traffic-Engineered Multicast Forwarding 69 5.1 Introduction . 69 5.2 Related Work . 71 5.3 System Model and Problem Definition . 73 5.4 Proposed STEM System . 74 viii 5.4.1 Overview . 74 5.4.2 Label Types in STEM . 75 5.4.3 Creating STEM Labels at the Controller . 77 5.4.4 Processing STEM Packets in the Data Plane . 80 5.4.5 Efficiency and Generality Analysis of STEM . 82 5.4.6 Illustrative Example . 83 5.5 Evaluation in a Testbed . 84 5.5.1 Testbed Setup . 85 5.5.2 Results . 86 5.6 Evaluation using Simulation . 87 5.6.1 Simulation Setup . 87 5.6.2 Results . 89 5.7 Summary . 93 6 Helix: Efficient Multicast Forwarding 94 6.1 Introduction . 94 6.2 Proposed Helix System . 95 6.2.1 Overview . 95 6.2.2 Creating Labels . 97 6.2.3 Processing Labeled Packets . 103 6.2.4 Illustrative Example . 105 6.3 Evaluation in NetFPGA Testbed . 107 6.3.1 Testbed Setup and Algorithm Implementation . 107 6.3.2 Results . 109 6.4 Evaluation using Simulation . 111 6.4.1 Setup . ..
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]
  • 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]
  • 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
    [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]
  • 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]
  • Junos Multicast Routing (JMR)
    Junos Multicast Routing (JMR) Junos Multicast Routing (JMR) Engineering Simplicity COURSE LEVEL COURSE OVERVIEW Junos Multicast Routing (JMR) is an advanced-level This two-day course is designed to provide students with detailed coverage of multicast course. protocols including Internet Group Management Protocol (IGMP), Protocol Independent Multicast-Dense Mode (PIM-DM), Protocol Independent Multicast-Sparse Mode (PIM- SM), Bidirectional PIM, and Multicast Source Discovery Protocol (MSDP). AUDIENCE Through demonstrations and hands-on labs, students will gain experience in configuring and monitoring the Junos OS and monitoring device and protocol This course benefits individuals responsible for implementing, monitoring, and troubleshooting operations. This course utilizes Juniper Networks vMX Series devices for the hands-on multicast components in a service provider’s component, but the lab environment does not preclude the course from being applicable to other Juniper hardware platforms running the Junos OS. The Juniper Networks vMX network. Series devices run Junos OS Release 16.2R1.6. PREREQUISITES Students should have basic networking knowledge OBJECTIVES and an understanding of the Open Systems • Describe IP multicast traffic flow. Interconnection (OSI) model and the TCP/IP • Identify the components of IP multicast. protocol suite. Students should also have working knowledge of security policies. • Explain how IP multicast addressing works. • Describe the need for reverse path forwarding (RPF) in multicast. Students should also attend the Introduction to the • Explain the role of IGMP and describe the available IGMP versions. Junos Operating System (IJOS) and Junos • Configure and monitor IGMP. Intermediate Routing (JIR) courses prior to • Identify common multicast routing protocols. attending this class. • Explain the differences between dense-mode and sparse-mode protocols.
    [Show full text]
  • Broadcast Routing Broadcasting: Sending a Packet to All N Receivers
    Broadcast Routing Broadcasting: sending a packet to all N receivers . routing updates in LS routing . service/request advertisement in application layer (e.g., Novell) Broadcast algorithm 1: N point-to-point sends . send packet to every destination, point-to-point . wasteful of bandwidth . requires knowledge of all destinations Broadcast algorithm 2: flooding . when node receives a broadcast packet, send it out on every link . node may receive many copies of broadcast packet, hence must be able to detect duplicates Broadcast Routing: Reverse Path Forwarding Goal: avoid flooding duplicates Assumptions: . A wants to broadcast . all nodes know predecessor node on shortest path back to A Reverse path forwarding: if node receives a broadcast packet . if packet arrived on predecessor on shortest path to A, then flood to all neighbors . otherwise ignore broadcast packet - either already arrived, or will arrive from predecessor 1 Reverse Path Forwarding . flood if packet arrives from source on link that router would use to send packets to source . otherwise discard . rule avoids flooding loops . uses shortest path tree from destinations to source (reverse tree) routing table to use S y x S to group w y z 2 Distributing routing information Q: is broadcast algorithm like reverse path forwarding good for distributing Link State updates (in LS routing)? A: First try (at LS broadcast distribution): . each router keeps a copy of most recent LS packet (LSP) received from every other node . upon receiving LSP(R) from router R: ◆ if LSP(R) not identical to stored copy then store LSP(R), update LS info for R, and flood LSP(R) else ignore duplicate How can this protocol fail? 2nd Try (at LS Broadcast Distribution) Each router puts a sequence number on its LSP's .
    [Show full text]
  • Vmware Virtual SAN Layer 2 and Layer 3 Network Topologies Deployments
    VMware Virtual SAN Layer 2 and Layer 3 Network Topologies Deployments Multicast Groups on the Layer 3 segment where the receiver is connected. This allows the switch to keep a table of the individual receivers that need a copy of the Multicast Group traffic. The participating hosts in a Virtual SAN cluster will negotiate for IGMP version 3. If the network does not support IGMP version 3, the hosts will fall back to IGMP version 2. VMware recommends that the same version of IGMP be used in all Layer 3 segments. Protocol-Independent Multicast (PIM) Protocol-Independent Multicast (PIM) is a family of Layer 3 multicast routing protocols that provide different communication techniques for IP Multicast traffic to reach receivers that are in different Layer 3 segments from the Multicast Groups sources. There are different versions of PIM, each of which is best suited for different IP Multicast topologies. The main four versions of PIM are these: • PIM Dense Mode (PIM-DM) – Dense Mode works by building a unidirectional shortest-path tree from each Multicast Groups source to the Multicast Groups receivers, by flooding multicast traffic over the entire Layer 3 Network and then pruning back branches of the tree where no receivers are present. Dense Mode is straightforward to implement and it is best suited for small Multicast deployments of one-to-many. • PIM Sparse Mode (PIM-SM) – Sparse Mode avoids the flooding issues of Dense Mode by assigning a root entity for the unidirectional Multicast Groups shortest-path tree called a rendezvous point (RP). The rendezvous point is selected in a per Multicast Group basis.
    [Show full text]