On Reducing Delay in Mesh-Based P2P Streaming: A Mesh-Push Approach

Zheng LIU; Kaiping XUE; Peilin HONG

doi:10.1587/transcom.E95.B.426

On Reducing Delay in Mesh-Based P2P Streaming: A Mesh-Push Approach

Zheng LIU, Kaiping XUE, Peilin HONG

Full Text Views

0

Share
Cite this

Summary :

The peer-assisted streaming paradigm has been widely employed to distribute live video data on the internet recently. In general, the mesh-based pull approach is more robust and efficient than the tree-based push approach. However, pull protocol brings about longer streaming delay, which is caused by the handshaking process of advertising buffer map message, sending request message and scheduling of the data block. In this paper, we propose a new approach, mesh-push, to address this issue. Different from the traditional pull approach, mesh-push implements block scheduling algorithm at sender side, where the block transmission is initiated by the sender rather than by the receiver. We first formulate the optimal upload bandwidth utilization problem, then present the mesh-push approach, in which a token protocol is designed to avoid block redundancy; a min-cost flow model is employed to derive the optimal scheduling for the push peer; and a push peer selection algorithm is introduced to reduce control overhead. Finally, we evaluate mesh-push through simulation, the results of which show mesh-push outperforms the pull scheduling in streaming delay, and achieves comparable delivery ratio at the same time.

Publication: IEICE TRANSACTIONS on Communications Vol.E95-B No.2 pp.426-434

Publication Date: 2012/02/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E95.B.426

Type of Manuscript: PAPER

Category: Network

Cite this

Copy

Zheng LIU, Kaiping XUE, Peilin HONG, "On Reducing Delay in Mesh-Based P2P Streaming: A Mesh-Push Approach" in IEICE TRANSACTIONS on Communications, vol. E95-B, no. 2, pp. 426-434, February 2012, doi: 10.1587/transcom.E95.B.426.
Abstract: The peer-assisted streaming paradigm has been widely employed to distribute live video data on the internet recently. In general, the mesh-based pull approach is more robust and efficient than the tree-based push approach. However, pull protocol brings about longer streaming delay, which is caused by the handshaking process of advertising buffer map message, sending request message and scheduling of the data block. In this paper, we propose a new approach, mesh-push, to address this issue. Different from the traditional pull approach, mesh-push implements block scheduling algorithm at sender side, where the block transmission is initiated by the sender rather than by the receiver. We first formulate the optimal upload bandwidth utilization problem, then present the mesh-push approach, in which a token protocol is designed to avoid block redundancy; a min-cost flow model is employed to derive the optimal scheduling for the push peer; and a push peer selection algorithm is introduced to reduce control overhead. Finally, we evaluate mesh-push through simulation, the results of which show mesh-push outperforms the pull scheduling in streaming delay, and achieves comparable delivery ratio at the same time.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.426/_p

Copy

@ARTICLE{e95-b_2_426,
author={Zheng LIU, Kaiping XUE, Peilin HONG, },
journal={IEICE TRANSACTIONS on Communications},
title={On Reducing Delay in Mesh-Based P2P Streaming: A Mesh-Push Approach},
year={2012},
volume={E95-B},
number={2},
pages={426-434},
abstract={The peer-assisted streaming paradigm has been widely employed to distribute live video data on the internet recently. In general, the mesh-based pull approach is more robust and efficient than the tree-based push approach. However, pull protocol brings about longer streaming delay, which is caused by the handshaking process of advertising buffer map message, sending request message and scheduling of the data block. In this paper, we propose a new approach, mesh-push, to address this issue. Different from the traditional pull approach, mesh-push implements block scheduling algorithm at sender side, where the block transmission is initiated by the sender rather than by the receiver. We first formulate the optimal upload bandwidth utilization problem, then present the mesh-push approach, in which a token protocol is designed to avoid block redundancy; a min-cost flow model is employed to derive the optimal scheduling for the push peer; and a push peer selection algorithm is introduced to reduce control overhead. Finally, we evaluate mesh-push through simulation, the results of which show mesh-push outperforms the pull scheduling in streaming delay, and achieves comparable delivery ratio at the same time.},
keywords={},
doi={10.1587/transcom.E95.B.426},
ISSN={1745-1345},
month={February},}

Copy

TY - JOUR
TI - On Reducing Delay in Mesh-Based P2P Streaming: A Mesh-Push Approach
T2 - IEICE TRANSACTIONS on Communications
SP - 426
EP - 434
AU - Zheng LIU
AU - Kaiping XUE
AU - Peilin HONG
PY - 2012
DO - 10.1587/transcom.E95.B.426
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2012
AB - The peer-assisted streaming paradigm has been widely employed to distribute live video data on the internet recently. In general, the mesh-based pull approach is more robust and efficient than the tree-based push approach. However, pull protocol brings about longer streaming delay, which is caused by the handshaking process of advertising buffer map message, sending request message and scheduling of the data block. In this paper, we propose a new approach, mesh-push, to address this issue. Different from the traditional pull approach, mesh-push implements block scheduling algorithm at sender side, where the block transmission is initiated by the sender rather than by the receiver. We first formulate the optimal upload bandwidth utilization problem, then present the mesh-push approach, in which a token protocol is designed to avoid block redundancy; a min-cost flow model is employed to derive the optimal scheduling for the push peer; and a push peer selection algorithm is introduced to reduce control overhead. Finally, we evaluate mesh-push through simulation, the results of which show mesh-push outperforms the pull scheduling in streaming delay, and achieves comparable delivery ratio at the same time.
ER -