Streaming over Subscription Overlay Networks Department of Computer Science Iowa State University.

Slides:



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

Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Incentives Build Robustness in BitTorrent Bram Cohen.
Impact Analysis of Cheating in Application Level Multicast s 1090176 Masayuki Higuchi.
Cognitive Publish/Subscribe for Heterogeneous Clouds Šarūnas Girdzijauskas, Swedish Institute of Computer Science (SICS) Joint work with:
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Wi-Fi Neighborcast: Enabling communication among nearby clients
Computer Science 1 ShapeShifter: Scalable, Adaptive End-System Multicast John Byers, Jeffrey Considine, Nicholas Eskelinen, Stanislav Rost, Dmitriy Zavin.
A Peer-to-Peer On-Demand Streaming Service and Its Performance Evaluation Presenter: Nera Liu Author: Yang Guo, Kyoungwon Suh, Jim Kurose and Don Towsley.
SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,
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,
A New Approach for the Construction of ALM Trees using Layered Coding Yohei Okada, Masato Oguro, Jiro Katto Sakae Okubo International Conference on Autonomic.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
Application Layer Anycasting: A Server Selection Architecture and Use in a Replicated Web Service Presented in by Jayanthkumar Kannan On 11/26/03.
Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of.
Slide Set 15: IP Multicast. In this set What is multicasting ? Issues related to IP Multicast Section 4.4.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
Application Layer Multicast
Overlay Networks EECS 122: Lecture 18 Department of Electrical Engineering and Computer Sciences University of California Berkeley.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
CS218 – Final Project A “Small-Scale” Application- Level Multicast Tree Protocol Jason Lee, Lih Chen & Prabash Nanayakkara Tutor: Li Lao.
Peer-to-peer Multimedia Streaming and Caching Service by Won J. Jeon and Klara Nahrstedt University of Illinois at Urbana-Champaign, Urbana, USA.
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.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
University of Nevada, Reno Virtual Direction Multicast for Overlay Networks Suat Mercan & Dr. Murat Yuksel HOTP2P’11.
Communication Part IV Multicast Communication* *Referred to slides by Manhyung Han at Kyung Hee University and Hitesh Ballani at Cornell University.
P2P File Sharing Systems
Wi-Fi Neighborcast: Enabling communication among nearby clients
Communication (II) Chapter 4
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
70-291: MCSE Guide to Managing a Microsoft Windows Server 2003 Network Chapter 12: Routing.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking BGP, Flooding, Multicast routing.
Common Devices Used In Computer Networks
ON DESIGING END-USER MULTICAST FOR MULTIPLE VIDEO SOURCES Y.Nakamura, H.Yamaguchi, A.Hiromori, K.Yasumoto †, T.Higashino and K.Taniguchi Osaka University.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Identifying Application Impacts on Network Design Designing and Supporting Computer.
Overcast: Reliable Multicasting with an Overlay Network CS294 Paul Burstein 9/15/2003.
 Network Segments  NICs  Repeaters  Hubs  Bridges  Switches  Routers and Brouters  Gateways 2.
Overlay Network Physical LayerR : router Overlay Layer N R R R R R N.
2: Application Layer1 Chapter 2 outline r 2.1 Principles of app layer protocols r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail r 2.5 DNS r 2.6 Socket.
Higashino Lab. Maximizing User Gain in Multi-flow Multicast Streaming on Overlay Networks Y.Nakamura, H.Yamaguchi and T.Higashino Graduate School of Information.
Multicast Routing Algorithms n Multicast routing n Flooding and Spanning Tree n Forward Shortest Path algorithm n Reversed Path Forwarding (RPF) algorithms.
© 2006 Cisco Systems, Inc. All rights reserved.Cisco PublicITE I Chapter 6 1 Identifying Application Impacts on Network Design Designing and Supporting.
Live Streaming over Subscription Overlay Networks CS587x Lecture Department of Computer Science Iowa State University.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
Impact of Topology on Overlay Multicast Suat Mercan.
Chapter 21 Topologies Chapter 2. 2 Chapter Objectives Explain the different topologies Explain the structure of various topologies Compare different topologies.
Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.
Multicast instant channel change in IPTV systems 1.
SocialTube: P2P-assisted Video Sharing in Online Social Networks
Video Multicast over the Internet Presented by: Liang-Yuh Wu Lung-Yuan Wu Hao-Hsiang Ku 12 / 6 / 2001 Bell Lab. And Georgia Institute of Technologies IEEE.
Star Topology Star Networks are one of the most common network topologies. consists of one central switch, hub or computer, which acts as a conduit to.
CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.
Click to edit Master title style Multi-Destination Routing and the Design of Peer-to-Peer Overlays Authors John Buford Panasonic Princeton Lab, USA. Alan.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
CHAPTER -II NETWORKING COMPONENTS CPIS 371 Computer Network 1 (Updated on 3/11/2013)
17 th -21 st July nd APAN Meeting in Singapore ’06 Forwarding State Reduction for One-to-Many Group Communications Sahar A. Al-Talib (PhD. Candidate)
Cost-Effective Video Streaming Techniques Kien A. Hua School of EE & Computer Science University of Central Florida Orlando, FL U.S.A.
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Multicast Outline Multicast Introduction and Motivation DVRMP.
Internet Networking recitation #12
THE NETWORK LAYER.
Chapter 3: Dynamic Routing
Host Multicast: A Framework for Delivering Multicast to End Users
EE 122: Lecture 13 (IP Multicast Routing)
Design and Implementation of OverLay Multicast Tree Protocol
Presentation transcript:

