An Autonomous and Decentralized Protocol for Delay Sensitive Overlay Multicast Tree

Authors:
Hirozumi Yamaguchi;Akihito Hiromori;Teruo Higashino;Kenichi Taniguchi
Affiliations:
-;-;-;-
Venue:
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Year:
2004

Citing 0
Cited 2

Capacity-Aware Multicast Algorithms on Heterogeneous Overlay Networks

IEEE Transactions on Parallel and Distributed Systems
ACOM: Any-source Capacity-constrained Overlay Multicast in Non-DHT P2P Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.