000 04304nam a22005775i 4500
001 978-0-8176-4519-9
003 DE-He213
005 20170628033410.0
007 cr nn 008mamaa
008 100301s2007 xxu| s |||| 0|eng d
020 _a9780817645199
_9978-0-8176-4519-9
024 7 _a10.1007/978-0-8176-4519-9
_2doi
050 4 _aQA76.9.C643
050 4 _aTK5105.5-5105.9
072 7 _aUT
_2bicssc
072 7 _aCOM067000
_2bisacsh
082 0 4 _a004.6
_223
100 1 _aBunke, Horst.
_eauthor.
245 1 2 _aA Graph-Theoretic Approach to Enterprise Network Dynamics
_h[electronic resource] /
_cby Horst Bunke, Peter J. Dickinson, Miro Kraetzl, Walter D. Wallis.
264 1 _aBoston, MA :
_bBirkhäuser Boston,
_c2007.
300 _aXIV, 226 p. 110 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aProgress in Computer Science and Applied Logic (PCS) ;
_v24
505 0 _aIntranets and Network Management -- Graph-Theoretic Concepts -- Event Detection Using Graph Distance -- Matching Graphs with Unique Node Labels -- Graph Similarity Measures for Abnormal Change Detection -- Median Graphs for Abnormal Change Detection -- Graph Clustering for Abnormal Change Detection -- Graph Distance Measures based on Intragraph Clustering and Cluster Distance -- Matching Sequences of Graphs -- Properties of the Underlying Graphs -- Distances, Clustering, and Small Worlds -- Tournament Scoring -- Prediction and Advanced Distance Measures -- Recovery of Missing Information in Graph Sequences -- Matching Hierarchical Graphs.
520 _aNetworks have become nearly ubiquitous and increasingly complex, and their support of modern enterprise environments has become fundamental. Accordingly, robust network management techniques are essential to ensure optimal performance of these networks. This monograph treats the application of numerous graph-theoretic algorithms to a comprehensive analysis of dynamic enterprise networks. Network dynamics analysis yields valuable information about network performance, efficiency, fault prediction, cost optimization, indicators and warnings. The exposition is organized into four relatively independent parts: an introduction and overview of typical enterprise networks and the graph theoretical prerequisites for all algorithms introduced later; an in-depth treatise of usage of various graph distances for event detection; a detailed exploration of properties of underlying graphs with modeling applications; and a theoretical and applied treatment of network behavior inferencing and forecasting using sequences of graphs. Based on many years of applied research on generic network dynamics, this work covers a number of elegant applications (including many new and experimental results) of traditional graph theory algorithms and techniques to computationally tractable network dynamics analysis to motivate network analysts, practitioners and researchers alike. The material is also suitable for graduate courses addressing state-of-the-art applications of graph theory in analysis of dynamic communication networks, dynamic databasing, and knowledge management.
650 0 _aComputer science.
650 0 _aComputer network architectures.
650 0 _aComputer system performance.
650 0 _aComputer software.
650 0 _aMathematics.
650 1 4 _aComputer Science.
650 2 4 _aComputer Systems Organization and Communication Networks.
650 2 4 _aSystem Performance and Evaluation.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aApplications of Mathematics.
650 2 4 _aMath Applications in Computer Science.
650 2 4 _aProbability and Statistics in Computer Science.
700 1 _aDickinson, Peter J.
_eauthor.
700 1 _aKraetzl, Miro.
_eauthor.
700 1 _aWallis, Walter D.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9780817644857
830 0 _aProgress in Computer Science and Applied Logic (PCS) ;
_v24
856 4 0 _uhttp://dx.doi.org/10.1007/978-0-8176-4519-9
912 _aZDB-2-SCS
999 _c15013
_d15013