Information theoretic approximations for the \(M/G/1\) retrial queue
type: Item
instance of: scholarly article
title: Information theoretic approximations for the \(M/G/1\) retrial queue
zbMATH Open document ID: 0818.68038
DOI: 10.1007/BF01213207
published in: Acta Informatica
publication date: 1994-12-18T00:00:00Z
review text: In this paper we present information theoretic approximations for the M/G/1 queue with retrials. Various approximations for this model are obtained according to the available information about the service time probability density and the steady-state distribution of the system state. The results are well-suited for numerical computation.
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 695008
zbMATH Keywords: \(M/G/1\) queue
zbMATH Keywords: retrial queues
zbMATH Keywords: monotonicity properties
zbMATH Keywords: \(I\)-projection
zbMATH Keywords: steady-state distribution
author: G. I. Falin
author: M. Martin
author: Jesus R. Artalejo
MaRDI profile type: Publication
cites work: An algorithm for finding the distribution of maximal entropy
cites work: Approximating queue lengths in M(t)/D/1 queues
cites work: Explicit Formulae for the Characteristics of the M/H2/1 Retrial Queue
cites work: I-divergence geometry of probability distributions and minimization problems
cites work: An iterative procedure for obtaining I-projections onto the intersection of convex sets
cites work: Aggregate arrival of customers in a one-line system with repeated calls
cites work: Q3878499
cites work: A survey of retrial queues
cites work: Approximations to Stochastic Service Systems, with an Application to a Retrial Model
cites work: M/G/1 queueing systems with returning customers
cites work: Explicit formulas for the characteristics of the M/M/2/2 queue with repeated attempts
cites work: A Service System with Unfilled Requests Repeated
cites work: ALGORITHMIC METHODS FOR SINGLE SERVER SYSTEMS WITH REPEATED ATTEMPTS
cites work: A maximum entropy priority approximation for a stable G/G/1 queue
cites work: Extended continued fractions, recurrence relations and two-dimensional Markov processes
cites work: Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
cites work: On Dykstra's iterative fitting procedure
cites work: Q3998392
full work available at URL: https://doi.org/10.1007/bf01213207
OpenAlex ID: W1953786337
Recommended article: Q4035386
Recommended article: Q3645240
Recommended article: The information-theoretic capacity of discrete-time queues
Recommended article: Information theoretic analysis for queueing systems with quasi-random input
Recommended article: ON APPROXIMATIONS FOR GI/G/c RETRIAL QUEUES
Recommended article: An approximation method for the \(M/G/1\) retrial queue with general retrial times
Recommended article: A maximum entropy approach for the busy period of the \(M/G/1\) retrial queue
Recommended article: Stochastic inequalities for \(M/G/1\) retrial queues
Recommended article: Information theoretic analysis for a general queueing system at equilibrium with application to queues in tandem
description: scientific article; zbMATH DE number 695008