default search action
IPTPS 2005: Ithaca, NY, USA
- Miguel Castro, Robbert van Renesse:
Peer-to-Peer Systems IV, 4th International Workshop, IPTPS 2005, Ithaca, NY, USA, February 24-25, 2005, Revised Selected Papers. Lecture Notes in Computer Science 3640, Springer 2005, ISBN 3-540-29068-0 - Mahesh Balakrishnan, Maya Haridasan, Prakash Linga, Hongzhou Liu, Venugopalan Ramasubramanian, Sean C. Rhea, Manpreet Singh, Vidhyashankar Venkatraman, Vivek Vishnumurthy, Kevin Walsh, Bernard Wong, Ming Zhong:
Workshop Report. 1-12
Security and Incentives
- Fabian Kuhn, Stefan Schmid, Roger Wattenhofer:
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn. 13-23 - Lidong Zhou, Lintao Zhang, Frank McSherry, Nicole Immorlica, Manuel Costa, Steve Chien:
A First Look at Peer-to-Peer Worms: Threats and Defenses. 24-35 - Seth James Nielson, Scott A. Crosby, Dan S. Wallach:
A Taxonomy of Rational Attacks. 36-46
Search
- Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang:
Brushwood: Distributed Trees in Peer-to-Peer Systems. 47-57 - Austin T. Clements, Dan R. K. Ports, David R. Karger:
Arpeggio: Metadata Searching and Content Sharing with Chord. 58-68 - Jeremy Stribling, Isaac G. Councill, Jinyang Li, M. Frans Kaashoek, David R. Karger, Robert Tappan Morris, Scott Shenker:
OverCite: A Cooperative Digital Research Library. 69-79
Miscellaneous
- Venkata N. Padmanabhan, Sriram Ramabhadran, Jitendra Padhye:
NetProfiler: Profiling Wide-Area Networks Using Peer Cooperation. 80-92 - Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurell, Seif Haridi:
A Statistical Theory of Chord Under Churn. 93-103 - Hari Balakrishnan, Scott Shenker, Michael Walfish:
Peering Peer-to-Peer Providers. 104-114
Multicast
- Ashwin R. Bharambe, Sanjay G. Rao, Venkata N. Padmanabhan, Srinivasan Seshan, Hui Zhang:
The Impact of Heterogeneous Bandwidth Constraints on DHT-Based Multicast Protocols. 115-126 - Vinay S. Pai, Kapil Kumar, Karthik Tamilmani, Vinay Sambamurthy, Alexander E. Mohr:
Chainsaw: Eliminating Trees from Overlay Multicast. 127-140 - Daniel Sandler, Alan Mislove, Ansley Post, Peter Druschel:
FeedTree: Sharing Web Micronews with Peer-to-Peer Event Notification. 141-151
Overlay Algorithms
- Ruixiong Tian, Yongqiang Xiong, Qian Zhang, Bo Li, Ben Y. Zhao, Xing Li:
Hybrid Overlay Structure Based on Random Walks. 152-162 - Brian F. Cooper:
Quickly Routing Searches Without Having to Move Content. 163-172 - Ittai Abraham, Ankur Badola, Danny Bickson, Dahlia Malkhi, Sharad Maloo, Saar Ron:
Practical Locality-Awareness for Large Scale Information Sharing. 173-181
Empirical Studies
- Mao Yang, Zheng Zhang, Xiaoming Li, Yafei Dai:
An Empirical Study of Free-Riding Behavior in the Maze P2P File-Sharing System. 182-192 - Stevens Le Blond, Jean-Loup Guillaume, Matthieu Latapy:
Clustering in P2P Exchanges and Consequences on Performances. 193-204 - Johan A. Pouwelse, Pawel Garbacki, Dick H. J. Epema, Henk J. Sips:
The Bittorrent P2P File-Sharing System: Measurements and Analysis. 205-216
Miscellaneous
- Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide:
Dynamic Load Balancing in Distributed Hash Tables. 217-225 - Rodrigo Rodrigues, Barbara Liskov:
High Availability in DHTs: Erasure Coding vs. Replication. 226-239 - Prashanth P. Bungale, Geoffrey Goodell, Mema Roussopoulos:
Conservation vs. Consensus in Peer-to-Peer Preservation Systems. 240-251
Exploiting Network Locality
- Kevin P. Shanahan, Michael J. Freedman:
Locality Prediction for Oblivious Clients. 252-263 - Byung-Gon Chun, Ben Y. Zhao, John Kubiatowicz:
Impact of Neighbor Selection on Performance and Resilience of Structured P2P Networks. 264-274 - Peter R. Pietzuch, Jeffrey Shneidman, Jonathan Ledlie, Matt Welsh, Margo I. Seltzer, Mema Roussopoulos:
Evaluating DHT-Based Service Placement for Stream-Based Overlays. 275-286
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.