Distributed Graph Algorithms For Computer Networks - Couverture rigide

Erciyes, Kayhan

Couverture rigide

ISBN 10 : 1447151720 ISBN 13 : 9781447151722

Editeur : Springer London Ltd, 2013

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.

Détails de l'édition

• Éditeur: Springer London Ltd
• Date d'édition: 2013
• Langue: anglais
• ISBN 10: 1447151720
• ISBN 13: 9781447151722
• Reliure: Relié
• Nombre de pages: 324
• Coordonnées du fabricant: non disponible
• Personne responsable: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Allemagne