Stabilization, safety, and security of distributed systems : 8th International Symposium, SSS 2006, Dallas, TX, USA, November 17-19, 2006 : proceedings

• Main Authors: Datta, Ajoy K, Gradinariu, Maria
• Format: eBook Book
• Language: English
• Published: Berlin Springer 2006; Springer Berlin / Heidelberg
• Edition: 1
• Subjects: Computer science; Congresses; Distributed operating systems (Computers)-Security measures-Congresses; Self-stabilization (Computer science)
• ISBN: 3540490183; 9783540490180

Table of Contents:

• A Non-self-stabilizing Driver Specification -- Non-stability -- System Model and Requirements -- Self-stabilizing Driver -- Leasing -- Consistency Check -- Concluding Remarks -- Secure Communication for RFIDs Proactive Information Security Within Computational Security -- Introduction -- Security Model for RFID Tags -- Proactive Information Secure Protocol -- Combined Computational Secure Protocol -- Conclusions and Extensions -- Fault Masking in Tri-redundant Systems -- Introduction -- Stabilizing Systems -- Systems with Tri-redundancy -- Stabilization Theorem -- Fault Masking Theorem -- A Tri-redundant Spanning Tree -- Concluding Remarks -- Logarithmic Keying of Communication Networks -- Introduction -- Logarithmic Keying of Star Networks -- Authenticated Broadcast in Star Networks -- Logarithmic Keying of Acyclic Networks -- Logarithmic Keying of Limited-Cycle Networks -- Logarithmic Keying of Planar Networks -- Concluding Remarks -- Safe Peer-to-Peer Self-downloading -- Introduction -- Application Model -- Safe Self-downloading -- Self-downloading with Lower Arrival Rate -- Conclusion -- Best Paper: Stabilizing Clock Synchronization for Wireless Sensor Networks -- Introduction -- Protocol Designs -- Contributions and Roadmap -- Sensor Network -- Converge-to-Max -- Legitimate State -- ``Pseudo'' Legitimate Execution -- Finite Clocks -- Fault Containment -- Conclusion -- Self-stabilizing Byzantine Digital Clock Synchronization -- Introduction -- Model -- The Byzantine Consensus Protocol -- Digital Clock Synchronization Algorithm -- Intuition for the Algorithm -- Preliminaries -- Lemmata and Proofs -- Complexity Analysis -- Discussion -- References -- Distributed Edge Coloration for Bipartite Networks -- Introduction -- The Computation Model and Basic Ideas -- The Algorithm -- The Correctness Proof -- Time Complexity Analysis -- Concluding Remarks
• Title Pages -- Preface -- Message from the General Chair -- Organization -- Table of Contents -- Stabilization Enabling Technology -- Introduction -- Periodic Reset Monitor -- The Stabilization Enabling Hardware ({\sc seh}) --- Supporting Enforced Resets -- Stabilization Enabling System ({\sc ses}) -- Beyond the Processor --- Enforcing Software Configuration -- Conclusions -- A General Characterization of Indulgence -- Introduction -- Model -- Indulgence -- Robustness -- Safety -- Uniformity -- Failure Sensitivity -- Divergence -- Concluding Remarks -- Coverage, Connectivity, and Fault Tolerance Measures of Wireless Sensor Networks -- Introduction -- Contributions -- Related Work -- Definitions -- Measuring Fault Tolerance of kCWSN -- Why Is kCWSN Connectivity Higher Than k? -- Homogeneous Wireless Sensor Networks -- Heterogeneous Wireless Sensor Networks -- Are kCWSN Connected When R &lt -- 2r? -- Are kCWSN Connected When R &lt -- r? -- Coverage-Based Fault Tolerance Measure -- Summary and Future Work -- A Case Study on Prototyping Power Management Protocols for Sensor Networks -- Introduction -- ProSe: Overview -- Structure of Programs -- Input/Output of ProSe -- Case Study: Prototyping pCover with ProSe -- pCover: Overview -- Transformation and Code Generation -- Evaluation of the Synthesized Program -- Lessons Learned in Prototyping Power Management Protocols -- Related Work -- Conclusion -- Unconscious Eventual Consistency with Gossips -- Introduction -- Ensuring Unconscious Eventual Consistency -- Few Comments on Eventual Consistency Implementations -- A Naive Implementation -- Towards a Better Implementation -- Protocol -- Overview -- Main Protocol -- Self-stabilization -- Coalition Self-sizing -- Performance -- Simulation Environment -- Self-stabilization -- Non-blocking Behavior -- Scalability -- Related Work
• Recovery Oriented Programming -- Producer-Consumer Example -- Conclusions -- Evaluation of a Tracking Architecture in Wireless Sensor Networks -- Introduction -- Case Study -- Simulator -- Notations -- Flooding -- TRAC -- Optimization -- Conclusion -- Self-protection for Distributed Component-Based Applications -- Introduction -- Autonomic Computing -- General Principles -- Self-protection -- Related Work -- Common Security Tools -- Self-protected Systems -- Summary -- Design Principles -- Requirements -- Context -- Architecture-Based Configuration and Protection -- Implementation Details -- Actuators -- Sensors -- Evaluation -- Limitations and Perspectives -- Conclusion -- From Self- to Snap- Stabilization -- Introduction -- Preliminaries -- The Approach -- Correctness -- Complexity Analysis -- Example -- Conclusion -- Self-stabilizing Philosophers with Generic Conflicts -- Introduction -- Preliminaries -- \mathcal {KDP} Algorithm -- Description -- Proof of Correctness -- Stabilization Efficiency Evaluation -- Solution to Generalized Dining Philosophers -- Implementation in Wireless Sensor Networks -- Further Extensions -- Selfish Stabilization -- Introduction -- Model and Notations -- A Solution -- Proof of Correctness -- Alternative Strategies -- Conclusion -- Reliability and Availability Analysis of Self-stabilizing Systems -- Introduction -- Basic Notions and Preliminaries -- Basic Ideas for Calculating Fault Tolerance Measures -- System Analysis Procedure -- Analysis of Sub-algorithm Classes -- Markov Chain Identification -- Determination of Fault Tolerance Measures -- Related Work -- Conclusions -- Circle Formation of Weak Mobile Robots -- Introduction -- Preliminaries -- Circle Formation Protocol -- Definitions and Basics Properties -- The Protocol -- Concluding Remarks -- Self-stabilizing Device Drivers -- Introduction
• A Dependable Intrusion Detection Architecture Based on Agreement Services -- Introduction -- Overview of a Generic Intrusion Detection Architecture -- A Basic Architecture to Ensure Confidentiality -- Enhancing Availability of a Basic Architecture -- Related Work -- The Eden Group Communication Toolkit -- Case Study: Enhancing Integrity for Web Servers -- Models and Notations -- HTTP Path of a Request -- SQL Path of a Request -- Experimental Results -- Quality of Service Offered by the IDS -- Atomic Broadcast Performances -- Conclusion -- Stabilizing Health Monitoring for Wireless Sensor Networks -- Introduction -- Related Work -- Experimental Results -- Tree Construction and PIF for WSN Health Monitoring -- Conclusions -- A Byzantine-Fault Tolerant Self-stabilizing Protocol for Distributed Clock Synchronization Systems -- Introduction -- Topology -- Protocol Description -- The Monitor -- The State Machine -- Message Sequence -- Protocol Functions -- System Assumptions -- The Self-stabilizing Clock Synchronization Problem -- The Byzantine-Fault Tolerant Self-stabilizing Protocol for Distributed Clock Synchronization Systems -- Proof of the Protocol -- Achieving Tighter Precision -- Conclusions -- A Memory Efficient Self-stabilizing Algorithm for Maximal k-Packing -- Introduction -- The Self-stabilizing Paradigm -- The Algorithm -- The Local Variables -- Definitions and Notations -- The Algorithm -- Correct Stabilization -- Convergence -- Conclusion -- Bounding the Impact of Unbounded Attacks in Stabilization -- Introduction -- Preliminaries -- Distributed System -- Self-stabilizing Protocol Resilient to Byzantine Faults -- Discussion -- Tree Orientation -- A Strongly-Stabilizing Tree Orientation for a Single Byzantine Process -- Protocol ss-TO -- Legitimate Configurations of ss-TO -- Convergence of ss-TO -- Conclusions
• On Bootstrapping Topology Knowledge in Anonymous Networks
• Concluding Remarks -- All k-Bounded Policies Are Equivalent for Self-stabilization -- Introduction -- Notion of Markov Decision Process -- Randomized Distributed Algorithms as Markov Decision Processes -- Probabilistic Convergence of a Randomized Protocol -- Extension to All k-Bounded Policies -- Examples -- Self-stabilizing Vertex Coloring -- Token Circulation -- Comparison of k-Bounded and Memory k-Bounded Policies -- Conclusion -- A 1-Strong Self-stabilizing Transformer -- Introduction -- Model -- Transformer -- Synchronous Unison -- Local Snapshots -- Transformed Actions of the Input Algorithm -- Proof -- Conclusion -- Optimal Message-Driven Implementation of Omega with Mute Processes -- Introduction -- Contribution -- Road Map -- Model -- Timing -- Events -- Failure Detectors -- Lower Bound on the Number of Processes -- A Matching Algorithm -- Discussions -- Conclusions -- Incremental Synthesis of Fault-Tolerant Real-Time Programs -- Introduction -- Related Work -- Contributions -- Real-Time Programs, Specifications, and Region Graphs -- Real-Time Program -- Specification -- Region Graph -- Faults and Fault-Tolerance in Real-Time Programs -- Problem Statement -- Adding Nonmasking Fault-Tolerance -- Adding Soft-Failsafe Fault-Tolerance -- Adding Hard-Failsafe Fault-Tolerance with One Bounded Response Property -- Conclusion -- Toward a Time-Optimal Odd Phase Clock Unison in Trees -- Introduction -- Related Works -- Contribution -- Paper Outline -- Preliminaries -- Congruence to Modulus K, Local Comparison Relationship -- Self-stabilizing Distributed System and Unison -- Local Variation and Delay -- Protocol for Synchronous Daemon -- Protocol for Asynchronous Daemon -- The Protocol -- Liveness and Self-stabilization -- Concluding Remarks -- Recovery Oriented Programming -- Introduction -- The System Architecture