Zum Hauptinhalt springen
Dekorationsartikel gehören nicht zum Leistungsumfang.
Distributed Graph Algorithms for Computer Networks
Buch von Kayhan Erciyes
Sprache: Englisch

90,94 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Aktuell nicht verfügbar

Kategorien:
Beschreibung
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.
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.
Zusammenfassung

Presents a comprehensive review of key distributed graph algorithms for computer network applications

Describes in detail the implementation of each algorithm, and discusses their concrete network applications

Includes practical exercises at the end of each chapter, and a simple simulator developed to run distributed algorithms

Includes supplementary material: [...]

Inhaltsverzeichnis

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.

Details
Erscheinungsjahr: 2013
Fachbereich: Wahrscheinlichkeitstheorie
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Reihe: Computer Communications and Networks
Inhalt: xviii
324 S.
ISBN-13: 9781447151722
ISBN-10: 1447151720
Sprache: Englisch
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Erciyes, Kayhan
Hersteller: Springer London
Springer-Verlag London Ltd.
Computer Communications and Networks
Maße: 241 x 160 x 24 mm
Von/Mit: Kayhan Erciyes
Erscheinungsdatum: 04.06.2013
Gewicht: 0,682 kg
Artikel-ID: 105926382
Zusammenfassung

Presents a comprehensive review of key distributed graph algorithms for computer network applications

Describes in detail the implementation of each algorithm, and discusses their concrete network applications

Includes practical exercises at the end of each chapter, and a simple simulator developed to run distributed algorithms

Includes supplementary material: [...]

Inhaltsverzeichnis

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.

Details
Erscheinungsjahr: 2013
Fachbereich: Wahrscheinlichkeitstheorie
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Buch
Reihe: Computer Communications and Networks
Inhalt: xviii
324 S.
ISBN-13: 9781447151722
ISBN-10: 1447151720
Sprache: Englisch
Ausstattung / Beilage: HC runder Rücken kaschiert
Einband: Gebunden
Autor: Erciyes, Kayhan
Hersteller: Springer London
Springer-Verlag London Ltd.
Computer Communications and Networks
Maße: 241 x 160 x 24 mm
Von/Mit: Kayhan Erciyes
Erscheinungsdatum: 04.06.2013
Gewicht: 0,682 kg
Artikel-ID: 105926382
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte