A Langevin Interpretation of PEPA Models

Authors:
Joris Slegers
Affiliations:
School of Informatics University of Edinburgh,
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2010

Citing 4
Cited 0

Scheduling networks of queues: heavy traffic analysis of a multistation network with controllable inputs

Operations Research - Supplement to Operations Research: stochastic processes
On the self-similar nature of Ethernet traffic

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
A compositional approach to performance modelling

A compositional approach to performance modelling
Fluid Flow Approximation of PEPA models

QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we examine a Langevin interpretation of the stochastic process algebra PEPA. We show how previous work on chemical systems yielding sets of stochastic differential equations (SDEs) can be adapted to the domain of computer systems. Two simple examples are then examined. Their experimental results show a good match between traditional Markovian interpretation of PEPA and the SDE interpretation introduced here. It also raises the problem of boundary conditions which is briefly discussed and for which we propose a solution.