G-networks: A versatile approach for work removal in queueing networks

European Journal of Operational Research

Volumn 126, Issue 2, 2000, Pages 233-249

  Artalejo, J R ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CLIENT SERVER COMPUTER SYSTEMS; COMPUTER SYSTEMS PROGRAMMING; MATHEMATICAL MODELS; RESPONSE TIME (COMPUTER SYSTEMS);

GENERALIZED NETWORKS (G-NETWORKS); NEGATIVE CUSTOMERS; POSITIVE CUSTOMERS; PRODUCT FORM; SINGLE NODE QUEUES; WORK REMOVAL;

QUEUEING NETWORKS;

EID: 0034675407     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00476-2     Document Type: Article

References (60)

1. J.R. Artalejo, Retrial queues with negative arrivals, in: Proceedings of International Conference on Stochastic Processes, Cochin, 1996, pp. 159-168.
2. J.R. Artalejo, A. Gomez-Corral, Stochastic analysis of the departure and quasi-input processes in a versatile single-server queue, Journal of Applied Mathematics and Stochastic Analysis 9 (1996) 171-183.
3. J.R. Artalejo, A. Gomez-Corral, Generalized birth and death processes with applications to queues with repeated attempts and negative arrivals, OR Spektrum 20 (1998) 5-14.
4. J.R. Artalejo, A. Gomez-Corral, Analysis of a stochastic clearing system with repeated attempts, Stochastic Models 14 (1998) 623-645.
5. J.R. Artalejo, A. Gomez-Corral, On a single server queue with negative arrivals and request repeated, Journal of Applied Probability, to appear.
6. J.R. Artalejo, A. Gomez-Corral, Performance analysis of a single-server queue with repeated attempts, Mathematical and Computer Modelling 30 (1999) 79-88.
7. J.R. Artalejo, A. Gomez-Corral, Computation of the limiting distribution in queueing systems with repeated attempts and disasters, RAIRO Operations Research 33 (1999) 371-382.
8. N. Bayer, O.J. Boxma, Wiener-Hopf analysis of an M/G/1 queue with negative customers and of a related class of random walks, Queueing Systems 23 (1996) 301-316.
9. R.J. Boucherie, Product form in queueing networks, PhD Thesis, Free University, Amsterdam, 1992.
10. R.J. Boucherie, O.J. Boxma, The workload in the M/G/1 queue with work removal, Probability in the Engineering and Informational Sciences 10 (1996) 261-277.
11. R.J. Boucherie, O.J. Boxma, K. Sigman, A note on negative customers, GI/G/1 workload and risk processes, Probability in the Engineering and Informational Sciences 11 (1997) 305-311.
12. R.J. Boucherie, N.M. van Dijk, Local balance in queueing networks with positive and negative customers, Annals of Operations Research 48 (1994) 463-492.
13. X. Chao, A note on queueing networks with signals and random triggering times, Probability in the Engineering and Informational Sciences 8 (1994) 213-219.
14. X. Chao, Networks of queues with customers, signals and arbitrary service time distributions, Operations Research 43 (1995) 537-550.
15. X. Chao, A queueing network model with catastrophes and product form solution, Operations Research Letters 18 (1995) 75-79.
16. X. Chao, M. Miyazawa, R.F. Serfozo, H. Takada, Markov network processes with product form stationary distributions, Queueing Systems 28 (1998) 377-401.
17. X. Chao, M. Pinedo, On generalized networks of queues with positive and negative arrivals, Probability in the Engineering and Informational Sciences 7 (1993) 301-334.
18. X. Chao, M. Pinedo, Networks of queues with batch services signals and product form solutions, Operations Research Letters 17 (1995) 237-242.
19. X. Chao, M. Pinedo, On queueing networks with signals and history-dependent routing, Probability in the Engineering and Informational Sciences 9 (1995) 341-354.
20. X. Chao, S. Zheng, A result on networks of queues with customer coalescence and state-dependent signalling, Journal of Applied Probability 35 (1998) 151-164.
21. A. Chen, E. Renshaw, The M/M/1 queue with mass exodus and mass arrivals when empty, Journal of Applied Probability 34 (1997) 192-207.
22. A.N. Dudin, S. Nishimura, Embedded stationary distribution for the BMAP/SM/1/N queue with disasters, in: Queues: Flows, Systems, Networks, Byelorussian State University, Minsk, 1998.
23. J.M. Fourneau, Computing the steady-state distribution of networks with positive and negative customers, in: Proceedings of 13th IMACS World Congress on Computation and Applied Mathematics, Dublin, 1991.
24. J.M. Fourneau, E. Gelenbe, G-networks with multiple classes of signals, in: Proceedings of ORSA Computer Science Technical Committee Conference, Williamsburg, VA, Pergamon Press, New York, 1992.
25. J.M. Fourneau, E. Gelenbe, R. Suros, G-networks with multiple classes of negative and positive customers, Theoretical Computer Science 155 (1996) 141-156.
26. E. Gelenbe, Réseaux stochastiques ouverts avec clients négatifs et positifs, et réseaux neuronaux, Comptes Rendus de l'Académie des Sciences 309, Série II, 1989, pp. 979-982.
27. E. Gelenbe, Random neural networks with negative and positive signals and product form solution, Neural Computation 1 (1989) 502-510.
28. E. Gelenbe, Réseaux neuronaux et aléatoires stables, Comptes Rendus de l'Académie des Sciences 310, Série II, 1990, pp. 177-180.
29. E. Gelenbe, Stability of the random neural network model, Neural Computation 2 (1990) 239-247.
30. E. Gelenbe, Product-form queueing networks with negative and positive customers, Journal of Applied Probability 28 (1991) 656-663.
31. E. Gelenbe, Une généralisation probabiliste du problème SAT, Comptes Rendus de l'Académie des Sciences 313, Série II, 1992, pp. 339-342.
32. E. Gelenbe, G-networks with triggered customer movement, Journal of Applied Probability 30 (1993) 742-748.
33. E. Gelenbe, Learning in the recurrent random neural network, Neural Computation 5 (1993) 154-164.
34. E. Gelenbe, G-networks with signals and batch removal, Probability in the Engineering and Informational Sciences 7 (1993) 335-342.
35. E. Gelenbe, G-networks: A unifying model for neural and queueing networks, Annals of Operations Research 48 (1994) 433-461.
36. E. Gelenbe, P. Glynn, K. Sigman, Queues with negative arrivals, Journal of Applied Probability 28 (1991) 245-250.
37. E. Gelenbe, V. Koubi, F. Pekergin, Dynamical random neural approach to the traveling salesman problem, Elektrik 2 (1994) 1-10.
38. E. Gelenbe, A. Labed, G-networks with multiple classes of signals and positive customers, European Journal of Operational Research 108 (1998) 293-305.
39. E. Gelenbe, R. Schassberger, Stability of G-networks, Probability in the Engineering and Informational Sciences 6 (1992) 271-276.
40. A. Ghanwani, Neural and delay based heuristics for the Steiner problem in networks, European Journal of Operational Research 108 (1998) 241-265.
41. A. Gomez-Corral, Retrial queues with negative customers, PhD Thesis, Statistics and Operations Research, Universidad Complutense de Madrid, 1996 (in Spanish).
42. A. Gomez-Corral, On single-server queues governed by a clearing mechanism and a secondary input of repeated attempts, in: Proceedings of International Conference on Stochastic Processes, Cochin, 1996, pp. 169-180.
43. P.G. Harrison, E. Pitel, Sojourn times in single-server queues with negative customers, Journal of Applied Probability 30 (1993) 943-963.
44. P.G. Harrison, E. Pitel, Response time distributions in tandem G-networks, Journal of Applied Probability 32 (1995) 224-246.
45. P.G. Harrison, E. Pitel, The M/G/1 queue with negative customers, Advances in Applied Probability 28 (1996) 540-566.
46. W. Henderson, Queueing networks with negative customers and negative queue lengths, Journal of Applied Probability 30 (1993) 931-942.
47. W. Henderson, B.S. Northcote, P.G. Taylor, State-dependent signalling in queueing networks, Advances in Applied Probability 26 (1994) 436-455.
48. W. Henderson, B.S. Northcote, P.G. Taylor, Geometric equilibrium distributions for queues with interactive batch departures, Annals of Operations Research 48 (1994) 493-511.
49. G. Jain, A rate conservation analysis of queues and networks with work removal, PhD Dissertation, Industrial Engineering and Operations Research, Columbia University, 1996.
50. G. Jain, K. Sigman, A Pollaczek-Khintchine formula for M/G/1 queues with disasters, Journal of Applied Probability 33 (1996) 1191-1200.
51. G. Jain, K. Sigman, Generalizing the Pollaczek-Khintchine formula to account for arbitrary work removal, Probability in the Engineering and Informational Sciences 10 (1996) 519-531.
52. K. Kim, A.F. Seila, A generalized cost model for stochastic clearing systems, Computers and Operations Research 20 (1993) 67-82.
53. M. Miyazawa, Insensitivity and product-form decomposibility of reallocatable GSMP, Advances in Applied Probability 25 (1993) 415-437.
54. B.S. Northcote, Signalling in product form queueing networks, PhD Thesis, University of Adelaide, 1993.
55. E. Pitel, Queues with negative customers, PhD Thesis, Imperial College, London, 1994.
56. R. Serfozo, S. Stidham, Semi-stationary clearing systems, Stochastic Processes and their Applications 6 (1978) 165-178.
57. Y.W. Shin, Sojourn time distributions for M/M/c G-queue, Communications of the Korean Mathematical Society 13 (1998) 405-434.
58. S. Stidham, Cost models for stochastic clearing systems, Operations Research 25 (1977) 100-127.
59. D. Towsley, S.K. Tripathi, A single server priority queue with server failures and queue flushing, Operations Research Letters 10 (1991) 353-362.
60. X. Chao, M. Miyazawa, M. Pinedo, Queueing Networks: Customers, Signals and Product Form Solutions, Wiley, Chichester, 1999.