Looking up data in P2P systems

@article{Balakrishnan2003LookingUD,
  title={Looking up data in P2P systems},
  author={H. Balakrishnan and M. Frans Kaashoek and David R. Karger and Robert Tappan Morris and Ion Stoica},
  journal={Commun. ACM},
  year={2003},
  volume={46},
  pages={43-48}
}
The main challenge in P2P computing is to design and implement a robust and scalable distributed system composed of inexpensive, individually unreliable computers in unrelated administrative domains. The participants in a typical P2P system might include computers at homes, schools, and businesses, and can grow to several million concurrent participants. 

Figures from this paper

Data In P 2 P Systems
TLDR
The goals, characteristics and data sharing problems that may exist in P2P systems are discussed, and a case study of ORION, a file sharing system in MANET P1P systems is done.
PHAC: An Environment for Distributed Collaborative Applications on P2P Networks
TLDR
The objective of the work is to offer one P2P network based on high availability based on PHAC framework to improve the dependability of applications.
Decentralized Data Storages: Technologies of Construction
TLDR
It is shown that, although they have some common properties typical of all peer-to-peer (P2P) networks, the tasks they solve and, hence, the technologies used to construct storage facilities of different types are significantly different.
A Research about Redundant Data Packet in Unstructured P2P Network
TLDR
This paper analyzes the reason of engendering redundant data packet and puts forward the Condensing Forward-List algorithm to reduce redundancy, and finds that it has good results.
A Survey on Peer-to-Peer and DHT
TLDR
This survey takes a look at P2P in general and DHT algorithms and implementations in more detail and concludes that pure peer-to-peer systems among distributed systems have no dependence on a central resource.
The Sea of Stuff: a model to manage shared mutable data in a distributed environment
"This work was supported by Adobe Systems, Inc. and EPSRC [grant number EP/M506631/1]" - from the Acknowledgements page
Attribute-based data access over p2p systems
TLDR
Designs of DHT based P2P systems that extend the interface to support attribute based data access by extracting semantic information from the queries are presented and solutions for approximate as well as exact answers to range queries are described.
An Agenda for Robust Peer-to-Peer Storage
TLDR
This paper presents a research agenda for the design and implementation of a robust storage system based on DHTs and analyzes previous research papers to conclude that a DHT for robust storage does not require some of the properties of existing D HTs but requires other properties that some DHTS do not possess.
Monitoring system of the resource sharing network
In order to solve the problem existing in the P2P network, the author issue a new method to monitor the P2P shared resource network. This solution can handle the problem that is hard to monitor
Interceptor: middleware-level application segregation and scheduling for P2P systems
  • C. Anglano
  • Computer Science
    Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
  • 2006
TLDR
This paper presents Interceptor, a middleware-level application segregation and scheduling system that is able to strictly enforce quantitative limitations on node resource usage and to make P2P applications achieve satisfactory performance even in face of these limitations.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 28 REFERENCES
A scalable content-addressable network
TLDR
The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
TLDR
A peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment is described using a novel XOR-based metric topology that simplifies the algorithm and facilitates the proof.
INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery
TLDR
The design, implementation, and evaluation of INS/Twine is described, an approach to scalable intentional resource discovery, where resolvers collaborate as peers to distribute resource information and to resolve queries.
Analysis of the evolution of peer-to-peer systems
TLDR
It is argued that traditional performance measures based on run-time are uninformative for a continually running P2P network, and that the rate at which nodes in the network need to participate to maintain system state is a more useful metric.
Wide-area cooperative storage with CFS
The Cooperative File System (CFS) is a new peer-to-peer read-only storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file storage and retrieval. CFS
Dynamically Fault-Tolerant Content Addressable Networks
TLDR
A content addressable network which is robust in the face of massive adversarial attacks and in a highly dynamic environment and can be created and maintained in a completely distributed fashion.
Distributed object location in a dynamic network
TLDR
This work presents a new distributed algorithm that can solve the nearest-neighbor problem for these networks and describes its solution in the context of Tapestry, an overlay network infrastructure that employs techniques proposed by Plaxton, Rajaraman, and Richa.
Chord: A scalable peer-to-peer lookup service for internet applications
TLDR
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Freenet: A Distributed Anonymous Information Storage and Retrieval System
We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet
Pastry: Scalable, distributed object location and routing for large-scale peer-to-
TLDR
Experimental results obtained with a prototype implementa tion on a simulated network of up to 100,000 nodes confirm Pastry’s scalability, its ability to selfconfigure and adapt to node failures, and its good network loc ality properties.
...
1
2
3
...