A single-server discrete-time queue with correlated positive and negative customer arrivals

Abstract An MMBP/Geo/1 queue with correlated positive and negative customer arrivals is studied. In the infinite-capacity queueing system, positive customers and negative customers are generated by a Bernoulli bursty source with two correlated geometrically distributed periods. I.e., positive and negative customers arrive to the system according to two different geometrical arrival processes. Under the late arrival scheme (LAS), two removal disciplines caused by negative customers are investigated in the paper. In individual removal scheme, a negative customer removes a positive customer in service if any, while in disaster model, a negative customer removes all positive customers in the system if any. The negative customer arrival has no effect on the system if it finds the system empty. We analyze the Markov chains underlying the queueing systems and evaluate the performance of two systems based on generating functions technique. Some explicit solutions of the system, such as the average buffer content and the stationary probabilities are obtained. Finally, the effect of several parameters on the system performance is shown numerically.

[1]  E. Gelende.  Réseaux stochastiques ouverts avec clients négatifs et positifs, et réseaux neuronaux , 1989 .

[2]  Peng Zhang,et al.  A discrete-time retrial queue with negative customers and unreliable server , 2009, Comput. Ind. Eng..

[3]  Erol Gelenbe,et al.  G-Networks with resets , 2002 .

[4]  Erol Gelenbe,et al.  G-networks with multiple classes of signals and positive customers , 1998, Eur. J. Oper. Res..

[5]  Onno Boxma,et al.  The workload in the M/G/1 queue with work removal , 1995 .

[6]  David E. McDysan,et al.  ATM: Theory and Application , 1994 .

[7]  Hm Park Hyun Min Park,et al.  The Geo/G/1 Queue with Negative Customers and Disasters , 2009 .

[8]  Erol Gelenbe,et al.  Stability of Product Form G-Networks , 1992 .

[9]  Erol Gelenbe,et al.  Random Neural Networks with Negative and Positive Signals and Product Form Solution , 1989, Neural Computation.

[10]  Tien Van Do,et al.  An initiative for a classified bibliography on G-networks , 2011, Perform. Evaluation.

[11]  Jinting Wang,et al.  A single-server discrete-time retrial G-queue with server breakdowns and repairs , 2009 .

[12]  Fariborz Jolai,et al.  Performance estimation of an email contact center by a finite source discrete time Geo/Geo/1 queue with disasters , 2008, Comput. Ind. Eng..

[13]  Erol Gelenbe.  G-Networks with Signals and Batch Removal , 1993 .

[14]  Erol Gelenbe,et al.  Analysis and Synthesis of Computer Systems , 1980 .

[15]  E. Gelenbe.  G-networks by triggered customer movement , 1993 .

[16]  Wenhui Zhou,et al.  Discrete-time queue with Bernoulli bursty source arrival and generally distributed service times , 2008 .

[17]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[18]  Ivan Atencia,et al.  A single-server G-queue in discrete-time with geometrical arrival and service process , 2005, Perform. Evaluation.

[19]  Erol Gelenbe,et al.  Flow equivalence and stochastic equivalence in G-networks , 2004, Comput. Manag. Sci..

[20]  Erol Gelenbe,et al.  Learning in the multiple class random neural network , 2002, IEEE Trans. Neural Networks.

[21]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[22]  Erol Gelenbe,et al.  Steps toward self-aware networks , 2009, CACM.

[23]  Erol Gelenbe,et al.  G-networks: a unifying model for neural and queueing networks , 1993, MASCOTS.

[24]  Wen-Hui Zhou,et al.  Performance analysis of discrete-time queue GI/G/1 with negative arrivals , 2005, Appl. Math. Comput..

[25]  Ivan Atencia,et al.  The discrete-time Geo/Geo/1 queue with negative customers and disasters , 2004, Comput. Oper. Res..

[26]  J.R. Artalejo,et al.  G-networks: A versatile approach for work removal in queueing networks , 2000, Eur. J. Oper. Res..

[27]  Herwig Bruneel,et al.  Discrete-time queues with correlated arrivals and constant service times , 1999, Comput. Oper. Res..

[28]  Jeffrey J. Hunter,et al.  Mathematical techniques of applied probability , 1985 .

[29]  Michael Pinedo,et al.  Queueing networks - customers, signals and product form solutions , 1999, Wiley-Interscience series in systems and optimization.

[30]  Erol Gelenbe,et al.  Learning in the Recurrent Random Neural Network , 1992, Neural Computation.

[31]  Erol Gelenbe.  Self-Aware Networks , 2011, 2011 IEEE Fifth International Conference on Self-Adaptive and Self-Organizing Systems.

[32]  Erol Gelenbe,et al.  G-Networks with Multiple Classes of Negative and Positive Customers , 1996, Theor. Comput. Sci..