Overcast: Reliable Multicasting with an Overlay Network Paper authors: Jannotti, Gifford, Johnson, Kaashoek, O’Toole Jr. Slides by Chris Johnstone.

Slides:



Advertisements
Similar presentations
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Advertisements

NUS.SOC.CS Roger Zimmermann (based in part on slides by Ooi Wei Tsang) Peer-to-Peer Streaming.
Packet Switching COM1337/3501 Textbook: Computer Networks: A Systems Approach, L. Peterson, B. Davie, Morgan Kaufmann Chapter 3.
1 Efficient and Robust Streaming Provisioning in VPNs Z. Morley Mao David Johnson Oliver Spatscheck Kobus van der Merwe Jia Wang.
SplitStream: High- Bandwidth Multicast in Cooperative Environments Monica Tudora.
LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.
Resilient Peer-to-Peer Streaming Paper by: Venkata N. Padmanabhan Helen J. Wang Philip A. Chou Discussion Leader: Manfred Georg Presented by: Christoph.
Computer Science 1 ShapeShifter: Scalable, Adaptive End-System Multicast John Byers, Jeffrey Considine, Nicholas Eskelinen, Stanislav Rost, Dmitriy Zavin.
Presented by Tom Ternquist CS /28/10
Scribe: A Large-Scale and Decentralized Application-Level Multicast Infrastructure Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, and Antony L. T.
ZIGZAG A Peer-to-Peer Architecture for Media Streaming By Duc A. Tran, Kien A. Hua and Tai T. Do Appear on “Journal On Selected Areas in Communications,
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
1 Switching and Forwarding Bridges and Extended LANs.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Application layer multicast routing. What Is Multicast? Unicast –One-to-one –Destination – unique receiver host address Broadcast –One-to-all –Destination.
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
Application Layer Multicast
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
CS218 – Final Project A “Small-Scale” Application- Level Multicast Tree Protocol Jason Lee, Lih Chen & Prabash Nanayakkara Tutor: Li Lao.
Scalable Live Video Streaming to Cooperative Clients Using Time Shifting and Video Patching Meng Guo and Mostafa H. Ammar INFOCOM 2004.
Wide-area cooperative storage with CFS
On-Demand Media Streaming Over the Internet Mohamed M. Hefeeda, Bharat K. Bhargava Presented by Sam Distributed Computing Systems, FTDCS Proceedings.
A Peer-to-Peer On-Demand Streaming Service and Its Performance Evaluation Yang Guo, Kyoungwon Suh, Jim Kurose, Don Towsley University of Massachusetts,
Nearcast: A Locality-Aware P2P Live Streaming Approach for Distance Education XUPING TU, HAI JIN, and XIAOFEI LIAO Huazhong University of Science and Technology.
Communication Part IV Multicast Communication* *Referred to slides by Manhyung Han at Kyung Hee University and Hitesh Ballani at Cornell University.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Communication (II) Chapter 4
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
ON DESIGING END-USER MULTICAST FOR MULTIPLE VIDEO SOURCES Y.Nakamura, H.Yamaguchi, A.Hiromori, K.Yasumoto †, T.Higashino and K.Taniguchi Osaka University.
Multicast Presented by Hakim Weatherspoon Slides borrowed from Qi Huang 2009 and Tom Ternquist 2010.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
Overlay Network Physical LayerR : router Overlay Layer N R R R R R N.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
De-Nian Young Ming-Syan Chen IEEE Transactions on Mobile Computing Slide content thanks in part to Yu-Hsun Chen, University of Taiwan.
Streaming over Subscription Overlay Networks Department of Computer Science Iowa State University.
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
This paper appears in: Computer Communications and Networks, ICCCN Proceedings.15th International Conference on 指導教授 : 許子衡 報告者 : 黃群凱 1.
Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.
IP1 The Underlying Technologies. What is inside the Internet? Or What are the key underlying technologies that make it work so successfully? –Packet Switching.
Application-Level Multicast Routing Michael Siegenthaler CS 614 – Cornell University November 2, 2006 A few slides are borrowed from Swati Agarwal, CS.
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
NUS.SOC.CS5248 Ooi Wei Tsang Course Matters. NUS.SOC.CS5248 Ooi Wei Tsang Deadlines 11 Oct: Survey Paper Due 18 Oct: Paper Reviews Due.
Information-Centric Networks10b-1 Week 10 / Paper 2 Hermes: a distributed event-based middleware architecture –P.R. Pietzuch, J.M. Bacon –ICDCS 2002 Workshops.
Information-Centric Networks Section # 10.2: Publish/Subscribe Instructor: George Xylomenos Department: Informatics.
Peer to Peer Network Design Discovery and Routing algorithms
ECE 544 Project3 Group 9 Brien Range Sidhika Varshney Sanhitha Rao Puskuru.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Chapter 7: Consistency & Replication IV - REPLICATION MANAGEMENT By Jyothsna Natarajan Instructor: Prof. Yanqing Zhang Course: Advanced Operating Systems.
An overlay for latency gradated multicasting Anwitaman Datta SCE, NTU Singapore Ion Stoica, Mike Franklin EECS, UC Berkeley
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Netprog: Chat1 Chat Issues and Ideas for Service Design Refs: RFC 1459 (IRC)
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
Distributed Systems Lecture 7 Multicast 1. Previous lecture Global states – Cuts – Collecting state – Algorithms 2.
Fall, 2001CS 6401 Switching and Routing Outline Routing overview Store-and-Forward switches Virtual circuits vs. Datagram switching.
Behrouz A. Forouzan TCP/IP Protocol Suite, 3rd Ed.
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Network Load Balancing
Host Multicast: A Framework for Delivering Multicast to End Users
ECE 544 Project3 Team member.
Chat Refs: RFC 1459 (IRC).
EE 122: Lecture 22 (Overlay Networks)
EE 122: Lecture 13 (IP Multicast Routing)
Performance-Robust Parallel I/O
Design and Implementation of OverLay Multicast Tree Protocol
Presentation transcript:

