The doubly stochastic server: A time-sharing model

DOI10.1007/BF01917171zbMath0467.90029OpenAlexW1977864051MaRDI QIDQ3920972

R. Schassberger

Publication date: 1981

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01917171

zbMATH Keywords

necessary and sufficient existence conditionsconditional average response timedoubly stochastic serverstochastic law of the output streamtime-sharing model

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Probabilistic methods, stochastic differential equations (65C99)

Related Items (6)

Analysis of discrete time queues via the reversed process ⋮ Decomposability in queues with background states ⋮ Open queueing networks in discrete time -- some limit theorems ⋮ Insensitivity in discrete time queues with a moving server ⋮ Networks of queues in discrete time ⋮ Modelling of priority buffering systems applicable for commercial mobile networks

Cites Work

• 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
• Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
• Networks of queues

This page was built for publication: The doubly stochastic server: A time-sharing model