Presentation is loading. Please wait.

Presentation is loading. Please wait.

Elders know best Lifespan-based ideas in P2P systems

Published byΑἴαξ Παπαδόπουλος Modified over 6 years ago

Similar presentations

Presentation on theme: "Elders know best Lifespan-based ideas in P2P systems"— Presentation transcript:

1 Elders know best Lifespan-based ideas in P2P systems
Yi Qiao & Fabián E. Bustamante Department of Computer Science Northwestern University {yqiao,fabianb}cs.northwestern.edu

2 P2P systems & transient populations
P2P purest form – all peers are equal Simple protocols Clash with reality → loss of most appealing attributes Highly transient population As undesirable as unavoidable → Maintenance-related messages, plus → Degree of replication, effectiveness of caches, spread of queries, overall system scalability, … Same for other large-scale distributed systems Dept. of Computer Science Northwestern University

3 Peer lifespan distribution
Active probing in Gnutella > 7 days 500,000 peers, ~1 million peers’ lifespans Fits a Pareto distribution well (R2 ~ 0.99) In this context … Peer’s expected remaining lifetime proportional to its current age Dept. of Computer Science Northwestern University

4 Lifespan protocols & strategies
Lifespan-based protocols Network stability – connection breakdown & rejection, number of connections per peer, …. Effects on the application – query hits & response time Lifespan-based strategies query distribution, caching, replication Experimental setup Trace-driven simulation 4/20 collected traces, period 510,000 sec., ~150,000 peers ~3-4,000 peers under stable conditions Cold start, warm-up ~80,000 sec. excluded Newer results where obtained using 4 traces (instead of 1) Dept. of Computer Science Northwestern University

5 LSPAN-based protocols
Lower connection breakdowns ~30-42% reduction! With low rejection rates – LSPAN-3 ~ 1 every hrs! Random-Walk & Neighbor Caching Same hit rate & query response time with 5 instead of 16 random walkers! Gnutella KaZaa LSPAN-based Dept. of Computer Science Northwestern University

6 Elders know best – new strategies
Query distribution - LSPAN-biased random walk Replication - Region-based instead path-replication Higher query satisfaction Finding “needles” Dept. of Computer Science Northwestern University

7 Conclusions and future work
To deal with transient populations, pay attention to your seniors More stable P2P systems Faster queries replies, more query hits, … More scalable P2P systems Soon More results Wide-area evaluation on PlanetLab Lifespan and DHTs? Dept. of Computer Science Northwestern University

Download ppt "Elders know best Lifespan-based ideas in P2P systems"

Similar presentations

Ranveer Chandra Ramasubramanian Venugopalan Ken Birman

Ranveer Chandra Ramasubramanian Venugopalan Ken Birman
Peer-to-Peer and Social Networks An overview of Gnutella.

Peer-to-Peer and Social Networks An overview of Gnutella.
Fabián E. Bustamante, 2007 Meridian: A lightweight network location service without virtual coordinates B. Wong, A. Slivkins and E. Gün Sirer SIGCOM 2005.

Fabián E. Bustamante, 2007 Meridian: A lightweight network location service without virtual coordinates B. Wong, A. Slivkins and E. Gün Sirer SIGCOM 2005.
GIA: Making Gnutella-like P2P Systems Scalable Yatin Chawathe Intel Research Seattle Sylvia Ratnasamy, Lee Breslau, Scott Shenker, and Nick Lanham.

GIA: Making Gnutella-like P2P Systems Scalable Yatin Chawathe Intel Research Seattle Sylvia Ratnasamy, Lee Breslau, Scott Shenker, and Nick Lanham.
Fabián E. Bustamante, Fall 2005 Efficient Replica Maintenance for Distributed Storage Systems B-G Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon,

Fabián E. Bustamante, Fall 2005 Efficient Replica Maintenance for Distributed Storage Systems B-G Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon,
Ýmir Vigfússon IBM Research Haifa Labs Ken Birman Cornell University Qi Huang Cornell University Deepak Nataraj Cornell University.

Ýmir Vigfússon IBM Research Haifa Labs Ken Birman Cornell University Qi Huang Cornell University Deepak Nataraj Cornell University.
MPAC 2004Rae Harbird 1 RUBI Adaptive Resource Discovery for Ubiquitous Computing Rae Harbird Stephen Hailes

