Computing queue length and waiting timedistributions in finite-buffer discrete-time multiserver queues with late and early arrivals
نویسندگان
چکیده
منابع مشابه
Multiserver bulk service discrete-time queue with finite buffer and renewal input
This paper analyzes a discrete-time finite-buffer multi-server bulk-service queueing system in which the interarrival-and service-times are, respectively, arbitrarily and geometrically distributed. Using the supplementary variable and the imbedded Markov-chain techniques, the queue is analyzed for the early arrival system. We obtain state probabilities at prearrival, arbitrary and outside obser...
متن کاملAnalysis of Discrete-time Multiserver Queues with Constant Service times and Correlated Arrivals
We investigate the behavior of a discrete-time multiserver buffer system with infinite buffer size. Packets arrive at the system according to a two-state correlated arrival process. The service times of the packets are assumed to be constant, equal to multiple slots. The behavior of the system is analyzed by means of an analytical technique based on probability generating functions (pgf’s). Exp...
متن کاملApproximations of General Discrete Time Queues by Discrete Time Queues with Arrivals Modulated by Finite Chains
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملOn a Multiserver Finite Buffer Queue with Impatient
In this paper we study a multiserver finite buffer queue in which customers have an stochastic deadline of phase-type until the beginning of their service. The following service disciplines are considered: FCFS (First-Come First-Served), LCFS (Last-Come First-Served) and SIRO (Service In Random Order) along with a parameterizable probabilistic push-out mechanism. Although this model has many ap...
متن کاملQueue Lengths and Waiting Times for Multiserver Queues with Abandonment and Retrials
We consider a Markovian multiserver queueing model with time dependent parameters where waiting customers may abandon and subsequently retry. We provide simple uid and di usion approximations to estimate the mean, variance, and density for both the queue length and virtual waiting time processes arising in this model. These approximations, which are generated by numerically integrating only 7 o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2004
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2004.05.010