Abstract
We extend the Stochastic Subscriber Line Model by the introduction of shortest-path trees which are obtained by splitting up the segment system of the typical serving zone at its crossings and endings. Due to reasons in the complex field of cost and capacity estimation in telecommunication networks, it is desirable to gain knowledge about distributional properties of the branches of these trees. The present paper shows how to obtain parametric approximation formulas for the univariate density functions of the lengths of the two main branches in shortest-path trees. Besides, we derive a joint bivariate distribution for the lengths of these branches by means of copula functions, i.e., we give a parametric composition formula of the marginals. These approximative parametric representation formulas can be used in order to prevent time consuming computer experiments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bose, P., Devroye, L., Evans, W., Kirkpatrick, D.: On the spanning ratio of Gabriel graphs and β-skeletons. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 479–493. Springer, Heidelberg (2002)
Calka, P.: The distributions of the smallest disks containing the Poisson-Voronoi typical cell and the Crofton cell in the plane. Advances in Applied Probability 34, 702–717 (2002)
Daley, D.J., Vere-Jones, D.: An Introduction to the Theory of Point Processes, vol. I/II. Springer, New York (August 2005)
Gloaguen, C., Voss, F., Schmidt, V.: Parametric distributions of connection lengths for the efficient analysis of fixed access network. Annals of Telecommunications 66, 103–118 (2011)
Hirsch, C., Neuhäuser, D., Gloaguen, C., Schmidt, V.: First-passage percolation on random geometric graphs and its applications to shortest-path trees. Advances in Applied Probability (submitted)
Hirsch, C., Neuhäuser, D., Gloaguen, C., Schmidt, V.: Asymptotic properties of Euclidean shortest-path trees and applications in telecommunication networks. Working paper (under preparation)
Mai, J.-F., Scherer, M.: Simulating Copulas: Stochastic Models, Sampling Algorithms, and Applications. Imperial College Press, London (2012)
Neuhäuser, D., Hirsch, C., Gloaguen, C., Schmidt, V.: On the distribution of typical shortest-path lengths in connected random geometric graphs. Queueing Systems 71, 199–220 (2012)
Ruppert, D.: Statistics and Data Analysis for Financial Engineering. Springer Texts in Statistics, New York (2010)
Schneider, R., Weil, W.: Stochastic and Integral Geometry. Springer, Berlin (2008)
Stoyan, D., Kendall, W.S., Mecke, J.: Stochastic Geometry and its Applications. J. Wiley & Sons, Chichester (1995)
Voss, F., Gloaguen, C., Schmidt, V.: Capacity distributions in spatial stochastic models for telecommunication networks. Image Analysis and Stereology 28, 155–163 (2009)
Voss, F., Gloaguen, C., Schmidt, V.: Scaling limits for shortest path lengths along the edges of stationary tessellations. Advances in Applied Probability 42, 936–952 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neuhäuser, D., Hirsch, C., Gloaguen, C., Schmidt, V. (2013). A Parametric Copula Approach for Modelling Shortest-Path Trees in Telecommunication Networks. In: Dudin, A., De Turck, K. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2013. Lecture Notes in Computer Science, vol 7984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39408-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-39408-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39407-2
Online ISBN: 978-3-642-39408-9
eBook Packages: Computer ScienceComputer Science (R0)