On a tandem G-network with blocking

Advances in Applied Probability

Volumn 34, Issue 3, 2002, Pages 626-661

  Gómez Corral, Antonio ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Disaster; Markov renewal theory; Markovian arrival process; Negative arrival; Phase type distribution; Tandem queue

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER NETWORKS; MARKOV PROCESSES; PROBABILITY;

TANDEM QUEUES;

CASCADE CONNECTIONS;

EID: 0036754651     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1033662169     Document Type: Article

References (69)

1. Artalejo, J.R. (2000). G-networks: A versatile approach for work removal in queueing networks. Europ. J. Operat. Res. 126, 233-249.
2. Artalejo, J.R. and Gómez-Corral, A. (1998). Analysis of a stochastic clearing system with repeated attempts. Commun. Statist. Stoch. Models 14, 623-645.
3. Artalejo, J.R. and Gómez-Corral, A. (1999). Computation of the limiting distribution in queueing systems with repeated attempts and disasters. RAIRO Operat. Res. 33, 371-382.
4. Artalejo, J.R. and Gómez-Corral, A. (1999). On a single server queue with negative arrivals and request repeated. J. Appl. Prob. 36, 907-918.
5. Asmussen, S. and Koole, G. (1993). Marked point processes as limits of Markovian arrival streams. J. Appl. Prob. 30, 365-372.
6. Avi-Itzhak, B. and Halfin, S. (1993). Servers in tandem with communication and manufacturing blocking. J. Appl. Prob. 30, 429-437.
7. Avi-Itzhak, B. and Yadin, M. (1965). A sequence of two servers with no intermediate queue. Manag. Sci. 11, 553-564.
8. Balsamo, S., de Nitto Personé, V. and Onvural, R. (2001). Analysis of Queueing Networks with Blocking. Kluwer, Boston.
9. Bayer, N. and Boxma, O.J. (1996). Wiener-Hopf analysis of an M/G/1 queue with negative customers and of a related class of random walks. Queueing Systems 23, 301-316.
10. Bellman, R. (1960). Introduction to Matrix Analysis. McGraw-Hill, New York.
11. Boucherie, R.J. and Boxma, O.J. (1996). The workload in the M/G/1 queue with work removal. Prob. Eng. Inf. Sci. 10, 261-277.
12. Boucherie, R.J. and Van Dijk, N.M. (1994). Local balance in queueing networks with positive and negative customers. Ann. Operat. Res. 48, 463-492.
13. Boucherie, R.J., Boxma, O.J. and Sigman, K. (1997). A note on negative customers, GI/G/1 workload and risk processes. Prob. Eng. Inf. Sci. 11, 305-311.
14. Brockwell, P.J. (1986). The extinction time of a general birth and death process with catastrophes. J. Appl. Prob. 23, 851-858.
15. Brockwell, P.J., Gani, J. and Resnick, S.I. (1982). Birth, immigration and catastrophe processes. Adv. Appl. Prob. 14, 709-731.
16. Chao, X. (1995). A queueing network model with catastrophes and product form solution. Operat. Res. Lett. 18, 75-79.
17. Chao, X. (1995). Networks of queues with customers, signals and arbitrary service time distributions. Operat. Res. 43, 537-544.
18. Chao, X. and Pinedo, M. (1995). Networks of queues with batch services, signals and product form solutions. Operat. Res. Lett. 17, 237-242.
19. Chao, X., Miyazawa, M. and Pinedo, M. (1999). Queueing Networks: Customers, Signals and Product Form Solutions. John Wiley, Chichester.
20. Chen, A. and Renshaw, E. (1997). The M/M/1 queue with mass exodus and mass arrivals when empty. J. Appl. Prob. 34, 192-207.
21. Çinlar, E. (1975). Introduction to Stochastic Processes. Prentice Hall, Englewood Cliffs, NJ.
22. Dudin, A.N. and Klimenok, V.I. (1998). Multi-dimensional quasitoeplitz Markov chains. J. Appl. Math. Stoch. Anal. 12, 393-415.
23. Dudin, A.N. and Nishimura, S. (1999). A BMAP/SM/1 queueing system with Markovian arrival input and disasters. J. Appl. Prob. 36, 868-881.
24. Foster, F.G. and Perros, H.G. (1980). On the blocking process in queue networks. Europ. J. Operat. Res. 5, 276-283.
25. Fourneau, J.M., Gelenbe, E. and Suros, R. (1996). G-networks with multiple classes of negative and positive customers. Theoret. Comput. Sci. 155, 141-156.
26. Gail, H.R., Hantler, S.L. and Taylor, B.A. (1996). Spectral analysis of M/G/1 and G/M/1 type Markov chains. Adv. Appl. Prob. 28, 114-165.
27. Gantmacher, F.R. (1959). Applications of the Theory of Matrices. Interscience, New York.
28. Gelenbe, E. (1989). Random neural networks with negative and positive signals and product form solution. Neural Comput. 1, 502-510.
29. Gelenbe, E. (1989). Réseaux stochastiques ouverts avec clients négatifs et positifs, et réseaux neuronaux. C.R. Acad. Sci. Paris II 309, 979-982.
30. Gelenbe, E. (1991). Product-form queueing networks with negative and positive customers. J. Appl. Prob. 28, 656-663.
31. Gelenbe, E. (1993). G-networks with signals and batch removal. Prob. Eng. Inf. Sci. 7, 335-342.
32. Gelenbe, E. (1993). G-networks with triggered customer movement. J. Appl. Prob. 30, 742-748.
33. Gelenbe, E. (1994). G-networks: a unifying model for neural and queueing networks. Ann. Operat. Res. 48, 433-461.
34. Gelenbe, E. and Schassberger, R. (1992). Stability of G-networks. Prob. Eng. Inf. Sci. 6, 271-276.
35. Gelenbe, E., Glynn, P. and Sigman, K. (1991). Queues with negative arrivals. J. Appl. Prob. 28, 245-250.
36. Gómez-Corral, A. (2002). A tandem queue with blocking and Markovian arrival process. Queueing Systems 41, 343-370.
37. Graham, A. (1981). Kronecker Products and Matrix Calculus: with Applications. Ellis Horwood, Chichester.
38. Grassmann, W.K. and Drekic, S. (2000). An analytical solution for a tandem queue with blocking. Queueing Systems 36, 221-235.
39. Gripenberg, G. (1983). A stationary distribution for the growth of a population subject to random catastrophes. J. Math. Biol. 17, 371-379.
40. Hall, N.G. and Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operat. Res. 44, 510-525.
41. Harrison, P.G. and Pitel, E. (1993). Sojourn times in single-server queues with negative customers. J. Appl. Prob. 30, 943-963.
42. Harrison, P.G. and Pitel, E. (1995). Response time distributions in tandem G-networks. J. Appl. Prob. 32, 224-246.
43. Harrison, P.G. and Pitel, E. (1996). The M/G/1 queue with negative customers. Adv. Appl. Prob. 28, 540-566.
44. Henderson, W. (1993). Queueing networks with negative customers and negative queue lengths. J. Appl. Prob. 30, 931-942.
45. Henderson, W., Northcote, B.S. and Taylor, P.G. (1994). Geometric equilibrium distributions for queues with interactive batch departures. Ann. Operat. Res. 48, 493-511.
46. Henderson, W., Northcote, B.S. and Taylor, P.G. (1994). State-dependent signalling in queueing networks. Adv. Appl. Prob. 26, 436-455.
47. IMSL, Inc. (1989). IMSL Math/Library User's Manual. FORTRAN Subroutines for Mathematical Applications. IMSL, Houston.
48. Jain, G. and Sigman, K. (1996). A Pollaczek-Khintchine formula for M/G/1 queues with disasters. J. Appl. Prob. 33, 1191-1200.
49. Jain, G. and Sigman, K. (1996). Generalizing the Pollaczek-Khintchine formula to account for arbitrary work removal. Prob. Eng. Inf. Sci. 10, 519-531.
50. Karlin, S. and Tavaré, S. (1982). Linear birth and death processes with killing. J. Appl. Prob. 19, 477-487.
51. Langaris, C. (1986). The waiting-time process of a queueing system with gamma-type input and blocking. J. Appl. Prob. 23, 166-174.
52. Langaris, C. and Conolly, B. (1985). Three stage tandem queue with blocking. Europ. J. Operat. Res. 19, 222-232.
53. Latouche, G. and Ramaswami, V. (1999). Introduction to Matrix Analytic Methods in Stochastic Modeling. ASA-SIAM, Philadelphia.
54. Lucantoni, D.M. (1991). New results on the single server queue with a batch Markovian arrival process. Commun. Statist. Stoch. Models 7, 1-46.
55. Lucantoni, D.M., Meier-Hellstern, K.S. and Neuts, M.F. (1990). A single-server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Prob. 22, 676-705.
56. Müller, D.E. (1965). A method for solving algebraic equations using an automatic computer. Math. Tables Aids Comput. 10, 208-215.
57. Neuts, M.F. (1979). A versatile Markovian point process. J. Appl. Prob. 16, 764-779.
58. Neuts, M.F. (1981). Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore.
59. Neuts, M.F. (1989). Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker, New York.
60. Perros, H.G. (1984). Queueing networks with blocking: a bibliography. SIGMETRICS Perf. Eval. Rev. 12, No. 2, 8-12.
61. Perros, H.G. (1989). A bibliography of papers on queueing networks with finite capacity queues. Perf. Eval. 10, 255-260.
62. Perros, H.G. (1994). Queueing Networks with Blocking. Oxford University Press.
63. Prabhu, N.U. (1967). Transient behaviour of a tandem queue. Manag. Sci. 13, 631-639.
64. Press, W.H., Teukolsky, S.A., Vetterling, W.T. and Flannery, B.P. (1992). Numerical Recipes in FORTRAN: The Art of Scientific Computing. Cambridge University Press.
65. Serfozo, R. and Stidham, S. Jr. (1978). Semi-stationary clearing processes. Stoch. Process. Appl. 6, 165-178.
66. Stidham, S. Jr. (1974). Stochastic clearing systems. Stoch. Process. Appl. 2, 85-113.
67. Suzuki, T. (1964). On a tandem queue with blocking. J. Operat. Res. Soc. Japan 6, 137-157.
68. Whitt, W. (1981). The stationary distribution of a stochastic cleating process. Operat. Res. 29, 294-308.
69. Zhu, Y. (1994). Tandem queue with group arrivals and no intermediate buffer. Queueing Systems 17, 403-412.