2016ACM SIGBED ReviewRequires access

Probabilistic component-based analysis for networks

Luca Santinelli

Open publisher page 2 citations

Abstract

Time-constrained networks have demanded so far for deterministic modeling and analysis in order to guarantee their worst-case behavior. With this work we intend to apply both probabilistic modeling and probabilistic analyses to investigate such networks. The probabilistic framework we propose aims at guaranteeing confidence levels, in the form of probabilities, to the network timing constraints; the deterministic case remain a particular case, the worst-case, within the probabilistic framework. We focus on probabilistic bounds for defining probabilistic interfaces to network components and we study the way that probabilities propagate within networks by accounting for the dependences and the interactions between network components. Finally, we define and apply probabilistic performance metrics for evaluating network behavior with different degree of confidence due to the probabilities.

About this research paper

What this paper is about

Time-constrained networks have demanded so far for deterministic modeling and analysis in order to guarantee their worst-case behavior. With this work we intend to apply both probabilistic modeling and probabilistic analyses to investigate such networks. The probabilistic framework we propose aims at guaranteeing confidence levels, in the form of probabilities, to the network timing constraints; the deterministic case remain a particular case, the worst-case, within the probabilistic framework. We focus on probabilistic bounds for defining probabilistic interfaces to network components and we study the way that probabilities propagate within networks by accounting for the dependences and the interactions between network components. Finally, we define and apply probabilistic performance metrics for evaluating network behavior with different degree of confidence due to the probabilities.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Time-constrained networks have demanded so far for deterministic modeling and analysis in order to guarantee their worst-case behavior. With this work we intend to apply both probabilistic modeling and probabilistic analyses to investigate such networks. The probabilistic framework we propose aims at guaranteeing confidence levels, in the form of probabilities, to the network timing constraints; the deterministic case remain a particular case, the worst-case, within the probabilistic framework. We focus on probabilistic bounds for defining probabilistic interfaces to network components and we study the way that probabilities propagate within networks by accounting for the dependences and the interactions between network components. Finally, we define and apply probabilistic performance metrics for evaluating network behavior with different degree of confidence due to the probabilities.

Key concepts: Probabilistic logic, Computer science, Probabilistic relevance model, Probabilistic analysis of algorithms, Focus (optics), Component (thermodynamics), Probabilistic CTL, Probabilistic argumentation

Related papers

Back to paper searchBrowse research topicsOriginal source
Probabilistic component-based analysis for networks — Research Paper | ScholarLens