Name
Title | ||
|---|---|---|
On The Relations Between Bcmp Queueing Networks And Product Form Solution Stochastic Petri Nets |
Abstract | ||
|---|---|---|
In this paper we show that multi-class BCMP queueing networks can be represented by means of Product Form Solution Stochastic Petri Nets (PF-SPNs). Since the first time PF-SPNs were proposed, one of their main drawbacks concerned the fact that there was no clear relation between PF-SPNs and PF-QNs, in particular the well-known multi-class BCMP-QNs. It is important to note that the existence of the product form solution is not a property of the formalism, but of the underlying Markovian process. Hence, the fact that PF-SPNs (and also PF-GSPNs) cannot directly represent BCMP-QNs is one of the weaknesses of the SPN product-form results. The results presented in this paper overcome this weakness. In particular, we show that starting from a detailed GSPN representation of each of the BCMP station types, it is possible to derive equivalent compact PF-SPN representations for each station type. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/PNPM.2003.1231547 | 10TH INTERNATIONAL WORKSHOP ON PETRI NETS AND PERFORMANCE MODELS, PROCEEDINGS |
Keywords | Field | DocType |
stochastic processes,linear systems,computer science,steady state,stochastic petri net,concurrent computing,petri nets | Discrete mathematics,BCMP network,Product-form solution,Petri net,Markov process,Computer science,Stochastic process,Theoretical computer science,Stochastic Petri net,Queueing theory,Concurrent computing | Conference |
ISSN | Citations | PageRank |
1063-6714 | 7 | 0.52 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gianfranco Balbo | 1 | 1807 | 243.48 |
| Steven C. Bruell | 2 | 142 | 29.83 |
| Matteo Sereno | 3 | 388 | 37.24 |