This book consitutes the refereed proceedings of the 15th International Conference on Distributed Computing, DISC 2001, held in Lisbon, Portugal, in October 2001.The 23 revised papers presented were carefully reviewed and selected from 70 submissions. Among the issues addressed are mutual exclusion, anonymous networks, distributed files systems, information diffusion, computation slicing, commit services, renaming, mobile search, randomized mutual search, message-passing networks, distributed queueing, leader election algorithms, Markov chains, network routing, ad-hoc mobile networks, and adding networks.
Reihe
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
Dateigröße
ISBN-13
978-3-540-45414-4 (9783540454144)
DOI
Schweitzer Klassifikation
A Time Complexity Bound for Adaptive Mutual Exclusion.- Quorum-Based Algorithms for Group Mutual Exclusion.- An Effective Characterization of Computability in Anonymous Networks.- Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System.- Optimal Unconditional Information Diffusion.- Computation Slicing: Techniques and Theory.- A Low-Latency Non-blocking Commit Service.- Stable Leader Election.- Adaptive Long-lived O(k 2)-Renaming with O(k 2) Steps.- A New Synchronous Lower Bound for Set Agreement.- The Complexity of Synchronous Iterative Do-All with Crashes.- Mobile Search for a Black Hole in an Anonymous Ring.- Randomised Mutual Search for k > 2 Agents.- Self-stabilizing Minimum Spanning Tree Construction on Message-Passing Networks.- Self Stabilizing Distributed Queuing.- A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings.- Randomized Finite-state Distributed Algorithms As Markov Chains.- The Average Hop Count Measure For Virtual Path Layouts.- Efficient Routing in Networks with Long Range Contacts.- An Efficient Communication Strategy for Ad-hoc Mobile Networks.- A Pragmatic Implementation of Non-blocking Linked-lists.- Stabilizing Replicated Search Trees.- Adding Networks.
