loading...
An Autonomous and Decentralized Protocol for Delay Sensitive Overlay Multicast Tree
Hachioji, Tokyo, Japan March 24-March 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2004.128163424th IEEE International Conference on ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Hirozumi Yamaguchi, Akihito Hiromori, Teruo Higashino, Kenichi Taniguchi, "An Autonomous and Decentralized Protocol for Delay Sensitive Overlay Multicast Tree," Distributed Computing Systems, International Conference on, pp. 662-669, 24th IEEE International Conference on Distributed Computing Systems (ICDCS'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ICDCS.2004.1281634,
author = {Hirozumi Yamaguchi and Akihito Hiromori and Teruo Higashino and Kenichi Taniguchi},
title = {An Autonomous and Decentralized Protocol for Delay Sensitive Overlay Multicast Tree},
journal ={Distributed Computing Systems, International Conference on},
volume = {0},
year = {2004},
issn = {1063-6927},
pages = {662-669},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.2004.1281634},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Distributed Computing Systems, International Conference on
TI - An Autonomous and Decentralized Protocol for Delay Sensitive Overlay Multicast Tree
SN - 1063-6927
SP662
EP669
A1 - Hirozumi Yamaguchi,
A1 - Akihito Hiromori,
A1 - Teruo Higashino,
A1 - Kenichi Taniguchi,
PY - 2004
KW - null
VL - 0
JA - Distributed Computing Systems, International Conference on
ER -
 
Hirozumi Yamaguchi, Osaka University
Akihito Hiromori, Osaka University
Teruo Higashino, Osaka University
Kenichi Taniguchi, Osaka University
In this paper, we present a protocol for dynamically maintaining a degree-bounded delay sensitive spanning tree in a decentralized way on overlay networks. The protocol aims at repairing the spanning tree autonomously even if multiple nodes? leave operations or failures (disappearances) occur simultaneously or continuously in a specified period. It also aims at maintaining the diameter (maximum delay) of the tree as small as possible. The simulation results using ns-2 have shown that the protocol could keep reasonable diameters compared with the existing centralized static algorithm even if many nodes? participations and disappearances occur frequently.
Citation:
Hirozumi Yamaguchi, Akihito Hiromori, Teruo Higashino, Kenichi Taniguchi, "An Autonomous and Decentralized Protocol for Delay Sensitive Overlay Multicast Tree," icdcs, pp.662-669, 24th IEEE International Conference on Distributed Computing Systems (ICDCS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.