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 www.cambridge.org/9780521876346.

Book Description

Comprehensive textbook covering the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. For advanced undergraduate and graduate students of electrical and computer engineering and computer science. Also of interest to practitioners in data networking, wireless networking, and sensor networks. Additional resources online: www.cambridge.org/9780521876346.

"About this title" may belong to another edition of this title.

Store Description

eCampus's mission is to set online bookstore industry standards for savings, selection, convenience and customer service as expressed in the company's slogan "Textbooks Easy. Fast. Cheap!" The company celebrated 15 years in business in 2015 and will continue to provide students with an easy, fast and cheap way to order their textbooks and materials for years to come.