Multiple class G-networks with list-oriented deletions

European Journal of Operational Research

Volumn 126, Issue 2, 2000, Pages 250-272

  Fourneau, J M ^a   Kloul, L ^a   Verchere D ^a  

^a UNIVERSITY OF VERSAILLES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SYSTEMS PROGRAMMING; ITERATIVE METHODS; MATHEMATICAL MODELS; PROBABILITY; PROGRAM PROCESSORS; RESPONSE TIME (COMPUTER SYSTEMS);

FIRST-IN-FIRST-OUT (FIFO) SERVICES; GENERALIZED NETWORKS (G-NETWORKS); LAST-IN-FIRST-OUT (LIFO) SERVICES; LIST-ORIENTED DELETION; MULTIPLE CUSTOMER CLASSES; PRODUCT FORM SOLUTIONS; SERVICE STATION LISTS;

QUEUEING NETWORKS;

EID: 0034675402     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00477-4     Document Type: Article

References (22)

1. F. Baskett, K.M. Chandy, R.R. Muntz, F.G. Palacios, Open, closed and mixed networks of queues with different classes of customers, Journal of ACM 22 (2) (1975) 248-260.
2. X. Chao, Networks of queues with customers signals and arbitrary service time distributions, Operations Research 43 (3) (1995) 537-544.
3. X. Chao, A queueing network model with catastrophes and product form solution, Operations Research Letters 18 (2) (1995) 75-79.
4. X. Chao, M. Pinedo, D. Shaw, Networks of queues with batch services and customer coalescence, Journal of Applied Probability 33 (1996) 858-869.
5. J.M. Fourneau, L. Kloul, F. Quessette, Multiclass G-networks with jumps back to zero, in: Mascots'95, Durham, NC, USA, March 1995.
6. J.M. Fourneau, L. Kloul, F. Quessette, Multiple class G-networks with iterated deletions, Performance Evaluation Journal, to be published.
7. J.M. Fourneau, E. Gelenbe, R. Suros, G-networks with multiple classes of negative and positive customers, Theoretical Computer Science 155 (1996) 141-156.
8. J.M. Fourneau, D. Verchère, Réseaux généralisés multiclasses avec synchronisations cycliques, RAIRO Recherche Opérationnelle, submitted.
9. C.D. Garcia, W.I. Zangwill, Pathways to Solutions Fixed Points and Equilibria, Prentice-Hall, Englewood Cliffs, NJ, 1981.
10. E. Gelenbe, Stable random neural network, Neural Computation 2 (2) (1990) 239-247.
11. E. Gelenbe, Réseaux neuronaux aléatoires stables, CRA Sci. T.310, Série II (1990) 177-180.
12. E. Gelenbe, Product form queueing networks with negative and positive customers, Journal of Applied Probability 28 (1991) 656-663.
13. E. Gelenbe, Une généralisation probabiliste du problème SAT, CRA Sci. T.313, Série II (1992) 339-342.
14. E. Gelenbe, G-networks with triggered customer movements, Journal of Applied Probability 30 (1993) 742-748.
15. E. Gelenbe, G-networks with signals and batch removal, Probability in Engineering and Informational Sciences 7 (1993) 335-342.
16. E. Gelenbe, G-networks: An unifying model for queueing networks and neural networks, Annals of Operations Research 40 (1-4) (1994) 433-461.
17. E. Gelenbe, P. Glynn, K. Sigmann, Queues with negative arrivals, Journal of Applied Probability 28 (1991) 245-250.
18. E. Gelenbe, A. Stafylopatis, Global behavior of homogeneous random neural systems, Applied Mathematical Modelling 15 (1991) 534-541.
19. E. Gelenbe, A. Labed, G-networks with multiple classes of signals and positive customers, European Journal of Operational Research 108 (1998) 293-305.
20. E. Gelenbe, R. Schassberger, Stability of product form G-networks, Probability in the Engineering and Informational Sciences 6 (1992) 271-276.
21. R.F. Serfozo, B. Yang, Markov network processes with string transitions, Personal Communication, April 1996.
22. D. Verchère, Méthodes analytiques d'évaluation de performance de systèmes informatiques, PhD Thesis, Université de Paris VI, June 1997.