The Annals of Applied Probability

Load optimization in a planar network

Charles Bordenave and Giovanni Luca Torrisi

Full-text: Open access

Abstract

We analyze the asymptotic properties of a Euclidean optimization problem on the plane. Specifically, we consider a network with three bins and n objects spatially uniformly distributed, each object being allocated to a bin at a cost depending on its position. Two allocations are considered: the allocation minimizing the bin loads and the allocation allocating each object to its less costly bin. We analyze the asymptotic properties of these allocations as the number of objects grows to infinity. Using the symmetries of the problem, we derive a law of large numbers, a central limit theorem and a large deviation principle for both loads with explicit expressions. In particular, we prove that the two allocations satisfy the same law of large numbers, but they do not have the same asymptotic fluctuations and rate functions.

Article information

Source
Ann. Appl. Probab., Volume 20, Number 6 (2010), 2040-2085.

Dates
First available in Project Euclid: 19 October 2010

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1287494554

Digital Object Identifier
doi:10.1214/09-AAP676

Mathematical Reviews number (MathSciNet)
MR2759728

Zentralblatt MATH identifier
1205.60042

Subjects
Primary: 60F05: Central limit and other weak theorems 60F10: Large deviations
Secondary: 90B18: Communication networks [See also 68M10, 94A05] 90C27: Combinatorial optimization

Keywords
Euclidean optimization law of large numbers central limit theorem large deviations calculus of variations wireless networks

Citation

Bordenave, Charles; Torrisi, Giovanni Luca. Load optimization in a planar network. Ann. Appl. Probab. 20 (2010), no. 6, 2040--2085. doi:10.1214/09-AAP676. https://projecteuclid.org/euclid.aoap/1287494554


Export citation

References

  • [1] Billingsley, P. (1968). Convergence of Probability Measures. Wiley, New York.
  • [2] Bordenave, C. (2006). Spatial capacity of multiple-access wireless networks. IEEE Trans. Inform. Theory 52 4977–4988.
  • [3] Buttazzo, G., Giaquinta, M. and Hildebrandt, S. (1998). One-Dimensional Variational Problems. Oxford Lecture Series in Mathematics and Its Applications 15. Oxford Univ. Press, New York.
  • [4] Dembo, A. and Zeitouni, O. (1998). Large Deviations Techniques and Applications, 2nd ed. Applications of Mathematics (New York) 38. Springer, New York.
  • [5] Dudley, R. M. (1999). Uniform Central Limit Theorems. Cambridge Studies in Advanced Mathematics 63. Cambridge Univ. Press, Cambridge.
  • [6] Murray, J. D. (1984). Asymptotic Analysis, 2nd ed. Applied Mathematical Sciences 48. Springer, New York.
  • [7] O’Connell, N. (2000). A large deviations heuristic made precise. Math. Proc. Cambridge Philos. Soc. 128 561–569.
  • [8] Royden, H. L. (1988). Real Analysis, 3rd ed. Macmillan, New York.
  • [9] Tse, D. and Viswanath, P. (2005). Fundamentals of Wireless Communication. Cambridge Univ. Press, New York.