Analyzing \(GI/E_ r/1\) queues
From MaRDI portal
Publication:1360112
DOI10.1016/0167-6377(96)00024-7zbMath0873.90035OpenAlexW2026122579MaRDI QIDQ1360112
Ivo J. B. F. Adan, Yiqiang Q. Zhao
Publication date: 15 July 1997
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(96)00024-7
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (10)
ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS ⋮ Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach ⋮ Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots ⋮ The periodic steady-state solution for queues with Erlang arrivals and service and time-varying periodic transition rates ⋮ On the limiting probabilities of the \(\mathrm{M}/\mathrm{E}_r/1\) queueing system ⋮ On the application of Rouché's theorem in queueing theory ⋮ A note on simple eigenvalues of matrix polynomials in queueing models with Erlang distribu\-tions ⋮ Asymptotics of the maximum of Brownian motion under Erlangian sampling ⋮ AN ALTERNATING SERVICE PROBLEM ⋮ Analytic computation schemes for the discrete-time bulk service queue
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximations for the conditional waiting times in the GI/G/c queue
- An algorithm for Ph/Ph/c queues
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- Mean waiting time of a Gamma/Gamma/1 queue
- Computational analysis of steady-state probabilities of \(M/G^{a,b}/1\) and related nonbulk queues
- A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue
- A Simple Numerical Approach for Infinite-State Markov Chains
- Stationary waiting time distribution in queues with phase type service and in quasi-birth-and-death processes
- Asymptotic exponentiality of the tail of the waiting-time distribution in a Ph/Ph/C queue
- A Class of Approximations for the Waiting Time Distribution in aGI/G/1 Queueing System
This page was built for publication: Analyzing \(GI/E_ r/1\) queues