Computer Science 1 ShapeShifter: Scalable, Adaptive End-System Multicast John Byers, Jeffrey Considine, Nicholas Eskelinen, Stanislav Rost, Dmitriy Zavin.

Slides:



Advertisements
Similar presentations
A Digital Fountain Approach to Reliable Distribution of Bulk Data
Advertisements

Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.
Digital Fountains: Applications and Related Issues Michael Mitzenmacher.
Digital Fountain Codes V. S
Jump to first page A. Patwardhan, CSE Digital Fountains Main Ideas : n Distribution of bulk data n Reliable multicast, broadcast n Ideal digital.
Cooperative Overlay Networking for Streaming Media Content Feng Wang 1, Jiangchuan Liu 1, Kui Wu 2 1 School of Computing Science, Simon Fraser University.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts Amherst Operating Systems CMPSCI 377 Lecture.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
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 ROMA: Reliable Overlay Multicast with Loosely Coupled TCP Connections Gu-In Kwon and John Byers Computer Science Dept. Boston University.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Informed Content Delivery Across Adaptive Overlay Networks J. Byers, J. Considine, M. Mitzenmacher and S. Rost Presented by Ananth Rajagopala-Rao.
Application Layer Multicast
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
Forward Error Correction Steven Marx CSC45712/04/2001.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
1 Routing as a Service Karthik Lakshminarayanan (with Ion Stoica and Scott Shenker) Sahara/i3 retreat, January 2004.
1 Scalable Video Coding with Digital Fountain Kai-Chao Yang.
MULTICASTING Network Security.
A Case for End System Multicast Author: Yang-hua Chu, Sanjay G. Rao, Srinivasan Seshan and Hui Zhang.
Digital Fountain with Tornado Codes and LT Codes K. C. Yang.
Informed Content Delivery Across Adaptive Overlay Networks John Byers Dept. of Computer Science, Boston University Joint work with.
Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads John Byers, Boston University Michael Luby, Digital Fountain, Inc.
Spanning Tree and Multicast. The Story So Far Switched ethernet is good – Besides switching needed to join even multiple classical ethernet networks Routing.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
Communication Part IV Multicast Communication* *Referred to slides by Manhyung Han at Kyung Hee University and Hitesh Ballani at Cornell University.
Network Topologies.
Scalable Reliable Multicast Architecture Wenjun Zeng Computer Science Department University of Missouri-Columbia.
Scalable On-Demand Media Streaming with Packet Loss Recovery A. Mahanti, D. L. Eager, (USask) M. K. Vernon, D S-Stukel (Wisc) Presented by Cheng Huang.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
Peer-to-Peer Overlay Networks. Outline Overview of P2P overlay networks Applications of overlay networks Classification of overlay networks – Structured.
1 Codes, Bloom Filters, and Overlay Networks Michael Mitzenmacher.
Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh.
AD HOC WIRELESS MUTICAST ROUTING. Multicasting in wired networks In wired networks changes in network topology is rare In wired networks changes in network.
ON DESIGING END-USER MULTICAST FOR MULTIPLE VIDEO SOURCES Y.Nakamura, H.Yamaguchi, A.Hiromori, K.Yasumoto †, T.Higashino and K.Taniguchi Osaka University.
Computer Science Informed Content Delivery Across Adaptive Overlay Networks Overlay networks have emerged as a powerful and highly flexible method for.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
Application-Layer Multicast -presented by William Wong.
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.
IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.
Sharing Information across Congestion Windows CSE222A Project Presentation March 15, 2005 Apurva Sharma.
On the use of Reliable Multicast for Content Distribution Vassilis Chatzigiannakis
Streaming over Subscription Overlay Networks Department of Computer Science Iowa State University.
TELE202 Lecture 5 Packet switching in WAN 1 Lecturer Dr Z. Huang Overview ¥Last Lectures »C programming »Source: ¥This Lecture »Packet switching in Wide.
N ETWORKed M EDIA L AB. D EPT. OF I NFO. & C OMM., K-JIST Scalable Overlay Network for Peer-to-Peer File Sharing Park, Chanmo Networked Media Lab. Kwang-Ju.
X1X1 X2X2 Encoding : Bits are transmitting over 2 different independent channels.  Rn bits Correlation channel  (1-R)n bits Wireless channel Code Design:
Live Streaming over Subscription Overlay Networks CS587x Lecture Department of Computer Science Iowa State University.
A Routing Underlay for Overlay Networks Akihiro Nakao Larry Peterson Andy Bavier SIGCOMM’03 Reviewer: Jing lu.
Impact of Topology on Overlay Multicast Suat Mercan.
CprE 545 project proposal Long.  Introduction  Random linear code  LT-code  Application  Future work.
Multicast and Unicast Real-Time Video Streaming Over Wireless LANS April. 27 th, 2005 Presented by, Kang Eui Lee.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
Multiuser Receiver Aware Multicast in CDMA-based Multihop Wireless Ad-hoc Networks Parmesh Ramanathan Department of ECE University of Wisconsin-Madison.
Presented by Kelly Whitacre Written by John W. Byers, Jeffrey Considine, Michael Mitzenmacher, Member, IEEE, and Stanislav Rost.
Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.
Global Internet 2005 A Comparative Study of Multicast Protocols: Top, Bottom, or In the Middle? Li Lao (UCLA), Jun-Hong Cui (UCONN) Mario Gerla (UCLA),
Peer-to-Peer Result Dissemination in High-Volume Data Filtering Shariq Rizvi and Paul Burstein CS 294-4: Peer-to-Peer Systems.
Overlay Networks and Overlay Multicast May Definition  Network -defines addressing, routing, and service model for communication between hosts.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
A Case for End System Multicast 學號: 報告人:通訊所 吳瑞益 指導教授:楊峻權 日期: ACM SIGMETRICS.
1 A Case For End System Multicast Yang-hua Chu, Sanjay Rao and Hui Zhang Carnegie Mellon University.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
PATH DIVERSITY WITH FORWARD ERROR CORRECTION SYSTEM FOR PACKET SWITCHED NETWORKS Thinh Nguyen and Avideh Zakhor IEEE INFOCOM 2003.
Cost-Effective Video Streaming Techniques Kien A. Hua School of EE & Computer Science University of Central Florida Orlando, FL U.S.A.
Coding for Multipath TCP: Opportunities and Challenges Øyvind Ytrehus University of Bergen and Simula Res. Lab. NNUW-2, August 29, 2014.
UNIT-V Transport Layer protocols for Ad Hoc Wireless Networks
PROTEAN: A Scalable Architecture for Active Networks
Overlay Networking Overview.
Presentation transcript:

