scholarly journals The Discrete-Time Bulk-ServiceGeo/Geo/1Queue with Multiple Working Vacations

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Jiang Cheng ◽  
Yinghui Tang ◽  
Miaomiao Yu
Keyword(s):  
Discrete Time ◽  
Queue Length ◽  
Busy Period ◽  
Operator Method ◽  
Embedded Markov Chain ◽  
Working Vacation ◽  
Early Arrival ◽  
Multiple Working Vacations ◽  
Bulk Service ◽  
Working Vacations

This paper deals with a discrete-time bulk-serviceGeo/Geo/1queueing system with infinite buffer space and multiple working vacations. Considering an early arrival system, as soon as the server empties the system in a regular busy period, he leaves the system and takes a working vacation for a random duration at timen. The service times both in a working vacation and in a busy period and the vacation times are assumed to be geometrically distributed. By using embedded Markov chain approach and difference operator method, queue length of the whole system at random slots and the waiting time for an arriving customer are obtained. The queue length distributions of the outside observer’s observation epoch are investigated. Numerical experiment is performed to validate the analytical results.

scholarly journals GEOM/GEOM[a]/1/ queue with late arrival system with delayed access and delayed multiple working vacations

2014 ◽  
Vol 24 (1) ◽  
pp. 127-143 ◽  
Author(s):  
Jiang Cheng ◽  
Yinghui Tang ◽  
Miaomiao Yu
Keyword(s):  
Queue Length ◽  
Probability Generating Function ◽  
Operator Method ◽  
Analysis Method ◽  
Idle Period ◽  
Arrival Times ◽  
Late Arrival ◽  
Multiple Working Vacations ◽  
Bulk Service ◽  
Working Vacations

This paper considers a discrete-time bulk-service queue with infinite buffer space and delay multiple working vacations. Considering a late arrival system with delayed access (LAS-AD), it is assumed that the inter-arrival times, service times, vacation times are all geometrically distributed. The server does not take a vacation immediately at service complete epoch but keeps idle period. According to a bulk-service rule, at least one customer is needed to start a service with a maximum serving capacity 'a'. Using probability analysis method and displacement operator method, the queue length and the probability generating function of waiting time at pre-arrival epochs are obtained. Furthermore, the outside observer?s observation epoch queue length distributions are given. Finally, computational examples with numerical results in the form of graphs and tables are discussed.

Algorithmic analysis of the BMAP/D/k system in discrete time

2003 ◽  
Vol 35 (4) ◽  
pp. 1131-1152 ◽  
Author(s):  
Attahiru Sule Alfa
Keyword(s):  
Structural Properties ◽  
Customer Service ◽  
Discrete Time ◽  
Queue Length ◽  
Busy Period ◽  
Marginal Distribution ◽  
Waiting Times ◽  
Single Server ◽  
Waiting Time Distribution ◽  
Algorithmic Analysis

We exploit the structural properties of the BMAP/D/k system to carry out its algorithmic analysis. Specifically, we use these properties to develop algorithms for studying the distributions of waiting times in discrete time and the busy period. One of the structural properties used results from considering the system as having customers assigned in a cyclic order—which does not change the waiting-time distribution—and then studying only one arbitrary server. The busy period is defined as the busy period of an arbitrary single server based on this cyclic assignment of customers to servers. Finally, we study the marginal distribution of the joint queue length and phase of customer arrival. The structural property used for studying the queue length is based on the observation of the system every interval that is the length of one customer service time.

scholarly journals Performance Characteristics of Discrete-Time Queue With Variant Working Vacations

2020 ◽  
Vol 11 (2) ◽  
pp. 1-21
Author(s):  
P. Vijaya Laxmi ◽  
Rajesh P.
Keyword(s):  
Discrete Time ◽  
Cost Model ◽  
Probability Generating Function ◽  
System Size ◽  
Service Rate ◽  
Single Server ◽  
Working Vacation ◽  
Optimal Service ◽  
Working Vacations ◽  
Vacation Period

This article analyzes an infinite buffer discrete-time single server queueing system with variant working vacations in which customers arrive according to a geometric process. As soon as the system becomes empty, the server takes working vacations. The server will take a maximum number K of working vacations until either he finds at least on customer in the queue or the server has exhaustively taken all the vacations. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. The probability generating function of the steady-state probabilities and the closed form expressions of the system size when the server is in different states have been derived. In addition, some other performance measures, their monotonicity with respect to K and a cost model are presented to determine the optimal service rate during working vacation.

A new informative embedded Markov renewal process for the PH/G/1 queue

1986 ◽  
Vol 18 (02) ◽  
pp. 533-557 ◽  
Author(s):  
Marcel F. Neuts
Keyword(s):  
Markov Chain ◽  
Statistical Analysis ◽  
Queue Length ◽  
Busy Period ◽  
Waiting Times ◽  
Arrival Process ◽  
Embedded Markov Chain ◽  
Markov Renewal Process ◽  
The Mean ◽  
Busy Cycle

We consider a new embedded Markov chain for the PH/G/1 queue by recording the queue length, the phase of the arrival process and the number of services completed during the current busy period at the successive departure epochs. Algorithmically tractable matrix formulas are obtained which permit the analysis of the fluctuations of the queue length and waiting times during a typical busy cycle. These are useful in the computation of certain profile curves arising in the statistical analysis of queues. In addition, informative expressions for the mean waiting times in the stable GI/G/1 queue and a simple new algorithm to evaluate the waiting-time distributions for the stationary PH/PH/1 queue are obtained.

scholarly journals Phase-Type Arrivals and Impatient Customers in Multiserver Queue with Multiple Working Vacations

2016 ◽  
Vol 2016 ◽  
pp. 1-17 ◽  
Author(s):  
Cosmika Goswami ◽  
N. Selvaraju
Keyword(s):  
Blocking Probability ◽  
Death Process ◽  
Impatient Customers ◽  
Working Vacation ◽  
Multiple Working Vacations ◽  
Phase Type ◽  
Working Vacations ◽  
The One ◽  
Vacation Period ◽  
Stationary Probability Vector

We consider a PH/M/c queue with multiple working vacations where the customers waiting in queue for service are impatient. The working vacation policy is the one in which the servers serve at a lower rate during the vacation period rather than completely ceasing the service. Customer’s impatience is due to its arrival during the period where all the servers are in working vacations and the arriving customer has to join the queue. We formulate the system as a nonhomogeneous quasi-birth-death process and use finite truncation method to find the stationary probability vector. Various performance measures like the average number of busy servers in the system during a vacation as well as during a nonvacation period, server availability, blocking probability, and average number of lost customers are given. Numerical examples are provided to illustrate the effects of various parameters and interarrival distributions on system performance.

Sign in / Sign up

Export Citation Format

Share Document