Skip to main content
Log in

Géométrie aléatoire et architecture de réseaux

Stochastic geometry and communication network architecture

  • Published:
Annales Des Télécommunications Aims and scope Submit manuscript

Résumé

Cet article propose une nouvelle approche pour l’étude d’architectures de réseaux de télécommunication, fondée sur des méthodes de géométrie aléatoire. Il résume d’abord l’état de l’art et la problématique de la planification stratégique ainsi que ses implications pour l’analyse économique avant de donner les grandes lignes et les avantages escomptés de la méthode proposée. Les modèles probabilistes, fondés sur des constructions géométriques associées des processus ponctuels aléatoires, sont ensuite introduits; diverses classes de problèmes d’évaluation de performances ou d’optimisation de réseaux se ramènent au calcul d’espérances de fonctionnelles des processus ponctuels sous-jacents. Plusieurs résultats analytiques sont obtenus pour le modèle poissonnien homogène. Les modèles plus complexes sont analysables par simulation ou par changement d’espace.

Abstract

This paper proposes a new approach for communication networks planning; this approach is based on stochastic geometry. We first summarize the state of the art in this domain, together with its economic implications, before sketching the main expectations of the proposed method. The main probabilistic tools are point processes and stochastic geometry. We show how several performance evaluation and optimization problems can actually be posed and solved within this framework by computing the mathematical expectation of certain functionals of these point processes. We both analyze models based on Poisson point processes, for which analytical formulae can sometimes be obtained, and more complex models, which can be analyzed via simulation, or change of space methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Bibliographie

  1. Aboulalaa (A.). Sur un théorème de limite conditionnelle. Application aux systèmes de capacités finies.Technical Report 2389, 1NRIA, Sophia-Antipolis, Fr (1994).

  2. Ambartzumian (R. V.). Factorization calculus and geometric probability. Encyclopedia of mathematics and its applications.Cambridge Univ. Press (1990).

  3. Blaszczyszyn (B.),Rolski (T.),Schmidt (V.). Light-traffic approximations in queues and related stochastic models.Adv. in Appl. Probab. (1995).

  4. Aurenhammer (F.). Voronoï diagrams — a survey of a fundamental geometric data structure.ACM Computing Surveys (1991),23, n° 3, pp. 345–405.

    Article  Google Scholar 

  5. Baccelli (F.), Brémaud (P.). Virtual customers in sensitivity and light traffic analysis via Campbell’s formula for point processes.Adv. in Appl. Probab. (1993),25, pp. 221–234.

    Article  MATH  MathSciNet  Google Scholar 

  6. Baccelli (F.),Brémaud (P.). Elements of queueing theory. Number 26 in Applications mathematics.Springer-Verlag (1994).

  7. Baccelli (F.). Klein (M.), Zuyev (S.). Perturbation analysis of functionals of random measures.Adv. in Appl. Probab. (1995),27, pp. 306–325.

    Article  MATH  MathSciNet  Google Scholar 

  8. Daley (D. J.), Vere-Jones (D.). An introduction to the theory of point processes.Springer, New York (1988).

    MATH  Google Scholar 

  9. Curien (N.),Gensollen (M.). Economie de télécommunications. Ouverture et réglementation.Economica-ENSPTT, Paris (1992).

  10. Foss (S.),Zuyev (S.). On a Voronoï aggregative process related to a bivariate Poisson process.Adv. in Appl. Probab. (1996),28, n°4.

    Google Scholar 

  11. Gilbert (E. N.). Random subdivisions of space into crystals.Ann. Math. Statist. (1962),33, pp. 958–972.

    Article  MATH  MathSciNet  Google Scholar 

  12. Ho (Yu.), Cao (Xi.). Perturbation analysis of discrete event dynamic sytems.Kluwer Acad. Publ., Boston (1991).

    Google Scholar 

  13. Kallenberg (O.). Random measures.Akademie-Verlag and Academic Press (1983).

  14. Kerstan (J.),Matthes (K.),Mecke (J.). Infinitely divisible point processes. In Russian,Nauka (1982).

  15. Kingman (J. F. C). Poisson processes. Oxford studies in probability.Oxford Univ. Press. (1993).

  16. Kleinrock (L.). Queueing systems. Volume I : Theory.Wiley (1975).

  17. Lebourges (M.),Olivier (P.),Petit (D.). Modèle statistico analytique des blocages dans un réseau téléphonique.Ann. télécommunic. (1996), à paraître.

  18. Møller (J.). Random tesselations in Rd Adv. in Appl. Probab. (1989),21, pp. 37–73.

    Article  MathSciNet  Google Scholar 

  19. Møller (J.). Lectures on random Voronoï tesselations, volume 87 of Lect. Notes in Statist.Springer-Verlag (1994).

  20. Møller (J.),Zuyev (S.). Gamma-type results and other related properties of Poisson processes.Adv. in Appl. Probab. (1996), 28.

  21. Matheron (G.). Random sets and integral geometry.Wiley, New York (1975).

    MATH  Google Scholar 

  22. Mecke (J.). Stationäre zufällige Masse auf localcompakten Abelischen Gruppen.Z. Wahrsch. verw. Gebiete (1967),9, pp. 36–58.

    Article  MATH  MathSciNet  Google Scholar 

  23. Meijering (J. L.). Interface area, edge length and number of vertices in crystal aggregates with random nucleation.Philips Res. Rep. (1957),8, pp. 270–290.

    Google Scholar 

  24. Muche (L.), Stoyan (D.). Contact and chord length distributions of the Poisson Voronoï tesselation.J. Appl. Probab. (1992),29, pp. 467–471.

    Article  MATH  MathSciNet  Google Scholar 

  25. Okabe (A.),Boots (B.),Sugihara (K.). Spatial tesselations. Wiley series in probability and mathematical statistics.Wiley (1992).

  26. Hoffmann-Jørgensen (J.),Liggett (T. M.),Neveu (J.). Ecole d’été de probabilité de Saint-Flour VI-1976, volume 58 of Lect. Notes in Math.Springer-Verlag (1976).

  27. Sallai (G.). Optimal network structure with randomly distributed nodes. In12th International Teletraffic Congress, Torino (June 1988), p. 2.1B.4.

  28. Slivnyak (I. M.). Some properties of stationary flow of homogeneous random events.Teoriya Veroyatn. i Primenen. (1962).7, pp. 347–352, in Russian. English tranlation:Theory Probab. Appl. 7, pp. 336–341.

    Google Scholar 

  29. Stoyan (D.),Kendall (W. S.),Mecke (J.) Stochastic geometry and its applications. Wiley series in probability and mathematical statistics.Wiley, Chichester (1987).

  30. Zuyev (S.). Poisson power tesselations.Technical Report 2303,INRIA, Sophia-Antipolis, Fr (juillet 1994).

  31. Baccelli (F.),Zuyev (S.). Stochastic geometry models of mobile communication networks. In frontiers in queuing. Models, methods and problems.Eds. J.H. Dshalalow, CRC Press (1996).

  32. Zuyev (S.),Rakotoarisoa (H.),Desnogues (P.). Simulations of large telecommunication networks based on probabilistic modeling.Proceedings of the 4th Int. Conf. on Telecommunication Systems, Nashville, USA (March 21–24, 1996).

Download references

Author information

Authors and Affiliations

Authors

Additional information

Travaux de recherche effectués dans le cadre des conventions de recherche 93 5 B 033 et CTI 94 1B 104.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baccelli, F., Klein, M., Lebourges, M. et al. Géométrie aléatoire et architecture de réseaux. Ann. Télécommun. 51, 158–179 (1996). https://doi.org/10.1007/BF02995506

Download citation

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02995506

Mots clés

Key words

Navigation