A Lightweight Currency-based P2P VoD Incentive Mechanism Presented by Svetlana Geldfeld by Chi Wang, Hongbo Wang, Yu Lin, and Shanzhi Chen.

Slides:



Advertisements
Similar presentations
Collaboration Mechanisms in SOA based MANETs. Introduction Collaboration implies the cooperation between the nodes to support the proper functioning of.
Advertisements

Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
Incentives Build Robustness in BitTorrent Author: Bram Cohen Presenter: Brian Liao.
Novasky: Cinematic-Quality VoD in a P2P Storage Cloud Speaker : 童耀民 MA1G Authors: Fangming Liu†, Shijun Shen§,Bo Li†, Baochun Li‡, Hao Yin§,
CS Spring 2009 CS 414 – Multimedia Systems Design Lecture 28 – Media Server (Part 3) Klara Nahrstedt Spring 2009.
CLive Cloud-Assisted P2P Live Streaming
Playback delay in p2p streaming systems with random packet forwarding Viktoria Fodor and Ilias Chatzidrossos Laboratory for Communication Networks School.
On Large-Scale Peer-to-Peer Streaming Systems with Network Coding Chen Feng, Baochun Li Dept. of Electrical and Computer Engineering University of Toronto.
The Role of Prices in Peer-Assisted Content Distribution Christina Aperijis Michael J. Freedman Ramesh Johari Presented by: Kyle Chauvin and Henry Xie.
Suphakit Awiphan, Takeshi Muto, Yu Wang, Zhou Su, Jiro Katto
Cloud Download : Using Cloud Utilities to Achieve High-quality Content Distribution for Unpopular Videos Yan Huang, Tencent Research, Shanghai, China Zhenhua.
CompSci 356: Computer Network Architectures Lecture 21: Content Distribution Chapter 9.4 Xiaowei Yang
CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture XV: Real P2P Systems.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
An Efficient Implementation of Interactive Video-on-Demand Steven Carter and Darrell Long University of California, Santa Cruz Jehan-François Pâris University.
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
Motivation Due to the development of new Internet access technologies (DSL's and HFC's), VoD services have become increasingly popular Despite the continuous.
Improving ISP Locality in BitTorrent Traffic via Biased Neighbor Selection Ruchir Bindal, Pei Cao, William Chan Stanford University Jan Medved, George.
Service Differentiated Peer Selection An Incentive Mechanism for Peer-to-Peer Media Streaming Ahsan Habib, Member, IEEE, and John Chuang, Member, IEEE.
Locality-Aware Request Distribution in Cluster-based Network Servers 1. Introduction and Motivation --- Why have this idea? 2. Strategies --- How to implement?
Prefix Caching assisted Periodic Broadcast for Streaming Popular Videos Yang Guo, Subhabrata Sen, and Don Towsley.
Exploiting Content Localities for Efficient Search in P2P Systems Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang 1 1 College of William and Mary,
A Novel Video Layout Strategy for Near-Video-on- Demand Servers Shenze Chen & Manu Thapar Hewlett-Packard Labs 1501 Page Mill Rd. Palo Alto, CA
On Line Markets for Distributed Object Services: The MAJIC System Lior Levy, Liad Blumrosen and Noam Nisan The Hebrew University, Jerusalem Presented by.
Understanding Mesh-based Peer-to-Peer Streaming Nazanin Magharei Reza Rejaie.
Free-rider problem in peer-to- peer networks Sumitra Ganesh.
Performance Evaluation of Peer-to-Peer Video Streaming Systems Wilson, W.F. Poon The Chinese University of Hong Kong.
1 CompuP2P: An Architecture for Sharing of Computing Resources In Peer-to-Peer Networks With Selfish Nodes Rohit Gupta and Arun K. Somani
Supporting VCR-like Operations in Derivative Tree-Based P2P Streaming Systems Tianyin Xu, Jianzhong Chen, Wenzhong Li, Sanglu Lu Nanjing University Yang.
Loopback: Exploiting Collaborative Caches for Large-Scale Streaming Ewa Kusmierek, Yingfei Dong, Member, IEEE, and David H. C. Du, Fellow, IEEE.
Modeling Quality-Quantity based Communication Orr Srour under the supervision of Ishai Menache.
CUHK Analysis of Movie Replication and Benefits of Coding in P2P VoD Yipeng Zhou Aug 29, 2012.
Some recent work on P2P content distribution Based on joint work with Yan Huang (PPLive), YP Zhou, Tom Fu, John Lui (CUHK) August 2008 Dah Ming Chiu Chinese.
CS Spring 2012 CS 414 – Multimedia Systems Design Lecture 34 – Media Server (Part 3) Klara Nahrstedt Spring 2012.
# Idowu Samuel O. # Kashif Shahzad # Arif Kamal M7001E - Multimedia systems [ltu.se] ©2011.
Can Internet Video-on-Demand Be Profitable? SIGCOMM 2007 Cheng Huang (Microsoft Research), Jin Li (Microsoft Research), Keith W. Ross (Polytechnic University)
A User Experience-based Cloud Service Redeployment Mechanism KANG Yu.
Research on cloud computing application in the peer-to-peer based video-on-demand systems Speaker : 吳靖緯 MA0G rd International Workshop.
Allerton 2011 September 28 Mathias Humbert, Mohammad Hossein Manshaei, and Jean-Pierre Hubaux EPFL - Laboratory for Communications and Applications (LCA1)
A Game Theoretic Framework for Incentives in P2P Systems --- CS. Uni. California Jun Cai Advisor: Jens Graupmann.
1 One-Click Hosting Services: A File-Sharing Hideout Demetris Antoniades Evangelos P. Markatos ICS-FORTH Heraklion,
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.
BitTorrent Presentation by: NANO Surmi Chatterjee Nagakalyani Padakanti Sajitha Iqbal Reetu Sinha Fatemeh Marashi.
Peer to Peer Network Anas Hardan. What is a Network? What is a Network? A network is a group of computers and other devices (such as printers) that are.
An Analysis of Chaining Protocols for Video-on-Demand J.-F. Pâris University of Houston Thomas Schwarz, S. J. Universidad Católica del Uruguay.
Michael Sirivianos Xiaowei Yang Stanislaw Jarecki Presented by Vidya Nalan Chakravarthy.
DELAYED CHAINING: A PRACTICAL P2P SOLUTION FOR VIDEO-ON-DEMAND Speaker : 童耀民 MA1G Authors: Paris, J.-F.Paris, J.-F. ; Amer, A. Computer.
Do incentives build robustness in BitTorrent? Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani.
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.
Multimedia Operating Systems ●File System Paradigms ●File Replacement ●Caching ●Disk.
Segment-Based Proxy Caching of Multimedia Streams Authors: Kun-Lung Wu, Philip S. Yu, and Joel L. Wolf IBM T.J. Watson Research Center Proceedings of The.
P2P Traffic Localization by Alias Tracker for Tracker-based P2P applications (ATTP) draft-zhang-alto-attp-02 Yunfei Zhang China Mobile.
A Non-Monetary Protocol for P2P Content Distribution in Wireless Broadcast Networks with Network Coding I-Hong Hou, Yao Liu, and Alex Sprintson Dept. of.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
Topic: P2P Trading in Social Networks: The Value of Staying Connected The purpose of this paper is to propose a P2P incentive paradigm named Networked.
Kaleidoscope – Adding Colors to Kademlia Gil Einziger, Roy Friedman, Eyal Kibbar Computer Science, Technion 1.
Efficient P2P Search by Exploiting Localities in Peer Community and Individual Peers A DISC’04 paper Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang.
Incentives for Sharing in Peer-to-Peer Networks By Philippe Golle, Kevin Leyton-Brown, Ilya Mironov, Mark Lillibridge.
SocialTube: P2P-assisted Video Sharing in Online Social Networks
Scheduled Video Delivery—A Scalable On-Demand Video Delivery Scheme Min-You Wu, Senior Member, IEEE, Sujun Ma, and Wei Shu, Senior Member, IEEE Speaker:
Can Internet Video-on-Demand Be Profitable? Cheng Huang, Jin Li (Microsoft Research), Keith W. Ross (Polytechnic University) ACM SIGCOMM 2007.
1 Push-to-Peer Video-on-Demand System. 2 Abstract Content is proactively push to peers, and persistently stored before the actual peer-to-peer transfers.
Cooperative Mobile Live Streaming Considering Neighbor Reception SPEAKER: BO-YU HUANG ADVISOR: DR. HO-TING WU 2015/10/15 1.
A simple model for analyzing P2P streaming protocols. Seminar on advanced Internet applications and systems Amit Farkash. 1.
Inside the New Coolstreaming: Principles, Measurements and Performance Implications Bo Li, Susu Xie, Yang Qu, Gabriel Y. Keung, Chuang Lin, Jiangchuan.
SYNERGY: A Game-Theoretical Approach for Cooperative Key Generation in Wireless Networks Jingchao Sun, Xu Chen, Jinxue Zhang, Yanchao Zhang, and Junshan.
Lecture XV: Real P2P Systems
An example of peer-to-peer application
Determining the Peer Resource Contributions in a P2P Contract
Presentation transcript:

