Erlang arrivals joining the shorter queue (Q2375751): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4001953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: J.comput. appl. math / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of the asymmetric shortest queue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compensation approach for two-dimensional Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3662408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2773624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO QUEUES IN PARALLEL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Similar Queues in Parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sample path methods in the control of queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kakeya's Problem on the Zeros of the Derivative of a Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light tail asymptotics in multidimensional reflecting processes for queueing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decay rate for a PH/M/2 queue with shortest queue discipline / rank
 
Normal rank

Latest revision as of 13:36, 6 July 2024

scientific article
Language Label Description Also known as
English
Erlang arrivals joining the shorter queue
scientific article

    Statements

    Erlang arrivals joining the shorter queue (English)
    0 references
    14 June 2013
    0 references
    This paper presents an analysis of a system in which, upon arrival, customers join the shortest of two single-server queues. The customers' service times are independent and exponentially distributed with a mean of one, irrespective of which queue they joined. The arrivals form a reneval process with Erlang interarrival times with the mean \(k/\lambda\) so that each interarrival time consists of \(k\) independent exponential phases with the mean \(1/\lambda\) respectively. Under these Markovian assumptions, this system rises to a Markov chain on a multi-layered quarter plane. In other words, the system can be described as a three-dimensional Markovian chain, whose state space consists of a \(k\)-layered quarter plane. When \(\rho = \lambda/2k<1\), this Markov chain is ergodic and equilibrium distribution exists. In this paper, an explicit expression for the equilibrium distribution in terms of an infinity series of geometric terms is derived.
    0 references
    0 references
    queueing theory
    0 references
    queues and services
    0 references
    0 references
    0 references