Peer-to-Peer- Netzwerke

By Albert-Ludwigs-Universitat Freiburg, Christian Schindelhauer. 2006

655 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/47bcb19fa74eea2740b4d46cb57fc434c0199db6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

The design and implementation of a next generation name service for the internet (2004, background): “Viceroy [24] provides O(log N) lookup performance with a constant degree routing graph.”
A scalable distributed information management system (2004, background): “Recent research in peer-to-peer structured networks resulted in Distributed Hash Tables (DHTs) [1, 16, 17, 21, 23, 26 , 27, 29, 32, 33, 36, 40, 47]—a data structure that scales with the number of nodes and that distributes the read-write load for different queries among the participating nodes.”
Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “It explicitly assumed that peers do not fail [46].”
PIC: practical Internet coordinates for distance estimation (2004, background): “Recently there has been much interest in structured peer-to-peer overlay networks like CAN, Chord, Pastry, Tapestry, and others [16], [17], [2], [3], [18], [19].”
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience (2003, methodology): “1 Note that our treatment of the butterfly graph follows the traditional definition [23], which is the basis of two recent proposals Viceroy [27] and Ulysses [46]; however, neither”
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems (2004, background): “A particular paradigm for such alloc tion, known as thedistributed hash table (DHT) , has become the standard approach to this problem in research on peer-to-pe er systems [7, 9, 12, 13, 16, 17, 21].”