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.
Full Product Details
Author: Kayhan Erciyes
Publisher: Springer London Ltd
Imprint: Springer London Ltd
Edition: 2013 ed.
Dimensions:
Width: 15.50cm
, Height: 2.00cm
, Length: 23.50cm
Weight: 6.387kg
ISBN: 9781447151722
ISBN 10: 1447151720
Pages: 324
Publication Date: 04 June 2013
Audience:
Professional and scholarly
,
Professional & Vocational
Format: Hardback
Publisher's Status: Active
Availability: Manufactured on demand
We will order this item for you from a manufactured on demand supplier.
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 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 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)
