Randomized algorithms
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
A data tracking scheme for general networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The Small-World Phenomenon: An Algorithmic Perspective
The Small-World Phenomenon: An Algorithmic Perspective
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Small World Architecture for Peer-to-Peer Networks
WI-IATW '06 Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology
Properties and mechanisms of self-organizing MANET and P2P systems
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Fault-tolerant peer-to-peer search on small-world networks
Future Generation Computer Systems
Self-organized customized content delivery architecture for ambient assisted environments
UPGRADE '08 Proceedings of the third international workshop on Use of P2P, grid and agents for the development of content networks
Small-World Peer-to-Peer for Resource Discovery
Information Networking. Towards Ubiquitous Networking and Services
P2P Networking and Applications
P2P Networking and Applications
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
A self-organization mechanism based on cross-entropy method for P2P-like applications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
| Hi-index | 0.00 |
Efficient data retrieval in an unstructured peer-to-peer system like Freenet is a challenging problem. In this paper, we study the impact of workload on the performance of Freenet. We find that there is a steep reduction in the hit ratio of document requests with increasing load in Freenet. We show that a slight modification of Freenet's routing table cache replacement scheme (from LRU to a replacement scheme that enforces clustering in the key space) can significantly improve performance. Our modification is based on intuition from the small-world models and theoretical results by Kleinberg; our replacement scheme forces the routing tables to resemble neighbor relationships in a small-world acquaintance graph--clustering with light randomness. Our simulations show that this new scheme improves the request hit ratio dramatically while keeping the small average hops per successful request comparable to LRU. A simple, highly idealized model of Freenet under clustering with light randomness proves that the expected message delivery time in Freenet is O(log n) if the routing tables satisfy the small-world model and have the size θ(log2n).