Stochastic monotonicity of the queue lengths in closed queueing networks
Operations Research
A vertex-allocation theorem for resources in queuing networks
Journal of the ACM (JACM)
Accuracy, speed, and convergence of approximate mean value analysis
Performance Evaluation
Optimal routing for closed queueing networks
Performance Evaluation
Optimization of static traffic allocation policies
Theoretical Computer Science - Special issue on probabilistic modelling
Bilinear separation of two sets in n-space
Computational Optimization and Applications
Optimal probabilistic allocation of customer types to servers
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Asymptotic analysis of multiclass closed queueing networks: multiple bottlenecks
Performance Evaluation
Optimal stochastic scheduling in multiclass parallel queues
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Optimal routing in closed queuing networks
ACM Transactions on Computer Systems (TOCS)
Linearizer: a heuristic algorithm for queueing network models of computing systems
Communications of the ACM
Capacity Planning for Web Services: metrics, models, and methods
Capacity Planning for Web Services: metrics, models, and methods
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research
Convex Optimization
Optimal probabilistic routing in distributed parallel queues
ACM SIGMETRICS Performance Evaluation Review
An analytical model for multi-tier internet services and its applications
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Resource Allocation for Autonomic Data Centers using Analytic Performance Models
ICAC '05 Proceedings of the Second International Conference on Automatic Computing
Exploiting nonstationarity for performance prediction
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Web Service Hosting and Revenue Maximization
ECOWS '07 Proceedings of the Fifth European Conference on Web Services
A unified framework for the bottleneck analysis of multiclass queueing networks
Performance Evaluation
A capacity planning process for performance assurance of component-based distributed systems
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
The price of forgetting in parallel and non-observable queues
Performance Evaluation
SLA-based admission control for a Software-as-a-Service provider in Cloud computing environments
Journal of Computer and System Sciences
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence
Mathematics of Operations Research
| Hi-index | 0.00 |
Motivated by revenue maximization in server farms with admission control, we investigate the optimal scheduling in parallel processor-sharing queues. Incoming customers are distinguished in multiple classes and we define revenue as a weighted sum of class throughputs. Under these assumptions, we describe a heavy-traffic limit for the revenue maximization problem and study the asymptotic properties of the optimization model as the number of clients increases. Our main result is a simple heuristic that is able to provide tight guarantees on the optimality gap of its solutions. In the general case with M queues and R classes, we prove that our heuristic is (1+1M-1)-competitive in heavy-traffic. Experimental results indicate that the proposed heuristic is remarkably accurate, despite its negligible computational costs, both in random instances and using service rates of a web application measured on multiple cloud deployments.