Mean-field framework for performance evaluation of push–pull gossip protocols

Bakhshi, Rena; Cloth, Lucia; Fokkink, Wan; Haverkort, Boudewijn R.

doi:10.1016/j.peva.2010.08.025

Cited by 30 publications

(40 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We present the idea in the following, showing how to compute the time-dependent reachability probability with time horizon T , without resorting to equation (8). The idea is to exploit the Chapman-Kolmogorov (CK) semigroup equations [42], Π(t, t ) = Π(t, t )Π(t , t ), t ∈ [t, t ], in order to integrate the backward and the forward equations separately.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Checking Individual Agent Behaviours in Markov Population Models by Fluid Approximation

Bortolussi

Hillston

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this chapter, we will describe, in a tutorial style, recent work on the use of fluid approximation techniques in the context of stochastic model checking. We will discuss the theoretical background and the algorithms working out an example. This approach is designed for population models, in which a (large) number of individual agents interact, which give rise to continuous time Markov chain (CTMC) models with a very large state space. We then focus on properties of individual agents in the system, specified by Continuous Stochastic Logic (CSL) formulae, and use fluid approximation techniques (specifically, the so called fast simulation) to check those properties. We will show that verification of such CSL formulae reduces to the computation of reachability probabilities in a special kind of timeinhomogeneous CTMC with a small state space, in which both the rates and the structure of the CTMC can change (discontinuously) with time. In this tutorial, we will discuss only briefly the theoretical issues behind the approach, like the decidability of the method and the consistency of the approximation scheme.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Algebras (SPA), giving birth to a new class of quantitative analysis techniques for large scale population models, described by continuous time Markov chains (CTMC) [7,8,31,27,16,9].…”

Section: Bortolussi L and Hillston J (2013) Checking Individual Amentioning

confidence: 99%

Checking Individual Agent Behaviours in Markov Population Models by Fluid Approximation

Bortolussi

Hillston

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Oracle data without hardware support, so we have to optimize the hardware. In the early stages of the application, often need to adjust the hardware optimization, many performance bottlenecks and get very good solve, but as the database scale growing, we need to turn the optimization to focus on comparative economic soft optimization level [21][22].…”

Section: The Database Optimization Approaches and Methodsmentioning

confidence: 99%

Research on the Enterprise Resource Management System and Auxiliary Performance Evaluation Mechanism based on Oracle Database Optimization and Security Enhancement

Liu¹,

Hua²,

Wesmmian³

2017

IJFGCN

View full text Add to dashboard Cite

show abstract

“…In recent years, the approach has been used for several performance and dependability models e.g. [3][4][5]30].…”

Section: Stochastic Process Algebra With Fluid Interpretationmentioning

confidence: 99%

The Benefits of Sometimes Not Being Discrete

Hillston

2014

CONCUR 2014 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. Discrete representations of systems are usual in theoretical computer science and they have many benefits. Unfortunately they also suffer from the problem of state space explosion, sometimes termed the curse of dimensionality. In recent years, research has shown that there are cases in which we can reap the benefits of discrete representation during system description but then gain from more efficient analysis by approximating the discrete system by a continuous one. This paper will motivate this approach, explaining the theoretical foundations and their practical benefits.

show abstract

Mean-field framework for performance evaluation of push–pull gossip protocols

Cited by 30 publications

References 23 publications

Checking Individual Agent Behaviours in Markov Population Models by Fluid Approximation

Checking Individual Agent Behaviours in Markov Population Models by Fluid Approximation

Research on the Enterprise Resource Management System and Auxiliary Performance Evaluation Mechanism based on Oracle Database Optimization and Security Enhancement

The Benefits of Sometimes Not Being Discrete

Contact Info

Product

Resources

About