{"product_id":"9781447158509","title":"Computer Communications and Networks","description":"\u003ch1\u003eComputer Communications and Networks\u003c\/h1\u003e \u003ch2\u003eErciyes, Kayhan\u003c\/h2\u003e \u003cp\u003eThis 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.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2015-06-06\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003eISBN-13: 9781447158509\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-1-4471-5173-9\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 324\u003c\/p\u003e ","brand":"Springer London","offers":[{"title":"Default Title","offer_id":47380212252812,"sku":"9781447158509","price":58.49,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9781447158509.jpg?v=1775739041","url":"https:\/\/lateknightbooks.com\/products\/9781447158509","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}