A Lightweight Currency-based P2P VoD Incentive Mechanism Presented by Svetlana Geldfeld by Chi Wang, Hongbo Wang, Yu Lin, and Shanzhi Chen

Paper Overview  P2P VoD system has to allow its users to watch video at any point in time and to provide such features as fast forward, rewind and pause.  The proposed system provides a lightweight incentive mechanism based on virtual currency to improve its performance.  Game theoretic analysis is provided to prove that the proposed incentive mechanism can relieve server’s heavy load and increase users’ contributions.

P2P Systems Overview  P2P is very popular due to its powerful sharing and distributing ability.  This ability is heavily reduced without a suitable incentive mechanism.  Users have strong motivations to be free riding the system.  For example, Gnutella study shows that 85% users share no files.

Barter-Exchange Incentive Mechanism  Peer offers data needed by another peer and gets data he needs as reward.  Easy to implement.  Prone to delays while seeking for suitable peer  Peer has no incentive to keep sharing file after download completes.  Example: Bit-Torrent tit-for-tat mechanism

Virtual Currency Incentive  System first establishes an account for every user.  It charges users for every download and rewards for every upload.  System removes time delay while seeking for peers.  Adds extra load into the system by tracking every transaction.  Examples:  Micro-payment, Dandelion, Scrip, Pace, etc.

