Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Performance Evaluation of a Distributed and Probabilistic Network Monitoring Approach
SICS.
SICS.
2012 (English)Conference paper, Published paper (Refereed)
Abstract [en]

We investigate the effects of employing a probabilistic fault detection approach relative the performance of a deterministic network monitoring method. The approach has its foundation in probabilistic network management, in which performance limits and thresholds are specified in terms of e.g. probabilities or belief values. When combined with adaptive mechanisms, probabilistic approaches can potentially offer improved controllability, adaptivity and reliability, compared to deterministic monitoring methods. Results from synthetically generated and real network QoS measurements indicate that the probabilistic approach generally can perform at least as good as a deterministic algorithm, with a higher degree of predictable performance and resource-efficiency. Due to the stochastic nature of the algorithm, worse performance than expected is sometimes observed. Nevertheless, the results give additional support to some of the practical benefits expected in using probabilistic approaches for network management purposes.

Place, publisher, year, edition, pages
2012.
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-144606Scopus ID: 2-s2.0-84872084126OAI: oai:DiVA.org:kth-144606DiVA: diva2:714335
Conference
The 8th International Conference on Network and Service Management (CNSM)
Note

QC 20140509

Available from: 2014-04-27 Created: 2014-04-27 Last updated: 2014-05-09Bibliographically approved
In thesis
1. Probabilistic Fault Management in Networked Systems
Open this publication in new window or tab >>Probabilistic Fault Management in Networked Systems
2014 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Technical advances in network communication systems (e.g. radio access networks) combined with evolving concepts based on virtualization (e.g. clouds), require new management algorithms in order to handle the increasing complexity in the network behavior and variability in the network environment. Current network management operations are primarily centralized and deterministic, and are carried out via automated scripts and manual interventions, which work for mid-sized and fairly static networks. The next generation of communication networks and systems will be of significantly larger size and complexity, and will require scalable and autonomous management algorithms in order to meet operational requirements on reliability, failure resilience, and resource-efficiency.

A promising approach to address these challenges includes the development of probabilistic management algorithms, following three main design goals. The first goal relates to all aspects of scalability, ranging from efficient usage of network resources to computational efficiency. The second goal relates to adaptability in maintaining the models up-to-date for the purpose of accurately reflecting the network state. The third goal relates to reliability in the algorithm performance in the sense of improved performance predictability and simplified algorithm control.

This thesis is about probabilistic approaches to fault management that follow the concepts of probabilistic network management (PNM). An overview of existing network management algorithms and methods in relation to PNM is provided. The concepts of PNM and the implications of employing PNM-algorithms are presented and discussed. Moreover, some of the practical differences of using a probabilistic fault detection algorithm compared to a deterministic method are investigated. Further, six probabilistic fault management algorithms that implement different aspects of PNM are presented.

The algorithms are highly decentralized, adaptive and autonomous, and cover several problem areas, such as probabilistic fault detection and controllable detection performance; distributed and decentralized change detection in modeled link metrics; root-cause analysis in virtual overlays; event-correlation and pattern mining in data logs; and, probabilistic failure diagnosis. The probabilistic models (for a large part based on Bayesian parameter estimation) are memory-efficient and can be used and re-used for multiple purposes, such as performance monitoring, detection, and self-adjustment of the algorithm behavior. 

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2014. 61 p.
Series
TRITA-CSC-A, ISSN 1653-5723 ; 2014:06
Keyword
probabilistic network management; probabilistic modeling; fault management; fault detection; event-correlation; change detection, probabilistisk nätverkshantering; probabilistiska modeller; fel- hantering; feldetektion; korrelationsanalys; förändringsdetektion
National Category
Communication Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:kth:diva-144608 (URN)978-91-7595-114-0 (ISBN)
Public defence
2014-05-28, F3, Lindstedtsvägen 26, KTH, Stockholm, 14:00 (English)
Opponent
Supervisors
Note

QC 20140509

Available from: 2014-05-09 Created: 2014-04-27 Last updated: 2014-05-13Bibliographically approved

Open Access in DiVA

No full text

Scopus

Search in DiVA

By author/editor
Steinert, Rebecca
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 28 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf