Distributed Graph Algorithms for Computer Networks

by Kayhan Erciyes

Overview

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.

Product Details

ISBN-13:	9781447151739
Publisher:	Springer-Verlag New York, LLC
Publication date:	05/16/2013
Series:	Computer Communications and Networks
Sold by:	Barnes & Noble
Format:	eBook
File size:	4 MB

About the Author

L. Santiago Medina, MD, MPH, is Co-Director, Division of Neuroradiology-Neuroimaging, and Director, Health Outcomes, Policy, and Economics (HOPE) Center at Miami Children's Hospital.
Jeffrey G. Jarvik, MD, MPH,is the Professor of Radiology and Neurological Surgery, Adjunct Associate Professor of Health Services, and Director of Radiology Health Service Research Section at the University of Washington School of Medicine.
Pina C. Sanelli, MD, MPH,is Associate Professor of Radiology and is also Associate Professor of Public Health at Weill Cornell Medical College. She is an Associate Attending Radiologist at the NewYork-Presbyterian Hospital-Weill Cornell Campus. Dr. Sanelli is a member of the Division of Neuroradiology. Her clinical expertise is in neuroradiological and spine imaging and procedures including MRI, MRA, CT, and CTA.

Table of Contents

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.

Editorial Reviews

From the reviews:

“This beautiful and timely book provides a comprehensive review of key distributed graph algorithms for computer network applications. … a must-read for young students and researchers who want to master the topics and implement applications. This would be an excellent textbook for courses on distributed systems. … I highly recommend it to researchers and students of computer networks, and it will also provide a solid foundation for many upcoming areas of research, such as network coding for distributed storage systems.” (Manish Gupta, Computing Reviews, February, 2014)

From the Publisher