Determining the Peer Resource Contributions in a P2P Contract

Slides:



Advertisements
Similar presentations
Rarest First and Choke Algorithms are Enough Arnaud LEGOUT INRIA, Sophia Antipolis France G. Urvoy-Keller and P. Michiardi Institut Eurecom France.
Advertisements

Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
On Large-Scale Peer-to-Peer Streaming Systems with Network Coding Chen Feng, Baochun Li Dept. of Electrical and Computer Engineering University of Toronto.
On the Economics of P2P Systems Speaker Coby Fernandess.
Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.
Xavier León PhD defense
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 (
CompSci 356: Computer Network Architectures Lecture 21: Content Distribution Chapter 9.4 Xiaowei Yang
Small-world Overlay P2P Network
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Network Coding for Large Scale Content Distribution Christos Gkantsidis Georgia Institute of Technology Pablo Rodriguez Microsoft Research IEEE INFOCOM.
End-to-End Analysis of Distributed Video-on-Demand Systems Padmavathi Mundur, Robert Simon, and Arun K. Sood IEEE Transactions on Multimedia, February.
Spotlighting Decentralized P2P File Sharing Archie Kuo and Ethan Le Department of Computer Science San Jose State University.
Building Low-Diameter P2P Networks Eli Upfal Department of Computer Science Brown University Joint work with Gopal Pandurangan and Prabhakar Raghavan.
1 Modeling peer-peer file sharing systems Ge, Z.; Figueiredo, D.R.; Sharad Jaiswal; Kurose, J.; Towsley, D.; INFOCOM Twenty-Second Annual Joint Conference.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
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,
Kyushu University Graduate School of Information Science and Electrical Engineering Department of Advanced Information Technology Supervisor: Professor.
presented by Hasan SÖZER1 Scalable P2P Search Daniel A. Menascé George Mason University.
1 Client-Server versus P2P  Client-server Computing  Purpose, definition, characteristics  Relationship to the GRID  Research issues  P2P Computing.
Improving Data Access in P2P Systems Karl Aberer and Magdalena Punceva Swiss Federal Institute of Technology Manfred Hauswirth and Roman Schmidt Technical.
Freenet. Anonymity  Napster, Gnutella, Kazaa do not provide anonymity  Users know who they are downloading from  Others know who sent a query  Freenet.
1 Proceeding the Second Exercises on Computer and Systems Engineering Professor OKAMURA Laboratory. Othman Othman M.M.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
Gil EinzigerRoy Friedman Computer Science Department Technion.
1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.
Do incentives build robustness in BitTorrent? Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani.
EmNet: Satisfying The Individual User Through Empathic Home Networks J. Scott Miller, John R. Lange & Peter A. Dinda Department of Electrical Engineering.
MULTI-TORRENT: A PERFORMANCE STUDY Yan Yang, Alix L.H. Chow, Leana Golubchik Internet Multimedia Lab University of Southern California.
Quantitative Evaluation of Unstructured Peer-to-Peer Architectures Fabrício Benevenuto José Ismael Jr. Jussara M. Almeida Department of Computer Science.
Othman Othman M.M., Koji Okamura Kyushu University 1.
A Peer-to-Peer Approach to Resource Discovery in Grid Environments (in HPDC’02, by U of Chicago) Gisik Kwon Nov. 18, 2002.
AlvisP2P : Scalable Peer-to-Peer Text Retrieval in a Structured P2P Network Toan Luu, Gleb Skobeltsyn, Fabius Klemm, Maroje Puh, Ivana Podnar Zarko, Martin.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
Impact of Incentives in BitTorrent By Jenny Liu and Seth Cooper.
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.
Analyzing the Vulnerability of Superpeer Networks Against Attack Niloy Ganguly Department of Computer Science & Engineering Indian Institute of Technology,
CS 640: Introduction to Computer Networks Aditya Akella Lecture 24 - Peer-to-Peer.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
On Reducing Mesh Delay for Peer- to-Peer Live Streaming Dongni Ren, Y.-T. Hillman Li, S.-H. Gary Chan Department of Computer Science and Engineering The.
ADVANCED COMPUTER NETWORKS Peer-Peer (P2P) Networks 1.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
Analyzing and Improving BitTorrent Ashwin R. Bharambe ( Carnegie Mellon University ) Cormac Herley ( Microsoft Research, Redmond ) Venkat Padmanabhan (
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
Malugo – a scalable peer-to-peer storage system..
Cloud-based movie search web application with transaction service Group 14 Yuanfan Zhang Ji Zhang Zhuomeng Li.
Lecture XV: Real P2P Systems
Coral: A Peer-to-peer Content Distribution Network
An example of peer-to-peer application
Measurements, Analysis, and Modeling of BitTorrent-like Systems
Introduction to BitTorrent
Nuno Salta Supervisor: Manuel Ricardo Supervisor: Ricardo Morla
Introduction to Load Balancing:
BitTorrent Vs Gnutella.
The Impact of Replacement Granularity on Video Caching
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
مظفر بگ محمدی دانشگاه ایلام
Plethora: Infrastructure and System Design
Authors Alessandro Duminuco, Ernst Biersack Taoufik and En-Najjary
Improving Performance in the Gnutella Protocol
Do incentives build robustness in BitTorrent?
Simplified Explanation of “Do incentives build robustness in BitTorrent?” By James Hoover.
The BitTorrent Protocol
Content Distribution Networks + P2P File Sharing
IFIP – Performance 2007 A Modeling Framework to Understand the Tussle between ISPs and Peer-to-Peer File Sharing Users Michele Garetto - unito.
Challenges with developing a Commercial P2P System
Content Distribution Networks + P2P File Sharing
Presentation transcript:

Determining the Peer Resource Contributions in a P2P Contract Behrooz Khorashadi Department of Computer Science University of California at Davis Joint work with D. Ghosal and X. Liu 11/19/2018 Hot-P2P 2005

Motivation P2P file-sharing traffic now dominates Internet traffic The word on the street: “half of Internet traffic is BitTorrent traffic” Limitation of BitTorrent Some times it may take days to download an object Methods to improve BitTorrent 11/19/2018 Hot-P2P 2005

Motivation (2) Seeds (peers that have all parts of the object) may leave the system BitTorrent like systems are robust only under flash-crowd scenarios The system would be much more robust if seeds remained in the system Key questions: How long; i.e., how much resource is required from the peer? How to incentivize seeds to remain in the system? 11/19/2018 Hot-P2P 2005

Talk Outline P2P Contract Key Issues P2P Contract in a Centralized System Relative importance of different components of the contribution primitive P2P Contract in a Decentralized System Methods to set contracts Related Work Conclusions and future work 11/19/2018 Hot-P2P 2005

P2P Contract A contract between a requesting client and the P2P system Resources required from the requesting client Quality of service guaranteed by the system Admission control Depending on the availability of the resources, admit clients who agree to the contract 11/19/2018 Hot-P2P 2005

P2P Contract in a File Sharing System A seed gives a requesting client a list of referrals to where file can be retrieved, IF the client agrees to become a peer and Serve up to N other requesting client Within T seconds after retrieving file P2P Contract System guarantees quality of service for the peer contributions 11/19/2018 Hot-P2P 2005

Example System Controller Queued Requests Pool of Active Peers All requests at sent to the seed/controller The controller doles out the contract Controller Queued Requests Pool of Active Peers 11/19/2018 Hot-P2P 2005

Example: N=2, T=∞ 10 11 2 4 1 3 5 6 7 8 9 11/19/2018 Hot-P2P 2005

Issues Performance Implementation Enforcement Centralized vs. decentralized implementation How should the contract be set? Static vs. dynamic Performance What is the relative importance of N and T in controlling the service capacity? Enforcement How to enforce? What is the impact of contract breaches? 11/19/2018 Hot-P2P 2005

Contract Scheme Analysis of the scheme in a centralized architecture Show that T is a more important control parameter Still N still plays an important role For a decentralized architecture Proposed and analyzed an adaptive scheme to set contracts without requiring global knowledge 11/19/2018 Hot-P2P 2005

Relative Importance of N and T The number of servers in the system is a linear function of T Impact of N is not significant for N ≥3 The N part of the contract provides an upper-bound on the bandwidth consumption 11/19/2018 Hot-P2P 2005

Decentralized P2P Architecture No information about the location of seeds and active peers Requests are flooded out with some predefined TTL value. Each active peer/seed receiving the request issues a contract to the requesting client If multiple contracts are received by the requesting client, the best one (i.e., smallest contract) is chosen If no active peer/seed is reached, the query fails 11/19/2018 Hot-P2P 2005

Decentralized P2P Architecture 11/19/2018 Hot-P2P 2005

Implementation in a Decentralized System Generation i Generation i+1 S: Seed; AP: Active Peer; CP: Client Peer The dark the color the higher the contract value 11/19/2018 Hot-P2P 2005

Decentralized P2P Architecture (2) Key Issues No global knowledge of the load Setting contracts that will stabilize the system Minimize query failure Maximize efficiency Number of original seeds 11/19/2018 Hot-P2P 2005

Decentralized Scheme System objectives Keep query failure rate low Keep TTL small As in the centralized system, T is a more important parameter than N How to set T? Related questions What is an acceptable failure rate? How detrimental is it to have too many servers? 11/19/2018 Hot-P2P 2005

Distance Modulated Contracts Let d be the distance from the seed/active peer to the requesting peer The Seed/active peer sets the T part of contract proportional to d T=d T=d2 Distance modulated with a TTL based dampening factor T=Kd2/TTL2 where K is some constant 11/19/2018 Hot-P2P 2005

Distance Modulated Contracts 11/19/2018 Hot-P2P 2005

Distance Modulated Contracts 11/19/2018 Hot-P2P 2005

Load Modulated Contracts If the overall load (request rate l) is known For a given value of TTL it can be shown that To stabilize the system, i.e., the query failure rate is less than e Where e is some acceptable request failure rate which is set to be 0.5% N(TTL) is the number of neighbors and is proportional to TTL2 11/19/2018 Hot-P2P 2005

Load Modulated Contracts 11/19/2018 Hot-P2P 2005

Load Modulated Contracts 11/19/2018 Hot-P2P 2005

Load Modulated Contracts Without Global Knowledge In practice an active peer does not know load l Each active peer keeps track of lN(TTL) This information is sent to the requesting client with the contract Each requesting client uses a simple moving average to estimate lN(TTL) 11/19/2018 Hot-P2P 2005

Results (1) 11/19/2018 Hot-P2P 2005

Results (2) 11/19/2018 Hot-P2P 2005

Summary P2P Contract Self-scaling - capacity scale with demand Resource bartering and admission scheme Self-scaling - capacity scale with demand Centralized Implementation Fixed value of N and T is sufficient T is a more important control parameter Decentralized Load modulated contract Distance modulated contract 11/19/2018 Hot-P2P 2005

Incentive Schemes BitTorrent: Tit-for-Tat type of scheme Micro-payment Kazaa: internal token scheme Popular Power: external currency Gnuttella: Altruistic (good Samaritan) scheme, which isn’t really a scheme at all 70% of users are free riders 11/19/2018 Hot-P2P 2005

Future Work Contract enforcement Multiple classes of contracts What is the impact of contact breaches? What are simple methods to enforce contracts? Multiple classes of contracts Router contracts Have a few servers connected by routers Get real world results based on BitTorrent traces Look more carefully into distance modulated contracts 11/19/2018 Hot-P2P 2005