Analysis of shortest paths and subscriber line lengths in telecommunication access networks

DOI10.1007/s11067-007-9021-zzbMath1183.90087OpenAlexW2122945599MaRDI QIDQ2379703

Hendrik Schmidt, C. Gloaguen, Volker Schmidt, Frank Fleischer

Publication date: 19 March 2010

Published in: Networks and Spatial Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11067-007-9021-z

zbMATH Keywords

shortest pathstochastic geometrypoint processPalm probabilityaccess networkNeveu's exchange formulaspatial tessellationsubscriber linetelecommunication network modellingtypical Cox-Voronoi cell

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Communication networks in operations research (90B18) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (6)

A sampling-based stochastic winner determination model for truckload service procurement ⋮ Shortest path distance in Manhattan Poisson line Cox process ⋮ Densities of Shortest Path Lengths in Spatial Stochastic Networks ⋮ Limit theorems for functionals on the facets of stationary random tessellations ⋮ Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling ⋮ Scaling limits for shortest path lengths along the edges of stationary tessellations

Cites Work

• Simulation of typical Cox-Voronoi cells with a special regard to implementation tests
• An introduction to the theory of point processes
• Approximations of functionals of some modulated-Poisson Voronoi tessellations with applications to modeling of communication networks
• On a coverage process ranging from the Boolean model to the Poisson–Voronoi tessellation with applications to wireless communications
• Sur les mesures de Palm de deux processus ponctuels stationnaires
• Stationary iterated tessellations
• Approximate decomposition of some modulated-Poisson Voronoi tessellations
• Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks
• Note on generalizations of Mecke's formula and extensions of H = λG
• Superposition of planar voronoi tessellations
• Aggregate and fractal tessellations
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of shortest paths and subscriber line lengths in telecommunication access networks