2001
DOI: 10.4218/etrij.01.0101.0303
|View full text |Cite
|
Sign up to set email alerts
|

Configuration of ACK Trees for Multicast Transport Protocols

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
16
0

Year Published

2002
2002
2017
2017

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(16 citation statements)
references
References 4 publications
0
16
0
Order By: Relevance
“…In the multicast session advertisement phase, all nodes obtain the group address of the multicast, the address of the sender node, and other necessary information for tree construction. This process can be realized by using a mechanism such as a web page announcement [12][13] [14]. After that, each receiver node starts to find one or more candidate repair nodes that are available in the session for its error recovery.…”
Section: Existing Schemesmentioning
confidence: 99%
See 3 more Smart Citations
“…In the multicast session advertisement phase, all nodes obtain the group address of the multicast, the address of the sender node, and other necessary information for tree construction. This process can be realized by using a mechanism such as a web page announcement [12][13] [14]. After that, each receiver node starts to find one or more candidate repair nodes that are available in the session for its error recovery.…”
Section: Existing Schemesmentioning
confidence: 99%
“…This logical tree can be constructed using a bottom-up [13], a top-down [12], or a hybrid scheme [14]. There are two options in deploying the repair nodes in tree-based protocols.…”
Section: Existing Schemesmentioning
confidence: 99%
See 2 more Smart Citations
“…This is called a top-down configuration [7]. On the other hand, the IETF RMT WG has proposed a bottom-up approach, where the receivers initiate a tree configuration.…”
Section: Protocol Overviewmentioning
confidence: 99%