2001
DOI: 10.1007/3-540-45546-9_6
|View full text |Cite
|
Sign up to set email alerts
|

An Overlay Tree Building Control Protocol

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
62
0

Year Published

2004
2004
2007
2007

Publication Types

Select...
3
3
2

Relationship

1
7

Authors

Journals

citations
Cited by 87 publications
(62 citation statements)
references
References 7 publications
0
62
0
Order By: Relevance
“…A routing algorithm is run at each node. In the tree-first approach [7,8], the application-level multicast tree is created directly (without construction of the underlying mesh). The arrival of new nodes or departure/failure of existing nodes triggers the restructuring of the tree.…”
Section: Base Tree Constructionmentioning
confidence: 99%
See 2 more Smart Citations
“…A routing algorithm is run at each node. In the tree-first approach [7,8], the application-level multicast tree is created directly (without construction of the underlying mesh). The arrival of new nodes or departure/failure of existing nodes triggers the restructuring of the tree.…”
Section: Base Tree Constructionmentioning
confidence: 99%
“…To overcome the lack of IP multicast, many application-level multicast systems have been proposed recently, e.g., [6][7][8][9][14][15][16][17]. Many of them use the delay as the single or primary metric in the tree construction, attempting to minimize the average delay among peer nodes.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…[4,5,[8][9][10][11][12][13][14][15][16])in recent years. These protocols either use a single shared tree (e.g.…”
Section: Related Workmentioning
confidence: 99%
“…As the basis for ALM, we implemented the TreeBuilding Control Protocol (TBCP) [8], a low-overhead control protocol for rapidly building latency-optimised, cost-constrained overlay trees among groups of network nodes.…”
Section: Simulationsmentioning
confidence: 99%