Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
The Complexity of Optimal Queuing Network Control
Mathematics of Operations Research
Optimal and heuristic policies for dynamic server allocation
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part I
A Generic Mean Field Convergence Result for Systems of Interacting Objects
QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
Analysis of Large Scale Interacting Systems by Mean Field Method
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
A class of mean field interaction models for computer and communication systems
Performance Evaluation
A mean field approach for optimization in particle systems and applications
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Grid brokering for batch allocation using indexes
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Optimal energy-aware epidemic routing in DTNs
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Distributed control of multi-agent systems with random parameters and a major agent
Automatica (Journal of IFAC)
Hi-index | 0.00 |
This paper investigates the limit behavior of Markov decision processes made of independent objects evolving in a common environment, when the number of objects (N) goes to infinity. In the finite horizon case, we show that when the number of objects becomes large, the optimal cost of the system converges to the optimal cost of a discrete time system that is deterministic. Convergence also holds for optimal policies. We further provide bounds on the speed of convergence by proving second order results that resemble central limits theorems for the cost and the state of the Markov decision process, with explicit formulas for the limit. These bounds (of order $1/\sqrt{N}$ ) are proven to be tight in a numerical example. One can even go further and get convergence of order $\sqrt{\log N}/N$ to a stochastic system made of the mean field limit and a Gaussian term. Our framework is applied to a brokering problem in grid computing. Several simulations with growing numbers of processors are reported. They compare the performance of the optimal policy of the limit system used in the finite case with classical policies by measuring its asymptotic gain. Several extensions are also discussed. In particular, for infinite horizon cases with discounted costs, we show that first order limits hold and that second order results also hold as long as the discount factor is small enough. As for infinite horizon cases with non-discounted costs, examples show that even the first order limits may not hold.