A Cost-Effective Buffer Map Notification Scheme for P2P VoDs Supporting VCR Operations

Ryusuke UEDERA; Satoshi FUJITA

doi:10.1587/transinf.E96.D.2713

A Cost-Effective Buffer Map Notification Scheme for P2P VoDs Supporting VCR Operations

Ryusuke UEDERA, Satoshi FUJITA

Full Text Views

0

Cite this

Summary :

In this paper, we propose a new buffer map notification scheme for Peer-to-Peer Video-on-Demand systems (P2P VoDs) which support VCR operations such as fast-forward, fast-backward, and seek. To enhance the fluidity of such VCR operations, we need to refine the size of each piece as small as possible. However, such a refinement significantly degrades the performance of buffer map notification schemes with respect to the overhead, piece availability and the efficiency of resource utilizations. The basic idea behind our proposed scheme is to use a piece-based buffer map with a segment-based buffer map in a complementary manner. The result of simulations indicates that the proposed scheme certainly increases the accuracy of the information on the piece availability in the neighborhood with a sufficiently low cost, which reduces the intermittent waiting time of each peer by more than 40% even under a situation in which 50% of peers conduct the fast-forward operation over a range of 30% of the entire video.

Publication: IEICE TRANSACTIONS on Information Vol.E96-D No.12 pp.2713-2719

Publication Date: 2013/12/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1587/transinf.E96.D.2713

Type of Manuscript: Special Section PAPER (Special Section on Parallel and Distributed Computing and Networking)

Category

Authors

Ryusuke UEDERA
Graduate School of Engineering, Hiroshima University
Satoshi FUJITA
Graduate School of Engineering, Hiroshima University

Keyword

Peer-to-Peer, video-on-demand, buffer map, VCR operation

Cite this

Copy

Ryusuke UEDERA, Satoshi FUJITA, "A Cost-Effective Buffer Map Notification Scheme for P2P VoDs Supporting VCR Operations" in IEICE TRANSACTIONS on Information, vol. E96-D, no. 12, pp. 2713-2719, December 2013, doi: 10.1587/transinf.E96.D.2713.
Abstract: In this paper, we propose a new buffer map notification scheme for Peer-to-Peer Video-on-Demand systems (P2P VoDs) which support VCR operations such as fast-forward, fast-backward, and seek. To enhance the fluidity of such VCR operations, we need to refine the size of each piece as small as possible. However, such a refinement significantly degrades the performance of buffer map notification schemes with respect to the overhead, piece availability and the efficiency of resource utilizations. The basic idea behind our proposed scheme is to use a piece-based buffer map with a segment-based buffer map in a complementary manner. The result of simulations indicates that the proposed scheme certainly increases the accuracy of the information on the piece availability in the neighborhood with a sufficiently low cost, which reduces the intermittent waiting time of each peer by more than 40% even under a situation in which 50% of peers conduct the fast-forward operation over a range of 30% of the entire video.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E96.D.2713/_p

Copy

@ARTICLE{e96-d_12_2713,
author={Ryusuke UEDERA, Satoshi FUJITA, },
journal={IEICE TRANSACTIONS on Information},
title={A Cost-Effective Buffer Map Notification Scheme for P2P VoDs Supporting VCR Operations},
year={2013},
volume={E96-D},
number={12},
pages={2713-2719},
abstract={In this paper, we propose a new buffer map notification scheme for Peer-to-Peer Video-on-Demand systems (P2P VoDs) which support VCR operations such as fast-forward, fast-backward, and seek. To enhance the fluidity of such VCR operations, we need to refine the size of each piece as small as possible. However, such a refinement significantly degrades the performance of buffer map notification schemes with respect to the overhead, piece availability and the efficiency of resource utilizations. The basic idea behind our proposed scheme is to use a piece-based buffer map with a segment-based buffer map in a complementary manner. The result of simulations indicates that the proposed scheme certainly increases the accuracy of the information on the piece availability in the neighborhood with a sufficiently low cost, which reduces the intermittent waiting time of each peer by more than 40% even under a situation in which 50% of peers conduct the fast-forward operation over a range of 30% of the entire video.},
keywords={},
doi={10.1587/transinf.E96.D.2713},
ISSN={1745-1361},
month={December},}

Copy

TY - JOUR
TI - A Cost-Effective Buffer Map Notification Scheme for P2P VoDs Supporting VCR Operations
T2 - IEICE TRANSACTIONS on Information
SP - 2713
EP - 2719
AU - Ryusuke UEDERA
AU - Satoshi FUJITA
PY - 2013
DO - 10.1587/transinf.E96.D.2713
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E96-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2013
AB - In this paper, we propose a new buffer map notification scheme for Peer-to-Peer Video-on-Demand systems (P2P VoDs) which support VCR operations such as fast-forward, fast-backward, and seek. To enhance the fluidity of such VCR operations, we need to refine the size of each piece as small as possible. However, such a refinement significantly degrades the performance of buffer map notification schemes with respect to the overhead, piece availability and the efficiency of resource utilizations. The basic idea behind our proposed scheme is to use a piece-based buffer map with a segment-based buffer map in a complementary manner. The result of simulations indicates that the proposed scheme certainly increases the accuracy of the information on the piece availability in the neighborhood with a sufficiently low cost, which reduces the intermittent waiting time of each peer by more than 40% even under a situation in which 50% of peers conduct the fast-forward operation over a range of 30% of the entire video.
ER -