This book constitutes the refereed proceedings of the 10th International Conference on Principles of Distributed Systems, OPODIS 2006, held at Bordeaux, France, in December 2006.
The 28 revised full papers presented together with 2 invited talks were carefully reviewed and selected from more than 230 submissions. The papers address all current issues in theory, specification, design and implementation of distributed and embedded systems.
Author(s): Butler Lampson (auth.), Mariam Momenzadeh Alexander A. Shvartsman (eds.)
Series: Lecture Notes in Computer Science 4305
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006
Language: English
Pages: 450
Tags: Computer Communication Networks; Software Engineering; Programming Techniques; Operating Systems; Special Purpose and Application-Based Systems
Front Matter....Pages -
Lazy and Speculative Execution in Computer Systems....Pages 1-2
In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement....Pages 3-19
A Topological Treatment of Early-Deciding Set-Agreement....Pages 20-35
Renaming with k -Set-Consensus: An Optimal Algorithm into n + k – 1 Slots....Pages 36-44
When Consensus Meets Self-stabilization....Pages 45-63
On the Cost of Uniform Protocols Whose Memory Consumption Is Adaptive to Interval Contention....Pages 64-80
Optimistic Algorithms for Partial Database Replication....Pages 81-93
Optimal Clock Synchronization Revisited: Upper and Lower Bounds in Real-Time Systems....Pages 94-109
Distributed Priority Inheritance for Real-Time and Embedded Systems....Pages 110-125
Safe Termination Detection in an Asynchronous Distributed System When Processes May Crash and Recover....Pages 126-141
Lock-Free Dynamically Resizable Arrays....Pages 142-156
Distributed Spanner Construction in Doubling Metric Spaces....Pages 157-171
Verification Techniques for Distributed Algorithms....Pages 172-186
Mobile Agent Algorithms Versus Message Passing Algorithms....Pages 187-201
Incremental Construction of k -Dominating Sets in Wireless Sensor Networks....Pages 202-214
Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks....Pages 215-229
Empire of Colonies Self-stabilizing and Self-organizing Distributed Algorithms....Pages 230-243
Glance : A Lightweight Querying Service for Wireless Sensor Networks....Pages 244-259
On Many-to-Many Communication in Packet Radio Networks....Pages 260-274
Robust Random Number Generation for Peer-to-Peer Systems....Pages 275-289
About the Lifespan of Peer to Peer Networks....Pages 290-304
Incentive-Based Robust Reputation Mechanism for P2P Services....Pages 305-319
Searching for Black-Hole Faults in a Network Using Multiple Agents....Pages 320-332
Gathering Asynchronous Mobile Robots with Inaccurate Compasses....Pages 333-349
Gathering Few Fat Mobile Robots in the Plane....Pages 350-364
Hop Chains: Secure Routing and the Establishment of Distinct Identities....Pages 365-379
Computing on a Partially Eponymous Ring....Pages 380-394
Self-stabilizing Leader Election in Networks of Finite-State Anonymous Agents....Pages 395-409
Robust Self-stabilizing Clustering Algorithm....Pages 410-424
Self-stabilizing Wireless Connected Overlays....Pages 425-439
Back Matter....Pages -
