A discrete-time system with service control and repairs

Abstract This paper discusses a discrete-time queueing system with starting failures in which an arriving customer follows three different strategies. Two of them correspond to the LCFS (Last Come First Served) discipline, in which displacements or expulsions of customers occur. The third strategy acts as a signal, that is, it becomes a negative customer. Also examined is the possibility of failures at each service commencement epoch. We carry out a thorough study of the model, deriving analytical results for the stationary distribution. We obtain the generating functions of the number of customers in the queue and in the system. The generating functions of the busy period as well as the sojourn times of a customer at the server, in the queue and in the system, are also provided. We present the main performance measures of the model. The versatility of this model allows us to mention several special cases of interest. Finally, we prove the convergence to the continuous-time counterpart and give some numerical results that show the behavior of some performance measures with respect to the most significant parameters of the system

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

[2]  D. Kendall.  Some Problems in the Theory of Queues , 1951 .

[3]  Dieter Fiems,et al.  Stability analysis of multiserver discrete-time queueing systems with renewal-type server interruptions , 2011, Perform. Evaluation.

[4]  Ivan Atencia,et al.  A Discrete-Time Queueing System With Different Types Of Displacement , 2013, ECMS.

[5]  B. Krishna Kumar,et al.  The M/G/1 retrial queue with feedback and starting failures , 2002 .

[6]  D. Kendall.  Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain , 1953 .

[7]  Annunziata Cascone,et al.  Geom/G/1/n system with LIFO discipline without interrupts and constrained total amount of customers , 2011 .

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

[9]  Walenty Oniszczuk,et al.  Semi-Markov-Based Approach for the Analysis of Open Tandem Networks with Blocking and Truncation , 2009, Int. J. Appl. Math. Comput. Sci..

[10]  Dieter Fiems,et al.  Randomly Interrupted GI-G-1 Queues: Service Strategies and Stability Issues , 2002, Ann. Oper. Res..

[11]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[12]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .

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

[14]  Jesus R. Artalejo,et al.  On the single server retrial queue subject to breakdowns , 1998, Queueing Syst. Theory Appl..

[15]  Annie Gravey,et al.  Simultaneity in Discrete-Time Single Server Queues with Bernoulli Inputs , 1992, Perform. Evaluation.

[16]  Hui Li,et al.  On the steady-state queue size distribution of the discrete-timeGeo/G/1 queue with repeated customers , 1995, Queueing Syst. Theory Appl..

[17]  Peter G. Harrison,et al.  Reliability modelling using G-queues , 2000, Eur. J. Oper. Res..

[18]  T. Meisling.  Discrete-Time Queuing Theory , 1958 .

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

[20]  Vidyadhar G. Kulkarni,et al.  Retrial queues with server subject to breakdowns and repairs , 1990, Queueing Syst. Theory Appl..

[21]  L. Christie,et al.  Queuing with Preemptive Priorities or with Breakdown , 1958 .

[22]  Xiuli Chao,et al.  Queueing networks , 1999 .

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

[24]  P K Pramod,et al.  On queues with interruptions and repeat or resumption of service , 2009 .

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

[26]  Jesús R. Artalejo,et al.  New results in retrial queueing systems with breakdown of the servers , 1994 .

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

[28]  Hui Li,et al.  TheM/G/1 retrial queue with the server subject to starting failures , 1994, Queueing Syst. Theory Appl..

[29]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[30]  E. T. S. Ingenieŕıa.  Discrete-Time Queueing System with Expulsions , 2012 .

[31]  Jan Werewka,et al.  Minimization of the total completion time for asynchronous transmission in a packet data-transmission system , 2010, Int. J. Appl. Math. Comput. Sci..

[32]  DU Zhen-bin.  The discrete-time Geo/Geo/1 queue with negative customers and disasters , 2006 .

[33]  Attahiru Sule Alfa,et al.  Queueing Theory for Telecommunications - Discrete Time Modelling of a Single Node System , 2010 .

[34]  Dieter Fiems,et al.  Discrete-time queues with generally distributed service times and renewal-type server interruptions , 2004, Perform. Evaluation.

[35]  Herwig Bruneel,et al.  System delay versus system content for discrete-time queueing systems subject to server interruptions , 2006, Eur. J. Oper. Res..

[36]  Ivan Atencia,et al.  A discrete-time queueing system with optional LCFS discipline , 2013, Ann. Oper. Res..