000 04030nam a22004935i 4500
001 978-1-4471-5173-9
003 DE-He213
005 20200421112224.0
007 cr nn 008mamaa
008 130517s2013 xxk| s |||| 0|eng d
020 _a9781447151739
_9978-1-4471-5173-9
024 7 _a10.1007/978-1-4471-5173-9
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aErciyes, K.
_eauthor.
245 1 0 _aDistributed Graph Algorithms for Computer Networks
_h[electronic resource] /
_cby K. Erciyes.
264 1 _aLondon :
_bSpringer London :
_bImprint: Springer,
_c2013.
300 _aXVIII, 324 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aComputer Communications and Networks,
_x1617-7975
505 0 _aIntroduction -- 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.
520 _aGraph 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              .
650 0 _aComputer science.
650 0 _aComputer communication systems.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputer Communication Networks.
650 2 4 _aMath Applications in Computer Science.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781447151722
830 0 _aComputer Communications and Networks,
_x1617-7975
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-4471-5173-9
912 _aZDB-2-SCS
942 _cEBK
999 _c57586
_d57586