Resilient Capacity-Aware Multicast Tree Construction Scheme


The KIPS Transactions:PartA, Vol. 13, No. 2, pp. 147-156, Apr. 2006
10.3745/KIPSTA.2006.13.2.147,   PDF Download:

Abstract

Recently, streaming service accounts for large part of internet traffic and it is becoming the most popular service. Because of P2P's scalability, P2P-based streaming system is proposed. There are frequent leave and join of a node. To overcome the group dynamics, Multiple Multicast Trees Methods were suggested. However, since they did not consider discrepancy in peers' capacity, it may cause the trees to be long and unstable. So we suggest Resilient Capacity-Aware Multicast Tree construction scheme (R-CAT) that promotes superior peer to upper position in the tree and construct more stable and short multicast trees. By simulation we can show that R-CAT cost more overhead packets for tree joining process, but it reduce the end-to-end delay of the resulting tree and the number of packets lost during the node joining and leaving processes much more than SplitStream.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
E. S. Kim, S. Y. Han, S. Y. Park, "Resilient Capacity-Aware Multicast Tree Construction Scheme," The KIPS Transactions:PartA, vol. 13, no. 2, pp. 147-156, 2006. DOI: 10.3745/KIPSTA.2006.13.2.147.

[ACM Style]
Eun Seok Kim, Sae Young Han, and Sung Yong Park. 2006. Resilient Capacity-Aware Multicast Tree Construction Scheme. The KIPS Transactions:PartA, 13, 2, (2006), 147-156. DOI: 10.3745/KIPSTA.2006.13.2.147.