Tree and Group Based Reliable Multicast Protocol
Yun Fu
Abstract
Yun Fu
Abstract
The paper proposes a reliable multicast protocol which is appropriate for real-time and interactive collaborative environment. The control tree and grouping mechanism are introduced to make error recovery localized, which can efficiently decrease the amount of packet stream on the backbone of network and the workload of host. Analysis shows that the protocol has perfect throughput and can be extended to very wide applications.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The paper proposes a reliable multicast protocol which is appropriate for real-time and interactive collaborative environment. The control tree and grouping mechanism are introduced to make error recovery localized, which can efficiently decrease the amount of packet stream on the backbone of network and the workload of host. Analysis shows that the protocol has perfect throughput and can be extended to very wide applications.
Key concepts: Multicast, Computer science, Computer network, Reliable multicast, Protocol Independent Multicast, Tree (set theory), Protocol (science), Distance Vector Multicast Routing Protocol