Optimal Routing in Closed Queueing Networks with State Dependent Queues
From MaRDI portal
Recommendations
- Optimal routing for closed queueing networks
- Optimal static customer routing in a closed queuing network
- Optimal workload allocation in closed queueing networks with state dependent queues
- Optimal dynamic routing in Markov queueing networks
- scientific article; zbMATH DE number 870457
- Optimal routing parameters for queueing networks: their determination methods
- Multiclass Queueing Networks with State-Dependent Routing
- Optimal routing and buffer allocation for a class of finite capacity queueing systems
- OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS
Cites work
- A vertex-allocation theorem for resources in queuing networks
- An \(M/G/C/C\) state-dependent network simulation model
- Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks
- Braess's paradox in a loss network
- Braess's paradox in a queueing network with state-dependent routing
- Combining routing and buffer allocation problems in series-parallel queueing networks
- Comparison of Policies for Routing Customers to Parallel Queueing Systems
- Dynamic routing in large-scale service systems with heterogeneous servers
- Generalized \(M/G/C/C\) state dependent queueing models and pedestrian traffic flows
- Generalized concavity
- Mean value analysis for multiclass closed queueing network models of flexible manufacturing systems with limited buffers
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Optimal dynamic routing in flexible manufacturing systems with limited buffers
- Optimal routing for closed queueing networks
- Optimal static customer routing in a closed queuing network
- Queue-and-idleness-ratio controls in many-server service systems
- Routing and Capacity Allocation in Networks with Trunk Reservation
- Routing in circuit-switched networks: optimization, shadow prices and decentralization
Cited in
(8)- State-dependent routing on symmetric loss networks with trunk reservations. II: Asymptotics, optimal design
- Optimal routing parameters for queueing networks: their determination methods
- Uniqueness of the solution for optimal static routing in open BCMP queueing networks
- The evaluation of pedestrians' behavior using \(M/G/C/C\) analytical, weighted distance and real distance simulation models
- Allocation of flows in closed bipartite queueing networks
- Queue decomposition \& finite closed queueing network models
- Braess's paradox in a queueing network with state-dependent routing
- User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
This page was built for publication: Optimal Routing in Closed Queueing Networks with State Dependent Queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102716)