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.
Produkteigenschaften
- Artikelnummer: 9781447151722
- Medium: Buch
- ISBN: 978-1-4471-5172-2
- Verlag: Springer
- Erscheinungstermin: 04.06.2013
- Sprache(n): Englisch
- Auflage: 2013
- Serie: Computer Communications and Networks
- Produktform: Gebunden
- Gewicht: 6387 g
- Seiten: 324
- Format (B x H x T): 160 x 241 x 24 mm
- Ausgabetyp: Kein, Unbekannt