product iamge

Principles of Distributed Systems: 11th International Conference, OPODIS 2007, Guadeloupe, French West Indies, December 17-20, 2007. Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 11th International Conference on Principles of Distributed Systems, OPODIS 2007, held in Guadeloupe, French West Indies, in December 2007.

The 32 revised full papers presented were carefully reviewed and selected from 106 submissions. The papers address all current issues in theory, specification, design and implementation of distributed and embedded systems. Topics addressed are communication and synchronization protocols, distributed algorithms, multiprocessor algorithms, distributed cooperative computing, embedded systems, fault-tolerance, reliability, availability, grid and cluster computing, location- and context-aware systems, mobile agents and autonomous robot, mobile computing and networks, peer- to-peer systems, overlay networks, complexity and lower bounds, performance analysis of distributed systems, realtime systems, security issues in distributed computing and systems, sensor networks: theory and practice, specification and verification of distributed systems, as well as testing and experimentation with distributed systems.

Author(s): Laurent Baduel, Satoshi Matsuoka (auth.), Eduardo Tovar, Philippas Tsigas, Hacène Fouchal (eds.)
Series: Lecture Notes in Computer Science 4878
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2007

Language: English
Pages: 466
Tags: Computer Communication Networks; Software Engineering; Programming Techniques; Operating Systems; Special Purpose and Application-Based Systems

Front Matter....Pages -
A Decentralized, Scalable, and Autonomous Grid Monitoring System....Pages 1-15
A Formal Analysis of the Deferred Update Technique....Pages 16-30
ASAP: A Camera Sensor Network for Situation Awareness....Pages 31-47
Asynchronous Active Recommendation Systems....Pages 48-61
Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks....Pages 62-75
Byzantine Consensus with Few Synchronous Links....Pages 76-89
Clock Synchronization in the Byzantine-Recovery Failure Model....Pages 90-104
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots....Pages 105-118
Deterministic Communication in the Weak Sensor Model....Pages 119-131
Deterministic Leader Election in Anonymous Sensor Networks Without Common Coordinated System....Pages 132-142
Distance Sensitive Snapshots in Wireless Sensor Networks....Pages 143-158
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs....Pages 159-173
Does Clock Precision Influence ZigBee’s Energy Consumptions?....Pages 174-188
From an Intermittent Rotating Star to a Leader....Pages 189-203
Global Deadline-Monotonic Scheduling of Arbitrary-Deadline Sporadic Task Systems....Pages 204-216
LFthreads : A Lock-Free Thread Library....Pages 217-231
Making Distributed Applications Robust....Pages 232-246
Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks....Pages 247-259
N -Consensus is the Second Strongest Object for N  + 1 Processes....Pages 260-273
Non-Searchability of Random Power-Law Graphs....Pages 274-285
O (log n )-Time Overlay Network Construction from Graphs with Out-Degree 1....Pages 286-300
On the Self-stabilization of Mobile Robots in Graphs....Pages 301-314
Peer to Peer Multidimensional Overlays: Approximating Complex Structures....Pages 315-328
Secretive Birds: Privacy in Population Protocols....Pages 329-342
Self-stabilizing and Byzantine-Tolerant Overlay Network....Pages 343-357
Separability to Help Parallel Simulation of Distributed Computations....Pages 358-371
Small-World Networks: From Theoretical Bounds to Practical Systems....Pages 372-385
The Anonymous Consensus Hierarchy and Naming Problems....Pages 386-400
The Baskets Queue....Pages 401-414
The Cost of Monotonicity in Distributed Graph Searching....Pages 415-428
Timed Quorum Systems for Large-Scale and Dynamic Environments....Pages 429-442
Worm Versus Alert: Who Wins in a Battle for Control of a Large-Scale Network?....Pages 443-456
Back Matter....Pages -