Mohamed Hefeeda Analysis of Peer-Assisted Video-on- Demand Systems with Scalable Video Streams Mohamed Hefeeda (Joint work with Kianoosh Mokhtarian) 22.

Slides:



Advertisements
Similar presentations
1 School of Computing Science Simon Fraser University Live P2P Streaming with Scalable Video Coding and Network Coding Shabnam Mirshokraie April 2010.
Advertisements

School of Computing Science Simon Fraser University, Canada
On Large-Scale Peer-to-Peer Streaming Systems with Network Coding Chen Feng, Baochun Li Dept. of Electrical and Computer Engineering University of Toronto.
Using P2P Technologies for Video on Demand (VoD) Limor Gavish limorgav at tau.ac.il Yuval Meir wil at tau.ac.il Tel-Aviv University Based on:  Cheng Huang,
View-Upload Decoupling: A Redesign of Multi-Channel P2P Video Systems Keith Ross Polytechnic Institute of NYU.
Kangaroo: Video Seeking in P2P Systems Xiaoyuan Yang †, Minas Gjoka ¶, Parminder Chhabra †, Athina Markopoulou ¶, Pablo Rodriguez † † Telefonica Research.
Peer-assisted On-demand Streaming of Stored Media using BitTorrent-like Protocols Authors: Niklas Carlsson & Derek L. Eager Published in: Proc. IFIP/TC6.
Lava: A Reality Check of Network Coding in Peer-to-Peer Live Streaming Mea Wang, Baochun Li Department of Electrical and Computer Engineering University.
1 Communication Networks Kolja Eger, Prof. Dr. U. Killat 1 From Packet-level to Flow-level Simulations of P2P Networks Kolja Eger, Ulrich Killat Hamburg.
1 Nazanin Magharei, Reza Rejaie University of Oregon INFOCOM 2007 PRIME: P2P Receiver-drIven MEsh based Streaming.
Network Coding in Peer-to-Peer Networks Presented by Chu Chun Ngai
1 Analysis of BitTorrent-like Protocols for On-Demand Stored Media Streaming Khandoker Nadim Parvez Carey Williamson Anirban Mahanti Niklas Carlsson.
Queueing Models for P2P Systems.  Extend classical queuing theory for P2P systems.  Develop taxonomy for different variations of these queuing models.
1 School of Computing Science Simon Fraser University, Canada PCP: A Probabilistic Coverage Protocol for Wireless Sensor Networks Mohamed Hefeeda and Hossein.
Modelling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks.
Analyzing and Improving BitTorrent Ashwin R. Bharambe ( Carnegie Mellon University ) Cormac Herley ( Microsoft Research, Redmond ) Venkat Padmanabhan (
Using Layered Video to Provide Incentives in P2P Live Streaming
1 School of Computing Science Simon Fraser University, Canada Modeling and Caching of P2P Traffic Mohamed Hefeeda Osama Saleh ICNP’06 15 November 2006.
June 3, A New Multipath Routing Protocol for Ad Hoc Wireless Networks Amit Gupta and Amit Vyas.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Analysis of Multimedia Authentication Schemes Mohamed Hefeeda (Joint work.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
1 Live P2P Streaming with Scalable Video Coding and Network Coding Shabnam Mirshokraie, Mohamed Hefeeda School of Computing Science Simon Fraser University,
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Multimedia Streaming in Dynamic Peer-to-Peer Systems and Mobile Wireless.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada End-to-End Secure Delivery of Scalable Video Streams Mohamed Hefeeda (Joint.
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,
1 School of Computing Science Simon Fraser University, Canada Rate-Distortion Optimized Streaming of Fine-Grained Scalable Video Sequences Mohamed Hefeeda.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Adaptive Video Streaming Over Internet Using Dynamic Video Transcoding By Lam Ling Shun, Felix.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
Modeling and analysis of BitTorrent-like P2P network Fan Bin Oct,1 st,2004.
CoolStreaming/DONet: A Data- driven Overlay Network for Peer- to-Peer Live Media Streaming INFOCOM 2005 Xinyan Zhang, Jiangchuan Liu, Bo Li, and Tak- Shing.
MMCN’091 School of Computing Science Simon Fraser University Bounding Switching Delay in Mobile TV Broadcast Networks Cheng-Hsin Hsu Joint Work with Mohamed.
Distributed Multimedia Streaming over Peer-to-Peer Network Jin B. Kwon, Heon Y. Yeom Euro-Par 2003, 9th International Conference on Parallel and Distributed.
PROMISE: Peer-to-Peer Media Streaming Using CollectCast M. Hefeeda, A. Habib, B. Botev, D. Xu, and B. Bhargava ACM Multimedia 2003, November 2003.
Quality-Aware Segment Transmission Scheduling in Peer-to-Peer Streaming Systems Cheng-Hsin Hsu Senior Research Scientist Deutsche Telekom R&D Lab USA Los.
On Peer-to-Peer Media Streaming Dongyan Xu Mohamed Heffeda Susanne Hamrusch Bharat Bhargava 2002 International Conference on Distributed Computing Systems.
KIANOOSH MOKHTARIAN SCHOOL OF COMPUTING SCIENCE SIMON FRASER UNIVERSITY 3/24/2008 Secure Multimedia Streaming.
Understanding Mesh-based Peer-to-Peer Streaming Nazanin Magharei Reza Rejaie.
6/28/2015Reza Rejaie INFOCOM 07 1 Nazanin Magharei, Reza Rejaie University of Oregon PRIME: P2P Receiver-drIven MEsh based.
On Peer-to-Peer Media Streaming by Dongyan Xu, Mohamed Hefeeda, Susanne Hambrusch, Bharat Bhargava Dept. of Computer Science, Purdue University, West Lafayette.
A Framework for Cost-Effective Peer-to- Peer Content Distribution Mohamed Hefeeda and Bharat Bhargava Department of Computer Sciences Purdue University.
On-Demand Media Streaming Over the Internet Mohamed M. Hefeeda, Bharat K. Bhargava Presented by Sam Distributed Computing Systems, FTDCS Proceedings.
PROMISE: Peer-to-Peer Media Streaming Using CollectCast Presented by: Randeep Singh Gakhal CMPT 886, July 2004.
Receiver-driven Layered Multicast Paper by- Steven McCanne, Van Jacobson and Martin Vetterli – ACM SIGCOMM 1996 Presented By – Manoj Sivakumar.
Can Internet Video-on-Demand Be Profitable? SIGCOMM 2007 Cheng Huang (Microsoft Research), Jin Li (Microsoft Research), Keith W. Ross (Polytechnic University)
1 Enabling near-VoD via P2P Networks Siddhartha Annapureddy Saikat Guha, Dinan Gunawardena Christos Gkantsidis, Pablo Rodriguez World Wide Web, 2007.
Exploring VoD in P2P Swarming Systems By Siddhartha Annapureddy, Saikat Guha, Christos Gkantsidis, Dinan Gunawardena, Pablo Rodriguez Presented by Svetlana.
COCONET: Co-Operative Cache driven Overlay NETwork for p2p VoD streaming Abhishek Bhattacharya, Zhenyu Yang & Deng Pan.
Effective Utilization of User-Contributed Resources in Peer-Assisted Video-on-Demand Systems HONGYANG LI, Research Intern at University of Victoria, Victoria,
BitTorrent Under a Microscope: Towards Static QoS Provision in Dynamic Peer-to-Peer Networks Tom H. Luan*, Xuemin (Sherman) Shen* and Danny H. K. Tsang.
Hybrid Peer-to-Peer Media Distribution Systems: a Performance Study Yicheng Tu, Jianzhong Sun and Sunil Prabhakar Department of Computer Sciences, Purdue.
DELAYED CHAINING: A PRACTICAL P2P SOLUTION FOR VIDEO-ON-DEMAND Speaker : 童耀民 MA1G Authors: Paris, J.-F.Paris, J.-F. ; Amer, A. Computer.
1 Towards Cinematic Internet Video-on-Demand Bin Cheng, Lex Stein, Hai Jin and Zheng Zhang HUST and MSRA Huazhong University of Science & Technology Microsoft.
Distributing Layered Encoded Video through Caches Authors: Jussi Kangasharju Felix HartantoMartin Reisslein Keith W. Ross Proceedings of IEEE Infocom 2001,
Resilient Peer-to-Peer Streaming Presented by: Yun Teng.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Video Streaming over Cooperative Wireless Networks Mohamed Hefeeda (Joint.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada Optimal Partitioning of Fine-Grained Scalable Video Streams Mohamed Hefeeda.
HUAWEI TECHNOLOGIES CO., LTD. Page 1 Survey of P2P Streaming HUAWEI TECHNOLOGIES CO., LTD. Ning Zong, Johnson Jiang.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Peer-Assisted Content Distribution Pablo Rodriguez Christos Gkantsidis.
PRIME: P2P Receiver-drIven MEsh based Streaming Nazanin Magharei, Reza Rejaie University of Oregon Presenter Jungsik Yoon.
On the Optimal Scheduling for Media Streaming in Data-driven Overlay Networks Meng ZHANG with Yongqiang XIONG, Qian ZHANG, Shiqiang YANG Globecom 2006.
A Simple Model for Analyzing P2P Streaming Protocols Zhou Yipeng Chiu DahMing John, C.S. Lui The Chinese University of Hong Kong.
A simple model for analyzing P2P streaming protocols. Seminar on advanced Internet applications and systems Amit Farkash. 1.
SHADOWSTREAM: PERFORMANCE EVALUATION AS A CAPABILITY IN PRODUCTION INTERNET LIVE STREAM NETWORK ACM SIGCOMM CING-YU CHU.
Daniel A. G. Manzato and Nelson L. S. da Fonseca Institute of Computing, State University of Campinas Campinas, Brazil speaker: 吳麟佑.
Network and Systems Laboratory nslab.ee.ntu.edu.tw Yipeng Zhou, Dah Ming Chiu, and John C.S. Lui Information Engineering Department The Chinese University.
Improving QoS in BitTorrent-like VoD Systems Yan Yang Alix L.H. Chow Leana Golubchik Dannielle Bragg Univ. of Southern California Harvard University InfoCom.
Proxy Caching for Peer-to-Peer Live Streaming The International Journal of Computer Networks, 2010 Ke Xu, Ming Zhang, Mingjiang Ye Dept. of Computer Science,
Geethanjali College Of Engineering and Technology Cheeryal( V), Keesara ( M), Ranga Reddy District. I I Internal Guide Mrs.CH.V.Anupama Assistant Professor.
Presentation transcript:

Mohamed Hefeeda Analysis of Peer-Assisted Video-on- Demand Systems with Scalable Video Streams Mohamed Hefeeda (Joint work with Kianoosh Mokhtarian) 22 February School of Computing Science Simon Fraser University, Canada

Mohamed Hefeeda Motivations  Wide deployment of P2P streaming systems -PPLive, UUSee, SopCast, CoolStreaming, ….  Video streams: 300 kbps to 1.5+ Mbps  Typically more than upload bandwidth of most peers  seed servers needed to help  peer- assisted streaming systems 2

Mohamed Hefeeda Motivations  Receivers are quite heterogeneous -network, processing power, screen resolution, … 3

Mohamed Hefeeda Supporting Receiver Heterogeneity  Encode low bitrate videos -Supports more receivers -Low video quality for everyone  Distribute multiple versions (simulcasting) -Need to encode video several times -Switching among versions (wait for next I-frame) -Reduced connectivity (P2P): different stream versions  different P2P networks 4

Mohamed Hefeeda Supporting Receiver Heterogeneity  Multiple Description Coding (MDC) -Video quality ~ number of descriptions received -Considerable bitrate overhead -Computationally complex  Scalable Video Coding (SVC) -Encode and distribute one video stream -Extract and decode various substreams -Lower overhead, simpler than MDC -Our focus in this paper 5

Mohamed Hefeeda Our Contributions  Analytical model for peer-assisted streaming systems with SVC -General model; details worked out for typical systems -Validated using simulations  Provides insights and answers questions such as -What is the expected throughput or video quality? -How much seeding capacity is needed to increase quality to certain level? -How many peers can the system support in flash crowd scenarios? 6

Mohamed Hefeeda Previous Works  Capacity growth of P2P system over time [Tu 05] -Finding the time to turn off servers -Similar analysis based on fluid model in [Kumar 07] -Only nonscalable video streams  Streaming capacity/startup delay and piece selection strategies [Zhou 07, Parvez 08] -Random matching of peers  Analysis based on constructing specific overlay topology [Small 06, Liu 08] -Cannot support most of today’s systems 7

Mohamed Hefeeda System Model  Trackers -Receive periodic update reports from peers  Peers -Join by contacting one of the trackers -Try to serve lower layers first As many layers as they can -Download in a streaming form, at the video bitrate  Seed servers -Serve requests when not enough capacity in peers -Finite resources 8

Mohamed Hefeeda System Model  Video file divided into S small segments -Time unit = segment length = T seg (e.g., 1 minute) -Peers in P s (peers currently watching segment s ) can serve to peers in P 1,…,s-1  Serving requests by seed servers -Random -Contribution based [Mokhtarian 09] 9

Mohamed Hefeeda System Model  Inputs (characteristics of P2P system) -Joint distribution of upload and download bandwidths (random variables D and U ) Pr( x 1 ≤ D ≤ x 2, y 1 ≤ U ≤ y 2 ) -The expected peer seeding duration T seed -Capacity of seed servers C, number of video layers L, bitrate of each layer r l (t) at each segment t -Distribution of peer arrivals (random variable N ) Pr(N = n): probability of n arrivals in one time unit ( T seg ) -Peer failure/departure rate γ (t) at segment t 10

Mohamed Hefeeda System Model  Outputs -System throughput -Average video quality served -Max number of supported peers (flash crowd) 11

Mohamed Hefeeda General Analytical Model: Overview  High-level procedure -Step 1: Estimate the capacity that peers in P s can serve to others (i.e., P 1,…,s-1 ) as a function of the capacity served to P s -Step 2: Employ this function for s = S, S-1, …, 1 to analyze the distribution of the complete video 12

Mohamed Hefeeda General Analytical Model: Step 1  Step 1: Distribution of one video segment -f(e, l, r l, n) : expected value of output capacity for layer l of a segment when serving it with capacity e to n peers e ≥ r l × n : trivial  f(.) in this case denoted by f all (.) e < r l × n : only [ e/r l ] of the n peers can be served  Selected randomly  f rnd (.)  Selected based on contribution  f opt (.) -Auxiliary rnd variable U l : upload bw of peers for layer l Distr of U l estimated using U and peers upload behavior 13

Mohamed Hefeeda General Analytical Model: Step 1  Step 1: Distribution of one video segment -f(e, l, r l, n) : expected value of the output capacity k : num peers that capacity e can serve with layer l R l : bitrate of the first l layers E [ U l | D ≥ R l ] : expected upload bw (for layer l ) of a peer given that it can download layers 1 to l 14

Mohamed Hefeeda General Analytical Model: Step 1  Step 1: Distribution of one video segment -f opt (e, l, r l, n) : expected output capacity of the first k peers out of a set of n -Assume a sorted list of peers according to serving capacity for layer l. Let k+1 -st peers have capacity x The expected capacity of the first k peers: Pr( k peers have capacity > x, one has x, n - k have < x ) 15

Mohamed Hefeeda General Analytical Model: Step 2  Step 2: distribution of video segments over time -Peers dynamics (at a given segment) Using f opt | rnd | all (.) obtained so far, the expected output capacity of a set of peers at a segment is: -Pr( there are n peers demanding layer l at a given seg ) : calc’ed using distr of N & D (arrivals and bandwidths) -Pr( a peer at a given seg stays until next seg ) : calculated using peer failure rate 16

Mohamed Hefeeda General Analytical Model: Step 2  Step 2: distribution of video segments over time -We know how to calculate the expected output of peers at a segment (prev slide): -e : input capacitiy, l : layer, r l : layer rate, N : random variable denoting arrivals, ε : probability of departure -At time instance i, throughput of peers at segment t is: -Term I : input capacity to seg, r l (t) : rate of layer l at seg t, Λ t (rnd variable): num peers at t, γ(t) : departure rate at t 17

Mohamed Hefeeda General Analytical Model: Step 2  Step 2: distribution of video segments over time -x i t,l converge over time; x t,l : the converged value -Expected num peers receiving layer l of segment t in the long term: m t,l = x t,l / r l (t)  Steady-state throughput:  Average video quality: Λ t : because different num peers in different segs 18

Mohamed Hefeeda General Analytical Model: Step 2  Step 2: distribution of video segments over time -Max peers that system can support in a flash crowd? -Recall: the expected num peers receiving layer l of segment t in the long term: m t,l = x t,l / r l (t) -Max of number of supportable peer = number of minimal substreams (base layers) that can be served using the expected capacity of the system = [total capacity – capacity needed for minimally serving current peers] / bitrate of base layer of first few segs = 19

Mohamed Hefeeda Analysis of Example System: Procedure  Employing the general analytical model to analyze a sample P2P streaming system -Video streams: L layers, each at rate r kbps -Download bandwidths ~ U(0, M) -Upload bandwidth = α × download bandwidth -Peer arrivals: Poisson distribution with arrival rate λ -Peer departures: given probabilities γ t at each seg t  Auxiliary random variables, intermediary functions f opt | rnd | all (.), and finally, m t,l values calculated 20

Mohamed Hefeeda Analysis of an Example System: Results  Distribution of one layer of one video segment -1-hour video, 1-min segments, 10 layers at rate 200 kbps each, max download bw: 10 Mbps, upload bw: 20% of download, arrival rate: 10 peers per minute, 25% of peers eventually leave Num peers receiving layer 5. Lowest curve: seed server capacity of 1 layer rate. 21

Mohamed Hefeeda Analysis of an Example System: Results  Distribution of the complete video Average video quality delivered to peers for different seeding capacities 22

Mohamed Hefeeda Validation of the Analysis  Simulation setup -Peers and video characteristics On average 500—600 peers in the network -Event-driven simulation, 10-second time step -Peers disobey some of our model assumptions and have other dynamics; to simulate realistic settings 23

Mohamed Hefeeda Validation of the Analysis: Results Theoretical results are close to simulation results 24

Mohamed Hefeeda Analyzing Seed Server Allocation Methods Expected throughput of the system in the long term 25

Mohamed Hefeeda Analyzing Flash Crowd Scenarios Max number of peers that the system can serve (with minimal substream) in a flash crowd 26

Mohamed Hefeeda Conclusions  Theoretical analysis of P2P/peer-assisted streaming systems with scalable videos -The long-term throughput and delivered video quality The cost-benefit tradeoff for provisioning a higher server capacity to have a desired throughput/quality -Max number of peers that the system can support in a flash crowd -Validated though simulations; results confirm the accuracy 27

Mohamed Hefeeda Thank You! Questions??  More info at: 28

Mohamed Hefeeda References  [Small 06]: T. Small, B. Liang, and B. Li. Scaling laws and tradeoffs in peer-to-peer live multimedia streaming. In Proc. of ACM Multimedia Conference, pages , Santa Barbara, CA, October  [Liu 08]: S. Liu, R. Zhang-Shen, W. Jiang, J. Rexford, and M. Chiang. Performance bounds for peer-assisted live streaming. In Proc. of ACM Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'08), pages , Annapolis, MD, June  [Tu 05]: Y. Tu, J. Sun, M. Hefeeda, Y. Xia, and S. Prabhakar. An analytical study of peer-to- peer media streaming systems. ACM Transactions on Multimedia Computing, Communications, and Applications, 1(4): , November  [Kumar 07]: R. Kumar, L. Yong, and K. Ross. Stochastic fluid theory for P2P streaming systems. In Proc. of IEEE INFOCOM'07, pages , Anchorage, AK, May  [Zhou 07]: Y. Zhou, D. Chiu, and J. Lui. A simple model for analyzing P2P streaming. In Proc. of IEEE International Conference on Network Protocols (ICNP'07), pages , Beijing, China, October  [Parvez 08]: N. Parvez, C. Williamson, A. Mahanti, and N. Carlsson. Analysis of Bittorrent-like protocols for on-demand stored media streaming. In Proc. of ACM Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'08), pages , Annapolis, MD, June