Aufgrund einer technischen Störung sind wir derzeit telefonisch nicht erreichbar. Wir arbeiten bereits an der Behebung. Vielen Dank für Ihr Verständnis.
Erciyes Distributed Graph Algorithms for Computer Networks
Erscheinungsjahr 2013
ISBN: 978-1-4471-5173-9
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
E-Book, Englisch, 324 Seiten
Reihe: Computer Science
ISBN: 978-1-4471-5173-9
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
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.
Zielgruppe
Graduate
Autoren/Hrsg.
Weitere Infos & Material
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.
