This paper investigates the lossless video aggregation and transport, a concept of transmitting a group of video sessions as a bundle over a communication network. We focus on the design of optimal transmission plan with minimum receiver buffer requirement for stored variable bit-rate (VBR) videos over a constant bit-rate (CBR) channel without incurring buffer underflow and overflow. For a single video, an efficient algorithm is proposed to calculate the optimal transmission plan in only O(N) time, a significant improvement of the previous result with time complexity of O(N2log N). For multiple video sessions, we propose an aggregation scheme to calculate the changes of optimal transmission plans at the joints or separations, where a session bundled in the aggregated video stream begins or stops. The experimental results show that our algorithms stand out in terms of simplicity and efficiency.
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
Jen-Kai CHEN, Jean-Lien C. WU, "Real-Time Aggregation and Transport of Stored VBR Videos over a CBR Channel" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 11, pp. 2081-2089, November 1998, doi: .
Abstract: This paper investigates the lossless video aggregation and transport, a concept of transmitting a group of video sessions as a bundle over a communication network. We focus on the design of optimal transmission plan with minimum receiver buffer requirement for stored variable bit-rate (VBR) videos over a constant bit-rate (CBR) channel without incurring buffer underflow and overflow. For a single video, an efficient algorithm is proposed to calculate the optimal transmission plan in only O(N) time, a significant improvement of the previous result with time complexity of O(N2log N). For multiple video sessions, we propose an aggregation scheme to calculate the changes of optimal transmission plans at the joints or separations, where a session bundled in the aggregated video stream begins or stops. The experimental results show that our algorithms stand out in terms of simplicity and efficiency.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e81-b_11_2081/_p
Copy
@ARTICLE{e81-b_11_2081,
author={Jen-Kai CHEN, Jean-Lien C. WU, },
journal={IEICE TRANSACTIONS on Communications},
title={Real-Time Aggregation and Transport of Stored VBR Videos over a CBR Channel},
year={1998},
volume={E81-B},
number={11},
pages={2081-2089},
abstract={This paper investigates the lossless video aggregation and transport, a concept of transmitting a group of video sessions as a bundle over a communication network. We focus on the design of optimal transmission plan with minimum receiver buffer requirement for stored variable bit-rate (VBR) videos over a constant bit-rate (CBR) channel without incurring buffer underflow and overflow. For a single video, an efficient algorithm is proposed to calculate the optimal transmission plan in only O(N) time, a significant improvement of the previous result with time complexity of O(N2log N). For multiple video sessions, we propose an aggregation scheme to calculate the changes of optimal transmission plans at the joints or separations, where a session bundled in the aggregated video stream begins or stops. The experimental results show that our algorithms stand out in terms of simplicity and efficiency.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Real-Time Aggregation and Transport of Stored VBR Videos over a CBR Channel
T2 - IEICE TRANSACTIONS on Communications
SP - 2081
EP - 2089
AU - Jen-Kai CHEN
AU - Jean-Lien C. WU
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 1998
AB - This paper investigates the lossless video aggregation and transport, a concept of transmitting a group of video sessions as a bundle over a communication network. We focus on the design of optimal transmission plan with minimum receiver buffer requirement for stored variable bit-rate (VBR) videos over a constant bit-rate (CBR) channel without incurring buffer underflow and overflow. For a single video, an efficient algorithm is proposed to calculate the optimal transmission plan in only O(N) time, a significant improvement of the previous result with time complexity of O(N2log N). For multiple video sessions, we propose an aggregation scheme to calculate the changes of optimal transmission plans at the joints or separations, where a session bundled in the aggregated video stream begins or stops. The experimental results show that our algorithms stand out in terms of simplicity and efficiency.
ER -