Resource sharing networks: Overview and an open problem
From MaRDI portal
Publication:5247118
DOI10.1214/13-SSY130zbMath1314.68024OpenAlexW4245673827MaRDI QIDQ5247118
Chinmoy Mandayam, Devavrat Shah, Yang Yang, J. Michael Harrison
Publication date: 23 April 2015
Full work available at URL: https://projecteuclid.org/euclid.ssy/1427462424
dynamic resource allocationentrainmenthierarchicalheavy traffic analysisresource sharing networksbandwidth sharing modelsgreedy ideal performance
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (9)
On the Optimal Control of Parallel Processing Networks with Resource Collaboration and Multitasking ⋮ Edge minimality of EDF resource sharing networks ⋮ Simple form control policies for resource sharing networks with HGI performance ⋮ Stability of linear EDF networks with resource sharing ⋮ Continuity and monotonicity of solutions to a greedy maximization problem ⋮ Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks ⋮ Diffusion Limit of Fair Resource Control—Stationarity and Interchange of Limits ⋮ Local edge minimality of SRPT networks with shared resources ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
- State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Insensitive bandwidth sharing in data networks
- Brownian models of open processing networks: Canonical representation of workload.
- Bandwidth sharing and admission control for elastic traffic
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- Fluid model for a network operating under a fair bandwidth-sharing policy.
- Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks
- Lifting projections of convex polyhedra
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Insensitivity in processor-sharing networks
- Brownian Models of Performance and Control
- A Note on Insensitivity in Stochastic Networks
- Stability of queueing networks
This page was built for publication: Resource sharing networks: Overview and an open problem