Computer Science 1 ShapeShifter: Scalable, Adaptive End-System Multicast John Byers, Jeffrey Considine, Nicholas Eskelinen, Stanislav Rost, Dmitriy Zavin Listed alphabetically

Computer Science 2 Problem  Problem: efficient delivery of popular bulk content  Existing Approaches:  Single-source unicast  Forward caching/Content Delivery Networks  Reliable IP Multicast  End-system multicast  Our approach:  Improving end-system multicast through the use of forward error correction and better topologies

Computer Science 3 Network-supported (IP) Multicast  Optimal solution: duplicates and disseminates data only when necessary  Relies on network support: in the real world, IP Multicast lacks deployment  Scalability concerns: per-group accounting and topology management do not scale due to limited router resources  Reliability: many proposals, few solutions

Computer Science 4 End-System Multicast  Does not rely on network support: builds and manages a virtual, overlay topology of unicast links on top of the network’s physical topology  Flexibility: optimization of the tree according to a richer set of metrics (perhaps specified by the application), ability to change topology on-demand  Improved scalability: end-systems are richer than routers in terms of dedicated resources  Problems: increased network resource requirements compared to IP Multicast, non-optimal mapping of the virtual topology onto physical topology

Computer Science 5 Related Work  Narada/End-System Multicast: Build and maintain a mesh of low-latency unicast links and use its minimal spanning tree for distribution. Also showed costs relative to IP Multicast are not excessive.  Overcast: A core group of well-placed nodes uses end-system multicast to distribute bulk content internally, in order to eventually provide it to clients. A node chooses a parent based on bandwidth through the candidate nodes using the number of network hops as a tie breaker.

Computer Science 6 Improvements in ShapeShifter  Erasure codes: improved overlay management, more connected graph structure, increased adaptivity  Scalable group management: a node need only be aware of a small portion of the graph but achieves coverage through continuous discovery  Measurements: metrics crucial to optimization of the overlay graph, such as shared-link congestion (refer to Khaled’s presentation)

Computer Science 7 Forward Error Correcting Codes  FEC codes: a well-known solution to dealing with packet loss without using feedback – instead of retransmitting packets, redundant packets are sent combining the original packets to recover from losses. e.g. x, y, x+y, a, b, a+b+x  Efficient codes: instead of the traditional slow Reed- Solomon codes, we use a variant of Tornado codes. This allows fast decoding while only requiring a small number of extra packets.  Strategy: the original server sends out FEC packets along the end-system multicast graph (à la Digital Fountain).

Computer Science 8 Recoding  Problem  Correlation: client nodes may have a high degree of correlation in information received due to common sources  Duplication: given correlation, duplicate packets received from client nodes can be ineffectual  Solution  Recoding: nodes blend received packets to generate new, high utility symbols for other nodes  Beyond trees: recoding allows non-tree topologies since duplication is avoided

Computer Science 9 Uncorrelated Loss Compensation  A neighbor node with greater throughput may supplement the flow of content to another node, circumventing the problematic physical link. Loss Rate 30% Loss Rate 5%

Computer Science 10 Download from Multiple Nodes in Parallel Well-connected newcomer scenario Non-uniform dissemination of content 1 MB/s

Computer Science 11 Resilience To Partitioning Partition avoidance through discovery and awareness of multiple candidates Collaborative Reconstruction

Computer Science 12 Future Work  Implementation underway  More analysis of  Codes and correlation  Graph management  Security issues  Testing  WAN, simulated and real  Mobile environments  Extensions to streaming media