The workload in the M/G/1 queue with work removal

Probability in the Engineering and Informational Sciences

Volumn 10, Issue 2, 1996, Pages 261-277

  Boucherie, Richard J ^a   Boxma, Onno J ^b,c  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b CWI   (Netherlands)

^c TILBURG UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SALES; STOCHASTIC SYSTEMS;

ARRIVAL PROCESS; GI/G/1 QUEUE; M/G/1 QUEUE; NEGATIVE CUSTOMERS; NETHERLANDS; POISSON PROCESS; WAITING TIME DISTRIBUTIONS; WORK-LOAD DISTRIBUTION;

QUEUEING THEORY;

EID: 0030533594     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0269964800004320     Document Type: Article

References (22)

1. Asmussen, S. (1987). Applied probability and queues. New York: Wiley.
2. Boucherie, R.J. & van Dijk, N.M. (1994). Local balance in queueing networks with positive and negative customers. Annals of Operations Research 48: 463-492.
3. Boxma, O.J. (1975). The single-server queue with random service output. Journal of Applied Probability 12: 763-778.
4. Brill, P.H. & Posner, M.J.M. (1977). Level crossings in point processes applied to queues: Single-server case. Operations Research 25: 662-674.
5. Chao, X. (1995). Networks of queues with customers, signals and arbitrary service. Operations Research 43: 537-544.
6. Chao, X. & Pinedo, M. (1993). On generalized networks of queues with positive and negative arrivals. Probability in the Engineering and Informational Sciences 7: 301-334.
7. Cohen, J.W. (1977). On up- and downcrossings. Journal of Applied Probability 14: 405-410.
8. Cohen, J.W. (1982). The single server queue. Amsterdam: North-Holland.
9. Cramér, H. (1955). Collective risk theory. Reprinted from the Jubilee Volume of Skandia Insurance Company. Stockholm: Esselte.
10. Gani, J. & Pyke, R. (1960). The content of a dam as the supremum of an infinitely divisible process. Journal of Mathematics and Mechanics 9: 639-651.
11. Gelenbe, E. (1991). Product-form queueing networks with negative and positive customers. Journal of Applied Probability 28: 656-663.
12. Gelenbe, E., Glynn, P., & Sigman, K. (1991). Queues with negative arrivals. Journal of Applied Probability 28: 245-250.
13. Gelenbe, E. & Schassberger, R. (1992). Stability of product form G-networks. Probability in the Engineering and Informational Sciences 6: 271-276.
14. Grinstein, J. & Rubinovitch, M. (1974). Queues with random service output: The case of Poisson arrivals. Journal of Applied Probability 11: 771-784.
15. Harrison, P.G. & Pitel, E. (1993). Sojourn times in single-server queues with negative customers. Journal of Applied Probability 30: 943-963.
16. Harrison, P.G. & Pitel, E. (1994). The M/G/1 queue with negative customers. Research Report, Imperial College, London (to appear in Journal of Applied Probability).
17. Henderson, W. (1993). Queueing networks with negative customers and negative queue lengths. Journal of Applied Probability 30: 931-942.
18. Jain, G. & Sigman, K. (1994). A Pollaczek-Khintchine formulation for M/G/1 queues with disasters. Research Report, Columbia University, New York, July (to appear in Journal of Applied Probability).
19. Jain, G. & Sigman, K. (1995). A generalization of Pollaczek-Khintchine formula to account for negative arrivals. Research Report, Columbia University, New York, August.
20. Prabhu, N.U. (1980). Stochastic storage processes. New York: Springer-Verlag.
21. Rogozin, B.A. (1966). On the distribution of functionals related to boundary problems for processes with independent increments. Theory of Probability and Its Applications 11: 580-591.
22. Wolff, R.W. (1989). Stochastic modeling and the theory of queues. Englewood Cliffs, NJ: Prentice-Hall.