Koorde: A Simple Degree-Optimal Distributed Hash Table

Kaashoek, M. Frans; Karger, David R.

doi:10.1007/978-3-540-45172-3_9

Cited by 389 publications

(302 citation statements)

References 15 publications

(11 reference statements)

Supporting

Mentioning

294

Contrasting

Unclassified

Order By: Relevance

“…Hence, we can subtract the number of the strings σ * σ * from the bound in Eqn. (10). From Lemmas 1 and 2, we infer that, in a de Bruijn graph, for any i, j and…”

Section: Lemma 2 the Number Of Routesmentioning

confidence: 81%

See 1 more Smart Citation

On the Cost of Participating in a Peer-to-Peer Network

Christin

Chuang

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we model the cost incurred by each peer participating in a peer-to-peer network. Such a cost model allows to gauge potential disincentives for peers to collaborate, and provides a measure of the "total cost" of a network, which is a possible benchmark to distinguish between proposals. We characterize the cost imposed on a node as a function of the experienced load and the node connectivity, and show how our model applies to a few proposed routing geometries for distributed hash tables (DHTs). We further outline a number of open questions this research has raised.

show abstract

“…Hence, we can subtract the number of the strings σ * σ * from the bound in Eqn. (10). From Lemmas 1 and 2, we infer that, in a de Bruijn graph, for any i, j and…”

Section: Lemma 2 the Number Of Routesmentioning

confidence: 81%

“…De Bruijn graphs De Bruijn graphs are used in algorithms such as Koorde [10], Distance-Halving [15], or ODRI [12], and are extensively discussed in [12,20]. In a de Bruijn graph, any node i is represented by an identifier string (i 1 The resulting directed graph has a fixed out-degree ∆, and a diameter D.…”

Section: Theorem 1 If the Number Of Nodesmentioning

confidence: 99%

On the Cost of Participating in a Peer-to-Peer Network

Christin

Chuang

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Several distributed hash tables (DHTs) have been introduced which are provably robust to random peer deletions (i.e. fail-stop faults) [1,13,16,21,22,26,28]. We are aware of several results that deal with the more challenging problem of designing DHTs which are robust to Byzantine faults.…”

Section: Related Workmentioning

confidence: 99%

Making Chord Robust to Byzantine Attacks

Fiat

Saia

Young

2005

Algorithms – ESA 2005

View full text Add to dashboard Cite

Abstract. Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the network. Chord assumes all nodes behave according to protocol. We give a variant of Chord which is robust with high probability for any time period during which: 1) there are always at least z total peers in the network for some integer z; 2) there are no more than (1/4 − ǫ)z insertion events for Byzantine peers for a fixed ǫ > 0; and 3) the number of insertion and deletion events for correct peers is no more than z k for some tunable parameter k. We assume there is an computationally unbounded adversary controlling the Byzantine peers and that the IP-addresses of all the Byzantine peers and the locations where they join the network are carefully selected by this adversary. Our notion of robustness is rather strong in that we not only guarantee that searches can be performed but also that we can enforce any set of "proper behavior" such as contributing new material, etc. In comparison to Chord, the resources required by this new variant are only a polylogarithmic factor greater in communication, messaging, and linking costs.

show abstract

“…Chord [33] was one of the pioneering works and guarantees a routing in log(N ) hops. Koorde [17] is an optimization of Chord which provides a routing complexity equal to O(log(N )/log(log(N )). Storm/Peacomm [28] is a infamous real worm using both cryptographic protection and peer-to-peer communication models [14].…”

Section: Botnet Architecturesmentioning

confidence: 99%

BotTrack: Tracking Botnets Using NetFlow and PageRank

Jérôme

Wang

State

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. With large scale botnets emerging as one of the major current threats, the automatic detection of botnet traffic is of high importance for service providers and large campus network monitoring. Faced with high speed network connections, detecting botnets must be efficient and accurate. This paper proposes a novel approach for this task, where NetFlow related data is correlated and a host dependency model is leveraged for advanced data mining purposes. We extend the popular linkage analysis algorithm PageRank [27] with an additional clustering process in order to efficiently detect stealthy botnets using peer-to-peer communication infrastructures and not exhibiting large volumes of traffic. The key conceptual component in our approach is to analyze communication behavioral patterns and to infer potential botnet activities.

show abstract

Koorde: A Simple Degree-Optimal Distributed Hash Table

Abstract: . While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node (where n is the number of nodes in the DHT), and O(log n/ log log n) hops per lookup request with O(log n) neighbors per node.

Cited by 389 publications

References 15 publications

On the Cost of Participating in a Peer-to-Peer Network

On the Cost of Participating in a Peer-to-Peer Network

Making Chord Robust to Byzantine Attacks

BotTrack: Tracking Botnets Using NetFlow and PageRank

Contact Info

Product

Resources

About