[LIBRO][B] P2P networking and applications

J Buford, H Yu, EK Lua - 2009 - books.google.com
Peer-to-Peer (P2P) networks enable users to directly share digital content (such as audio,
video, and text files) as well as real-time data (such as telephony traffic) with other users …

[PDF][PDF] Bandwidth-efficient management of DHT routing tables

J Li, J Stribling, R Morris, MF Kaashoek - Proceedings of the 2nd …, 2005 - usenix.org
Today an application developer using a distributed hash table (DHT) with n nodes must
choose a DHT protocol from the spectrum between O (1) lookup protocols [9, 18] and O (log …

[PDF][PDF] Improving lookup performance over a widely-deployed DHT

D Stutzbach, R Rejaie - Proceedings IEEE INFOCOM 2006 …, 2006 - elearning.di.unipi.it
During recent years, Distributed Hash Tables (DHTs) have been extensively studied through
simulation and analysis. However, due to their limited deployment, it has not been possible …

Using lightweight modeling to understand Chord

P Zave - ACM SIGCOMM Computer Communication Review, 2012 - dl.acm.org
Correctness of the Chord ring-maintenance protocol would mean that the protocol can
eventually repair all disruptions in the ring structure, given ample time and no further …

Modeling heterogeneous user churn and local resilience of unstructured P2P networks

Z Yao, D Leonard, X Wang… - Proceedings of the 2006 …, 2006 - ieeexplore.ieee.org
Previous analytical results on the resilience of un-structured P2P systems have not explicitly
modeled heterogeneity of user churn (ie, difference in online behavior) or the impact of in …

Flickr: Who is looking?

R Van Zwol - IEEE/WIC/ACM International Conference on Web …, 2007 - ieeexplore.ieee.org
This article presents a characterization of user behavior on Flickr, a popular on-line photo
sharing service that allows users to store, search, sort and share their photos. Based on a …

On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks

D Leonard, Z Yao, V Rai… - IEEE/ACM Transactions …, 2007 - ieeexplore.ieee.org
To model P2P networks that are commonly faced with high rates of churn and random
departure decisions by end-users, this paper investigates the resilience of random graphs to …

Reasoning about identifier spaces: How to make chord correct

P Zave - IEEE Transactions on Software Engineering, 2017 - ieeexplore.ieee.org
The Chord distributed hash table (DHT) is well-known and often used to implement peer-to-
peer systems. Chord peers find other peers, and access their data, through a ring-shaped …

Identification of dynamic community in temporal network via joint learning graph representation and nonnegative matrix factorization

D Li, Q Lin, X Ma - Neurocomputing, 2021 - Elsevier
The accumulated temporal networks provide an opportunity to explore the dynamics of
complex systems, and detecting the dynamic communities is of considerable significance …

[PDF][PDF] A performance evaluation of the Kad-protocol

R Brunner, E Biersack - Institut Eurecom, France, 2006 - Citeseer
Most efficient peer-to-peer protocols deploy structured overlay networks based on
Distributed Hash Tables (DHTs). These have been extensively studied through theoretical …