Entropy maximisation and queueing network models
From MaRDI portal
Publication:1315336
DOI10.1007/BF02023095zbMath0789.90032OpenAlexW1990019746MaRDI QIDQ1315336
Publication date: 12 June 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02023095
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Measures of information, entropy (94A17) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
ASYMPTOTIC WAITING TIME ANALYSIS OF A FINITE-SOURCE M/M/1 RETRIAL QUEUEING SYSTEM ⋮ Unnamed Item ⋮ On the analytic assessment of the impact of traffic correlation on queues in continuous time domain ⋮ Entropy maximization and the busy period of some single-server vacation models ⋮ Asymptotic sojourn time analysis of finite-source M/M/\(1\) retrial queueing system with collisions and server subject to breakdowns and repairs ⋮ On the number of customers served in the \(M/G/1\) retrial queue: first moments and maximum entropy approach ⋮ The SIS and SIR stochastic epidemic models: a maximum entropy approach ⋮ Stationary analysis of a retrial queue with preemptive repeated attempts ⋮ A discrete-time \(Geo^{[x}/g/1\) retrial queue with control of admission] ⋮ A maximum entropy approach for the busy period of the \(M/G/1\) retrial queue ⋮ Towards time domain invariant QoS measures for queues with correlated traffic ⋮ Advances in Modelling of Complex Systems : Preface to the Special Issue ⋮ Product form solution for g-networks with dependent service ⋮ A Markovian queue with varying number of servers and applications to the performance comparison of HSDPA user equipment ⋮ A universal building block for the approximate analysis of a shared buffer ATM switch architecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- MRE hierarchical decomposition of general queueing network models
- Information theoretic analysis for a general queueing system at equilibrium with application to queues in tandem
- Maximum entropy and the G/G/1/N queue
- Maximum entropy two-station cyclic queues with multiple general servers
- Exact solutions for open, closed and mixed queueing networks with rejection blocking
- The presence of exponentiality in entropy maximized M/GI/1 queues
- Information theoretic approximations for M/G/1 and G/G/1 queuing systems
- The behaviour of a single queue in a general queueing network
- A maximum entropy priority approximation for a stable G/G/1 queue
- Optimal flow control of a class of queueing networks in equilibrium
- ME-based approximations for general discrete-time queueing models
- Information Theory and Statistical Mechanics
- Optimal flow control of an end-to-end communication network with fixed routing
- Maximum Entropy Condition in Queueing Theory
- On Approximations for Queues, III: Mixtures of Exponential Distributions
- A new MVA-based approximation for closed queueing networks with a preemptive priority server
- Maximum Entropy Analysis of Multiple-server Queueing Systems
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
- Estimation of State Probabilities Using the Maximum Entropy Principle
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Multiprocessor systems with preemptive priorities
- Properties of cross-entropy minimization
- Analytic Queueing Models for Programs with Internal Concurrency
- Multilevel aggregation of central server models: a minimum relative entropy approach
- On an Approximation to the Mean Response Times of Priority Classes in a Stable G/G/c/PR Queue
- Approximate Analysis of General Queuing Networks
- Queuing Networks with Multiple Closed Chains: Theory and Computational Algorithms
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Models for parallel processing within programs
- Exact Aggregation in Exponential Queueing Networks
- Accuracy of the Diffusion Approximation for Some Queuing Systems
- Entropy maximised queueing networks with blocking and multiple job classes
- On Jockeying in Queues
- Prior Probabilities
- A Statistical Mechanical Approach to Systems Analysis
- A solution for queues with instantaneous jockeying and other customer selection rules
- An Analysis of M/M/s Queueing Systems Based on the Maximum Entropy Principle
