Analysis of Steiner subtrees of Random Trees for Traceroute AlgorithmsReport as inadecuate




Analysis of Steiner subtrees of Random Trees for Traceroute Algorithms - Download this document for free, or read online. Document in PDF available to download.

1 Orange Labs Issy les Moulineaux 2 RAP - Networks, Algorithms and Probabilities Inria Paris-Rocquencourt

Abstract : We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A subset of nodes is selected according to some criterion. As a measure of efficiency of the algorithm, the Steiner distance of the selected nodes, i.e. the size of the spanning sub-tree of these nodes, is investigated. For the selection of nodes, two criteria are considered: A node is randomly selected with a probability, which is either independent of the depth of the node uniform model or else in the depth biased model, is exponentially decaying with respect to its depth. The limiting behavior the size of the discovered subtree is investigated for both models.

Keywords : Branching Process. Traceroute Algorithm. Oscillating Behavior. Asymptotic Expansion Branching Process. Traceroute Algorithm. Oscillating Behavior. Asymptotic Expansion.





Author: Fabrice Guillemin - Philippe Robert -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents