Proactive Route Maintenance for Tree-Based Application Layer Multicast and Its Implementations
-
- KUSUMOTO Tetsuya
- School of Science and Engineering, Waseda University
-
- KATTO Jiro
- School of Science and Engineering, Waseda University
-
- OKUBO Sakae
- School of Science and Engineering, Waseda University
この論文をさがす
抄録
The purpose of this study is to maintain efficient backup routes for reconstructing overlay trees quickly. In most conventional methods, after a node leaves the trees, its child nodes start searching for the new parents. In this reactive approach, it takes a lot of time to find a new parent. In this paper, we propose a proactive approach to finding a next parent as the backup route node over the overlay tree before the current parent leaves. A proactive approach allows a node to find its new parent node immediately and switch to the backup route node smoothly. In our proposal, the structure of the overlay tree using a redundant degree can decide a backup route node without so much overhead. Simulations demonstrate our proactive approach can recover from node departures 2 times faster than reactive approaches, and can construct overlay trees with lower overheads than another proactive method. Additionally we carried out experiments over actual networks and their results support the effectiveness of our approach. We confirmed that our proposal achieved better streaming quality than conventional approaches.
収録刊行物
-
- IEICE transactions on information and systems
-
IEICE transactions on information and systems 89 (12), 2856-2866, 2006-12-01
一般社団法人電子情報通信学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1573105977404507392
-
- NII論文ID
- 110007538496
-
- NII書誌ID
- AA10826272
-
- ISSN
- 09168532
-
- 本文言語コード
- en
-
- データソース種別
-
- CiNii Articles