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

DOI10.1007/S11067-007-9021-ZMaRDI QIDQ2379703zbMATH OpenOpenAlexFDO

Authors Catherine Gloaguen, Hendrik Schmidt, Frank Fleischer, Volker Schmidt

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

access networkNeveu's exchange formulaPalm probabilitypoint processshortest pathspatial tessellationstochastic geometrysubscriber linetelecommunication network modellingtypical Cox-Voronoi cell

Mathematics Subject Classification ID

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

Recommendations

• Some analytical results for congestion in subscriber line modules
• Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks
• Estimate of resource distribution with the shortest paths in the multiuser network
• Analysis of the influence of the subscriber traffic structure on the speed of multiplexed connections
• Short-length routes in low-cost networks via Poisson line patterns
• Shortest paths in a lattice network: A comparative study
• scientific article; zbMATH DE number 1396723
• Link-Length Minimization in Networks
• The network redesign problem for access telecommunications networks
• Characterization results of all shortest paths interval routing schemes

Cites work

• Aggregate and fractal tessellations
• An introduction to the theory of point processes
• Approximate decomposition of some modulated-Poisson Voronoi tessellations
• Approximations of functionals of some modulated-Poisson Voronoi tessellations with applications to modeling of communication networks
• scientific article; zbMATH DE number 1350310 (Why is no real title available?)
• scientific article; zbMATH DE number 1734461 (Why is no real title available?)
• scientific article; zbMATH DE number 786469 (Why is no real title available?)
• Note on generalizations of Mecke's formula and extensions of H = λG
• On a coverage process ranging from the Boolean model to the Poisson-Voronoi tessellation with applications to wireless communications
• Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks
• Simulation of typical Cox-Voronoi cells with a special regard to implementation tests
• Stationary iterated tessellations
• Superposition of planar voronoi tessellations
• Sur les mesures de Palm de deux processus ponctuels stationnaires

Cited in

(11)

• Simulation algorithm of typical modulated Poisson-Voronoi cells and application to telecommunication network modelling
• A stochastic model for multi-hierarchical networks
• Limit theorems for functionals on the facets of stationary random tessellations
• A sampling-based stochastic winner determination model for truckload service procurement
• Shortest path distance in Manhattan Poisson line Cox process
• A parametric copula approach for modelling shortest-path trees in telecommunication networks
• Capacity distributions in spatial stochastic models for telecommunication networks
• Scaling limits for shortest path lengths along the edges of stationary tessellations
• Conditional length distributions induced by the coverage of two points by a Poisson Voronoï tessellation: application to a telecommunication model
• Densities of shortest path lengths in spatial stochastic networks
• Random tessellations and Cox processes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379703)