Paper Info
Title
Mean-Value Analysis Of Mixed, Multiple Class Bcmp Networks With Load Dependent Service Stations
Abstract
In this paper we describe a mean value analysis algorithm to solve product form queueing network models of the B askett, C handy, M untz, and P alacios type (BCMP) [5]. These networks can accommodate multiple job classes and load dependent service stations. The networks can be closed (i.e., jobs neither enter nor leave the network), open (i.e., jobs can enter and leave the network), or mixed (i.e., closed with respect to some job classes and open with respect to others). Two major aspects of this paper are: 1. (1)to present a unified approach to the solution of this class of BCMP queueing networks [5], and 2. (2)to thereby extend and consolidate the results of the work of several authors (Balbo, Bruell and Schwetman (1977), Bruell and Balbo (1980), Chandy and Sauer (1980), Krzesinki, Teunissen and Kritzinger (1981), Resier and Kobayashi (1975), Reiser and Lavenberg (1980), Reiser (1981), Sauer (1983), Schwetman (1980), Tucci and MacNair (1982) and Zahorjan and Wong (1981)). The paper concludes by collecting together all the results into an explicit algorithm, MVALDMX (for m ean v alue a nalysis l oad d ependent m ixed) that is a generalization of the original MVA algorithm of Reiser and Lavenberg (1978, 1980).
Year
DOI
Venue
1984
10.1016/0166-5316(84)90010-5
PERFORMANCE EVALUATION
Keywords
Field
DocType
mean value analysis
Mean value analysis,BCMP network,Mean value,Computer science,Queueing network models,Queuing network,Theoretical computer science,Queueing theory,Distributed computing
Journal
Volume
Issue
ISSN
4
4
0166-5316
Citations 
PageRank 
References 
18
1.11
13
Authors
3
Name
Order
Citations
PageRank
Steven C. Bruell114229.83
Gianfranco Balbo21807243.48
P. V. Afshari3352.77