A Markov renewal approach to \(M/G/1\) type queues with countably many background states

From MaRDI portal
Publication:596418

DOI10.1023/B:QUES.0000021148.33178.0FzbMath1056.90035OpenAlexW1980495297MaRDI QIDQ596418

Masakiyo Miyazawa

Publication date: 10 August 2004

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

Full work available at URL: https://doi.org/10.1023/b:ques.0000021148.33178.0f




Related Items (19)

Departure processes and busy periods of a tandem networkThe kernel method tail asymptotics analytic approach for stationary probabilities of two-dimensional queueing systemsInvariant measures and error bounds for random walks in the quarter-plane based on sums of geometric termsOn the Effect of Finite Buffer Truncation in a Two-Node Jackson NetworkLight-tailed asymptotics of \(\mathrm{GI}/\mathrm{G}/1\)-type Markov chainsLight tail asymptotics in multidimensional reflecting processes for queueing networksStationary tail asymptotics of a tandem queue with feedbackA tandem network with MAP inputsQuantitative Estimates in an M2/G2/1 Priority Queue with Non-Preemptive Priority: The Method of Strong StabilityGeometric Decay in a QBD Process with Countable Background States with Applications to a Join-the-Shortest-Queue ModelThe stationary tail asymptotics in the GI/G/1-type queue with countably many background statesTail asymptotics of two parallel queues with transfers of customersExact tail asymptotics in a priority queue -- characterizations of the preemptive modelSubexponential asymptotics of the stationary distributions of M/G/1-type Markov chainsLight-Tailed Asymptotics of Stationary Tail Probability Vectors of Markov Chains of M/G/1 TypeDiscriminatory Processor Sharing Queues and the DREB MethodLight-Tailed Behavior in QBD Processes with Countably Many PhasesA Retrial Queue with a Constant Retrial Rate, Server Downs and Impatient CustomersUnnamed Item







This page was built for publication: A Markov renewal approach to \(M/G/1\) type queues with countably many background states