Advertisement

© 2007

A Graph-Theoretic Approach to Enterprise Network Dynamics

Benefits

  • Treats the application of numerous graph-theoretic algorithms to a comprehensive analysis of dynamic enterprise networks

  • Covers a number of elegant applications, including many new and experimental results, to motivate network analysts, practitioners and researchers alike

  • Also suitable for graduate courses addressing state-of-the-art applications of graph theory in analysis of dynamic communication networks and dynamic databasing

Book

Part of the Progress in Computer Science and Applied Logic (PCS) book series (PCS, volume 24)

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Introduction

    1. Front Matter
      Pages 1-1
  3. Event Detection Using Graph Distance

  4. Properties of the Underlying Graphs

    1. Front Matter
      Pages 145-145
    2. Pages 165-173
  5. Prediction and Advanced Distance Measures

    1. Front Matter
      Pages 175-175
  6. Back Matter
    Pages 211-225

About this book

Introduction

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.

Keywords

Algorithms Graph Graph theory Intranet Matching Node Sim algorithm knowledge management modeling network management optimization

Authors and affiliations

  1. 1.Institute of Computer Science and Applied Mathematics (IAM/FKI)Universität BernBernSwitzerland
  2. 2.Defence Science and Technology Organisation (DSTO), ISR Division-CA GroupAustralian Department of DefenceEdinburghAustralia
  3. 3.Department of MathematicsSouthern Illinois UniversityCarbondaleUSA

Bibliographic information

Industry Sectors
Aerospace
Electronics
IT & Software
Telecommunications

Reviews

From the reviews:

"This book introduces various graph theory topics, and shows how these concepts can be used to solve some of the real problems that arise in these five functional areas. … It is more suitable for research professors working with data networks, graduate students in the subject, or advanced undergrads in discrete mathematics." (G. M. White, Computing Reviews, Vol. 50 (1), January, 2009)

"This monograph focusses on the dynamic nature of networks. It provides guidance in answering questions concerning the detection and identification of faults … . Most mathematicians will appreciate the applications … and at the same time find numerous open problems in mathematics suggested by the needs of dynamic network modelling. … The monograph should prove interesting not only to network managers, but also to mathematicians in a variety of fields. … it provides a good starting point for the underlying mathematics." (Charles J. Colbourn, Zentralblatt MATH, Vol. 1157, 2009)