P2P and Media Streaming  Media streaming system has its own particular characteristics:  1. Peer with advanced point in playback can provide data for the behind peer, but the latter has nothing to give in exchange (barter-exchange will not work).  2. Real-time streaming requires quick location of a peer and data exchange. It also requires that the incentive mechanism to be as light as possible.  3. Users are scattered among thousands of video files so it is difficult for them to cooperate.

Media Streaming Classification  Can be subdivided into two groups:  1. Live streaming  Content transmitted in real time to all users  2. Video on Demand  Asynchronous content distribution => heavier burden on the server.

Multiple Video Cache  Main characteristic:  larger buffer for storage of additional data (not just the playback buffer)  Users allocate additional memory for previous movies, which they have viewed before and upload that data while they are watching a different movie.  Greatly improves cooperation and reduces server load.

Virtual Currency-based Incentive Mechanism  Server keeps all account information for each user.  Peer gains “money” when uploads the completely downloaded file.  Other peers “pay” to that peer for the download.  Audience peers (watching the same video file) are not considered by the system.

Features  Incentive is applied to the entire system (not a single file).  Only upload and audience peers data exchange is considered.  Encourages users to share the file that is completely downloaded.

Further Discussion  Currency-based incentive mechanism system details  Game theory analysis of the system  Conclusions

System Structure  Two main modules are considered:  1. Servers Provide centralized management of the system including video content and peers’ account maintanance.  2. Peers Can start watching a movie at any point in time with small startup times and sustainable playback rates.

System Architecture –Cont.

Pricing Scheme  Two main questions when constructing:  1. What to price  2. How to set the price  Main requirements:  Peer actions that result in reducing server load should be rewarded and the opposite should be charged accordingly.  Playback quality should not be affected.

