Distributed Graph Algorithms for Computer Networks
- Length: 350 pages
- Edition: 2013
- Language: English
- Publisher: Springer
- Publication Date: 2013-06-04
- ISBN-10: 1447151720
- ISBN-13: 9781447151722
- Sales Rank: #4735944 (See Top 100 Books)
Distributed Graph Algorithms for Computer Networks (Computer Communications and Networks)
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.
Table of Contents
Part I: Fundamental Algorithms
Part II: Graph Theoretical Algorithms
Part III: Ad Hoc Wireless Networks
Appendix A: Pseudocode Conventions
Appendix B: ASSIST Code
Appendix C: Applications Using ASSIST
Donate to keep this site alive
1. Disable the AdBlock plugin. Otherwise, you may not get any links.
2. Solve the CAPTCHA.
3. Click download link.
4. Lead to download server to download.