On a simple discrete cyclic-waiting queueing problem (Q1288938): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02432338 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966135751 / rank
 
Normal rank

Latest revision as of 10:58, 30 July 2024

scientific article
Language Label Description Also known as
English
On a simple discrete cyclic-waiting queueing problem
scientific article

    Statements

    On a simple discrete cyclic-waiting queueing problem (English)
    0 references
    0 references
    29 June 1999
    0 references
    This article deals with a discrete time single server queueing model with geometrically distributed interarrival and service times, under FIFO service discipline. It is assumed that the service of a customer starts upon arrival if the system is free; or else only at moments differing from it by multiples of a given cycle time. Employing the techniques of the embedded Markov chain, by considering the system at times just prior to starting of a service, the condition for the existence of the ergodic distribution is established and the generating function of ergodic probabilities is obtained.
    0 references
    discrete time queue
    0 references
    cyclic-waiting time
    0 references
    embedded Markov chain
    0 references
    ergodic distribution
    0 references
    generating function
    0 references
    0 references
    0 references

    Identifiers