Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With vital algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioners in data networking and sensor networks will also find this a valuable resource. Additional resources are available online at (http://www.cambridge.org/9780521876346) www.cambridge.org/9780521876346 . Distributed computing has important applications in wireless and mobile networks, and the Internet. This textbook presents the fundamental principles, models and practical algorithms underlying all aspects of distributed computing. Illustrations and simple ideas will be used to present the algorithms and explain the main concepts, rather than complex proofs. Whilst the focus is primarily on the foundations and algorithms of distributed computing, practical systems-like problems such as mutual exclusion, deadlock detection and leader election, will also be addressed in detail. Some of the most interesting recent developments in the field - sensor networks, mobile computing, peer-to-peer computing and network security - are also covered. With new techniques of algorithm design, worked examples, exercises problems and solutions, this textbook is ideal for advanced undergraduates and graduate students of electrical and computer engineering and computer science, as well as practitioners working in data networking, wireless networking, and sensor networks Cover; Half-title; Title; Copyright; Dedication; Contents; Preface; CHAPTER 1 Introduction; CHAPTER 2 A model of distributed computations; CHAPTER 3 Logical time; CHAPTER 4 Global state and snapshot recording algorithms; CHAPTER 5 Terminology and basic algorithms; CHAPTER 6 Message ordering and group communication; CHAPTER 7 Termination detection; CHAPTER 8 Reasoning with knowledge; CHAPTER 9 Distributed mutual exclusion algorithms; CHAPTER 10 Deadlock detection in distributed systems; CHAPTER 11 Global predicate detection; CHAPTER 12 Distributed shared memory. CHAPTER 13 Checkpointing and rollback recoveryCHAPTER 14 Consensus and agreement algorithms; CHAPTER 15 Failure detectors; CHAPTER 16 Authentication in distributed systems; CHAPTER 17 Self-stabilization; CHAPTER 18 Peer-to-peer computing and overlay graphs; Index.
