Insensitivity in discrete time queues with a moving server (Q1201828): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Peter G. Taylor / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q1180565 / rank
Normal rank
 
Property / author
 
Property / author: Peter G. Taylor / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58645592 / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Jevsey Morozov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Erlang's formulas which distinguishes individual servers / rank
 
Normal rank
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: Networks of queues in discrete time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insensitivity in discrete-time generalized semi-Markov processes allowing multiple events and probabilistic service scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and disaggregation through insensitivity in stochastic Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insensitivity of steady-state distributions of generalized semi-Markov processes by speeds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the response time distribution in a discrete round-robin queue / 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: Partial balance and insensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Erlang's loss formula / rank
 
Normal rank

Latest revision as of 14:12, 17 May 2024

scientific article
Language Label Description Also known as
English
Insensitivity in discrete time queues with a moving server
scientific article

    Statements

    Insensitivity in discrete time queues with a moving server (English)
    0 references
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    Two single-server queues in discrete time are considered. The customers have in general different types and request several service segments. The server can move from one customer to another after completion of each segment of service. In the first model one segment is provided at each time point while in the second model at most one arrival or service occurs at each point (in fact the second model is considered in so-called ``stomer time scale''). The states of the queue are described by the discrete time Markov (birth and death) process with a given transient probability. The conditions for the existence of limiting (product form) distributions are found. The conditions are obtained also when the distributions are insensitive to the service distribution and queue discipline. Some special cases, in particular, Daduna and Schassberger model are considered.
    0 references
    0 references
    single-server queues
    0 references
    product form
    0 references
    insensitive to the service distribution and queue discipline
    0 references
    0 references