Distributed Graph Algorithms for Computer Networks

Erciyes Kayhan

ISBN 10: 1447151720 / ISBN 13: 9781447151722

Edité par Springer, 2013

A propos de cet article

pp. 344 167 Illus.

N° de réf. du vendeur 94894757

Détails bibliographiques

• Titre: Distributed Graph Algorithms for Computer Networks
• Éditeur: Springer
• Date de parution: 2013
• Langue: anglais
• ISBN à 10 chiffres: 1447151720
• ISBN à 13 chiffres: 9781447151722
• Reliure: Couverture rigide
• État de l'article: New

A propos de ce titre

Synopsis

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.