Presentation 2013-03-08
A Proposal of Graph Construction Random Nodes Leaving for Application Level Multicast
Taiki KIMURA, Nobuyuki TAKAHASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A multicast tree for Application-Level-Multicast is reconstructed each time node leaves. Therefore, there is problem that delivery becomes unstable when nodes often leave. Existing research has shown that technique of maintaining proactive route. However, there are problems that length of a multicast tree after the reconstruction tends to grow. We propose a graph construction method for Application-Level-Multicast using a proactive route and alternative node. We evaluate the proposed method by experiment in ns-2. We show that our proposal method constructs a shorter multicast tree compared to an existing method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Application-Level-Multicast / overlay network / proactive route
Paper # NS2012-262
Date of Issue

Conference Information
Committee NS
Conference Date 2013/2/28(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 Network Systems(NS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Proposal of Graph Construction Random Nodes Leaving for Application Level Multicast
Sub Title (in English)
Keyword(1) Application-Level-Multicast
Keyword(2) overlay network
Keyword(3) proactive route
1st Author's Name Taiki KIMURA
1st Author's Affiliation Graduate School of Systems Information Science, Future University Hakodate()
2nd Author's Name Nobuyuki TAKAHASHI
2nd Author's Affiliation School of Systems Information Science, Future University Hakodate
Date 2013-03-08
Paper # NS2012-262
Volume (vol) vol.112
Number (no) 463
Page pp.pp.-
#Pages 6
Date of Issue