Analysis of discrete time queues via the reversed process (Q1339088): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Insensitivity in discrete time queues with a moving server / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The doubly stochastic server: A time-sharing model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3791100 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Queuing analysis of polling models / rank | |||
Normal rank |
Latest revision as of 09:42, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Analysis of discrete time queues via the reversed process |
scientific article |
Statements
Analysis of discrete time queues via the reversed process (English)
0 references
4 December 1995
0 references
A class of discrete-time single server queues is considered, where customers arrive in the form of a Bernoulli stream and have service demands with general arithmetic distributions. By way of suitably permuting the positions in queue of the customers present at the end of a time slot, a Markovian state process can be defined which has an invariant measure of product form. This is shown via a study of the time reversed state process.
0 references
cyclic queue
0 references
time reversibility
0 references
round robin queue
0 references
Bernoulli stream
0 references
invariant measure of product form
0 references
0 references