Optimization of static traffic allocation policies
Theoretical Computer Science - Special issue on probabilistic modelling
The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
Journal of the ACM (JACM)
How Useful Is Old Information?
IEEE Transactions on Parallel and Distributed Systems
Task assignment with unknown duration
Journal of the ACM (JACM)
An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
Convex Optimization
Optimal probabilistic routing in distributed parallel queues
ACM SIGMETRICS Performance Evaluation Review
Optimal Routing in Two Parallel Queues with Exponential Service Times
Discrete Event Dynamic Systems
Algorithmic Game Theory
The effect of local scheduling in load balancing designs
ACM SIGMETRICS Performance Evaluation Review
A comparative analysis of server selection in content replication networks
IEEE/ACM Transactions on Networking (TON)
Dynamic scheduling for heterogeneous Desktop Grids
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The price of anarchy in parallel queues revisited
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Price of anarchy in non-cooperative load balancing
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Transactions on Parallel and Distributed Systems
The price of anarchy in an exponential multi-server
Operations Research Letters
Algorithms for generalized round robin routing
Operations Research Letters
Energy-aware capacity scaling in virtualized environments with performance guarantees
Performance Evaluation
Heavy-traffic revenue maximization in parallel multiclass queues
Performance Evaluation
| Hi-index | 0.00 |
We consider a broker-based network of non-observable parallel queues and analyze the minimum expected response time and the optimal routing policy when the broker has the memory of its previous routing decisions. We provide lower bounds on the minimum response time by means of convex programming that are tight, as follows by a numerical comparison with a proposed routing scheme. The ''Price of Forgetting'' (PoF), the ratio between the minimum response times achieved by a probabilistic broker and a broker with memory, is shown to be unbounded or arbitrarily close to one depending on the coefficient of variation of the service time distributions. In the case of exponential service times, the PoF is bounded from above by two, which is tight in heavy-traffic, and independent of the network size and heterogeneity. These properties yield a simple engineering product-form approximating tightly the minimum response time. Finally, we put our results in the context of game theory revisiting the ''Price of Anarchy'' (PoA) of parallel queues: it can be decomposed into the product of the PoA achieved by a probabilistic broker (already well understood) and the PoF.