𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combining search and trust models in unstructured peer-to-peer networks

✍ Scribed by Hoda Mashayekhi; Jafar Habibi

Publisher
Springer US
Year
2009
Tongue
English
Weight
964 KB
Volume
53
Category
Article
ISSN
0920-8542

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Efficient search in unstructured peer-to
Efficient search in unstructured peer-to-peer networks
✍ Cholvi, Vicent ;Felber, Pascal ;Biersack, Ernst πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 207 KB πŸ‘ 1 views

## 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

Meta-searches in peer-to-peer networks
Meta-searches in peer-to-peer networks
✍ Juha Lehikoinen; Ilkka Salminen; Antti Aaltonen; Pertti Huuskonen; Juha Kaario πŸ“‚ Article πŸ“… 2005 πŸ› Springer 🌐 English βš– 809 KB
Meta-searches in peer-to-peer networks
Meta-searches in peer-to-peer networks
✍ Juha Lehikoinen; Ilkka Salminen; Antti Aaltonen; Pertti Huuskonen; Juha Kaario πŸ“‚ Article πŸ“… 2005 πŸ› Springer 🌐 English βš– 809 KB
Efficient resource discovery in self-org
Efficient resource discovery in self-organized unstructured peer-to-peer networks
✍ Lu Liu; Nick Antonopoulos; Stephen Mackin; Jie Xu; Duncan Russell πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 503 KB

## 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