Allocation of flows in closed bipartite queueing networks
From MaRDI portal
Recommendations
- On the Optimal Allocation of Servers and Workloads in Closed Queueing Networks
- Characteristics of optimal workload allocation for closed queueing networks
- scientific article; zbMATH DE number 934470
- Optimal workload allocation in closed queueing networks with state dependent queues
- scientific article; zbMATH DE number 6379042
- On a class of approximations for closed queueing networks
- A Fixed-Point Algorithm for Closed Queueing Networks
- scientific article; zbMATH DE number 870457
- scientific article; zbMATH DE number 3843466
- Allocation of buffer capacities in queueing networks with arbitrary topologies
Cites work
- scientific article; zbMATH DE number 5665896 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks
- A note on the convexity of performance measures of M/M/c queueing systems
- A vertex-allocation theorem for resources in queuing networks
- Analyzing Computer System Performance with Perl::PDQ
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
- Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach
- Choosing a Good Appointment System—A Study of Queues of the Type (D, M, 1)
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Computational algorithms for closed queueing networks with exponential servers
- Critical thresholds for dynamic routing in queueing networks
- Dynamic Routing in a Queueing System with a Multiple Service Facility
- Dynamic routing in large-scale service systems with heterogeneous servers
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
- Fundamentals of queueing theory
- Individual versus Social Optimization in the Allocation of Customers to Alternative Servers
- Maximizing throughput in finite-source parallel queue systems
- Mean-Value Analysis of Closed Multichain Queuing Networks
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Open and Closed Models for Networks of Queues
- Optimal Design of Queueing Systems
- Optimal Routing in Closed Queueing Networks with State Dependent Queues
- Optimal Workload Allocation in Open Networks of Multiserver Queues
- Optimal balancing of I/O requests to disks
- Optimal control of a queueing system with two heterogeneous servers
- Optimal dynamic routing in flexible manufacturing systems with limited buffers
- Optimal pricing for service facilities with self-optimizing customers
- Optimal routing for closed queueing networks
- Optimal static customer routing in a closed queuing network
- Optimality of the round-robin routing policy
- Optimality of the shortest line discipline
- Price-Directed Control of a Closed Logistics Queueing Network
- Resource allocation in state-dependent emergency evacuation networks
- Self-interested routing in queueing networks
- The Regulation of Queue Size by Levying Tolls
- The convexity of the mean queue size of the M/M/c queue with respect to the traffic intensity
- The price of anarchy is independent of the network topology
- To queue or not to queue: equilibrium behavior in queueing systems.
- Uniqueness of the solution for optimal static routing in open BCMP queueing networks
This page was built for publication: Allocation of flows in closed bipartite queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323531)
