Malyshev's theory and JS-queues. Asymptotics of stationary probabilities (Q1429107): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two coupled processors: The reduction to a Riemann-Hilbert problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in the Constructive Theory of Countable Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3913845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two queues in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Join the shortest queue: Stability and exact asymptotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A load-balanced network with two servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4216252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical method in the theory of two-dimensional positive random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the stationary probabilities for two-dimensional positive random walks / rank
 
Normal rank

Latest revision as of 15:41, 6 June 2024

scientific article
Language Label Description Also known as
English
Malyshev's theory and JS-queues. Asymptotics of stationary probabilities
scientific article

    Statements

    Malyshev's theory and JS-queues. Asymptotics of stationary probabilities (English)
    0 references
    0 references
    0 references
    30 March 2004
    0 references
    The paper considers a discrete-time nearest neighbor random walk (SHC random walk) in \(\mathbb{Z}^2_+\), whose jump probabilities are homogeneous in time and possess homogeneity relative to space shifts and symmetry relative to the reflection about the diagonal. These walks can describe the so-called join-the-shorter-queues (JS-queues). In JS-queues, tasks arrive within three independent Poisson processes \(\Xi_1\), \(\Xi_2\) and \(\Xi'\). Processes \(\Xi_1\) and \(\Xi_2\) are of rate \(\lambda\) and \(\Xi'\) of rate \(\lambda'\). Tasks from \(\Xi_1\) go to server 1, tasks from \(\Xi_2\) go to server 2 and tasks from \(\Xi'\) choose the shortest queue. The service rates at each server are equal 1, and tasks are served according to a conservative discipline (say, FCFS), without interruption. The paper gives a criterion for positive recurrence of SHC random walk and analyzes geometric asymptotics of the stationary probabilities \(\rho_{m+n, m}\) as \(m,n\to\infty\), \((m+ n)/n\sim \text{ctg\,}\gamma\).
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references