## Abstract The huge popularity of recent peerβtoβpeer (P2P) file sharing systems has been mainly driven by the scalability of their architectures and the flexibility of their search facilities. Such systems are usually designed as unstructured P2P networks, because they impose few constraints on t
Unstructured peer-to-peer networks for sharing processor cycles
β Scribed by Asad Awan; Ronaldo A. Ferreira; Suresh Jagannathan; Ananth Grama
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 373 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In unstructured peerβtoβpeer (P2P) networks, two autonomous peer nodes can be connected if users in those nodes are interested in each other's data. Owing to the similarity between P2P networks and social networks, where peer nodes can be regarded as people and connections can be regard
RDF-based P2P networks have a number of advantages compared to simpler P2P networks such as Napster, Gnutella or to approaches based on distributed indices on binary keys such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited