An Alliance based Peering Scheme for P2P Live Media Streaming Darshan Purandare Ratan Guha University of Central Florida August 31, P2P-TV, Kyoto.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advanced Piloting Cruise Plot.
Kapitel 21 Astronomie Autor: Bennett et al. Galaxienentwicklung Kapitel 21 Galaxienentwicklung © Pearson Studium 2010 Folie: 1.
Copyright © 2003 Pearson Education, Inc. Slide 1 Computer Systems Organization & Architecture Chapters 8-12 John D. Carpinelli.
Chapter 1 The Study of Body Function Image PowerPoint
Cognitive Radio Communications and Networks: Principles and Practice By A. M. Wyglinski, M. Nekovee, Y. T. Hou (Elsevier, December 2009) 1 Chapter 12 Cross-Layer.
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 5 Author: Julia Richards and R. Scott Hawley.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
UNITED NATIONS Shipment Details Report – January 2006.
1 P2P Layered Streaming for Heterogeneous Networks in PPSP K. Wu, Z. Lei, D. Chiu James Zhibin Lei 17/03/2010.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Wireless Networks Should Spread Spectrum On Demand Ramki Gummadi (MIT) Joint work with Hari Balakrishnan.
An Analytical Study of Low Delay Multi-tree-based Overlay Multicast György Dán and Viktória Fodor School of Electrical Engineering KTH, Royal Institute.
Scalable Routing In Delay Tolerant Networks
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
ZMQS ZMQS
Xia Zhou*, Stratis Ioannidis ♯, and Laurent Massoulié + * University of California, Santa Barbara ♯ Technicolor Research Lab, Palo Alto + Technicolor Research.
Opportunities and Challenges of Peer-to-Peer Internet Video Broadcast Speaker: Shao-Fen Chou Adivisor: Dr. Ho-Ting Wu 11/14/
Solve Multi-step Equations
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Utility Optimization for Event-Driven Distributed Infrastructures Cristian Lumezanu University of Maryland, College Park Sumeer BholaMark Astley IBM T.J.
ABC Technology Project
1 Generating Network Topologies That Obey Power LawsPalmer/Steffan Carnegie Mellon Generating Network Topologies That Obey Power Laws Christopher R. Palmer.
College of Engineering Capacity Allocation in Multi-cell UMTS Networks for Different Spreading Factors with Perfect and Imperfect Power Control Robert.
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
VOORBLAD.
1 Breadth First Search s s Undiscovered Discovered Finished Queue: s Top of queue 2 1 Shortest path from s.
Differential Forms for Target Tracking and Aggregate Queries in Distributed Networks Rik Sarkar Jie Gao Stony Brook University 1.
Squares and Square Root WALK. Solve each problem REVIEW:
School of Computing Science Simon Fraser University, Canada
© 2012 National Heart Foundation of Australia. Slide 2.
Understanding Generalist Practice, 5e, Kirst-Ashman/Hull
Chapter 5 Test Review Sections 5-1 through 5-4.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
1 S Digital Communication Systems Advanced Modulation and Random Access Techniques.
25 seconds left…...
1 Atlantic Annual Viewing Trends Adults 35-54, Total TV, By Daypart Average Minute Audience (000) Average Weekly Reach (%) Average Weekly Hours Viewed.
Januar MDMDFSSMDMDFSSS
Week 1.
We will resume in: 25 Minutes.
Heterogeneity in Data-Driven Live Streaming: Blessing or Curse? Fabien Mathieu Hot-P2P, 04/23/2010.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
A SMALL TRUTH TO MAKE LIFE 100%
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
1 PART 1 ILLUSTRATION OF DOCUMENTS  Brief introduction to the documents contained in the envelope  Detailed clarification of the documents content.
How Cells Obtain Energy from Food
Delay Analysis and Optimality of Scheduling Policies for Multihop Wireless Networks Gagan Raj Gupta Post-Doctoral Research Associate with the Parallel.
An Alliance based PeeringScheme for P2P Live Media Streaming An Alliance based Peering Scheme for P2P Live Media Streaming Darshan Purandare Ratan Guha.
Presentation transcript:

An Alliance based Peering Scheme for P2P Live Media Streaming Darshan Purandare Ratan Guha University of Central Florida August 31, P2P-TV, Kyoto

