Distributed Graph Algorithms for Computer Networks

By:

Kayhan Erciyes

Format:

Paperback / softback

Series:

Computer Communications and Networks

Show Hide Adult Content

$158.99

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Buy Now, Pay Later with:

4 payments of $39.75 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

Around 25 Jun - 5 Jul using International Courier

Description

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.

Release date Australia

June 6th, 2015

Author

Kayhan Erciyes

Audience

Professional & Vocational

Illustrations

XVIII, 324 p.

Pages

324

Series

Computer Communications and Networks

Dimensions

155x235x18

ISBN-13

9781447158509

Product ID

23791439

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here