Presentation 2004/2/26
Application Level Multicast with Backup Parent Searching Function
Yohei KUNICHIKA, Jiro KATTO, Sakae OKUBO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, an efficient algorithm to look for backup parents in preparation of parent leaving is proposed for application level multicasting whose topology is constituted in the shape of a tree from a single source node. In conventional methods, a parent node which leaves from a multicasting tree transmits a message to all the nodes in its sub tree, and each child node starts searching for its new parent. In our proposal, each child node aims at performing efficient tree reconstruction proactively by holding the node information which indicates parent candidates.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Anolication / Level Multicast / Peercast
Paper # NS2003-255,IN2003-210
Date of Issue

Conference Information
Committee IN
Conference Date 2004/2/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Networks (IN)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Application Level Multicast with Backup Parent Searching Function
Sub Title (in English)
Keyword(1) Anolication
Keyword(2) Level Multicast
Keyword(3) Peercast
1st Author's Name Yohei KUNICHIKA
1st Author's Affiliation Graduate School of Science and Engineering, Waseda University()
2nd Author's Name Jiro KATTO
2nd Author's Affiliation Graduate School of Science and Engineering, Waseda University
3rd Author's Name Sakae OKUBO
3rd Author's Affiliation Graduate School of Science and Engineering, Waseda University
Date 2004/2/26
Paper # NS2003-255,IN2003-210
Volume (vol) vol.103
Number (no) 691
Page pp.pp.-
#Pages 6
Date of Issue