MPAC 2004Rae Harbird 1 RUBI Adaptive Resource Discovery for Ubiquitous Computing Rae Harbird Stephen Hailes
Structuring Unstructured Peer-to-Peer Networks Stefan Schmid Roger Wattenhofer Distributed Computing Group HiPC 2007 Goa, India.

Structuring Unstructured Peer-to-Peer Networks Stefan Schmid Roger Wattenhofer Distributed Computing Group HiPC 2007 Goa, India.
1 An Overview of Gnutella. 2 History The Gnutella network is a fully distributed alternative to the centralized Napster. Initial popularity of the network.

1 An Overview of Gnutella. 2 History The Gnutella network is a fully distributed alternative to the centralized Napster. Initial popularity of the network.
Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.

Search and Replication in Unstructured Peer-to-Peer Networks Pei Cao, Christine Lv., Edith Cohen, Kai Li and Scott Shenker ICS 2002.
Expediting Searching Processes via Long Paths in P2P Systems 05/30 IDEA Lab.

Expediting Searching Processes via Long Paths in P2P Systems 05/30 IDEA Lab.
Improving Gnutella Willy Henrique Säuberli Seminar in Distributed Computing, 16. November 2005 Papers: I.Making Gnutella-like P2P Systems Scalable; SIGCOMM.

Improving Gnutella Willy Henrique Säuberli Seminar in Distributed Computing, 16. November 2005 Papers: I.Making Gnutella-like P2P Systems Scalable; SIGCOMM.
P2p, Spring 05 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems March 29, 2005.

P2p, Spring 05 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems March 29, 2005.
IPSN/SPOTS 2007 Beacon Location Service A Location Service for Point-to-Point Routing in Wireless Sensor Networks EECS Department University of California,

IPSN/SPOTS 2007 Beacon Location Service A Location Service for Point-to-Point Routing in Wireless Sensor Networks EECS Department University of California,
Technion –Israel Institute of Technology Software Systems Laboratory A Comparison of Peer-to-Peer systems by Gomon Dmitri and Kritsmer Ilya under Roi Melamed.

Technion –Israel Institute of Technology Software Systems Laboratory A Comparison of Peer-to-Peer systems by Gomon Dmitri and Kritsmer Ilya under Roi Melamed.
1 Modeling and Taming Parallel TCP on the Wide Area Network Dong Lu,Yi Qiao Peter Dinda, Fabian Bustamante Department of Computer Science Northwestern.

1 Modeling and Taming Parallel TCP on the Wide Area Network Dong Lu,Yi Qiao Peter Dinda, Fabian Bustamante Department of Computer Science Northwestern.
1 A Framework for Lazy Replication in P2P VoD Bin Cheng 1, Lex Stein 2, Hai Jin 1, Zheng Zhang 2 1 Huazhong University of Science & Technology (HUST) 2.

1 A Framework for Lazy Replication in P2P VoD Bin Cheng 1, Lex Stein 2, Hai Jin 1, Zheng Zhang 2 1 Huazhong University of Science & Technology (HUST) 2.
Exploring Tradeoffs in Failure Detection in P2P Networks Shelley Zhuang, Ion Stoica, Randy Katz HIIT Short Course August 18-20, 2003.

Exploring Tradeoffs in Failure Detection in P2P Networks Shelley Zhuang, Ion Stoica, Randy Katz HIIT Short Course August 18-20, 2003.
1 SLIC: A Selfish Link-based Incentive Mechanism for Unstructured P2P Networks Qixiang Sun Hector Garcia-Molina Stanford University.

1 SLIC: A Selfish Link-based Incentive Mechanism for Unstructured P2P Networks Qixiang Sun Hector Garcia-Molina Stanford University.
UNIVERSITY OF JYVÄSKYLÄ Topology Management in Unstructured P2P Networks Using Neural Networks Presentation for IEEE Congress on Evolutionary Computing.

UNIVERSITY OF JYVÄSKYLÄ Topology Management in Unstructured P2P Networks Using Neural Networks Presentation for IEEE Congress on Evolutionary Computing.

Similar presentations

Ads by Google