Fleischer, F.; Gloaguen, C.; Schmidt, H.; Schmidt, V.; Schweiggert, F. Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling. (English) Zbl 1166.90005 Japan J. Ind. Appl. Math. 25, No. 3, 305-330 (2008). This paper provides an analysis of a specialized case of modulated Poisson-Voronoi tesselations. The modulation used in the paper was generated by a Boolean germ-grain model with circular grains. This means that this model can be used to model densities or spatial densities of network devices on nationwide scales. In addition, the possible randomness of the radius of the grains allows us to minimize the observed features of the towns lying in a given area. In the stationary case, the typical cell obtained by these tessellations can be regarded as a cell chosen at random out of the pool of all cells. These tessellations may either have a deterministic or random but bounded radius.Furthermore, the Poisson tessellation modulated in this way can provide Voronoi tessellation, as well as so-called inner city model or swiss cheese model. Several values of the mean distance from a randomly choosen location to its nearest Voronoi cell nucleus are used as the basic cost in many networks, especially for computating functionals, such as costs, prices, etc. These models are valuable for telecommunication operators and provide many useful characteristics important from a telecommunications point of view.The important result achieved in this paper is that the estimated cost functionals from presented models are in accordance with the values computed using theoretical framework. This means that the algorithm presented in the paper can be used in modeling practice. Reviewer: Jerzy Martyna (Kraków) Cited in 2 Documents MSC: 90B18 Communication networks in operations research 60D05 Geometric probability and stochastic geometry 90B15 Stochastic network models in operations research 05C85 Graph algorithms (graph-theoretic aspects) 90C35 Programming involving graphs or networks Keywords:stochastic geometry; network models, stochastic; graph algorithms; programming involving graphs in networks × Cite Format Result Cite Review PDF Full Text: DOI References: [1] F. Baccelli and B. Błaszczyszyn, On a coverage process ranging from the Boolean model to the Poisson-Voronoi tessellation. Advances in Applied Probability,33 (2001), 293–323. · Zbl 0986.60010 [2] F. Baccelli, C. Gloaguen and S. Zuyev, Superposition of Planar Voronoi Tessellations. Communications in Statistics, Series Stochastic Models,16 (2000), 69–98. · Zbl 0978.90013 · doi:10.1080/15326340008807577 [3] F. Baccelli, M. Klein, M. Lebourges and S. Zuyev, Geéométrie aléatoire et architecture de réseaux. Annales des Télécommunication,51 (1996), 158–179. [4] F. Baccelli, M. Klein, M. Lebourges and S. Zuyev, Stochastic geometry and architecture of communication networks. Telecommunications Systems,7 (1997), 209–227. · doi:10.1023/A:1019172312328 [5] F. Baccelli, D. Kofman and J.L. Rougier, Self organizing hierarchical multicast trees and their optimization. Proceedings of IEEE Infocom ’99, New York, 1999, 1081–1089. [6] F. Baccelli and S. Zuyev, Poisson-Voronoi spanning trees with applications to the optimization of communication networks. Operations Research,47 (1996), 619–631. · Zbl 1014.90012 · doi:10.1287/opre.47.4.619 [7] B. Błaszczyszyn and R. Schott, Approximate decomposition of some modulated Poisson-Voronoi tessellations. Advances in Applied Probability,35 (2003), 847–862. · Zbl 1041.60010 · doi:10.1239/aap/1067436322 [8] B. Błaszczyszyn and R. Schott, Approximations of functionals of some modulated Poisson-Voronoi tessellations with applications to modeling of communication networks. Japan Journal of Industrial and Applied Mathematics,22 (2004), 179–204. · Zbl 1129.90331 · doi:10.1007/BF03167437 [9] D.J. Daley and D. Vere-Jones, An Introduction to the Theory of Point Processes. Springer, New York, 1988. · Zbl 0657.60069 [10] C. Gloaguen, P. Coupé, R. Maier and V. Schmidt, Stochastic modelling of urban access networks. Proc. 10th Internat. Telecommun. Network Strategy Planning Symp. (Munich, June 2002), VDE, Berlin, 2002, 99–104. [11] C. Gloaguen, F. Fleischer, H. Schmidt and V. Schmidt, Simulation of typical Cox-Voronoi cells with a special regard to implementation tests. Mathematical Methods of Operations Research,62 (2005), 357–373. · Zbl 1081.60007 · doi:10.1007/s00186-005-0036-2 [12] C. Gloaguen, F. Fleischer, H. Schmidt and V. Schmidt, Analysis of shortest paths and subscriber line lengths in telecommunication access networks. Networks and Spatial Economics,9 (2008), in print. · Zbl 1183.90087 [13] R. Maier, J. Mayer and V. Schmidt, Distributional properties of the typical cell of stationary iterated tessellations. Mathematical Methods of Operations Research,59 (2004), 287–302. · Zbl 1065.60008 · doi:10.1007/s001860300326 [14] J. Mayer and R. Guderlei, Test oracles and randomness. Lecture Notes in Informatics,P-58, Köllen Druck+Verlag GmbH, Bonn, 2004, 179–189. [15] J. Mayer, V. Schmidt and F. Schweiggert, A unified simulation framework for spatial stochastic models. Simulation Modelling Practice and Theory,12 (2004), 307–326. · doi:10.1016/j.simpat.2004.02.001 [16] M.P. Quine and D.F. Watson, Radial generation ofn-dimensional Poisson processes. Journal of Applied Probability,21 (1984), 548–557. · Zbl 0549.60014 · doi:10.2307/3213616 [17] R. Schneider and W. Weil, Stochastische Geometrie. Teubner, Stuttgart, 2000. [18] D. Stoyan, W.S. Kendall and J. Mecke, Stochastic Geometry and Its Applications, 2nd edition. J. Wiley & Sons, Chichester, 1995. · Zbl 0838.60002 [19] K. Tchoumatchenko and S. Zuyev, Aggregate and fractal tessellations. Probability Theory Related Fields,121 (2001), 198–218. · doi:10.1007/PL00008802 [20] J.G. Wendel, A problem in geometric probability. Math. Scand.,11 (1962), 109–111. · Zbl 0108.31603 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.