An queue with close-down and vacation times.
An M/G/1 queueing system with compulsory server vacations.
This paper deals with a single server queue with compulsory server vacations. There are single Poisson arrivals with mean arrival date λ and the service is performed in batches of fixed size M (≥1) or min (n, M) and the service times of successive batches follow a general distribution with the density function D(x). The Laplace transforms of the probability generating functions of different states of the system have been obtained, the corresponding steady state results have been derived and in a...
An MX/G/1 unreliable retrial queue with two phase service and persistence behaviour of customers in service
This paper describes an unreliable server batch arrival retrial queue with two types of repair and second optional service. The server provides preliminary first essential service (FES) to the primary arriving customers or customers from retrial group. On successful completion of FES, the customer may opt for second optional service (SOS) with probability α. The server is subject to active break downs. The customer under FES (or SOS) during the failure decides, with probability q, to join the orbit(impatientcustomer)...
An SMDP model for a multiclass multi-server queueing control problem considering conversion times
We address a queueing control problem considering service times and conversion times following normal distributions. We formulate the multi-server queueing control problem by constructing a semi-Markov decision process (SMDP) model. The mechanism of state transitions is developed through mathematical derivation of the transition probabilities and transition times. We also study the property of the queueing control system and show that optimizing the objective function of the addressed queueing control...
Analysis of a bulk queue with unreliable server and single vacation.
Analysis of a MX/G(a,b)/1 queueing system with vacation interruption
In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary job is interrupted abruptly and the server resumes for primary...
Analysis of a MX/G(a,b)/1 queueing system with vacation interruption
In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary...
Analysis of a production system with a feedback buffer and a general dispatching time.
Analysis of a Two-Level Queuing Production System With Finite Dedicated Buffers
Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies
Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered....
Analysis of AQM queues with queue size based packet dropping
Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that...
Analysis of MAP/PH(1), PH(2)/2 queue with Bernoulli vacations.
Analysis of multi-server queueing model of ABR.
Analysis of operating characteristics for the heterogeneous batch arrival queue with server startup and breakdowns
In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on (i.e. begins startup) when units are accumulated in the system and off when the system is empty. We model this system by an M/M/1 queue with server breakdowns and startup time under the policy. The arrival rate varies according to the server’s status: off, startup, busy, or breakdown. While the server is working, he is subject to breakdowns according to a Poisson...
Analysis of Operating Characteristics for the Heterogeneous Batch Arrival Queue with Server Startup and Breakdowns
In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on (i.e. begins startup) when N units are accumulated in the system and off when the system is empty. We model this system by an M[x]/M/1 queue with server breakdowns and startup time under the N policy. The arrival rate varies according to the server's status: off, startup, busy, or breakdown. While the server is working, he is subject to breakdowns according to a...
Analysis of the asymmetrical shortest two-server queueing model.
Analyzing discrete-time bulk-service Geo/Geob/m queue
This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of b customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time distribution...
Analyzing linear recursive projects as an absorbing chain.
Application des lois non paramétriques dans les systèmes d’attente et la théorie de renouvellement
Les distributions non paramétriques de survie trouvent, de plus en plus, des applications dans des domaines très variés, à savoir : théorie de fiabilité et analyse de survie, files d’attente, maintenance, gestion de stock, théorie de l’économie, L’objet de ce travail est d’utiliser les bornes inférieures et supérieures (en terme de la moyenne) des fonctions de fiabilité appartenant aux classes de distribution de type et , présentées par Sengupta (1994), pour l’évaluation de certaines caractéristiques....
Application des lois non paramétriques dans les systèmes d'attente et la théorie de renouvellement
Les distributions non paramétriques de survie trouvent, de plus en plus, des applications dans des domaines très variés, à savoir: théorie de fiabilité et analyse de survie, files d'attente, maintenance, gestion de stock, théorie de l'économie, ... L'objet de ce travail est d'utiliser les bornes inférieures et supérieures (en terme de la moyenne) des fonctions de fiabilité appartenant aux classes de distribution de type IFR, DFR, NBU et NWU, présentées par Sengupta (1994), pour l'évaluation de...