Tous nos rayons

Déjà client ? Identifiez-vous

Mot de passe oublié ?

Nouveau client ?

CRÉER VOTRE COMPTE
A Graph-theoretic Approach to Enterprise Network Dynamics
Ajouter à une liste

Librairie Eyrolles - Paris 5e
Indisponible

A Graph-theoretic Approach to Enterprise Network Dynamics

A Graph-theoretic Approach to Enterprise Network Dynamics

Horst Bunke, Peter J. Dickinson, Miro Kraetzl, Walter D. Wallis - Collection Progress in computer science and applied logic

240 pages, parution le 22/01/2007

Résumé

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.

Written for: Graduate students, researchers, computer scientists, network analysts, graph theorists, applied mathematicians and statisticians

Sommaire

  • Introduction
    • 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.
Voir tout
Replier

Caractéristiques techniques

  PAPIER
Éditeur(s) Birkhäuser
Auteur(s) Horst Bunke, Peter J. Dickinson, Miro Kraetzl, Walter D. Wallis
Collection Progress in computer science and applied logic
Parution 22/01/2007
Nb. de pages 240
Format 16 x 24
Couverture Relié
Poids 460g
Intérieur Noir et Blanc
EAN13 9780817644857
ISBN13 978-0-8176-4485-7

Avantages Eyrolles.com

Livraison à partir de 0,01 en France métropolitaine
Paiement en ligne SÉCURISÉ
Livraison dans le monde
Retour sous 15 jours
+ d'un million et demi de livres disponibles
satisfait ou remboursé
Satisfait ou remboursé
Paiement sécurisé
modes de paiement
Paiement à l'expédition
partout dans le monde
Livraison partout dans le monde
Service clients 0 321 79 56 75 sav@commande.eyrolles.com
librairie française
Librairie française depuis 1925