Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization

Abstract

Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful network topologies. The goal is to devise distributed algorithms that converge quickly to such a desirable topology, independently of the initial network state. This paper proposes… (More)
DOI: 10.1007/978-3-642-12200-2_27

Topics

3 Figures and Tables