Insensitivity in discrete time queues with a moving server

DOI10.1007/BF01164006zbMath0766.60111WikidataQ58645592 ScholiaQ58645592MaRDI QIDQ1201828

W. Henderson, Peter G. Taylor

Publication date: 17 January 1993

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

product formsingle-server queuesinsensitive to the service distribution and queue discipline

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (2)

Analysis of discrete time queues via the reversed process ⋮ Decomposability in queues with background states

Cites Work

• Unnamed Item
• Unnamed Item
• A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions
• On the response time distribution in a discrete round-robin queue
• Insensitivity in discrete-time generalized semi-Markov processes allowing multiple events and probabilistic service scheduling
• Networks of queues in discrete time
• The doubly stochastic server: A time-sharing model
• Aggregation and disaggregation through insensitivity in stochastic Petri nets
• An extension of Erlang's loss formula
• Insensitivity of steady-state distributions of generalized semi-Markov processes by speeds
• Partial balance and insensitivity
• An extension of Erlang's formulas which distinguishes individual servers

This page was built for publication: Insensitivity in discrete time queues with a moving server