Corona: A stabilizing deterministic message-passing skip list

We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We pro...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 512; pp. 119 - 129
Main Authors Nor, Rizal Mohd, Nesterenko, Mikhail, Scheideler, Christian
Format Journal Article
LanguageEnglish
Published Elsevier B.V 11.11.2013
Subjects
Message-passing
Overlay networks
Peer-to-peer networks
Self-stabilization
Self-stabilization
Overlay networks
Peer-to-peer networks
Message-passing
Online AccessGet full text

Cover

More Information
Summary:We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in a message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identifiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2012.08.029