ISSN:
1572-9443
Keywords:
queueing networks
;
stochastic Petri nets
;
Poisson input
;
vectorial recurrence equation
;
waiting times
;
analyticity
;
Taylor series expansion
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract We consider a certain class of vectorial evolution equations, which are linear in the (max,+) semi-field. They can be used to model several Types of discrete event systems, in particular queueing networks where we assume that the arrival process of customers (tokens, jobs, etc.) is Poisson. Under natural Cramér Type conditions on certain variables, we show that the expected waiting time which the nth customer has to spend in a given subarea of such a system can be expanded analytically in an infinite power series with respect to the arrival intensity λ. Furthermore, we state an algorithm for computing all coefficients of this series expansion and derive an explicit finite representation formula for the remainder term. We also give an explicit finite expansion for expected stationary waiting times in (max,+)-linear systems with deterministic queueing services.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1019141510202
