Many-to-Many Communications in HyperCast
|
|
- Cameron Fox
- 6 years ago
- Views:
Transcription
1 Many-to-Many Communications in HyperCast Jorg Liebeherr University of Virginia Jörg Liebeherr, 2001
2 HyperCast Project HyperCast is a set of protocols for large-scale overlay multicasting and peer-to-peer networking Motivating Research Problems: How to organize thousands of applications in a virtual overlay network? How to do multicasting in very large overlay networks?
3 Acknowledgements Team: Past: Bhupinder Sethi, Tyler Beam, Burton Filstrup, Mike Nahas, Dongwen Wang, Konrad Lorincz Current: Jean Ablutz, Weisheng Si, Haiyong Wang, Jianping Wang, Guimin Zhang This work is supported in part by the National Science Foundation: D E N A L I
4 Applications with many receivers 1,000,000 1, Number of Senders Collaboration Tools Games Distributed Information Systems Peer-to-Peer Applications Streaming Software Distribution 10 1,000 1,000,000 Number of Receivers
5 Need for Multicasting? Maintaining unicast connections is not feasible Infrastructure or services needs to support a send to group
6 Problem with Multicasting NAK NAK NAK NAK NAK Feedback Implosion: A node is overwhelmed with traffic or state One-to-many multicast with feedback (e.g., reliable multicast) Many-to-one multicast (Incast)
7 Multicast support in the network infrastructure (IP Multicast) Reality Check (after 10 years of IP Multicast): Deployment has encountered severe scalability limitations in both the size and number of groups that can be supported IP Multicast is still plagued with concerns pertaining to scalability, network management, deployment and support for error, flow and congestion control
8 Overlay Multicasting Logical overlay resides on top of the Layer-3 network Data is transmitted between neighbors in the overlay No network support needed Overlay topology should match the Layer-3 infrastructure
9 Overlay-based approaches for multicasting Build an overlay mesh network and embed trees into the mesh: Narada (CMU) RMX/Gossamer (UCB) many more Build a shared tree: Yallcast/Yoid (NTT, ACIRI) AMRoute (Telcordia, UMD College Park) Overcast (MIT) many more Build an overlay using a logical coordinate spaces : Chord (UCB, MIT) not used for multicast CAN (UCB, ACIRI)
10 HyperCast Approach Build overlay network as a graph with known properties N-dimensional (incomplete) hypercube Delaunay triangulation Advantages: Achieve good load-balancing Exploit symmetry Routing in the overlay comes for free Claim: Can improve scalability of multicast and peer-topeer networks by orders of magnitude over existing solutions
11 Hypercast Software Applications organize themselves to form a logical overlay network with a given topology No central control Dynamic membership hypercube Delaunay triangulation
12 Data Transfer Data is distributed neighborto-neighbor in the overlay network
13 HyperCast Software: Overlay Socket Protocol for transport services in Peer-to-Peer Networks Socket-based API Overlay Socket Interface Streams messages Different reliability semantics Implementation done in Java Statistics Interface OLSocket Overlay Node Interface Overlay Node Adapter Interface Application Transmit Buffer Forwarding Engine Adapter Interface Application Receive Buffer Message Store Network Adapter Network Adapter Software available from: Messages of the Overlay Protocol Application Messages
14 Nodes in a Plane 0,6 4,9 10,8 Nodes are are assigned x-y x-y coordinates (e.g., based on on geographic location) 0,3 0,2 0,1 0,0 1,0 2,0 3,0 5,2 12,0
15 Voronoi Regions 0,6 4,9 10,8 The The Voronoi region of of a node is is the the region of of the the plane that that is is closer to to this this node than than to to any any other node. 5,2 12,0
16 Delaunay Triangulation 0,6 4,9 10,8 The The Delaunay triangulation has has edges between nodes in in neighboring Voronoi regions. 5,2 12,0
17 Delaunay Triangulation 0,6 4,9 10,8 An An equivalent definition: A triangulation such that that each circumscribing circle of of a triangle formed by by three vertices, no no vertex of of is is in in the the interior of of the the circle. 5,2 12,0
18 Locally Equiangular Property Sibson 1977: Maximize the minimum angle C For every convex quadrilateral formed by triangles ACB and ABD that share a common edge AB, the minimum internal angle of triangles ACB and ABD is at least as large as the minimum internal angle of triangles ACD and CBD. A α D β B
19 Next-hop routing with Compass Routing A node s parent in a spanning tree is its neighbor which forms the smallest angle with the root. A node need only know information on its neighbors no routing protocol is needed for the overlay. A Root B is the Node s Parent B Node
20 4,9 10,8 Spanning tree tree when node (8,4) is is root. root. The The tree tree can can be be calculated by by both both parents and and children. 0,6 8,4 5,2 12,0
21 Problem with Delaunay Triangulations Delaunay triangulation considers location of nodes, but not the network topology 2 heuristics to achieve a better mapping Jörg Liebeherr, 2001 UNL, December 2001
22 Hierarchical Delaunay Triangulation 2-level hierarchy of Delaunay triangulations The node with the lowest x-coordinate in a domain DT is a member in 2 triangulations
23 Multipoint Delaunay Triangulation Different ( implicit ) hierarchical organization Virtual nodes are positioned to form a bounding box around a cluster of nodes. All traffic to nodes in a cluster goes through one of the virtual nodes
24 Evaluation of Overlays Simulation: Network with 1024 routers ( Transit-Stub topology) hosts Performance measures for trees embedded in an overlay network: Degree of a node in an embedded tree Relative Delay Penalty : Ratio of delay in overlay to shortest path delay Stress : Number of duplicate transmissions over a physical link
25 Illustration of Stress and Relative Delay Penalty AA Stress = BB Stress = 2 Unicast delay A B : 4 Delay A B in overlay: 6 Relative delay penalty for A B: 1.5
26 Transit-Stub Network Transit-Stub GA Tech topology generator 4 transit domains 4 16 stub domains 1024 total routers 128 hosts on stub domain
27 Overlay Topologies Delaunay Triangulation and variants Hierarchical DT Multipoint DT Degree-6 Graph Similar to graphs generated in Narada Degree-3 Tree Similar to graphs generated in Yoid Logical MST Minimum Spanning Tree Hypercube
28 Average Relative Delay Penalty
29 90 th Percentile of Relative Delay Penalty Delaunay triangulation
30 Average Stress
31 90 th Percentile of Stress Delaunay triangulation
32 The DT Protocol Protocol which organizes members of a network in a Delaunay Triangulation Each member only knows its neighbors soft-state protocol Topics: Nodes and Neighbors Example: A node joins State Diagram Rendezvous Measurement Experiments
33 HelloHello Hello Hello 4,9 HelloHello Each node sends Hello messages to to its its neighbors periodically 10,8 0,6 Hello Hello HelloHello HelloHello 5,2 HelloHello 12,0
34 Each Hello contains the the clockwise (CW) and and counterclockwise (CCW) neighbors Receiver of of a Hello runs runs a Neighbor test test ( ( locally equiangular prop.) CW CW and and CCW are are used to to detect new new neighbors 4,9 10,8 Neighborhood Table of ,6 Neighbor CW CCW Hello CW = 12,0 CCW = 4,9 5,2 12,0 4,9 4,9 5,2 12,0 10,8 5,2 12,0
35 A node that that wants to to join join the the triangulation contacts a node that that is is close 4,9 10,8 0,6 New node Hello 8,4 5,2 12,0
36 Node (5,2) updates its its Voronoi region, and and the the triangulation 4,9 10,8 0,6 8,4 5,2 12,0
37 (5,2) sends a Hello which contains info info for for contacting its its clockwise and and counterclockwise neighbors 4,9 10,8 0,6 5,2 Hello 8,4 12,0
38 (8,4) contacts these neighbors ,9 Hello 10,8 0,6 8,4 5,2 Hello 12,0
39 which update their their respective Voronoi regions. 4,9 10,8 0,6 8,4 5,2 12,0
40 4,9 Hello (4,9) and and (12,0) send Hellos and and provide info info for for contacting their their respective clockwise and and counterclockwise neighbors. 10,8 0,6 8,4 5,2 Hello 12,0
41 (8,4) contacts the the new new neighbor (10,8) ,9 10,8 0,6 8,4Hello 5,2 12,0
42 which updates its its Voronoi region... 4,9 10,8 0,6 8,4 5,2 12,0
43 and responds with with a Hello 0,6 4,9 8,4 Hello 10,8 5,2 12,0
44 This This completes the the update of of the the Voronoi regions and and the the Delaunay Triangulation 4,9 10,8 0,6 8,4 5,2 12,0
45 Rendezvous Methods Rendezvous Problems: How does a new node detect a member of the overlay? How does the overlay repair a partition? Three solutions: 1. Announcement via broadcast 2. Use of a server 3. Use `likely members ( Buddy List )
46 Rendezvous Method 1: 1: 4,9 Announcement via via broadcast (e.g., using IP IP Multicast) 10,8 0,6 New node 5,2 Hello 8,4 12,0
47 4,9 Leader 10,8 Rendezvous Method 1: 1: A Leader is is a node with with a Y-coordinate higher than than any any of of its its neighbors. 0,6 5,2 12,0
48 Rendezvous Method 2: 2: New New node and and leader contact a server. Server keeps a cache of of some other nodes 4,9 10,8 0,6 Server Request New node Server Server Reply (12,0) 5,2 Hello 8,4 NewNode NewNode 12,0
49 Rendezvous Method 3: 3: Each node has has a list list of of likely members of of the the overlay network 4,9 10,8 0,6 5,2 Hello 8,4 NewNode New node with Buddy List: (12,0) (4,9) NewNode 12,0
50 State Diagram of a Node Stopped Application starts Leader without Neighbor Neighbor added (with smaller coordinates) All neighbors leave or timeout Neighbor added (with larger coordinates) All neighbors leave or timeout Application exits Leader with Neighbor A new neighbor with greater coordinates is added After removing some neighbor, this node has largest coordinates Not Leader Send Goodbye Send Goodbye Send Goodbye Leaving
51 Sub-states of a Node Stable Without Candidate Neighbor Node contained in NewNode passes neighbor test After handling the candidate neighbor, node remains stable After neighborhood updating, node becomes not stable After neighborhood updating, node becomes stable. Stable With Candidate Neighbor After neighborhood updating, node becomes not stable Not Stable A node is is stable when all all nodes that that appear in in the the CW CW and and CCW neighbor columns of of the the neighborhood table also also appear in in the the neighbor column
52 Measurement Experiments Experimental Platform: Centurion cluster at UVA (cluster of 300 Linux PCs) 2 to 10,000 overlay members members per PC Internet Switch 3 Gigabit Ethernet centurion183 centurion Switch 4 Switch 8 centurion centurion246 centurion250 centurion251 Switch 5 Switch 9 centurion centurion centurion249 centurion252 Switch 6 Switch 11 centurion centurion centurion Switch 7 Switch 10
53 Experiment: Adding Members How long does it take to add M members to an overlay network of N members? Time to Complete (sec) M+N members
54 Experiment: Throughput of Multicasting 100 MB bulk transfer for N=2-100 members (1 node per PC) 10 MB bulk transfer for N= members (10 nodes per PC) Average throughput (Mbps) Measured values Bandwidth bounds (due to stress) Number of Members N
55 Experiment: Delay 100 MB bulk transfer for N=2-100 members (1 node per PC) 10 MB bulk transfer for N= members (10 nodes per PC) Delay of a packet (msec) Number of Nodes N
56 Summary Use of Delaunay triangulations for overlay networks Delaunay triangulation observes coordinates but ignores network topology No routing protocol is needed in the overlay Ongoing effort: use delay measurements to determine parameters HyperCast Project website:
Delaunay Triangulation Overlays
HighPerf or mance Swi tchi ng and Routi ng Tele com Cent erw orksh op: Sept 4, 1 97. Delaunay Triangulation Overlays Jörg Liebeherr 2003 1 HyperCast Project HyperCast is a set of protocols for large-scale
More informationTwo challenges for building large self-organizing overlay networks
Two challenges for building large selforganizing overlay networks Jorg Liebeherr University of Virginia Two issues in multicast overlay networks 1. Why do we keep on proposing overlay networks for multicast?
More informationApplication-Layer Multicasting with Delaunay Triangulation Overlays
Application-Layer Multicasting with Delaunay Triangulation Overlays Jörg Liebeherr Michael Nahas Weisheng Si Department of Computer Science University of Virginia Charlottesville, VA 22904 Abstract Application-layer
More informationApplication-Layer Multicasting With Delaunay Triangulation Overlays
1472 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 20, NO. 8, OCTOBER 2002 Application-Layer Multicasting With Delaunay Triangulation Overlays Jörg Liebeherr, Member, IEEE, Michael Nahas, Member,
More informationApplication-layer Multicast with Delaunay Triangulations
Application-layer Multicast with Delaunay Triangulations Jörg Liebeherr, Michael Nahas, Department of Computer Science, University of Virginia, Charlottesville, VA 9 Abstract Recently, application-layer
More informationLarge-scale Application-Layer Multicast with Delaunay Triangulations
Large-scale pplication-layer Multicast with elaunay Triangulations Jörg Liebeherr Michael ahas epartment of omputer Science University of Virginia harlottesville, V 2294 bstract pplication-layer multicast
More informationProgramming Overlay Networks with Overlay Sockets
Programming Overlay Networks with Overlay Sockets Jörg Liebeherr, Jianping Wang and Guimin Zhang Department of Computer Science, University of Virginia, Charlottesville, USA Abstract. The emergence of
More informationScalable Application Layer Multicast
Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy http://www.cs.umd.edu/projects/nice Group Communication A C A C 1 2 1 2 B D B D Network-layer Multicast Replication
More informationA Contemporary Study of Application Layer Multicast Protocols in aid of Effective Communication
A Contemporary Study of Application Layer Multicast Protocols in aid of Effective Communication M. Anitha #1, P. Yogesh *2 # Department of Computer Science and Engineering, * Department of Information
More informationAdaptive Routing of QoS-Constrained Media Streams over Scalable Overlay Topologies
Adaptive Routing of QoS-Constrained Media Streams over Scalable Overlay Topologies Gerald Fry and Richard West Boston University Boston, MA 02215 {gfry,richwest}@cs.bu.edu Introduction Internet growth
More informationContents. Overview Multicast = Send to a group of hosts. Overview. Overview. Implementation Issues. Motivation: ISPs charge by bandwidth
EECS Contents Motivation Overview Implementation Issues Ethernet Multicast IGMP Routing Approaches Reliability Application Layer Multicast Summary Motivation: ISPs charge by bandwidth Broadcast Center
More informationBroadcast and Multicast Routing
Broadcast and Multicast Routing Daniel Zappala CS 460 Computer Networking Brigham Young University Group Communication 2/34 How can the Internet provide efficient group communication? send the same copy
More information! Naive n-way unicast does not scale. ! IP multicast to the rescue. ! Extends IP architecture for efficient multi-point delivery. !
Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination ACM NOSSDAV 001 Shelley Q. Zhuang, Ben Y. Zhao, Anthony D. Joseph, Randy H. Katz, John D. Kubiatowicz {shelleyz, ravenben,
More informationSurvey on Multicast Routing Protocols in MANETs
Survey on Multicast Routing Protocols in MANETs A Viswanath, Dept of CSE, Sree Vidyanikethan Engineering College, Tirupati, AP, India. N Papanna, M.Tech, Assistant Professor, Sree Vidyanikethan Engineering
More informationSimulations of the quadrilateral-based localization
Simulations of the quadrilateral-based localization Cluster success rate v.s. node degree. Each plot represents a simulation run. 9/15/05 Jie Gao CSE590-fall05 1 Random deployment Poisson distribution
More informationOverlay Socket Tutorial
Tutorial Overview 1. Terminology: socket, overlay network 2. User perspective: The API: Writing programs with an overlay socket Managing Properties of an overlay network a) Attributes b) Property file
More informationMulticast Communications
Multicast Communications Multicast communications refers to one-to-many or many-tomany communications. Unicast Broadcast Multicast Dragkedja IP Multicasting refers to the implementation of multicast communication
More informationThe Overlay Socket API
1/10/2002 Overlay Socket API 1 The Overlay Socket API 1. OVERVIEW The HyperCast software provides an Application Programming Interface (API) for building applications that use overlay sockets. The overlay
More informationMulticast EECS 122: Lecture 16
Multicast EECS 1: Lecture 16 Department of Electrical Engineering and Computer Sciences University of California Berkeley Broadcasting to Groups Many applications are not one-one Broadcast Group collaboration
More informationViewing IP and MPLS Multicast Configurations
CHAPTER 19 These topics provide an overview of the IP Multicast technology and describe how to view IP and multicast configurations in Prime Network Vision: IP and MPLS Multicast Configuration: Overview,
More informationAd hoc and Sensor Networks Topology control
Ad hoc and Sensor Networks Topology control Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity This chapter looks at methods to deal with such networks by Reducing/controlling
More information3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
More informationAnnouncements. EECS 122: Introduction to Computer Networks Multicast and Overlay Networks. Motivational Example: Streaming Media
Announcements EEC : Introduction to Computer Networks Multicast and Overlay Networks Ion toica (and Brighten Godfrey) TAs: Lucian Popa, David Zats and Ganesh Ananthanarayanan http://inst.eecs.berkeley.edu/~ee/
More informationThe Cluster Protocol Wittawat Tantisiriroj, Jorg Liebeherr, MNG Group
The Cluster Protocol Wittawat Tantisiriroj, Jorg Liebeherr, MNG Group (updated: January 2008) This is a draft and not a final version. 2008. All rights reserved. All material is copyrighted by the authors.
More informationThe Spanning Tree Protocol
The Spanning Tree Protocol Guangyu Dong, Jorg Liebeherr, MNG Group Wednesday, March 30, 2005 This is a draft and not a final version. 2005-8. All rights reserved. All material is copyrighted by the authors.
More informationEdge Device Multi-unicasting for Video Streaming
Edge Device Multi-unicasting for Video Streaming T. Lavian, P. Wang, R. Durairaj, F. Travostino Advanced Technology Lab, Nortel Networks D. B. Hoang University of Technology, Sydney Presented By Ramesh
More informationPrianka.P 1, Thenral 2
An Efficient Routing Protocol design and Optimizing Sensor Coverage Area in Wireless Sensor Networks Prianka.P 1, Thenral 2 Department of Electronics Communication and Engineering, Ganadipathy Tulsi s
More informationMidpoint Routing algorithms for Delaunay Triangulations
Midpoint Routing algorithms for Delaunay Triangulations Weisheng Si and Albert Y. Zomaya Centre for Distributed and High Performance Computing School of Information Technologies Prologue The practical
More informationAd hoc and Sensor Networks Chapter 10: Topology control
Ad hoc and Sensor Networks Chapter 10: Topology control Holger Karl Computer Networks Group Universität Paderborn Goals of this chapter Networks can be too dense too many nodes in close (radio) vicinity
More informationComputational Geometry
Computational Geometry 600.658 Convexity A set S is convex if for any two points p, q S the line segment pq S. S p S q Not convex Convex? Convexity A set S is convex if it is the intersection of (possibly
More informationMesh-Based Content Routing Using XML
Outline Mesh-Based Content Routing Using XML Alex C. Snoeren, Kenneth Conley, and David K. Gifford MIT Laboratory for Computer Science Presented by: Jie Mao CS295-1 Fall 2005 2 Outline Motivation Motivation
More informationNetworking Acronym Smorgasbord: , DVMRP, CBT, WFQ
Networking Acronym Smorgasbord: 802.11, DVMRP, CBT, WFQ EE122 Fall 2011 Scott Shenker http://inst.eecs.berkeley.edu/~ee122/ Materials with thanks to Jennifer Rexford, Ion Stoica, Vern Paxson and other
More informationEE122: Multicast. Kevin Lai October 7, 2002
EE122: Multicast Kevin Lai October 7, 2002 Internet Radio www.digitallyimported.com (techno station) - sends out 128Kb/s MP3 music streams - peak usage ~9000 simultaneous streams only 5 unique streams
More informationOverview. Overview. OTV Fundamentals. OTV Terms. This chapter provides an overview for Overlay Transport Virtualization (OTV) on Cisco NX-OS devices.
This chapter provides an overview for Overlay Transport Virtualization (OTV) on Cisco NX-OS devices., page 1 Sample Topologies, page 6 OTV is a MAC-in-IP method that extends Layer 2 connectivity across
More informationEE122: Multicast. Internet Radio. Multicast Service Model 1. Motivation
Internet Radio EE122: Multicast Kevin Lai October 7, 2002 wwwdigitallyimportedcom (techno station) - sends out 128Kb/s MP music streams - peak usage ~9000 simultaneous streams only 5 unique streams (trance,
More informationEfficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks
Efficient Hybrid Multicast Routing Protocol for Ad-Hoc Wireless Networks Jayanta Biswas and Mukti Barai and S. K. Nandy CAD Lab, Indian Institute of Science Bangalore, 56, India {jayanta@cadl, mbarai@cadl,
More informationBridge-Node Selection and Loss Recovery in Island Multicast
Bridge-Node Selection and Loss Recovery in Island Multicast W.-P. Ken Yiu K.-F. Simon Wong S.-H. Gary Chan Department of Computer Science The Hong Kong University of Science and Technology Clear Water
More informationOverlay Networks for Multimedia Contents Distribution
Overlay Networks for Multimedia Contents Distribution Vittorio Palmisano vpalmisano@gmail.com 26 gennaio 2007 Outline 1 Mesh-based Multicast Networks 2 Tree-based Multicast Networks Overcast (Cisco, 2000)
More informationBayeux: An Architecture for Scalable and Fault Tolerant Wide area Data Dissemination
Bayeux: An Architecture for Scalable and Fault Tolerant Wide area Data Dissemination By Shelley Zhuang,Ben Zhao,Anthony Joseph, Randy Katz,John Kubiatowicz Introduction Multimedia Streaming typically involves
More informationApplication Layer Multicast For Efficient Peer-to-Peer Applications
Application Layer Multicast For Efficient Peer-to-Peer Applications Adam Wierzbicki 1 e-mail: adamw@icm.edu.pl Robert Szczepaniak 1 Marcin Buszka 1 1 Polish-Japanese Institute of Information Technology
More informationPeer-to-Peer Streaming Systems. Behzad Akbari
Peer-to-Peer Streaming Systems Behzad Akbari 1 Outline Introduction Scaleable Streaming Approaches Application Layer Multicast Content Distribution Networks Peer-to-Peer Streaming Metrics Current Issues
More informationOverlay Multicast. Application Layer Multicast. Structured Overlays Unstructured Overlays. CAN Flooding Centralised. Scribe/SplitStream Distributed
Overlay Multicast Application Layer Multicast Structured Overlays Unstructured Overlays CAN Flooding Centralised Scribe/SplitStream Distributed PeerCast 1 Prof. Dr. Thomas Schmidt http:/www.informatik.haw-hamburg.de/~schmidt
More informationArvind Krishnamurthy Fall 2003
Overlay Networks Arvind Krishnamurthy Fall 003 Internet Routing Internet routing is inefficient: Does not always pick the lowest latency paths Does not always pick paths with low drop rates Experimental
More informationHyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology *
HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology * Jörg Liebeherr # Computer Science Department University of Virginia Charlottesville, VA 93 Tyler K. Beam
More informationNetwork Infrastructure
Network Infrastructure For building computer networks more complex than e.g. a short bus, some additional components are needed. They can be arranged hierarchically regarding their functionality: Repeater
More informationIntroduction to Communication Networks Spring Unit 13 Network extensions Bridges.
Introduction to Communication Networks Spring 2007 Unit 13 Network extensions Bridges. Acknowledgements slides coming from: The book by Peterson/Davie The book by Wiliam Stallings Slides from lectures
More informationCS514: Intermediate Course in Computer Systems
Distributed Hash Tables (DHT) Overview and Issues Paul Francis CS514: Intermediate Course in Computer Systems Lecture 26: Nov 19, 2003 Distributed Hash Tables (DHT): Overview and Issues What is a Distributed
More informationConfiguring PIM. Information About PIM. Send document comments to CHAPTER
CHAPTER 3 This chapter describes how to configure the Protocol Independent Multicast (PIM) features on Cisco NX-OS switches in your IPv4 networks. This chapter includes the following sections: Information
More informationIP Multicast. Overview. Casts. Tarik Čičić University of Oslo December 2001
IP Multicast Tarik Čičić University of Oslo December 00 Overview One-to-many communication, why and how Algorithmic approach (IP) multicast protocols: host-router intra-domain (router-router) inter-domain
More informationWhat is Multicasting? Multicasting Fundamentals. Unicast Transmission. Agenda. L70 - Multicasting Fundamentals. L70 - Multicasting Fundamentals
What is Multicasting? Multicasting Fundamentals Unicast transmission transmitting a packet to one receiver point-to-point transmission used by most applications today Multicast transmission transmitting
More informationMulticast Technology White Paper
Multicast Technology White Paper Keywords: Multicast, IGMP, IGMP Snooping, PIM, MBGP, MSDP, and SSM Mapping Abstract: The multicast technology implements high-efficiency point-to-multipoint data transmission
More informationII. Principles of Computer Communications Network and Transport Layer
II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part
More informationRouting with a distance vector protocol - EIGRP
Routing with a distance vector protocol - EIGRP Introducing Routing and Switching in the Enterprise Chapter 5.2 Copyleft 2012 Vincenzo Bruno (www.vincenzobruno.it) Released under Crative Commons License
More informationWITH the penetration of broadband Internet access,
216 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 21, NO. 2, FEBRUARY 2010 A Distributed Protocol to Serve Dynamic Groups for Peer-to-Peer Streaming Xing Jin, S.-H. Gary Chan, Senior Member,
More informationAdvanced Networking. Multicast
Advanced Networking Multicast Renato Lo Cigno Alessandro Russo LoCigno@disi.unitn.it - Russo@disi.unitn.it Homepage: disi.unitn.it/locigno/index.php/teaching-duties/advanced-networking The Multicast Tree
More informationBrocade: Landmark Routing on Peer to Peer Networks. Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz
Brocade: Landmark Routing on Peer to Peer Networks Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz State of the Art Routing High dimensionality and coordinate-based P2P routing Decentralized
More informationHyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology *
HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology * Jörg Liebeherr # Computer Science Department University of Virginia Charlottesville, VA 22903 Tyler K. Beam
More informationConfiguring Multicast Routing
CHAPTER 24 This chapter describes how to configure the ASA to use the multicast routing protocol and includes the following sections: Information About Multicast Routing, page 24-17 Licensing Requirements
More informationContent. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.
Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management
More informationInternet Indirection Infrastructure (i3) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana. UC Berkeley SIGCOMM 2002
Internet Indirection Infrastructure (i3) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana UC Berkeley SIGCOMM 2002 Motivations Today s Internet is built around a unicast pointto-point
More informationEECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Overlay Networks: Motivations
EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University of California, Berkeley
More informationECEN Final Exam Fall Instructor: Srinivas Shakkottai
ECEN 424 - Final Exam Fall 2013 Instructor: Srinivas Shakkottai NAME: Problem maximum points your points Problem 1 10 Problem 2 10 Problem 3 20 Problem 4 20 Problem 5 20 Problem 6 20 total 100 1 2 Midterm
More informationThis chapter describes how to configure the Cisco ASA to use the multicast routing protocol.
This chapter describes how to configure the Cisco ASA to use the multicast routing protocol. About, page 1 Guidelines for, page 4 Enable, page 4 Customize, page 5 Monitoring for PIM, page 16 Example for,
More informationReliable End System Multicasting with a Heterogeneous Overlay Network
Reliable End System Multicasting with a Heterogeneous Overlay Network Jianjun Zhang, Ling Liu, Calton Pu and Mostafa Ammar College of Computing Georgia Institute of Technology Atlanta, GA 333, U.S.A. {zhangjj,
More informationWe noticed that the trouble is due to face routing. Can we ignore the real coordinates and use virtual coordinates for routing?
Geographical routing in practice We noticed that the trouble is due to face routing. Is greedy routing robust to localization noise? Can we ignore the real coordinates and use virtual coordinates for routing?
More informationPerformance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s
Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations
More informationCRESCENDO GEORGE S. NOMIKOS. Advisor: Dr. George Xylomenos
CRESCENDO Implementation of Hierarchical Chord (Crescendo), according to Canon paradigm and evaluation, via simulation over realistic network topologies, of the Crescendo's advantages in comparison to
More informationScattercast: An Adaptable Broadcast Distribution Framework
Multimedia Systems Journal manuscript No. (will be inserted by the editor) Scattercast: An Adaptable Broadcast Distribution Framework Yatin Chawathe AT&T Labs-Research 75 Willow Road, Menlo Park, CA 94107
More informationConfiguring Virtual Private LAN Services
Virtual Private LAN Services (VPLS) enables enterprises to link together their Ethernet-based LANs from multiple sites via the infrastructure provided by their service provider. This module explains VPLS
More informationDistributed Systems. 21. Content Delivery Networks (CDN) Paul Krzyzanowski. Rutgers University. Fall 2018
Distributed Systems 21. Content Delivery Networks (CDN) Paul Krzyzanowski Rutgers University Fall 2018 1 2 Motivation Serving web content from one location presents problems Scalability Reliability Performance
More informationCS November 2018
Distributed Systems 21. Delivery Networks (CDN) Paul Krzyzanowski Rutgers University Fall 2018 1 2 Motivation Serving web content from one location presents problems Scalability Reliability Performance
More informationGRE and DM VPNs. Understanding the GRE Modes Page CHAPTER
CHAPTER 23 You can configure Generic Routing Encapsulation (GRE) and Dynamic Multipoint (DM) VPNs that include GRE mode configurations. You can configure IPsec GRE VPNs for hub-and-spoke, point-to-point,
More informationMulticast. Presented by Hakim Weatherspoon. Slides borrowed from Qi Huang 2009 and Tom Ternquist 2010
Multicast Presented by Hakim Weatherspoon Slides borrowed from Qi Huang 2009 and Tom Ternquist 2010 Midterm report abstract, introduction, background, related work, and design section. These sections should
More informationSemantic Multicast for Content-based Stream Dissemination
Semantic Multicast for Content-based Stream Dissemination Olga Papaemmanouil Brown University Uğur Çetintemel Brown University Stream Dissemination Applications Clients Data Providers Push-based applications
More informationIP Multicast Optimization: Optimizing PIM Sparse Mode in a Large IP Multicast Deployment
IP Multicast Optimization: Optimizing PIM Sparse Mode in a Large IP Multicast Deployment Finding Feature Information, page 1 Prerequisites for Optimizing PIM Sparse Mode in a Large IP Multicast Deployment,
More informationQoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks
QoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks Satyabrata Pradhan, Yi Li, and Muthucumaru Maheswaran Advanced Networking Research Laboratory Department of Computer Science University
More information6. Node Disjoint Split Multipath Protocol for Unified. Multicasting through Announcements (NDSM-PUMA)
103 6. Node Disjoint Split Multipath Protocol for Unified Multicasting through Announcements (NDSM-PUMA) 6.1 Introduction It has been demonstrated in chapter 3 that the performance evaluation of the PUMA
More informationCS 268: IP Multicast Routing
Motivation CS 268: IP Multicast Routing Ion Stoica April 8, 2003 Many applications requires one-to-many communication - E.g., video/audio conferencing, news dissemination, file updates, etc. Using unicast
More informationOverlay Networks: Motivations. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Motivations (cont d) Goals.
Overlay Networks: Motivations CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University
More informationA Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks
A Comparative and Performance Study of On Demand Multicast Routing Protocols for Ad Hoc Networks P.Madhan Mohan #, J.James Johnson #, K.Murugan $ and V.Ramachandran % # Under Graduate Student $ Senior
More informationInternet Indirection Infrastructure
Motivations Internet Indirection Infrastructure Modified version of Ion Stoica s talk at ODU Nov 14, 05 Today s Internet is built around a unicast point-to-point communication abstraction: Send packet
More information3. INTERCONNECTING NETWORKS WITH SWITCHES. THE SPANNING TREE PROTOCOL (STP)
3. INTERCONNECTING NETWORKS WITH SWITCHES. THE SPANNING TREE PROTOCOL (STP) 3.1. STP Operation In an extended Ethernet network (a large network, including many switches) multipath propagation may exist
More informationCSE 473 Introduction to Computer Networks. Exam 2. Your name here: 11/7/2012
CSE 473 Introduction to Computer Networks Jon Turner Exam 2 Your name here: 11/7/2012 1. (10 points). The diagram at right shows a DHT with 16 nodes. Each node is labeled with the first value in its range
More informationThe Backbone-Cluster Protocol Wittawat Tantisiriroj, Jorg Liebeherr, MNG Group Thursday, February 07, 2008
The Backbone-Cluster Protocol Wittawat Tantisiriroj, Jorg Liebeherr, MNG Group Thursday, February 07, 2008 Table of Contents 1. Introduction...1 2. Operations...3 3. 4. States and State Transitions...4
More informationA Survey and Comparison of. Application-level Multicast Protocols
A Survey and omparison of Application-level Multicast Protocols Xing Jin Wan-hing Wong S.-. Gary han oi-lun Ngan epartment of omputer Science The ong Kong University of Science and Technology lear Water
More informationCS November 2017
Distributed Systems 21. Delivery Networks () Paul Krzyzanowski Rutgers University Fall 2017 1 2 Motivation Serving web content from one location presents problems Scalability Reliability Performance Flash
More information1. What is a Computer Network? interconnected collection of autonomous computers connected by a communication technology
Review Questions for exam Preparation (22-07-2017) 1. What is a Computer Network? interconnected collection of autonomous computers connected by a communication technology 2. What is the Internet? "network
More informationComputer Networks. Routing
Computer Networks Routing Topics Link State Routing (Continued) Hierarchical Routing Broadcast Routing Sending distinct packets Flooding Multi-destination routing Using spanning tree Reverse path forwarding
More informationGoals. EECS 122: Introduction to Computer Networks Overlay Networks and P2P Networks. Solution. Overlay Networks: Motivations.
Goals CS : Introduction to Computer Networks Overlay Networks and PP Networks Ion Stoica Computer Science Division Department of lectrical ngineering and Computer Sciences University of California, Berkeley
More informationWhat is the difference between unicast and multicast? (P# 114)
1 FINAL TERM FALL2011 (eagle_eye) CS610 current final term subjective all solved data by eagle_eye MY paper of CS610 COPUTER NETWORKS There were 30 MCQs Question no. 31 (Marks2) Find the class in 00000001.001011.1001.111
More informationEIGRP. About EIGRP. CLI Book 1: Cisco ASA Series General Operations CLI Configuration Guide, 9.7 1
This chapter describes how to configure the Cisco ASA to route data, perform authentication, and redistribute routing information using the Enhanced Interior Gateway Routing Protocol (). About, page 1
More informationMulticast Communications. Slide Set were original prepared by Dr. Tatsuya Susa
Multicast Communications Slide Set were original prepared by Dr. Tatsuya Susa Outline 1. Advantages of multicast 2. Multicast addressing 3. Multicast Routing Protocols 4. Multicast in the Internet 5. IGMP
More informationNetwork-on-chip (NOC) Topologies
Network-on-chip (NOC) Topologies 1 Network Topology Static arrangement of channels and nodes in an interconnection network The roads over which packets travel Topology chosen based on cost and performance
More informationAn overview of how packets are routed in the Internet
An overview of how packets are routed in the Internet 1 Dijkstra s shortest path first algorithm (example of a Link State Algorithm ) 1. Exchange link state: A router floods to every other router the state
More informationSUPPORTING EFFICIENT AND SCALABLE MULTICASTING OVER MOBILE AD HOC NETWORKS. X.Xiang X.Wang Y.Yang
SUPPORTING EFFICIENT AND SCALABLE MULTICASTING OVER MOBILE AD HOC NETWORKS X.Xiang X.Wang Y.Yang Introduction Multicasting: an efficient way to realize group communications(one to many or many to many).
More informationInterdomain Routing Design for MobilityFirst
Interdomain Routing Design for MobilityFirst October 6, 2011 Z. Morley Mao, University of Michigan In collaboration with Mike Reiter s group 1 Interdomain routing design requirements Mobility support Network
More informationInternet Engineering Task Force (IETF) Request for Comments: Category: Experimental February 2014 ISSN:
Internet Engineering Task Force (IETF) A. Retana Request for Comments: 7137 S. Ratliff Updates: 5820 Cisco Systems, Inc. Category: Experimental February 2014 ISSN: 2070-1721 Use of the OSPF-MANET Interface
More informationDynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds 1
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds 1 Contents: Introduction Multicast on parallel distributed systems Multicast on P2P systems Multicast on clouds High performance
More informationOverview of Overlay Multicast Protocols Dennis M. Moen C3I Center George Mason University
Overview of Overlay Multicast Protocols Dennis M. Moen C3I Center George Mason University dmoen@gmu.edu Introduction Multicasting remains a critical element in the deployment of scalable networked virtual
More informationScalable multicasting with network-aware geometric overlay
Available online at www.sciencedirect.com Computer Communications 3 (28) 464 488 www.elsevier.com/locate/comcom Scalable multicasting with network-aware geometric overlay Eng Keong Lua a,b, *, Xiaoming
More information