Information theoretic analysis for queueing systems with quasi-random input

DOI10.1016/0895-7177(95)00120-QzbMath0831.60101MaRDI QIDQ1900306

Jesus R. Artalejo, Antonio Gómez-Corral

Publication date: 25 January 1996

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

stationary distributionqueueing theoryrepeated attemptsmaximum entropy estimationinformation theoretic inference methodologyretrial policystable recursion algorithms

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Measures of information, entropy (94A17)

Related Items (7)

On the number of customers served in the \(M/G/1\) retrial queue: first moments and maximum entropy approach ⋮ MRSPN analysis of semi-Markovian finite source retrial queues ⋮ A finite-source inventory system with postponed demands and modified M vacation policy ⋮ A finite source retrial queue ⋮ A multiserver retrial queue with a finite number of sources of primary calls. ⋮ Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority ⋮ Homogeneous finite-source retrial queues with server subject to breakdowns and repairs

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of retrial queues
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• A survey on retrial queues
• Information theoretic approximations for M/G/1 and G/G/1 queuing systems
• Approximating queue lengths in \(M(t)/G/1\) queue using the maximum entropy principle
• An algorithm for finding the distribution of maximal entropy
• An ME-based approximation for multi-server queues with preemptive priority
• Information theoretic approximations for the \(M/G/1\) retrial queue
• On Time Dependent Queuing Processes
• A service model in which the server is required to search for customers
• ALGORITHMIC METHODS FOR SINGLE SERVER SYSTEMS WITH REPEATED ATTEMPTS
• Maximum Entropy Condition in Queueing Theory
• Explicit Formulae for the Characteristics of the M/H₂/1 Retrial Queue
• Prior Probabilities
• An Analysis of M/M/s Queueing Systems Based on the Maximum Entropy Principle
• Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain

This page was built for publication: Information theoretic analysis for queueing systems with quasi-random input