Overcast: Reliable Multicasting with an Overlay Network Paper authors: Jannotti, Gifford, Johnson, Kaashoek, O’Toole Jr. Slides by Chris Johnstone

Design Goals Provide application- level multicasting using already existing technology via overcasting Scalable, efficient, and reliable distribution of high quality video Compete well against IP Multicasting

Overcasting vs IP Multicast Overcasting imposes about twice as much network load as IP multicast (for large networks). This difference is in O(n). (Figure 4)

Architecture of an Overcast system The entities which form the architecture of the Overcast system are called nodes. Nodes are connected via an organizational scheme distribution tree. Each group provides content, which is replicated at each of the nodes. A node can conceivably participate in more than one group. Clients are end-system consumers of content.

Root nodes (1) Content originates at the root node and is streamed down the distribution tree. The root is the administrational center of the group. When clients join the group, they go to a webpage at the root, which redirects them to the “best” overcast node Is the root a single point of failure?

Root nodes (2) Linear roots can alleviate this problem. For the source to fail, all roots must fail. Using round robin IP resolution, you can stop your content serving cluster from being ‘slashdotted’ (overloaded by sheer popularity) by client requests.

Distribution tree The distribution tree is built and maintained using a self-organizing algorithm. The primary heuristic of this algorithm is to maximize bandwidth from the root to an overcast node. Backbone nodes are nodes which are located on or close to a network backbone. Overcast performs better when these backbone nodes are located at the top of the tree (ie, they are switched on first)

Tree building protocol (1) A node initializes by booting up, obtaining its IP, and contacts a “global, well-known registry” (Possible point of failure?) with a unique serial number. Registry provides a list of groups to join. This node initially chooses the root as its parent. A series of rounds will begin in which the node decides where on the tree it should be.

Tree building protocol (2) For each round, evaluate the bandwidth we have to our parent. Also consider the bandwidth to the rest of our parent’s children. If there is a tie (bandwidth differences between 2 or more nodes within 10%), break it by the number of hops reported by traceroute. The child selects the best of it’s parents children as its new parent. Nodes maintain an ancestor list and can rejoin further up the tree when it’s ancestors fail.

Reaching a stable state Overcast nodes can still receive content from the root, even when the tree is not stabilized. A typical round period is about 1 to 2 seconds.

Tree building protocol (3) By having consecutive rounds of tree building, the distribution tree can overcome conditions occuring on the underlying network. The up/down protocol is used to maintain information about the status of nodes. Each node in the network maintains a table of information about all of it’s descendants. After the tree stabilizes, nodes will continue to consider relocating after a reevaluation period.

Up/down protocol A parent that gets a new child gives its parent a birth certificate, which propagates to the root. The node’s sequence number is incremented by 1. Sequence numbers are used to prevent a race condition. When a parent’s child fails to report its status (called checkin), after a length of time called a lease period, the parent propagates a death certificate for its child up the tree. A child also presents any certificates or changes it has accumulated from its last checkin.

Problems A simple approach leads to a simple solution: Not appropriate for software (same as mirroring a file!) Not appropriate for games (latency is too high!) What about teleconferencing? Authors suggest that if a non-root node wishes to send to other nodes, the node should first unicast (send via normal TCP/IP to the root, which will then overcast it as normal). Is this a good solution?

Closing thoughts Simulated on a virtual network topology (Georgia Tech Internetwork Topology Models). Take results with a grain of salt (or two). Might work out well commercially. Consider a high demand for high definition video over the net, and corporations/entities willing to deliver it (CNN,Hollywood studios,Olympics). Overcast could be a premium service for ISP subscribers [like newsgroups,www hosting].