A general treatment of discrete-time buffers with one randomly interrupted output line (Q1088586): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A finite waiting room queueing model with multiple servers having Markovian interruptions and its application to computer communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buffer Behavior in Computer Communication Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buffer Behavior with Poisson Arrivals and Bulk Geometric Service / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general model for the behaviour of infinite buffers with periodic service opportunities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Analysis of a Statistical Multiplexer with Nonindependent Arrivals and Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the behavior of buffers with random server interruptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of an infinite buffer system with random server interruptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101255 / rank
 
Normal rank

Latest revision as of 18:45, 17 June 2024

scientific article
Language Label Description Also known as
English
A general treatment of discrete-time buffers with one randomly interrupted output line
scientific article

    Statements

    A general treatment of discrete-time buffers with one randomly interrupted output line (English)
    0 references
    0 references
    1986
    0 references
    A discrete-time buffer with one single output channel, synchronous transmission of messages and an infinite waiting room is considered, where the output line is subjected to random interruptions in time. The stochastic nature of the interruption process is described by two independent sets of i.i.d. random variables: 'available periods', during which the output line is available for the transmission of data from the buffer, and 'blocked periods', during which it is not. It is shown how expressions of the probability generating function of the buffer occupancy at random clock times can be derived, under the assumption that both available and blocked periods are arbitrarily distributed with the restriction that the available periods have a rational probability generating function. Many prior treatments of this kind of buffer system are shown to be special cases of the present one. An illustrative example of the method is given.
    0 references
    0 references
    discrete-time buffer
    0 references
    single output channel
    0 references
    synchronous transmission of messages
    0 references
    infinite waiting room
    0 references
    interruption process
    0 references