Analysis of Steiner subtrees of Random Trees for Traceroute Algorithms
<|reference_start|>Analysis of Steiner subtrees of Random Trees for Traceroute Algorithms: 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.<|reference_end|>
@article{guillemin2007analysis,
    title={Analysis of Steiner subtrees of Random Trees for Traceroute Algorithms},
    author={Fabrice Guillemin, Philippe Robert (INRIA Rocquencourt)},
    journal={Random Structures and Algorithms, 35(2):194-215, September 2009},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0702156},
    primaryClass={cs.NI cs.DS}
}