Kayhan Erciyes

Distributed Graph Algorithms for Computer Networks

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Computer Communications and Networks
• Verlag: Springer / Springer London / Springer, Berlin
• Artikelnr. des Verlages: 978-1-4471-5850-9
• 2013
• Seitenzahl: 344
• Erscheinungstermin: 6. Juni 2015
• Englisch
• Abmessung: 235mm x 155mm x 19mm
• Gewicht: 528g
• ISBN-13: 9781447158509
• ISBN-10: 1447158504
• Artikelnr.: 43001304

Inhaltsangabe

Introduction.- Part I: Fundamental Algorithms.- Graphs.- The Computational Model.- Spanning Tree Construction.- Graph Traversals.- Minimal Spanning Trees.- Routing.- Self-Stabilization.- Part II: Graph Theoretical Algorithms.- Vertex Coloring.- Maximal Independent Sets.- Dominating Sets.- Matching.- Vertex Cover.- Part III: Ad Hoc Wireless Networks.- Introduction.- Topology Control.- Ad Hoc Routing.- Sensor Network Applications.- ASSIST: A Simulator to Develop Distributed Algorithms.- Pseudocode Conventions.- ASSIST Code.- Applications Using ASSIST.

Rezensionen

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)