Proactive route maintenance for tree-based application layer multicast and its implementations

Tetsuya Kusumoto*, Jiro Katto, Sakae Okubo


研究成果: Article査読

2 被引用数 (Scopus)


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
出版ステータスPublished - 2006 12月

ASJC Scopus subject areas

  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ビジョンおよびパターン認識
  • 電子工学および電気工学
  • 人工知能


「Proactive route maintenance for tree-based application layer multicast and its implementations」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。