Information theoretic analysis for queueing systems with quasi-random input
DOI10.1016/0895-7177(95)00120-QzbMATH Open0831.60101MaRDI QIDQ1900306FDOQ1900306
Jesus R. Artalejo, A. Gómez-Corral
Publication date: 25 January 1996
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
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
- Entropy maximisation and queueing network models
queueing theorystationary distributionrepeated attemptsmaximum entropy estimationinformation theoretic inference methodologyretrial policystable recursion algorithms
Queues and service in operations research (90B22) Measures of information, entropy (94A17) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- Title not available (Why is that?)
- Prior Probabilities
- A survey on retrial queues
- A survey of retrial queues
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- Title not available (Why is that?)
- A service model in which the server is required to search for customers
- Information theoretic approximations for the \(M/G/1\) retrial queue
- ALGORITHMIC METHODS FOR SINGLE SERVER SYSTEMS WITH REPEATED ATTEMPTS
- Maximum Entropy Condition in Queueing Theory
- An algorithm for finding the distribution of maximal entropy
- On Time Dependent Queuing Processes
- Information theoretic approximations for M/G/1 and G/G/1 queuing systems
- An Analysis of M/M/s Queueing Systems Based on the Maximum Entropy Principle
- Approximating queue lengths in \(M(t)/G/1\) queue using the maximum entropy principle
- An ME-based approximation for multi-server queues with preemptive priority
- Explicit Formulae for the Characteristics of the M/H2/1 Retrial Queue
Cited In (13)
- Information theoretic approximations for the \(M/G/1\) retrial queue
- Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority
- A finite source retrial queue
- Homogeneous finite-source retrial queues with server subject to breakdowns and repairs
- The M/G/1 retrial queue: an information theoretic approach
- Title not available (Why is that?)
- INFORMATION AND UNCERTAINTY IN A QUEUING SYSTEM
- A multiserver retrial queue with a finite number of sources of primary calls.
- On the number of customers served in the \(M/G/1\) retrial queue: first moments and maximum entropy approach
- Information theoretic analysis for a general queueing system at equilibrium with application to queues in tandem
- MRSPN analysis of semi-Markovian finite source retrial queues
- Exploiting Partial Information in Queueing Systems
- A finite-source inventory system with postponed demands and modified M vacation policy
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)
