Information theoretic approximations for the \(M/G/1\) retrial queue

DOI10.1007/BF01213207zbMath0818.68038OpenAlexW1953786337MaRDI QIDQ1338900

M. Martin Diaz, Jesus R. Artalejo, Gennadij Falin

Publication date: 18 December 1994

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01213207

zbMATH Keywords

\(M/G/1\) queuesteady-state distributionmonotonicity propertiesretrial queues\(I\)-projection

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

GI/M/1/1 queue with finite retrials and finite orbits ⋮ Unnamed Item ⋮ Information theoretic analysis for queueing systems with quasi-random input ⋮ Entropy maximization and the busy period of some single-server vacation models ⋮ On the \(M/G/1\) retrial queueing system with linear control policy ⋮ On the number of customers served in the \(M/G/1\) retrial queue: first moments and maximum entropy approach ⋮ A functional approximation for retrial queues with two way communication ⋮ Stationary analysis of a retrial queue with preemptive repeated attempts ⋮ Fluid limits of many-server retrial queues with nonpersistent customers ⋮ A discrete-time \(Geo^{[x}/g/1\) retrial queue with control of admission]

Cites Work

• Unnamed Item
• Unnamed Item
• On Dykstra's iterative fitting procedure
• A survey of retrial queues
• An iterative procedure for obtaining I-projections onto the intersection of convex sets
• I-divergence geometry of probability distributions and minimization problems
• Aggregate arrival of customers in a one-line system with repeated calls
• An algorithm for finding the distribution of maximal entropy
• Approximating queue lengths in M(t)/D/1 queues
• A maximum entropy priority approximation for a stable G/G/1 queue
• Explicit formulas for the characteristics of the M/M/2/2 queue with repeated attempts
• ALGORITHMIC METHODS FOR SINGLE SERVER SYSTEMS WITH REPEATED ATTEMPTS
• Extended continued fractions, recurrence relations and two-dimensional Markov processes
• M/G/1 queueing systems with returning customers
• Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
• Approximations to Stochastic Service Systems, with an Application to a Retrial Model
• Explicit Formulae for the Characteristics of the M/H₂/1 Retrial Queue
• A Service System with Unfilled Requests Repeated

This page was built for publication: Information theoretic approximations for the \(M/G/1\) retrial queue