Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of... » 

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 state-of-the-art 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 www.cambridge.org/9780521876346.Fundamental principles are supported using practical algorithms from real-world applicationsCovers emerging topics such as sensor networks, peer-to-peer computing, mobile computing and network securityContains worked examples and homework problems, with instructor solutions and lecture slides available online at www.cambridge.org/9780521876346Numerous illustrations with small figures in the margin, and intuitive ideas help to make difficult concepts more accessible «