On the Overflow Process from a Finite Markovian Queue

DOI10.1016/0166-5316(84)90009-9zbMath0551.90022OpenAlexW2090902216MaRDI QIDQ3343726

Erik A. van Doorn

Publication date: 1984

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(84)90009-9

zbMATH Keywords

Laplace transformsinfinite-server queuefinite waiting roomsingle server Markovian queueing systemteletraffic theorydistribution time between overflowspeakedness factorstate-dependent service and arrival rates

Mathematics Subject Classification ID

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

Related Items (8)

On truncations and perturbations of Markov decision problems with an application to queueing network overflow control ⋮ The overflow process from a state-dependent queue ⋮ Stationary Blocking Probability in Multi-server Finite Queuing System with Ordered Entry and Poisson Arrivals ⋮ Two queues with weighted one-way overflow ⋮ The asymptotic variance rate of the output process of finite capacity birth-death queues ⋮ Selective trunk with multiserver reservation ⋮ Birth and Death (BDP) Process Models with Applications ⋮ On two product form modifications for finite overflow systems

This page was built for publication: On the Overflow Process from a Finite Markovian Queue