Self-Stabilization in Dynamic Networks
スポンサーリンク
概要
- 論文の詳細を見る
A self-stabilizing protocol is a protocol that achieves its intended behavior regardless of the initial configuration (i.e., global state). Thus, a self-stabilizing protocol is adaptive to any number and any type of topology changes of networks: after the last topology change occurs, the protocol starts to converge to its intended behavior. This advantage makes self-stabilizing protocols extremely attractive for designing highly dependable distributed systems on dynamic networks. While conventional self-stabilizing protocols require that the networks remain static during convergence to the intended behaviors, some recent works undertook the challenge of realizing self-stabilization in dynamic networks with frequent topology changes. This paper introduces some of the challenges as a new direction of research in self-stabilization.
- （社）電子情報通信学会の論文
- 2009-02-01
著者
-
MASUZAWA Toshimitsu
Graduate School of Information Science and Technology, Osaka University
-
Masuzawa Toshimitsu
Graduate School Of Engineering Science Osaka University
関連論文
- A Self-Adaptive Routing Protocol in Wireless LANs Based on Attractor Selection
- A Biologically Inspired Self-Adaptation of Replica Density Control
- A Message-Efficient Peer-to-Peer Search Protocol Based on Adaptive Index Dissemination
- An Efficient Index Dissemination in Unstructured Peer-to-Peer Networks
- Self-Adaptive Mobile Agent Population Control in Dynamic Networks Based on the Single Species Population Model(Distributed Cooperation and Agents)
- A Simple Parallel Algorithm for the Medial Axis Transform (Special Issue on Architectures Algorithms and Networks for Massively parallel Computing)
- Timed Atomic Broadcast Resiliet to Multiple Timing Faults
- Timed Atomic Broadcast Resiliet to Multiple Timing Faults
- Scheduling for Independent-Task Applications on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model(Parallel and Distributed Computing,Foundations of Computer Science)
- Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments
- Hierarchical Composition of Self-Stabilizing Protocols Preserving the Fault-Containment Property
- Distributed Construction Protocols of Probabilistic Degree-Weighted Peer-to-Peer Overlays
- Self-Stabilization in Dynamic Networks
- Parallel Selection Algorithms for CGM and BSP Models with Application to Sorting (特集 並列処理) -- (並列・分散アルゴリズム)
- Self-Stabilizing Agent Traversal on Tree Networks(Distributed Cooperation and Agents)
- A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance