IEICE TRANSACTIONS on Communications
Optimal Buffer Management Strategy for Minimizing Delivery Latency of Streaming Data with Packet Dependencies
Summary :
Buffer management and delivery latency in various networks have been extensively studied. However, little work has considered the condition in which the traffic exhibits interpacket dependency, a common occurrence with many applications. Furthermore, the existing work related to such traffic mainly focuses on maximizing goodput and little attention has been paid to delivery latency. This paper concentrates on the delivery latency minimization problem for streaming data with packet dependencies. A novel optimization model is proposed to describe the aforementioned problem and the theoretical lower bound for delivery latency is deduced. Based on this model, a plain buffer management (PBM) algorithm is applied to the implementation of the buffer scheduling process. Afterwards, we improve the PBM algorithm under the guidance of a heuristic idea and put forward an optimal buffer management greedy (OBMG) algorithm. Experiments demonstrate that the OBMG algorithm outperforms the currently best known online (BKO) algorithm as it decreases the average delivery latency by 35.6%. In some cases, delivery latency obtained from the OBMG algorithm can be quite close to the theoretical lower bound. In addition, the OBMG algorithm can reduce CPU computational overhead by more than 12% in comparison to the BKO algorithm.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E99-B No.7 pp.1501-1510
- Publication Date
- 2016/07/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2015EBP3313
- Type of Manuscript
- PAPER
- Category
- Internet
Authors
Jinghong WU
Chinese Academy of Sciences
Hong NI
Chinese Academy of Sciences
Xuewen ZENG
Chinese Academy of Sciences
Xiaozhou YE
Chinese Academy of Sciences
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Jinghong WU, Hong NI, Xuewen ZENG, Xiaozhou YE, "Optimal Buffer Management Strategy for Minimizing Delivery Latency of Streaming Data with Packet Dependencies" in IEICE TRANSACTIONS on Communications,
vol. E99-B, no. 7, pp. 1501-1510, July 2016, doi: 10.1587/transcom.2015EBP3313.
Abstract: Buffer management and delivery latency in various networks have been extensively studied. However, little work has considered the condition in which the traffic exhibits interpacket dependency, a common occurrence with many applications. Furthermore, the existing work related to such traffic mainly focuses on maximizing goodput and little attention has been paid to delivery latency. This paper concentrates on the delivery latency minimization problem for streaming data with packet dependencies. A novel optimization model is proposed to describe the aforementioned problem and the theoretical lower bound for delivery latency is deduced. Based on this model, a plain buffer management (PBM) algorithm is applied to the implementation of the buffer scheduling process. Afterwards, we improve the PBM algorithm under the guidance of a heuristic idea and put forward an optimal buffer management greedy (OBMG) algorithm. Experiments demonstrate that the OBMG algorithm outperforms the currently best known online (BKO) algorithm as it decreases the average delivery latency by 35.6%. In some cases, delivery latency obtained from the OBMG algorithm can be quite close to the theoretical lower bound. In addition, the OBMG algorithm can reduce CPU computational overhead by more than 12% in comparison to the BKO algorithm.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2015EBP3313/_p
Copy
@ARTICLE{e99-b_7_1501,
author={Jinghong WU, Hong NI, Xuewen ZENG, Xiaozhou YE, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimal Buffer Management Strategy for Minimizing Delivery Latency of Streaming Data with Packet Dependencies},
year={2016},
volume={E99-B},
number={7},
pages={1501-1510},
abstract={Buffer management and delivery latency in various networks have been extensively studied. However, little work has considered the condition in which the traffic exhibits interpacket dependency, a common occurrence with many applications. Furthermore, the existing work related to such traffic mainly focuses on maximizing goodput and little attention has been paid to delivery latency. This paper concentrates on the delivery latency minimization problem for streaming data with packet dependencies. A novel optimization model is proposed to describe the aforementioned problem and the theoretical lower bound for delivery latency is deduced. Based on this model, a plain buffer management (PBM) algorithm is applied to the implementation of the buffer scheduling process. Afterwards, we improve the PBM algorithm under the guidance of a heuristic idea and put forward an optimal buffer management greedy (OBMG) algorithm. Experiments demonstrate that the OBMG algorithm outperforms the currently best known online (BKO) algorithm as it decreases the average delivery latency by 35.6%. In some cases, delivery latency obtained from the OBMG algorithm can be quite close to the theoretical lower bound. In addition, the OBMG algorithm can reduce CPU computational overhead by more than 12% in comparison to the BKO algorithm.},
keywords={},
doi={10.1587/transcom.2015EBP3313},
ISSN={1745-1345},
month={July},}
Copy
TY - JOUR
TI - Optimal Buffer Management Strategy for Minimizing Delivery Latency of Streaming Data with Packet Dependencies
T2 - IEICE TRANSACTIONS on Communications
SP - 1501
EP - 1510
AU - Jinghong WU
AU - Hong NI
AU - Xuewen ZENG
AU - Xiaozhou YE
PY - 2016
DO - 10.1587/transcom.2015EBP3313
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E99-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2016
AB - Buffer management and delivery latency in various networks have been extensively studied. However, little work has considered the condition in which the traffic exhibits interpacket dependency, a common occurrence with many applications. Furthermore, the existing work related to such traffic mainly focuses on maximizing goodput and little attention has been paid to delivery latency. This paper concentrates on the delivery latency minimization problem for streaming data with packet dependencies. A novel optimization model is proposed to describe the aforementioned problem and the theoretical lower bound for delivery latency is deduced. Based on this model, a plain buffer management (PBM) algorithm is applied to the implementation of the buffer scheduling process. Afterwards, we improve the PBM algorithm under the guidance of a heuristic idea and put forward an optimal buffer management greedy (OBMG) algorithm. Experiments demonstrate that the OBMG algorithm outperforms the currently best known online (BKO) algorithm as it decreases the average delivery latency by 35.6%. In some cases, delivery latency obtained from the OBMG algorithm can be quite close to the theoretical lower bound. In addition, the OBMG algorithm can reduce CPU computational overhead by more than 12% in comparison to the BKO algorithm.
ER -
English
