𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Mitigating unfairness in locality-aware peer-to-peer networks

✍ Scribed by Frank Lehrieder; Simon Oechsner; Tobias Hoßfeld; Dirk Staehle; Zoran Despotovic; Wolfgang Kellerer; Maximilian Michel

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
818 KB
Volume
21
Category
Article
ISSN
1055-7148

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

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

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

A framework for distributed bandwidth al
A framework for distributed bandwidth allocation in peer-to-peer networks
✍ Iordanis Koutsopoulos; George Iosifidis 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 830 KB

In peer-to-peer networks, each peer plays the role of client and server. As a server, it receives content requests of others and decides to what extent it will satisfy them by allocating upload bandwidth. As a client, it sends its own requests to others to download content. We consider a star topolo