P2P-TV 2007 Darshan Purandare 2 Outline Chunk based P2P models Current Issues Proposed peering scheme Discussion and summary

P2P-TV 2007 Darshan Purandare 3 Chunk based P2P models Server … … … … … … … … 1 3 Stream is split into pieces Stream is split into pieces

P2P-TV 2007 Darshan Purandare 4 Working Philosophy Peers exchange buffer map of data availability Retrieve the missing pieces and upload pieces to neighbors Scheduling algorithm finds which pieces to retrieve and from whom Partnership refinement helps to obtain better peers in terms of uploading rate

P2P-TV 2007 Darshan Purandare 5 Outline Chunk based P2P models Current Issues Proposed peering scheme Discussion and summary

P2P-TV 2007 Darshan Purandare 6 Current Issues Quality of Service Quality of Service can improve [Hei et al. 06] Long start up time Peer Lag Unfairness Unfairness [Ali et al. 06] Uplink bandwidth distribution uneven Sub-optimal uplink utilization May affect QoS & Scalability Can we do better ?

P2P-TV 2007 Darshan Purandare 7 Outline Chunk based P2P models Current Issues Proposed peering scheme Discussion and summary

P2P-TV 2007 Darshan Purandare 8 Proposed Model Chunk based paradigm but overlay formation using alliances Nodes cluster in groups of 4-8 to form alliances Power Media server relays content to Power nodes BEAM: Bit strEAMing

P2P-TV 2007 Darshan Purandare 9 BEAM: Working Philosophy A new node upon arrival obtains peerlist from Tracker Peerlist contains nodes in similar bandwidth range and similar network (if possible) Contacts peers for stream content Starts joining alliances or creates one Power nodes Server relays stream content to Power nodes Utility Factor Power nodes changes periodically based on Utility Factor (UF) A nodes UF computed using: Cumulative share ratio (CSR) Temporal share ratio (TSR)

P2P-TV 2007 Darshan Purandare 10 Alliance Formation 6, 17, 23 Peerlist of Node 1:: 6, 17, 23 12, 22, 43 Peerlist of Node 6: 12, 22, 43

P2P-TV 2007 Darshan Purandare 11 Alliance Properties A node can be a member of multiple alliances H H: Maximum number of nodes in an Alliance K K: Maximum number of alliances a node can join Number of neighbors = K(H-1)

P2P-TV 2007 Darshan Purandare 12 Alliance Functionality H = 5 K = 2

P2P-TV 2007 Darshan Purandare 13 Alliance Functionality H = 5 K = 2

P2P-TV 2007 Darshan Purandare 14 Why form Alliances ? Clustering into alliances forms a small world network graph Short Path Length Robust to network perturbations such as churn Close knit group ensures streaming content is readily available within alliances Alliance members have common trust & treaty

P2P-TV 2007 Darshan Purandare 15 Small World Network Dense local clustering (high clustering coefficient) Some links to other part of the graph (non local) Overlay distance is near-optimal Robust to churn [Watts et al., Nature,98]

P2P-TV 2007 Darshan Purandare 16 Simulator Details Streaming rate = 512 Kbps Media Servers Uplink = 1536 Kbps (3 links) Heterogeneous bandwidth class (512,128), (768,256), (1024, 512), (1536,768), (2048, 1024) H, K = 4, 2 (6 neighbor nodes) Each node buffers content for 120 sec

P2P-TV 2007 Darshan Purandare 17 QoS: Average Jitter Rate

P2P-TV 2007 Darshan Purandare 18 QoS: Average Latency

P2P-TV 2007 Darshan Purandare 19 Uplink Utilization

P2P-TV 2007 Darshan Purandare 20 Fairness: Share Ratio Range

P2P-TV 2007 Darshan Purandare 21 Fairness: Jitter Factor Range

P2P-TV 2007 Darshan Purandare 22 Fairness: Latency Range

P2P-TV 2007 Darshan Purandare 23 Summary Alliance based peering scheme is an effective technique to group peers QoS, Uplink throughput and fairness results are at par or even better than CoolStreaming Peer lag can be improved using BEAM Initial buffering time can be slightly improved Our research is complementary to advance source and channel coding techniques.

P2P-TV 2007 Darshan Purandare 24 Questions or Comments

Thank You!