A single-server G-queue in discrete-time with geometrical arrival and service process

Performance Evaluation

Volumn 59, Issue 1, 2005, Pages 85-97

  Atencia, Ivan ^a   Moreno, Pilar ^b  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b Universidad Pablo de Olavide   (Spain)

Author keywords

Discrete time queue; Negative customers; RCH and RCE inimmune and immune servicing killing policies

Indexed keywords

ASYNCHRONOUS TRANSFER MODE; COMPUTATIONAL GEOMETRY; CUSTOMER SATISFACTION; DISCRETE TIME CONTROL SYSTEMS; PARAMETER ESTIMATION; QUEUEING NETWORKS; SERVERS; TELECOMMUNICATION NETWORKS;

CONTROL MECHANISM; DISCRETE-TIME QUEUE; NEGATIVE CUSTOMERS; RCH AND RCE-INIMMUNE AND IMMUNE SERVICING KILLING POLICIES;

TELECOMMUNICATION SERVICES;

EID: 9544252953     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2004.07.019     Document Type: Article

References (31)

1. J.R. Artalejo, G-networks: A versatile approach for work removal in queueing networks, Eur. J. Oper. Res. 126 (2000) 233-249.
2. I. Atencia, P. Moreno, The discrete-time Geo/ Geo/1 queue with negative customers and disasters, Comput. Oper. Res. 31 (2004) 1537-1548.
3. H. Bruneel, B.G. Kim, Discrete-time Models for Communication Systems Including ATM, Kluwer Academic Publishers, Boston, 1993.
4. R. Chakka, P.O. Harrison, A Markov modulated multi-server queue with negative customers-the MMCPP/GE/c/L G-queue, Acta Inform. 37 (2001) 881-919.
5. C.E. Cramer, E. Gelenbe, Video quality and traffic QoS in learning-based sub-sampled and receiver-interpolated video sequences, IEEE J. Selected Areas Commun. 18 (2000) 150-167.
6. C. Cramer, E. Gelenbe, H. Bakircioglu, Low bit-rate video compression with neural networks and temporal subsampling, Proc. IEEE 84 (1996) 1529-1543.
7. J.M. Fourneau, E. Gelenbe, R. Suros, G-networks with multiple classes of negative and positive customers, Theor. Comput. Sci. 155(1996)141-156.
8. E. Gelenbe, Réseaux stochastiques ouverts avec clients négatifs et positifs, et réseaux neuronaux, Comptes-Rendus Acad. Sciences de Paris Série II 309 (1989) 979-982.
9. E. Gelenbe, Random neural networks with negative and positive signals and product form solution, Neural Comput. 1 (1989) 502-510.
10. E. Gelenbe, Product-form queueing networks with negative and positive customers, J. Appl. Prob. 28 (1991) 656-663.
11. E. Gelenbe, G-networks with signals and batch removal, Prob. Eng. Inform. Sci. 7 (1993) 335-342.
12. E. Gelenbe, G-networks with triggered customer movement, J. Appl. Prob. 30 (1993) 742-748.
13. E. Gelenbe, Learning in the recurrent random neural network, Neural Comput. 5 (1993) 154-164.
14. E. Gelenbe, G-networks: a unifying model for neural and queueing networks, Ann. Oper. Res. 48 (1994) 433-461.
15. E. Gelenbe, The first decade of G-networks, Eur. J. Oper. Res. 126 (2000) 231-232.
16. E. Gelenbe, C. Cramer, M. Sungur, P. Gelenbe, Traffic and video quality in adaptive neural compression, Multimedia Syst. 4 (1996) 357-369.
17. E. Gelenbe, Y. Feng, K.R.R. Krishnan, Neural network methods for volumetric magnetic resonance imaging of the human brain, Proc. IEEE 84 (1996) 1488-1496.
18. E. Gelenbe, J.M. Fourneau, G-networks with resets, Perform. Eval. 49 (2002) 179-191.
19. E. Gelenbe, P. Glynn, K. Sigman, Queues with negative arrivals, J. Appl. Prob. 28 (1991) 245-250.
20. E. Gelenbe, K.F. Hussain, Learning in the multiple class random neural network, IEEE Trans. Neural Netw. 13 (2002) 1257-1267.
21. E. Gelenbe, T. Kocak, Area-based results for mine detection, IEEE Trans. Geosci. Remote Sens. 38 (2000) 12-24.
22. E. Gelenbe, A. Labed, G-networks with multiple classes of signals and positive customers, Eur. J. Oper. Res. 108 (1998) 293-305.
23. E. Gelenbe, M. Schassberger, Stability of product form G-networks, Prob. Eng. Inform. Sci. 6 (1992) 271-276.
24. E. Gelenbe, E. Seref, Z. Xu, Simulation with learning agents, Proc. IEEE 89 (2001) 148-157.
25. E. Gelenbe, H. Shachnai, On G-networks and resource allocation in multimedia systems, Eur. J. Oper. Res. 126 (2000) 308-318.
26. A. Gravey, G. Hébuteme, Simultaneity in discrete-time single server queues with Bernoulli inputs, Perform. Eval. 14 (1992) 123-131.
27. P.G. Harrison, E. Pitel, Sojourn times in single-server queues with negative customers, J. Appl. Prob. 30 (1993) 943-963.
28. P.G. Harrison, E. Pitel, The M/G/l queue with negative customers, Adv. Appl. Prob. 28 (1996) 540-566.
29. J.J. Hunter, Mathematical Techniques of Applied Probability, vol. 2, Discrete-time Models: Techniques and Applications, Academic Press, New York, 1983.
30. H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, vol. 3, Discrete-time Systems, North-Holland, Amsterdam, 1993.
31. M.E. Woodward, Communication and Computer Networks: Modelling with Discrete-time Queues, IEEE Computer Society Press, Silverspring, MD, 1994.