For real-time video streaming, tree-based Application Level Multicasts (ALMs) are effective with respect to transmission delay and jitter. In particular, multiple-tree ALMs can alleviate the inefficient use of upload bandwidth among the nodes. However, most conventional multiple-tree ALMs are constructed using a Distributed Hash Table (DHT). This causes considerable delay and consumes substantial network resources because the DHT, generally, does not take distances in the IP network into account. In addition, the network constructed by a DHT has poor churn resilience because the network needs to reconstruct all the substreams of the tree network. In this paper, we propose a construction method involving overlapped cluster trees for delivering streamed data that are churn resilient. In addition, these overlapped cluster trees can decrease both the delay and the consumption of network resources because the node-connecting process takes IP network distances into account. In the proposed method, clusters are divided or merged using their numbers of members to optimize cluster size. We evaluated the performance of the proposed method via extensive computer simulations. The results show that the proposed method is more effective than conventional multiple-tree ALMs.
Tomoki MOTOHASHI
Osaka University
Akihiro FUJIMOTO
Osaka University
Yusuke HIROTA
Osaka University
Hideki TODE
Osaka Prefecture University
Koso MURAKAMI
Osaka University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tomoki MOTOHASHI, Akihiro FUJIMOTO, Yusuke HIROTA, Hideki TODE, Koso MURAKAMI, "A Resilient Video Streaming System Based on Location-Aware Overlapped Cluster Trees" in IEICE TRANSACTIONS on Communications,
vol. E96-B, no. 11, pp. 2865-2874, November 2013, doi: 10.1587/transcom.E96.B.2865.
Abstract: For real-time video streaming, tree-based Application Level Multicasts (ALMs) are effective with respect to transmission delay and jitter. In particular, multiple-tree ALMs can alleviate the inefficient use of upload bandwidth among the nodes. However, most conventional multiple-tree ALMs are constructed using a Distributed Hash Table (DHT). This causes considerable delay and consumes substantial network resources because the DHT, generally, does not take distances in the IP network into account. In addition, the network constructed by a DHT has poor churn resilience because the network needs to reconstruct all the substreams of the tree network. In this paper, we propose a construction method involving overlapped cluster trees for delivering streamed data that are churn resilient. In addition, these overlapped cluster trees can decrease both the delay and the consumption of network resources because the node-connecting process takes IP network distances into account. In the proposed method, clusters are divided or merged using their numbers of members to optimize cluster size. We evaluated the performance of the proposed method via extensive computer simulations. The results show that the proposed method is more effective than conventional multiple-tree ALMs.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.2865/_p
Copy
@ARTICLE{e96-b_11_2865,
author={Tomoki MOTOHASHI, Akihiro FUJIMOTO, Yusuke HIROTA, Hideki TODE, Koso MURAKAMI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Resilient Video Streaming System Based on Location-Aware Overlapped Cluster Trees},
year={2013},
volume={E96-B},
number={11},
pages={2865-2874},
abstract={For real-time video streaming, tree-based Application Level Multicasts (ALMs) are effective with respect to transmission delay and jitter. In particular, multiple-tree ALMs can alleviate the inefficient use of upload bandwidth among the nodes. However, most conventional multiple-tree ALMs are constructed using a Distributed Hash Table (DHT). This causes considerable delay and consumes substantial network resources because the DHT, generally, does not take distances in the IP network into account. In addition, the network constructed by a DHT has poor churn resilience because the network needs to reconstruct all the substreams of the tree network. In this paper, we propose a construction method involving overlapped cluster trees for delivering streamed data that are churn resilient. In addition, these overlapped cluster trees can decrease both the delay and the consumption of network resources because the node-connecting process takes IP network distances into account. In the proposed method, clusters are divided or merged using their numbers of members to optimize cluster size. We evaluated the performance of the proposed method via extensive computer simulations. The results show that the proposed method is more effective than conventional multiple-tree ALMs.},
keywords={},
doi={10.1587/transcom.E96.B.2865},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - A Resilient Video Streaming System Based on Location-Aware Overlapped Cluster Trees
T2 - IEICE TRANSACTIONS on Communications
SP - 2865
EP - 2874
AU - Tomoki MOTOHASHI
AU - Akihiro FUJIMOTO
AU - Yusuke HIROTA
AU - Hideki TODE
AU - Koso MURAKAMI
PY - 2013
DO - 10.1587/transcom.E96.B.2865
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2013
AB - For real-time video streaming, tree-based Application Level Multicasts (ALMs) are effective with respect to transmission delay and jitter. In particular, multiple-tree ALMs can alleviate the inefficient use of upload bandwidth among the nodes. However, most conventional multiple-tree ALMs are constructed using a Distributed Hash Table (DHT). This causes considerable delay and consumes substantial network resources because the DHT, generally, does not take distances in the IP network into account. In addition, the network constructed by a DHT has poor churn resilience because the network needs to reconstruct all the substreams of the tree network. In this paper, we propose a construction method involving overlapped cluster trees for delivering streamed data that are churn resilient. In addition, these overlapped cluster trees can decrease both the delay and the consumption of network resources because the node-connecting process takes IP network distances into account. In the proposed method, clusters are divided or merged using their numbers of members to optimize cluster size. We evaluated the performance of the proposed method via extensive computer simulations. The results show that the proposed method is more effective than conventional multiple-tree ALMs.
ER -