Distributed Graph Algorithms for Computer Networks

AvKayhan Erciyes

Inbunden, Engelska, 2013

Del i serien Computer Communications and Networks

940 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Häftad

666 kr

Skickas inom 10-15 vardagar

Beskrivning

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.

Produktinformation

Utgivningsdatum:2013-06-04
Mått:155 x 235 x 24 mm
Vikt:682 g
Format:Inbunden
Språk:Engelska
Serie:Computer Communications and Networks
Antal sidor:324
Upplaga:2013
Förlag:Springer London Ltd
ISBN:9781447151722

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

Recensioner i media

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)

Innehållsförteckning

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.