Streaming over Subscription Overlay Networks Department of Computer Science Iowa State University

Outline Subscription Overlay Network (SONet) Subscription management Streaming over SONet Performance Study Concluding Remarks

Subscription Overlay Network Two components One central server  Streaming source (eg., live TV broadcast, etc.) A number of subscribing nodes  Pay monthly fee in return of video services  A node can be offline/online/idling/playing One Service Streaming video data from source to all online nodes Three goals Minimize the server workload Minimize network traffic Minimize data latency S r r r r

Solution I: Unicast Dedicating one stream for each online node Advantages Simple implementation Good data freshness Disadvantages Server bottleneck: not scalable

Solution II: IP Multicast One multicast stream can serve many clients simultaneously Advantages Simple implementation Achieve all three goals Disadvantages IP Multicast is not widely deployed on the Internet (due to security issues, etc.)

Solution III: Application Layer Multicast A node receiving data can forward its incoming stream to serve others Existing ALM techniques Chaining/ESM NICE/ZIPZAG, etc. Advantages each server stream can serve many clients Leverage the entire network resource Disadvantages Only the playing nodes can contribute Difficult to maintain topology, etc. s c1 c3 c4 c2 c5 c6

Observation and Motivation A SONet may consist of a large number of subscribers, but at any one time, only a small percentage of them are playing American watch TV 4 hours/day in average A majority of SONet not playing may be idling Unlike regular TV sets, a node not playing is likely to be online Recruiting appropriate idling nodes for data forwarding can effectively reduce network traffic

Motivation Examples Server workload? Network traffic? Data freshness?

Subscription Management Account database The server maintains all subscriber information, including IP, password, the amount of data forwarded (for discount purpose), etc. Topology graph When a new member M joins, the server S detects its path to the members  A path is denoted as PATH(S, M) = S  R1  R2  M When a member M1 is asked to forward data to another member M2, M1 reports the actual PATH(M1, M2) to the server  The connections among the members are detected and updated as needed  The topology graph becomes more and more accurate to the server

Some Notations Path(X, Y) The sequence of routers on the shortest path from X to Y (as known to the server) Ring(R, i) The set of routers that are i-hop away from R Capacity(N) The number of streams N can forward Local node and local router A node and a router is local to each other if they connect directly

Node Status Changing A node can make itself only offline, idling, or playing Only the server can decide when a node can become an incentive node

A node becomes online When a node becomes online, the server may bundle the streams flowing through N’s local router

Bundling Procedure

A node becomes playing The node is in incentive Simply turn on its player The node was in idling, find a parent Find the joint router Rj A parent should be as close as possible to the join  Prefer playing node  If not, recruit an incentive node, more than one candidates may be available (what is the choosing criteria

Find Parent Candidates

Choosing Incentive Node

If N’s capacity is not 0 It can help serve others The server finds the parent by searching Ring(Rj, 0), …, but stops at Ring(Rj, d), where d is Hop(N, Rj) Since N can serve at least one child, it can redirect its incoming stream to its parent’s current child

A node becomes offline or idling Find a new parent for each child of this node The parent can be either an incentive or playing node

Performance Study Performance Metrics Mean Relative Delay (MRP)  The MRP of a node X is to defined to HOP(S, X)/StreamingPath(S, X)  Measure the data freshness Link Stress  The total amount of traffic flowing through each network links Our study focus on Effect of subscription size Effect of topology size Effect of active rate

Effect of Subscription Size

Concluding Remarks SONet: a framework for video streaming over the Internet Similar to cable/satellite broadcast networks Allows effective incentive mechanisms Centralized subscription and topology maintenance A new topology-oriented technique for building application layer multicast Unique in its ability of incorporating idling nodes to assist in data forwarding Simulation confirms its performance advantage Future work???