Information theoretic analysis for queueing systems with quasi-random input

DOI10.1016/0895-7177(95)00120-QMaRDI QIDQ1900306zbMATHFDO

Authors Jesus R. Artalejo, A. Gómez-Corral

Publication date 25 January 1996

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

zbMATH Keywords

queueing theorystationary distributionrepeated attemptsmaximum entropy estimationinformation theoretic inference methodologyretrial policystable recursion algorithms

Mathematics Subject Classification ID

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

Recommendations

• Information theoretic analysis for a general queueing system at equilibrium with application to queues in tandem
• The M/G/1 retrial queue: an information theoretic approach
• Maximum Entropy Analysis of Multiple-server Queueing Systems
• scientific article; zbMATH DE number 176279
• Entropy maximisation and queueing network models

Cites work

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

Cited in

(13)

• Information theoretic analysis for a general queueing system at equilibrium with application to queues in tandem
• Information theoretic approximations for the \(M/G/1\) retrial queue
• The M/G/1 retrial queue: an information theoretic approach
• Exploiting Partial Information in Queueing Systems
• INFORMATION AND UNCERTAINTY IN A QUEUING SYSTEM
• Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority
• A multiserver retrial queue with a finite number of sources of primary calls.
• A finite-source inventory system with postponed demands and modified M vacation policy
• A finite source retrial queue
• 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
• scientific article; zbMATH DE number 7070808 (Why is no real title available?)
• Homogeneous finite-source retrial queues with server subject to breakdowns and repairs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900306)