Distributed computing

More about the book

The book features a comprehensive collection of invited talks and regular papers focusing on various aspects of distributed computing. Key topics include routing and scheduling with incomplete information, time-efficient broadcasting in radio networks, and a subjective exploration of selected distributed computing topics. Highlighted papers address resilient Byzantine storage without unproven cryptographic assumptions, fast robust approximate majority protocols, and denial-of-service resistant distributed hash tables. The work also investigates mobility costs in geocasting for mobile ad-hoc networks and self-stabilizing counting in mobile sensor networks. Other contributions include scalable load-distance balancing, time-optimal asynchronous self-stabilizing spanning trees, and rendezvous strategies for mobile agents in unknown graphs with faulty links. The collection discusses failure detectors, amnesic distributed storage, and distributed approximations for packing in unit-disk graphs. Further topics cover gossiping in multi-channel radio networks, energy-efficient broadcasting, and distributed algorithms for optimal swap edges in minimum diameter spanning trees. The book also examines fault-tolerant implementations, transaction-safe non-blocking data structures, and the complexities of decentralized asynchronous Byzantine consensus. Celebrating its 20th anniversary, the collection includes reflections on the evoluti