Distributed Graph Algorithms for Computer Networks (Computer Communications and Networks)

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.;Graph theory is an invaluable tool for the designer of algorithms for distributed systems. This hands-on textbook/reference presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation. Each chapter opens with a concise introduction to a specific problem, supporting the theory with numerous examples, before providing a list of relevant algorithms. These algorithms are described in detail from conceptual basis to pseudocode, complete with graph templates for the stepwise implementation of the algorithm, followed by its analysis. The chapters then conclude with summarizing notes and programming exercises. 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 classroom-tested and easy-to-follow textbook is essential reading for all graduate students and researchers interested in discrete mathematics, algorithms and computer networks. Prof. Dr. Kayhan Erciyeş is the Rector and a member of the Computer Engineering Department at Izmir University, Turkey. Graph Theory Is An Invaluable Tool For The Designer Of Algorithms For Distributed Systems. This Hands-on Textbook/reference Presents A Comprehensive Review Of Key Distributed Graph Algorithms For Computer Network Applications, With A Particular Emphasis On Practical Implementation. Each Chapter Opens With A Concise Introduction To A Specific Problem, Supporting The Theory With Numerous Examples, Before Providing A List Of Relevant Algorithms. These Algorithms Are Described In Detail From Conceptual Basis To Pseudocode, Complete With Graph Templates For The Stepwise Implementation Of The Algorithm, Followed By Its Analysis. The Chapters Then Conclude With Summarizing Notes And Programming Exercises. 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 Classroom-tested And Easy-to-follow Textbook Is Essential Reading For All Graduate Students And Researchers Interested In Discrete Mathematics, Algorithms And Computer Networks. Prof. Dr. Kayhan Erciyeş Is The Rector And A Member Of The Computer Engineering Department At Izmir University, Turkey. 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. By K. Erciyes. Front Matter....Pages I-XVIII Introduction....Pages 1-8 Front Matter....Pages 9-9 Graphs....Pages 11-21 The Computational Model....Pages 23-37 Spanning Tree Construction....Pages 39-51 Graph Traversals....Pages 53-67 Minimum Spanning Trees....Pages 69-82 Routing....Pages 83-96 Self-Stabilization....Pages 97-104 Front Matter....Pages 105-105 Vertex Coloring....Pages 107-134 Maximal Independent Sets....Pages 135-155 Dominating Sets....Pages 157-171 Matching....Pages 173-191 Vertex Cover....Pages 193-213 Front Matter....Pages 215-215 Introduction....Pages 217-228 Topology Control....Pages 229-257 Ad Hoc Routing....Pages 259-275 Sensor Network Applications....Pages 277-294 ASSIST: A Simulator to Develop Distributed Algorithms....Pages 295-303 Back Matter....Pages 305-324