Efficient Recovery from Organizational Disconnects in SkipNet

Harvey, Nicholas J. A.; Jones, Michael; Theimer, Marvin; Wolman, Alec

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

Cited by 17 publications

(16 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…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

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

show abstract

“…We chose Scribe as the comparison target in these experiments, mainly because it can be built on top of any DHTs. Skip Graph can be used to construct a DHT by using a kind of routing which is referred to as "Routing by Numeric ID" in SkipNet [20]. Indeed, this type of DHT is implemented by PIAX [21].…”

Section: Discussionmentioning

confidence: 99%

Designing Overlay Networks for Handling Exhaust Data in a Distributed Topic-based Pub/Sub Architecture

Banno

Takeuchi

Takemoto

et al. 2015

Journal of Information Processing

View full text Add to dashboard Cite

Abstract:To provide event-driven services in IoT, scalable methods of topic-based pub/sub messaging are indispensable. Methods using structured overlay networks are promising candidates. However, existing methods have the problem of wasting network resources, because they lack adaptivity to "exhaust data," which have low or no value most of the time. The problem contains two aspects. One is that each publisher node continues to forward data to a relay node even if there are no subscribers. The other is that excessively large multicast trees are constructed for low value data, which will be received by only a small number of subscribers. In this paper, we formulate the desirable design of overlay networks by defining a property called "strong relay-free" as an expansion of relay-free property. The property involves publishers and subscribers composing connected subgraphs to enable detecting the absence of subscribers and autonomously adjusting the tree size. We also propose a practical method satisfying the property by using Skip Graph, and evaluate it through simulation experiments. We confirmed that the proposed method can suspend publishing adaptively, and shorten the path length on multicast trees by more than 75% under an experimental condition with 100,000 nodes.

show abstract

“…Skip graphs [17] and SkipNet [18] are randomised structures based on skip lists and achieve expected O(log n) query and update times with O(log n) node state in an nnodes network. Skip graphs preserve the order of the keys but do not provide load balancing.…”

Section: Related Workmentioning

confidence: 99%

“…Systems not based on DHTs have designed overlay networks for which the order of the keys is preserved [16][17][18]11,19,20]. As hashing provides a solution to the dictionary problem, logical evolution has led to the consideration of other data structures that implement (ordered) dictionaries such as tries, 2-3 trees, B-trees, AVL trees, and skip lists.…”

Section: Introductionmentioning

confidence: 99%