Cargando…

A Graph-Theoretic Approach to Enterprise Network Dynamics

Networks 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 numer...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Bunke, Horst (Autor), Dickinson, Peter J. (Autor), Kraetzl, Miro (Autor), Wallis, Walter D. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser, 2007.
Edición:1st ed. 2007.
Colección:Progress in Computer Science and Applied Logic, 24
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-0-8176-4519-9
003 DE-He213
005 20220116181109.0
007 cr nn 008mamaa
008 100301s2007 xxu| s |||| 0|eng d
020 |a 9780817645199  |9 978-0-8176-4519-9 
024 7 |a 10.1007/978-0-8176-4519-9  |2 doi 
050 4 |a TK7885-7895 
050 4 |a TK5105.5-5105.9 
072 7 |a UK  |2 bicssc 
072 7 |a COM043000  |2 bisacsh 
072 7 |a UK  |2 thema 
082 0 4 |a 621.39  |2 23 
082 0 4 |a 004.6  |2 23 
100 1 |a Bunke, Horst.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 2 |a A Graph-Theoretic Approach to Enterprise Network Dynamics  |h [electronic resource] /  |c by Horst Bunke, Peter J. Dickinson, Miro Kraetzl, Walter D. Wallis. 
250 |a 1st ed. 2007. 
264 1 |a Boston, MA :  |b Birkhäuser Boston :  |b Imprint: Birkhäuser,  |c 2007. 
300 |a XIV, 226 p. 110 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Progress in Computer Science and Applied Logic,  |x 2297-0584 ;  |v 24 
505 0 |a Intranets 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 |a Networks 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 |a Computer engineering. 
650 0 |a Computer networks . 
650 0 |a Electronic digital computers-Evaluation. 
650 0 |a Algorithms. 
650 0 |a Mathematics. 
650 0 |a Computer science-Mathematics. 
650 0 |a Mathematical statistics. 
650 1 4 |a Computer Engineering and Networks. 
650 2 4 |a System Performance and Evaluation. 
650 2 4 |a Algorithms. 
650 2 4 |a Applications of Mathematics. 
650 2 4 |a Mathematical Applications in Computer Science. 
650 2 4 |a Probability and Statistics in Computer Science. 
700 1 |a Dickinson, Peter J.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Kraetzl, Miro.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
700 1 |a Wallis, Walter D.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9780817671211 
776 0 8 |i Printed edition:  |z 9780817644857 
830 0 |a Progress in Computer Science and Applied Logic,  |x 2297-0584 ;  |v 24 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-0-8176-4519-9  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)