Distributed Computing

DISC, the International Symposium on Distributed Computing, is an annual forum for presentationof researchon all facets of distributed computing, incl- ing the theory, design, analysis, implementation, and application of distributed systems and networks. The nineteenth edition of DISC was held on September 26 29, 2005, in Cracow, Poland. There were 162 ?fteen-page-long (in LNCS format) extended abstracts s- mitted to DISC this year,and this volume contains the 32 contributions selected by the Program Committee among these 162 submissions. All submitted papers werereadandevaluatedbyatleastthreeProgramCommitteemembers,assisted by externalreviewers.The ?nal decision regardingeverypaper wastakenduring the Program Committee meeting, which took place in Paris, July 1 2, 2005. The Best Student Award was split and given to two papers: the paper G- eral Compact Labeling Schemes for Dynamic Trees , authored by Amos K- man, and the paper Space and Step Complexity E?cient Adaptive Collect , co-authored by Yaron De Levie and Yehuda Afek. The proceedings also include 14 two-page-long brief announcements (BA). TheseBAsarepresentationsofongoingworksforwhichfullpapersarenotready yet, or of recent results whose full description will be soon or has been recently presented in other conferences. Researchers use the brief announcement track to quickly draw the attention of the community to their experiences, insights and results from ongoing distributed computing research and projects. The BAs included in this proceedings were selected among 30 BA submissions. DISC 2005 was organizedin cooperation with WarsawUniversity and Jagi- lonian University. The support of the University of Liverpool, INRIA, CNRS, andtheUniversityofParisSud(LRI)isalsogratefullyacknowledged.Thereview process and the preparation of this volume were done using CyberChairPRO.

Klappentext

process and the preparation of this volume were done using CyberChairPRO.

Inhalt
Invited Talks.- Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks.- Securing the Net: Challenges, Failures and Directions.- Regular Papers.- Coterie Availability in Sites.- Keeping Denial-of-Service Attackers in the Dark.- On Conspiracies and Hyperfairness in Distributed Computing.- On the Availability of Non-strict Quorum Systems.- Musical Benches.- Obstruction-Free Algorithms Can Be Practically Wait-Free.- Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System.- Non-blocking Hashtables with Open Addressing.- Computing with Reads and Writes in the Absence of Step Contention.- Restricted Stack Implementations.- Proving Atomicity: An Assertional Approach.- Time and Space Lower Bounds for Implementations Using k-CAS.- (Almost) All Objects Are Universal in Message Passing Systems.- ? Meets Paxos: Leader Election and Stability Without Eventual Timely Links.- Plausible Clocks with Bounded Inaccuracy.- Causing Communication Closure: Safe Program Composition with Non-FIFO Channels.- What Can Be Implemented Anonymously?.- Waking Up Anonymous Ad Hoc Radio Networks.- Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs.- Distributed Computing with Imperfect Randomness.- Polymorphic Contention Management.- Distributed Transactional Memory for Metric-Space Networks.- Concise Version Vectors in WinFS.- Adaptive Software Transactional Memory.- Optimistic Generic Broadcast.- Space and Step Complexity Efficient Adaptive Collect.- Observing Locally Self-stabilization in a Probabilistic Way.- Asymptotically Optimal Solutions for Small World Graphs.- Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time,.-Compact Routing for Graphs Excluding a Fixed Minor.- General Compact Labeling Schemes for Dynamic Trees.- The Dynamic And-Or Quorum System.- Brief Announcements.- Byzantine Clients Rendered Harmless.- Reliably Executing Tasks in the Presence of Malicious Processors.- Obstruction-Free Step Complexity: Lock-Free DCAS as an Example.- Communication-Efficient Implementation of Failure Detector Classes and .- Optimal Resilience for Erasure-Coded Byzantine Distributed Storage.- Agreement Among Unacquainted Byzantine Generals.- Subscription Propagation and Content-Based Routing with Delivery Guarantees.- Asynchronous Verifiable Information Dispersal.- Towards a Theory of Self-organization.- Timing Games and Shared Memory.- A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters.- Could any Graph be Turned into a Small-World?.- Papillon: Greedy Routing in Rings.- An Efficient Long-Lived Adaptive Collect Algorithm.