On a numerical method for calculating state probabilities for queueing systems with more than one waiting line (Q1094319): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-0427(87)90129-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064281565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on waiting times in systems with queues in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3662408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-queue, one-server model with priority for the longer queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: The autostrada queueing problem / rank
 
Normal rank
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: The shorter queue problem: A numerical study using the matrix-geometric solution / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:12, 18 June 2024

scientific article
Language Label Description Also known as
English
On a numerical method for calculating state probabilities for queueing systems with more than one waiting line
scientific article

    Statements

    On a numerical method for calculating state probabilities for queueing systems with more than one waiting line (English)
    0 references
    0 references
    1987
    0 references
    A numerical method for calculating state probabilities of queueing systems with more than one waiting line in parallel is based on power series expansions of state probabilities as functions of the traffic intensity of the system. Coefficients of these power series are calculated recursively, and coefficients of power series expansions of moments of queue length distributions are derived from them. Their extrapolations at the origin are obtained using the asymptotic behaviour of moments in heavy traffic. Two examples of exponential queueing systems are used to illustrate and discuss the method.
    0 references
    0 references
    0 references
    0 references
    0 references
    queues in parallel
    0 references
    traffic intensity
    0 references
    state probabilities of queueing systems
    0 references
    power series expansions
    0 references
    moments of queue length distributions
    0 references
    exponential queueing systems
    0 references
    0 references