Analyzing \(GI/E_ r/1\) queues
type: Item
instance of: scholarly article
title: Analyzing \(GI/E_ r/1\) queues
zbMATH Open document ID: 0873.90035
DOI: 10.1016/0167-6377(96)00024-7
published in: Operations Research Letters
publication date: 1997-07-15T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 1034130
zbMATH Keywords: Markov chain
zbMATH Keywords: single-server system
zbMATH Keywords: Erlang-\(r\) distributed service times
author: Ivo Adan
author: Yiqiang Q. Zhao
MaRDI profile type: Publication
full work available at URL: 0167-6377(96)00024-7
OpenAlex ID: W2026122579
cites work: Q4022742
cites work: Computational analysis of steady-state probabilities of \(M/G^{a,b}/1\) and related nonbulk queues
cites work: Q3938929
cites work: Q5672035
cites work: Q3227943
cites work: A Class of Approximations for the Waiting Time Distribution in aGI/G/1 Queueing System
cites work: Mean waiting time of a Gamma/Gamma/1 queue
cites work: A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue
cites work: Q3923308
cites work: Q3713483
cites work: Stationary waiting time distribution in queues with phase type service and in quasi-birth-and-death processes
cites work: An algorithm for Ph/Ph/c queues
cites work: Approximations for the conditional waiting times in the GI/G/c queue
cites work: Asymptotic exponentiality of the tail of the waiting-time distribution in a Ph/Ph/C queue
cites work: A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
cites work: A Simple Numerical Approach for Infinite-State Markov Chains
description: scientific article; zbMATH DE number 1034130