Features of some discrete-time cyclic queueing networks (Q1339086): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On response time and cycle time distributions in a two-stage cyclic queue / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational algorithms for closed queueing networks with exponential servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cycle Time Distribution of Exponential Cyclic Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5524074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of queues in discrete time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed Queuing Systems with Exponential Servers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—On Normalizing Constants in Queueing Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twenty Five Years of Cyclic Queues and Closed Queue Networks: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet Transmission in a Noisy-Channel Ring Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of large discrete-time cyclic queueing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time for a Round Trip in a Cycle of Exponential Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete-time queueing network / rank
 
Normal rank

Latest revision as of 09:42, 23 May 2024

scientific article
Language Label Description Also known as
English
Features of some discrete-time cyclic queueing networks
scientific article

    Statements

    Features of some discrete-time cyclic queueing networks (English)
    0 references
    0 references
    1 December 1994
    0 references
    A finite number of service stations are cyclically connected and provide service to a population of customers of a fixed finite total size. Time is slotted. At the end of a time slot, each customer in service independently moves to the station right ahead in the cycle with a probability depending only on the number of that station, or else stays in service where he is. For the two cases in which each station is a single server and hence can serve no more than one customer at a given time, or else each station is an infinite server, the authors derive product-form invariant distributions for the network state process, the state specifying the number of customers present at each node.
    0 references
    cyclic queueing network
    0 references
    discrete-time queue
    0 references
    product form
    0 references
    product-form invariant distributions
    0 references

    Identifiers

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