This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Topics and features: introduces a range of fundamental graph algorithms, covering spanning trees, graph traversal algorithms, routing algorithms, and self-stabilization; reviews graph-theoretical distributed approximation algorithms with applications in ad hoc wireless networks; describes in detail the implementation of each algorithm, with extensive use of supporting examples, and discusses their concrete network applications; examines key graph-theoretical algorithm concepts, such as dominating sets, and parameters for mobility and energy levels of nodes in wireless ad hoc networks, and provides a contemporary survey of each topic; presents a simple simulator, developed to run distributed algorithms; provides practical exercises at the end of each chapter.
Rezensionen / Stimmen
From the reviews:
"This beautiful and timely book provides a comprehensive review of key distributed graph algorithms for computer network applications. . a must-read for young students and researchers who want to master the topics and implement applications. This would be an excellent textbook for courses on distributed systems. . I highly recommend it to researchers and students of computer networks, and it will also provide a solid foundation for many upcoming areas of research, such as network coding for distributed storage systems." (Manish Gupta, Computing Reviews, February, 2014)
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
ISBN-13
978-1-4471-5173-9 (9781447151739)
DOI
10.1007/978-1-4471-5173-9
Schweitzer Klassifikation
