منابع مشابه
Self-Stabilizing Distributed File Systems
A self-stabilizing distributed file system is presented. The system constructs and maintains a spanning tree for each file volume. The spanning tree consists of the servers that have volume replicas and caches for the specific file volume. The spanning trees are constructed and maintained by selfstabilizing distributed algorithms. File system updates use the tree to implement file read and writ...
متن کاملSelf-Stabilizing Distributed Constraint Satisfaction
Distributed architectures and solutions are described for classes of constraint satisfaction problems, called network consistency problems. An inherent assumption of these architectures is that the communication network mimics the structure of the constraint problem. The solutions are required to be self-stabilizing and to treat arbitrary networks, which makes them suitable for dynamic or error...
متن کاملSelf-stabilizing Distributed Data Fusion
The Theory of Belief Functions is a formal framework for reasoning with uncertainty that is well suited for representing unreliable information and weak states of knowledge. In information fusion applications, it is mainly used in a centralized way, by gathering the data on a single node before computation. In this paper, a distributed algorithm is proposed to compute the neighborhood confidenc...
متن کاملAutomated Synthesis of Distributed Self-Stabilizing Protocols
In this paper, we introduce an SMT-based method that automatically synthesizes a distributed self-stabilizing protocol from a given high-level specification and network topology. Unlike existing approaches, where synthesis algorithms require the explicit description of the set of legitimate states, our technique only needs the temporal behavior of the protocol. We extend our approach to synthes...
متن کاملMechanical Verification of Self-Stabilizing Distributed Systems
Self-stabilizing distributed systems are a class of distributed systems which converge to correct system states even if they start from arbitrary system states. A self-stabilizing system can recover from finite number of transient faults (e.g., message loss, memory corruption). Therefore, they are fault-tolerant systems. When we design a self-stabilizing system, its verification, such as conver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2006
ISSN: 1045-9219
DOI: 10.1109/tpds.2006.94