Analysis of Steiner Subtrees of Random Trees for Traceroute Algorithms

被引：0

作者：

Guillemin, Fabrice ^{[2
]}

Robert, Philippe ^{[1
]}

机构：

[1] INRIA Rocquencourt, RAP Project, F-78153 Le Chesnay, France

[2] Orange Labs, F-22300 Lannion, France

来源：

RANDOM STRUCTURES & ALGORITHMS | 2009年 / 35卷 / 02期

关键词：

traceroute algorithm; Steiner distance; branching processes; oscillating behavior; asymptotic expansion; BINARY SEARCH-TREES; DISTANCES;

D O I：

10.1002/rsa.20263

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We consider in this article 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 subtree 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. (C) 2009 Wiley Periodicals. Inc. Random Struct. Alg., 35, 194-215, 2009

引用

页码：194 / 215

页数：22

共 50 条

[1] Distinct Fringe Subtrees in Random Trees
Seelbach Benkner, Louisa
Wagner, Stephan
[J]. ALGORITHMICA, 2022, 84 (12) : 3686 - 3728
[2] Distinct Fringe Subtrees in Random Trees
Louisa Seelbach Benkner
Stephan Wagner
[J]. Algorithmica, 2022, 84 : 3686 - 3728
[3] ON STEINER TREES AND GENETIC ALGORITHMS
HESSER, J
MANNER, R
STUCKY, O
[J]. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1991, 565 : 509 - 525
[4] Algorithms for terminal Steiner trees
Martinez, FV
de Pina, JC
Soares, J
[J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2005, 3595 : 369 - 379
[5] Algorithms for terminal Steiner trees
Martinez, Fabio Viduani
de Pina, Jose Coelho
Soares, Jose
[J]. THEORETICAL COMPUTER SCIENCE, 2007, 389 (1-2) : 133 - 142
[6] NEAR OPTIMAL-ALGORITHMS FOR FINDING MINIMUM STEINER TREES ON RANDOM GRAPHS
KUCERA, L
MARCHETTISPACCAMELA, A
PROTASI, M
TALAMO, M
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 501 - 511
[7] Protected nodes and fringe subtrees in some random trees
Devroye, Luc
Janson, Svante
[J]. ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2014, 19 : 1 - 10
[8] Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
Thomas, Doreen A.
Weng, Jia F.
[J]. OPTIMIZATION LETTERS, 2014, 8 (04) : 1337 - 1359
[9] On the richness of the collection of subtrees in random binary search trees
Devroye, L
[J]. INFORMATION PROCESSING LETTERS, 1998, 65 (04) : 195 - 199
[10] Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
Doreen A. Thomas
Jia F. Weng
[J]. Optimization Letters, 2014, 8 : 1337 - 1359

← 1 2 3 4 5 →