On a class of approximations for closed queueing networks
This paper presents some analytical results concerning an approximation procedure for closed queueing networks. The procedure is well-known and has been found useful for product-form networks where large numbers of queues, jobs or job classes prohibit an exact analysis, as well as for networks which do not possess product-form. The procedure represents the mean sojourn time at a queue as a function of the throughput of the queue, and derives a set of fixed point equations for the throughputs of the various job classes. We begin by showing that under a mild regularity condition the fixed point equations have a unique solution. Then we show that derivatives of performance measures can be readily calculated, and that their simple form provides an interesting insight into capacity allocation in closed queueing networks.
- Approximate Analysis Of Bulk Closed Queueing Networks
- Strong Approximations of Irreducible Closed Queueing Networks
- On the asymptotic behaviour of closed multiclass queueing networks
- A unifying framework for the approximate solution of closed multiclass queuing networks
- Exact-order asymptotic analysis for closed queueing networks
- scientific article; zbMATH DE number 4068580
- Simple bounds for closed queueing networks
- Two classes of performance bounds for closed queueing networks
- A Minimum Delay Routing Algorithm Using Distributed Computation
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 4068014 (Why is no real title available?)
- Open and Closed Models for Networks of Queues
- Routing and Capacity Allocation in Networks with Trunk Reservation
- Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks
- Proportional fairness and its relationship with multi-class queueing networks
- Analysis of closed hyper-Erlang queueing networks by the method of fictitious stages
- Realization probability in multi-class closed queueing networks
- Closed two node priority queueing networks
- Approximate analysis for queueing networks with finite capacity and customer loss
- Approximate techniques for general closed queueing networks with subnetworks having population constraints
- Approximate analysis of a Gordon-Newell like non-product-form queueing network
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- An operational approach to perturbation analysis of closed queuing networks
- Resource pooling in congested networks: Proportional fairness and product form
- Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes
- General open and closed queueing networks with blocking: a unified framework for approximation
- Exact-order asymptotic analysis for closed queueing networks
- Notes on the stability of closed queueing networks
- scientific article; zbMATH DE number 3886852 (Why is no real title available?)
- Allocation of flows in closed bipartite queueing networks
- Algorithms for nonintegral degrees of multiprogramming in closed queuing networks
- Heuristic analysis of closed queueing networks
- scientific article; zbMATH DE number 5116725 (Why is no real title available?)
- A Fixed-Point Algorithm for Closed Queueing Networks
- scientific article; zbMATH DE number 3925942 (Why is no real title available?)
- Open and Closed Models for Networks of Queues
- Approximate solutions for a class of non-product form queueing network models
- The static property of a perturbed multiclass closed queueing network and decomposition
- A linear programming problem in separable closed queueing networks
- Properties and performance bounds for closed free choice synchronized monoclass queueing networks
- Operational analysis of stochastic closed queueing networks
- An Approach to Analyzing the Behavior of Some Queueing Networks
- A product-form approximation method for general closed queueing networks with several classes of customers
- Bounding errors introduced by clustering of customers in closed product-form queuing networks
- Strong Approximations of Irreducible Closed Queueing Networks
- scientific article; zbMATH DE number 1159047 (Why is no real title available?)
- On the asymptotic behaviour of closed multiclass queueing networks
- Approximate Description of Dynamics of a Closed Queueing Network Including Multi-servers
- A unifying framework for the approximate solution of closed multiclass queuing networks
- Approximate Analysis Of Bulk Closed Queueing Networks
- Closed-Form Solution of a LAN Gateway Queueing Model
- Utility Optimization in Congested Queueing Networks
- On the effect of time preferences on the price of anarchy
- A zero-or-one law in aggregated closed queueing networks
- Approximate analysis of a closed fork/join model
This page was built for publication: On a class of approximations for closed queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115026)
