✦ LIBER ✦

Reputation and trust management in heterogeneous peer-to-peer networks

✍ Scribed by Xiaowen Chu; Xiaowei Chen; Kaiyong Zhao; Jiangchuan Liu

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 640 KB
Volume: 44
Category: Article
ISSN: 1018-4864
DOI: 10.1007/s11235-009-9259-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fuzzy techniques for trust and reputatio

Fuzzy techniques for trust and reputation management in anonymous peer-to-peer systems

✍ Roberto Aringhieri; Ernesto Damiani; Sabine De Capitani Di Vimercati; Stefano Pa 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

## Abstract Peer‐to‐peer (P2P) applications are rapidly gaining acceptance among users of Internet‐based services, especially because of their capability of exchanging resources while preserving the anonymity of both requesters and providers. However, concerns have been raised about the possibility

Combining search and trust models in uns

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

✍ Hoda Mashayekhi; Jafar Habibi 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 964 KB

Peer-to-Peer Technologies in Network and

Peer-to-Peer Technologies in Network and Service Management

✍ Aiko Pras; Jürgen Schönwälder; Burkhard Stiller 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 97 KB

Managing peer-to-peer networks with huma

Managing peer-to-peer networks with human tactics in

✍ Lu Liu; Nick Antonopoulos; Stephen Mackin 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 632 KB

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

Random walks in peer-to-peer networks: A

Random walks in peer-to-peer networks: Algorithms and evaluation

✍ Christos Gkantsidis; Milena Mihail; Amin Saberi 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 243 KB

We quantify the effectiveness of random walks for searching and construction of unstructured peer-to-peer (P2P) networks. We have identified two cases where the use of random walks for searching achieves better results than flooding: (a) when the overlay topology is clustered, and (b) when a client