THE MX/D/c BATCH ARRIVAL QUEUE

2005 ◽  
Vol 19 (3) ◽  
pp. 345-349 ◽  
Author(s):  
Geert Jan Franx
Keyword(s):  
Explicit Expression ◽  
Waiting Time ◽  
Probabilistic Analysis ◽  
Generating Functions ◽  
Time Distribution ◽  
Laplace Transforms ◽  
Batch Arrival ◽  
Waiting Time Distribution

A surprisingly simple and explicit expression for the waiting time distribution of the MX/D/c batch arrival queue is derived by a full probabilistic analysis, requiring neither generating functions nor Laplace transforms. Unlike the solutions known so far, this expression presents no numerical complications, not even for high traffic intensities.

Transient and busy period analysis of the GIG/1 Queue as a Hilbert factorization problem

1991 ◽  
Vol 28 (4) ◽  
pp. 873-885 ◽  
Author(s):  
Dimitris J. Bertsimas ◽  
Julian Keilson ◽  
Daisuke Nakazato ◽  
Hongtao Zhang
Keyword(s):  
Closed Form ◽  
Waiting Time ◽  
Time Distribution ◽  
Busy Period ◽  
Laplace Transforms ◽  
Waiting Time Distribution ◽  
Period Analysis ◽  
Factorization Problem ◽  
Period Distribution ◽  
Lindley Process

In this paper we find the waiting time distribution in the transient domain and the busy period distribution of the GI G/1 queue. We formulate the problem as a two-dimensional Lindley process and then transform it to a Hilbert factorization problem. We achieve the solution of the factorization problem for the GI/R/1, R/G/1 queues, where R is the class of distributions with rational Laplace transforms. We obtain simple closed-form expressions for the Laplace transforms of the waiting time distribution and the busy period distribution. Furthermore, we find closed-form formulae for the first two moments of the distributions involved.

Transient and busy period analysis of the GI G/1 Queue as a Hilbert factorization problem

1991 ◽  
Vol 28 (04) ◽  
pp. 873-885 ◽  
Author(s):  
Dimitris J. Bertsimas ◽  
Julian Keilson ◽  
Daisuke Nakazato ◽  
Hongtao Zhang
Keyword(s):  
Closed Form ◽  
Waiting Time ◽  
Time Distribution ◽  
Busy Period ◽  
Laplace Transforms ◽  
Waiting Time Distribution ◽  
Period Analysis ◽  
Factorization Problem ◽  
Period Distribution ◽  
Lindley Process

In this paper we find the waiting time distribution in the transient domain and the busy period distribution of the GI G/1 queue. We formulate the problem as a two-dimensional Lindley process and then transform it to a Hilbert factorization problem. We achieve the solution of the factorization problem for the GI/R/1, R/G/1 queues, where R is the class of distributions with rational Laplace transforms. We obtain simple closed-form expressions for the Laplace transforms of the waiting time distribution and the busy period distribution. Furthermore, we find closed-form formulae for the first two moments of the distributions involved.

scholarly journals A Globally Gated Polling System with a Dormant Server

1995 ◽  
Vol 9 (2) ◽  
pp. 239-254 ◽  
Author(s):  
S. C. Borst
Keyword(s):  
Explicit Expression ◽  
Waiting Time ◽  
Cycle Time ◽  
Time Distribution ◽  
Polling System ◽  
Waiting Time Distribution ◽  
Home Base ◽  
Convex Ordering ◽  
Increasing Convex Ordering

We study a globally gated polling system with a dormant server, which makes a halt at its home base when there are no customers present in the system. We derive an explicit expression for the cycle time distribution as well as for the waiting-time distribution at each of the queues. As a justification of the dormant server policy, we show the waiting time at each of the queues to be smaller (in the increasing-convex-ordering sense) than in the ordinary nondormant server case.

Some analyses on the control of queues using level crossings of regenerative processes

1980 ◽  
Vol 17 (3) ◽  
pp. 814-821 ◽  
Author(s):  
J. G. Shanthikumar
Keyword(s):  
Waiting Time ◽  
Time Distribution ◽  
Queueing Systems ◽  
Density Functions ◽  
Waiting Time Distribution ◽  
Regenerative Processes ◽  
Stieltjes Transform ◽  
Expected Number ◽  
Control Of Queues ◽  
Special Case

Some properties of the number of up- and downcrossings over level u, in a special case of regenerative processes are discussed. Two basic relations between the density functions and the expected number of upcrossings of this process are derived. Using these reults, two examples of controlled M/G/1 queueing systems are solved. Simple relations are derived for the waiting time distribution conditioned on the phase of control encountered by an arriving customer. The Laplace-Stieltjes transform of the distribution function of the waiting time of an arbitrary customer is also derived for each of these two examples.

scholarly journals Role of the Solar Minimum in the Waiting Time Distribution Throughout the Heliosphere

2021 ◽  
Author(s):  
Yosia I Nurhan ◽  
Jay Robert Johnson ◽  
Jonathan R Homan ◽  
Simon Wing
Keyword(s):  
Waiting Time ◽  
Time Distribution ◽  
Solar Minimum ◽  
Waiting Time Distribution

CONTINUOUS-TIME FINANCE AND THE WAITING TIME DISTRIBUTION: MULTIPLE CHARACTERISTIC TIMES

2012 ◽  
Vol 26 (23) ◽  
pp. 1250151 ◽  
Author(s):  
KWOK SAU FA
Keyword(s):  
Distribution Function ◽  
Random Walk ◽  
Waiting Time ◽  
Continuous Time ◽  
Probability Distribution Function ◽  
Time Distribution ◽  
Waiting Time Distribution ◽  
Exponential Functions ◽  
Multiple Characteristic ◽  
Sum Of Products

In this paper, we model the tick-by-tick dynamics of markets by using the continuous-time random walk (CTRW) model. We employ a sum of products of power law and stretched exponential functions for the waiting time probability distribution function; this function can fit well the waiting time distribution for BUND futures traded at LIFFE in 1997.

Part Waiting Time Distribution in a Two-Machine Line

2012 ◽  
Vol 45 (6) ◽  
pp. 457-462 ◽  
Author(s):  
Chuan Shi ◽  
Stanley B. Gershwin
Keyword(s):  
Waiting Time ◽  
Time Distribution ◽  
Waiting Time Distribution
Sign in / Sign up

Export Citation Format

Share Document