Tiara: A Self-stabilizing Deterministic Skip List

Clouser, Thomas; Nesterenko, Mikhail; Scheideler, Christian

doi:10.1007/978-3-540-89335-6_12

Cited by 20 publications

(11 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Corona operates in the low-atomicity message-passing asynchronous system model. A self stabilizing sparse 0-1 skip list on top of a self stabilizing sorted list call Tiara presented in [4].Here, 0-1 skip list means that any step between any two entities n i and n i+1 at level j can only skip 0 (skip no entities) or 1 (only one entity skipped) in level level j−1 of skip list. They have proposed a self-stabilizing algorithm for a sorted list first, and then have extended it to the sparse 0-1 skip lists which allows logarithmic searches and topology updates.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Deterministic Cluster-based Skip List Protocol for Dynamic Distributed Systems

Ahmed¹,

Alzohairy²,

Khalf-Allah³

2017

IJCA

View full text Add to dashboard Cite

Dynamic distributed system (DDS) is a continually running system with a large number of entities as processes or nodes that are connected with each other and each of them has only a partial view of the system as Peer-to-peer (P2P) system which can be decentralized, centralized or hybrid of both to make the system operations faster as possible. In P2P, any number of entities can join and leave the system at any moment which makes the topology of the system continuously changed. So, the system must deal with these changes to be stable as possible. So, data management algorithms are needed to build an overlay network which is a logical layer that used to store the information about these entities. Skip list structure is the most common and efcient overlay structure for data management in P2P systems. However, using this structure cannot minimize the time delay for query processes as searching, inserting, and deleting in case of there is a huge number of entities in the skip list. In addition, most of existing algorithms that use this structure have been developed based on a special structure of skip list and they did not be applicable for another structure of the skip list. In this paper, to overcome these drawbacks, a new skip List structure and query processing methods are proposed. The conducted simulation results show that the proposed structure and algorithm are much better than the existing algorithms in the time delay and the required number of steps to nish any query process.

show abstract

Section: Related Workmentioning

confidence: 99%

“…They proved that the algorithm is correct in the shared register model. In [12] a set of algorithms has been proposed to overcome the shortcomings of existing architectures, as proposed in Tiara [4] and Corona [14]. Beacuse the Tiara architecture cannot be extended for 1-2 skip lists.…”

Section: Related Workmentioning

confidence: 99%

Deterministic Cluster-based Skip List Protocol for Dynamic Distributed Systems

Ahmed¹,

Alzohairy²,

Khalf-Allah³

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…In [19], Onus et al present a local-control strategy called linearization for converting an arbitrary connected graph into a sorted list. Clouser et al [5] formulate a variant of the linearization technique for asynchronous systems in order to design a self-stabilizing skip list. In this work, our selfstabilization process has also as its basis a variance of the linearization technique.…”

Section: B Self-stabilizationmentioning

confidence: 99%

A Self-Stabilization Process for Small-World Networks

Kniesburges

Koutsopoulos

Scheideler

2012

2012 IEEE 26th International Parallel and Distributed Processing Symposium

Self Cite

View full text Add to dashboard Cite

Abstract-Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network.

show abstract

“…Topological self-stabilization is a relatively young field, and researchers have only started to examine the most simple networks such as line or ring graphs, e.g., [9]. While interesting compilers [6] have been proposed many years ago that allow to render any local algorithm self-stabilizing (see also the recent survey [21]), the overhead when applied to dynamically changing topologies and the implications on randomized algorithms are not well understood yet.…”

Section: Further Readingmentioning

confidence: 99%

Robust architectures for open distributed systems and topological self-stabilization

Schmid

2010

Proceedings of the Third International Workshop on Reliability, Availability, and Security

View full text Add to dashboard Cite

Distributed systems are often dynamic in the sense that there are frequent membership changes (nodes joining and leaving the network), either due to regular churn or due to an attack. Maintaining availability and full functionality of such a system under continuous topological changes hence constitutes an important algorithmic challenge. This paper reports on some of our recent results on robust distributed systems. We review two randomized architectures that build upon the continuous-discrete approach by Naor and Wieder, namely the SHELL network which allows for fast joins and leaves and organizes more reliable (or stronger) nodes in a core network where their communication is not affected by malicious (or weak) nodes, and the Chameleon network whose replica placement strategy and whose intentional topological updates ensure resiliency against denial-of-service attacks, even from past insiders. To complement our investigations on randomized architectures, we discuss algorithms to maintain hypercubic networks under worstcase churn. Finally, we advocate the design of self-stabilizing topologies-a very appealing and still not well-understood notion of robustness-that converge quickly to a desirable structure from arbitrarily degenerated states. As a use case, graph linearization is examined in more detail. This invited paper complements the WRAS'10 talk and is joint work with

show abstract

Tiara: A Self-stabilizing Deterministic Skip List

Cited by 20 publications

References 15 publications

Deterministic Cluster-based Skip List Protocol for Dynamic Distributed Systems

Deterministic Cluster-based Skip List Protocol for Dynamic Distributed Systems

A Self-Stabilization Process for Small-World Networks

Robust architectures for open distributed systems and topological self-stabilization

Contact Info

Product

Resources

About