A Graph-Theoretic Approach to Enterprise Network Dynamics (eBook)

Horst Bunke, Peter J. Dickinson, Miro Kraetzl, Walter D. Wallis (Autoren)

eBook Download: PDF

2007 | 2007
XIV, 226 Seiten
Birkhäuser Boston (Verlag)
978-0-8176-4519-9 (ISBN)

Infos

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

---

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.Based on many years of applied research of 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.

Inhalt

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.

Produkt-Details

• Erscheint lt. Verlag: 5.4.2007
• Reihe/Serie: Progress in Computer Science and Applied Logic
• Reihe/Serie: Progress in Computer Science and Applied Logic
• Zusatzinfo: XIV, 226 p. 110 illus.
• Verlagsort: Boston
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik ► Netzwerke
• Themenwelt: Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge
• Themenwelt: Mathematik / Informatik ► Informatik ► Theorie / Studium
• Themenwelt: Informatik ► Weitere Themen ► Hardware
• Themenwelt: Mathematik / Informatik ► Mathematik
• Themenwelt: Technik
• Schlagworte: algorithm • Algorithm analysis and problem complexity • algorithms • Graph • graph theory • Intranet • knowledge management • Matching • Modeling • Network Management • Node • Optimization • SiM
• ISBN-10: 0-8176-4519-5 / 0817645195
• ISBN-13: 978-0-8176-4519-9 / 9780817645199