Distributed Graph Algorithms for Computer Networks
Buch in deiner Nähe kaufen
Beschreibung
Graph theory is an invaluable tool for the designer of algorithms for distributed systems.
This hands-on textbook/reference presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Each chapter opens with a concise introduction to a specific problem, supporting the theory with numerous examples, before providing a list of relevant algorithms. These algorithms are described in detail from conceptual basis to pseudocode, complete with graph templates for the stepwise implementation of the algorithm, followed by its analysis. The chapters then conclude with summarizing notes and programming exercises.
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
This classroom-tested and easy-to-follow textbook is essential reading for all graduate students and researchers interested in discrete mathematics, algorithms and computer networks.
Prof. Dr. Kayhan Erciyeş is the Rector and a member of the Computer Engineering Department at Izmir University, Turkey
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.
Presents a comprehensive review of key distributed graph algorithms for computer network applications Describes in detail the implementation of each algorithm, and discusses their concrete network applications Includes practical exercises at the end of each chapter, and a simple simulator developed to run distributed algorithms Includes supplementary material: sn.pub/extras
Autor*in
Kayhan Erciyes
Themen in »Distributed Graph Algorithms for Computer Networks«
Ad Hoc Networks Distributed Algorithm Graph Algorithm Network Algorithm Sensor Networks algorithm analysis and problem complexity
Stimmen zu »Distributed Graph Algorithms for Computer Networks«
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)()