Theory of computing systems

By Thomas Schwentick, D. Suciu. 2009

364 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/7f086baf57c07ed7155802b00e63372b305655cd

How researchers see this paper

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

In Computational Theory and Mathematics

In Computer Networks and Communications

Citations in the corpus

Load balancing in dynamic structured P2P systems (2004, background): “Most structured P2P systems ([1], [2], [3], [4]) assume that object IDs are uniformly distributed.”
Tapestry: a resilient global-scale overlay for service deployment (2004, neutral): “In this article, we present Tapestry [1], [2], an extensible infrastructure that provides Decentralized Object Location and Routing (DOLR) [3].”
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience (2003, background): “[44] S.Q. Zhuang, B.Y. Zhao, and A.D. Joseph, Bayeux: An Architecture for Scalable and Fault-Tolerant Wide-Area Data Dissemination, ACM NOSSDAV, June 2001.”
Towards a Common API for Structured Peer-to-Peer Overlays (2003, methodology): “The update operation is trigged when a node receives an acknowledged multicast for a new inserting node, or when it receives an object movement request during node deletion [5].”
Survey of research towards robust peer-to-peer networks: Search methods (2006, background): “Whereas each object has one root node in PRR, Tapestry uses several to avoid a single point of failure.”
Symphony: Distributed Hashing in a Small World (2003, methodology): “We also show how this basic idea can be adapted and engineered into a practical protocol for maintaining DHTs in a peer to peer network.”
Internet indirection infrastructure (2002, methodology): “While i3 is implemented on top of Chord, in principle i3 can use any of the recently proposed P2P lookup systems such as CAN [22], Pastry [23] and Tapestry [12].”
Koorde: A Simple Degree-Optimal Distributed Hash Table (2003, background): “Many protocols (Chord, Kademlia [9], Pastry [11], Tapestry [5]) offerO(log n) degree and hop count.”
Pond: The OceanStore Prototype (2003, methodology): “Virtualization is enabled by a decentralized object location and routing system (DOLR) called Tapestry [12].”
Meridian: a lightweight network location service without virtual coordinates (2005, background): “The time and space complexity of two techniques are discussed in [27] and [30], but these techniques focus exclusively on finding the nearest neighbor, apply only to Internet latencies modeled by growthconstrained metrics, and have not been evaluated with a large scale”
Load Balancing in Structured P2P Systems (2003, background): “In this work, we address the problem of load balancing in peer-to-peer (P2P) systems that provide a distributed hash table (DHT) abstraction ([1], [2], [4], [5]).”
Peer-to-peer systems (2010, background): “Many implementations of keybased routing exist.(18,27,32) In general, they strike a balance between the”
A Survey of Solutions to the Sybil Attack (2006, background): “• No solution [1, 6, 7, 21,25,32,43,45,53,54,58,79–82,88,97] Though many researchers are aware that the Sybil attack is a potential problem, they present no solution to it for in their work.”