Results 321 to 330 of about 470,919 (363)

On Episodic Queues [PDF]

SIAM Journal on Matrix Analysis and Applications, 1997
Summary: For a queueing system with a low traffic intensity, the expected number of customers in the queue is small. However, with a bursty input process, long queues may build up in a short time. We study light traffic queueing systems with bursty input processes. We study the distributions of queue lengths, waiting times, busy and active periods, and
Qi-Ming He, Marcel F. Neuts
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Tandem Queues and Queueing Networks

2016
Markov processes are a special class of stochastic processes. In order to fully understand Markov processes we first need to introduce stochastic processes. However, to help us understand stochastic process we need to remember the basic probability theory associated with it, which was briefly reviewed in the last chapter.
Attahiru Sule Alfa, Attahiru Sule Alfa
openaire   +2 more sources

Why Trading Speed Matters: A Tale of Queue Rationing under Price Controls

, 2015
Queue rationing under price controls drives speed competition in liquidity provision. We find that a one-cent tick size generates higher revenues and longer queues of liquidity provision for lower-priced (larger relative tick size) securities.
Chengxi Yao, Mao Ye
semanticscholar   +1 more source

New results for the single server queue with a batch Markovian arrival process

, 1991
The versatile Markovian point process was introduced by M. F. Neuts in 1979. This is a rich class of point processes whichcontains many familiar arrival process as very special cases.
D. Lucantoni
semanticscholar   +1 more source

The Regulation of Queue Size by Levying Tolls

, 1969
SOME DISCUSSION has arisen recently as to whether the imposition of an "entrance fee" on arriving customers who wish to be serviced by a station and hence join a waiting line is a rational measure.
P. Naor
semanticscholar   +1 more source

The Single Server Queue.

, 1972
Hardbound. This classic work, now available in paperback, concentrates on the basic models of queueing theory. It has a dual aim: to describe relevant mathematical techniques and to analyse the single server queue and its most important variants.
Vincent Hodgson, J. Cohen
semanticscholar   +1 more source

On Jockeying in Queues

Management Science, 1966
There are numerous queueing situations in which those awaiting service may be allowed to make choices which affect the time spent in the service system. In such cases, it should be possible to formulate a “strategy” for customers to follow in order to optimize a given parameter. A whole class of queue problems which involve “jockeying” can be regarded
openaire   +2 more sources

Stability, queue length, and delay of deterministic and stochastic queueing networks

IEEE Transactions on Automatic Control, 1994
We present two types of stability problems: 1) conditions for queueing networks that render bounded queue lengths and bounded delay for customers, and 2) conditions for queueing networks in which the queue length distribution of a queue has an ...
Cheng-Shang Chang
semanticscholar   +1 more source

Nonstationary analysis of the loss queue and of queueing networks of loss queues

European Journal of Operational Research, 2009
Abstract We present an iterative scheme based on the fixed-point approximation method, for the numerical calculation of the time-dependent mean number of customers and blocking probability functions in a nonstationary queueing network with multi-rate loss queues. We first show how the proposed method can be used to analyze a single-class, multi-class,
Harry G. Perros, Khalid Alnowibet
openaire   +2 more sources

On the regulation of queues

Operations Research Letters, 1986
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. J. M. Posner, M Berg
openaire   +3 more sources