Overview
- 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
Part of the book series: Computer Communications and Networks (CCN)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (18 chapters)
-
Front Matter
-
Fundamental Algorithms
-
Front Matter
-
-
Graph Theoretical Algorithms
-
Front Matter
-
-
Ad Hoc Wireless Networks
-
Front Matter
-
Reviews
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)Authors and Affiliations
Bibliographic Information
Book Title: Distributed Graph Algorithms for Computer Networks
Authors: K. Erciyes
Series Title: Computer Communications and Networks
DOI: https://doi.org/10.1007/978-1-4471-5173-9
Publisher: Springer London
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag London 2013
Hardcover ISBN: 978-1-4471-5172-2Published: 04 June 2013
Softcover ISBN: 978-1-4471-5850-9Published: 06 June 2015
eBook ISBN: 978-1-4471-5173-9Published: 16 May 2013
Series ISSN: 1617-7975
Series E-ISSN: 2197-8433
Edition Number: 1
Number of Pages: XVIII, 324
Topics: Algorithm Analysis and Problem Complexity, Computer Communication Networks, Math Applications in Computer Science