Analysis of Steiner subtrees of Random Trees for Traceroute Algorithms

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.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00133676
Contributor : Philippe Robert <>
Submitted on : Friday, June 6, 2008 - 12:09:40 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Tuesday, September 21, 2010 - 4:26:19 PM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00133676, version 2
  • ARXIV : cs/0702156

Collections

Citation

Fabrice Guillemin, Philippe Robert. Analysis of Steiner subtrees of Random Trees for Traceroute Algorithms. 2008. ⟨inria-00133676v2⟩

Share

Metrics

Record views

250

Files downloads

257