An approximation method for general closed queuing networks with fork/join mechanisms

Journal of the Operational Research Society

Volumn 51, Issue 2, 2000, Pages 198-208

  Baynat, B ^a   Dallery, Y ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

Fork Join mechanisms; Modeling and analysis; Product form approximations; Queuing networks

Indexed keywords

APPROXIMATION THEORY; BENCHMARKING; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; QUEUEING NETWORKS;

FORK/JOIN MECHANISMS; PRODUCT-FORM APPROXIMATIONS;

OPERATIONS RESEARCH;

EID: 0033888608     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600885     Document Type: Article

References (18)

1. Baskett F, Chandy KM, Muntz RR and Palacios-Gomez F (1975). Open, closed and mixed networks of queues with different classes of customers. J ACM 22: 248-260.
2. Heidelberger P and Trivedi SK (1983). Analytic queuing models for programs with internal concurrency. IEEE Trans on Comput 32: 73-82.
3. Duda A (1987). Approximate performance analysis of parallel systems. In: Proceedings 2nd International Workshop Appl. Math. And Performance/Reliability Models of Computf Commun. Syst. Rome, Italy.
4. Liu YC and Perros HG (1991). Approximate analysis of a closed fork/join model. Eur J Opl Res 53: 382-392.
5. Liu YC and Perros HG (1991). A decomposition procedure for the analysis of a closed fork/join queuing system. IEEE Trans on Comput 40: 365-370.
6. Baynat B and Dallery Y, (1993). A unified view of product-form approximation techniques for general closed queuing networks. Perform Eval 18: 205-224.
7. Brandwajn A (1985). Equivalence and decomposition in queuing systems: a unified approach. Perfor Eval 5: 175-186.
8. Lazowska ED, Zahoijan J, Graham GS and Sevcik KC (1984). Quantitative System Performance. Prentice Hall: New Jersey. Sauer CH and Chandy KM (1981). Computer Systems Performance Modelling. Prentice-Hall: New Jersey.
9. Marie R (1979). An approximate analytical method for general queuing networks. IEEE Trans on Software Engng 5: 530-538.
10. Baynat B and Dallery Y (1996). A product-form approximation method for general closed queuing networks with several classes of customers. Perform Eval 24: 165-188.
11. Cox DR (1955). A use of complex probabilities in the theory of stochastic processes. Proc Camb Philos Soc 51: 313-319.
12. Avi-Itzhak B and Heyman DP (1973). Approximae queuing models for multiprogramming computer systems. OpnsRes 21: 1212-1230.
13. Gordon WJ and Newell GF (1967). Closed queuing networks with exponential servers. Opns Res 15: 252-267.
14. Marie R, Snyder P and Stewart WJ (1982). Extensions and computational aspects of an iterative method. ACM Sigmetrics11: 186-194.
15. Dallery Y and Cao XR (1992). Operational analysis of closed stochastic queuing networks. Perform Eval 14: 43-61.
16. Philippe B, Saad Y and Stewart WI. Numerical methods in Markov chain modeling. OpnsRes 40: 1156-1179.
17. Baynat B and Dallery Y (1993). Approximate techniques for general closed queuing networks with subnetworks having population constraints. Eur J Opl Res 69: 250-264.
18. Baynat B and Dallery Y (1995). Approximate analysis ofmulti-class synchronized closed queuing networks. International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems. Durham, North Carolina.