Pricing Scheme Considerations  Uploading peers are main contributors to saving server bandwidth.  No uploading peers = server does all the work.  Upload peer’s contribution is much more significant due to the fact that he has the whole file downloaded = higher probability of having complete file received from that source by the audience peer.  Upload peer contribution considered higher on average.

Pricing Scheme Considerations – cont.  Data sharing between audience peers is also important, but not accounted for in the pricing.  The accounting that would be required to keep these records would surpass the effectiveness gained by the system.  Therefore, only upload and audience peers data exchanges are considered for accounting by the server.

Main Pricing Factors  Reward can be calculated as: where R is reward that peer k gets from uploading file j, p is the unit price per upload bandwidth, and y is the rate of peer kuploading file j.  So total reward of the set of upload peers can be calculated as  From the above we can derive, where Bj is the bill a peer group pays for downloading file j.

Resulting System Overview  Main idea: Price of upload bandwidth is global and uniform.  Therefore:  Reward is directly dependent on the shared bandwidth.  Reward does not depend on the actual video file shared.  The payment decreases with number of peers in the audience group.  Collusion will not work in such system:  Case when there are only collusion peers in the system: the total balance will be 0 => no incentive.  Case the peers disguising as an audience: balance will not come right (upload rates are not sustainable)

System Mechanisms  When a new peer joins:  Bank server opens a new account and offers a subsidy to help with first file download  The amount of subsidy is the major consideration for system effectiveness:  Subsidy too small – new peer will not download a complete file  Subsidy too large – peers can avoid to contribute to the system (periodically leave and rejoin the system getting new subsidy each time) Currently the subsidy is set to the median price of all the video files in the system.

System Mechanisms  A request for a video chunk process: 1. A peer i chooses a video interest group G to join as an audience peer. 2. Peer i sends request for a video chunk to the server 3. Server replies i with a list of peers in the video group 4. i chooses from the list the audience peers with data available 5. If no such peer is available, i searches the upload peer list 6. If no upload peers are available, i requests the server to transfer data.

System Mechanisms  End of video chunk transmission:  1. After a video chunk is transmitted from upload peer to audience peer, the server records the interest group, the upload peer and his upload bandwidth.  2. The Bank server records every trade and deposits the rewards in the account of the seller.  3. The Bank server draws points from the balance of the buyer.

Game Theoretic Evaluation  Game consists of three main components:  1. Set of players (peers)  2. Set of strategies for each player  3. Utility function that gives each player’s utility to each list of the players’ strategies.  Players are assumed to be selfish and rational  Each player’s belief about other players’ strategies is believed to be correct.  Peer decisions reflect several VoD system parameters: video group to join, download and upload rate, usage of disk space (bandwidth and jitter are omitted for simplicity).

No Incentive Mechanism System Analysis  The utility function of such system can be represented as follows:  U(x,y,d), where  X = download rate  Y = upload rate  D = occupied disk space  The authors prove that such system is the most effective when user maximizes its download rate and minimizes upload rate and disk space utilization.

Lightweight Currency-based Incentive System Analysis  The utility function of such system can be represented as follows:  U(x,y,z,d), where  X = download rate  Y = upload rate  Z = upload rate of a completed file (already vewed)  D = occupied disk space  The authors mathematically prove that such system provides incentive for a peer to upload as much as possible in order to maximize his utility.  They further show that the more users download the better utility they can get, thus achieving maximum download rates.

Conclusions  1. Features of P2P VoD system were analyzed.  2. It was shown that the fundamental problem of the VoD system lies in the heavy server load and random action of the peers in the system.  3. A new lightweight incentive mechanism based on currency was proposed.  4. Its pricing scheme was analyzed and it was shown that the system stimulates peers to share the completely downloaded video files.  5. It was demonstrated through game theoretical analysis that the system can lighten the server load and increase cooperation between peers.

Future Work  1. Differentiated service scheme would be a nice addition to the system. Example: higher resolution videos in exchange for higher points.  Study of reduction of cross-ISP traffic would be advantageous for the system. Alternatively, ISPs could become a part of the system and get “paid” for better network utilization.

Questions?