Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
By Dmitri Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh. IEEE/ACM Transactions on Networking, 2003
320 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/98b86d19e8b4672d39816f422ba9c86625942e4c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Anne-Marie Kermarrec
- Márk Jelasity
- Maarten van Steen
- C. Hong
- Matthew C. Caesar
- Spyros Voulgaris
- John Risson
- Tim Moors
Citations in the corpus
- Gossip-based peer sampling (2007, background): “Another issue in common with our own work is that graph-theoretic approaches have been developed for further analysis [Loguinov et al. 2003].”
- The impact of DHT routing geometry on resilience and proximity (2003, unknown): “References [18, 22] address this issue in the contexts of CAN and Pastry respectively, while some recent work in reference [13] examines how certain graph theoretic properties of a overlay structure affect its static resilience.”
- Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “Loguinov et al. claimed that there were only two such works [24] [36].”
- The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations (2004, background): “Another issue in common with our own work is that graph theoretic approaches have been developed for further analysis [19].”
- Dcell: a scalable and fault-tolerant network structure for data centers (2008, background): “Furthermore, it is not fault-tolerant, since there is only one path between two nodes. de Bruijn [14] achieves near-optimal tradeoff between node degree and network diameter.”
- A survey and comparison of peer-to-peer overlay network schemes (2005, background): “If FIND NODE fails to return a peer that is any closer,”
- BotGrep: Finding P2P Bots with Structured Graph Analysis (2010, background): “Further, structured overlay mechanisms are designed to remain robust in the face of churn [48, 32], an important concern for botnets, where individual machines may be frequently disinfected or simply turned off for the night.”