Effective Algorithms for Multicast Video Transport to Meet Various QoS Requirements
Summary :
In this paper, we propose flow aggregation algorithms for multicast video transport. Because of heterogeneities of network/client environments and users' preference on the perceived video quality, various QoS requirements must be simultaneously guaranteed even for the single video source in the multicast connection. It is easy but ineffective to provide many video streams according to each user's request. Our flow aggregation algorithm arranges similar QoS requirements of clients into a single QoS requirement, by which the required number of video streams that the video server prepares can be decreased. Then the total amount of the required bandwidth can be reduced by sharing the same video stream among a number of clients. Our flow aggregation algorithm has two variants, which are suitable to sender-initiated and receiver-initiated multicast connections, respectively. Proposed algorithms are evaluated and compared through simulation. Then we show that the server-initiated flow aggregation (an ideal case in our approach) is most effective, but the receiver-initiated flow aggregation can also offer a reasonably effective mechanism.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E81-B No.8 pp.1599-1607
- Publication Date
- 1998/08/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Multimedia Communications in Heterogeneous Network Environments)
- Category
- Multicasting
Authors
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
Kentarou FUKUDA, Naoki WAKAMIYA, Masayuki MURATA, Hideo MIYAHARA, "Effective Algorithms for Multicast Video Transport to Meet Various QoS Requirements" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 8, pp. 1599-1607, August 1998, doi: .
Abstract: In this paper, we propose flow aggregation algorithms for multicast video transport. Because of heterogeneities of network/client environments and users' preference on the perceived video quality, various QoS requirements must be simultaneously guaranteed even for the single video source in the multicast connection. It is easy but ineffective to provide many video streams according to each user's request. Our flow aggregation algorithm arranges similar QoS requirements of clients into a single QoS requirement, by which the required number of video streams that the video server prepares can be decreased. Then the total amount of the required bandwidth can be reduced by sharing the same video stream among a number of clients. Our flow aggregation algorithm has two variants, which are suitable to sender-initiated and receiver-initiated multicast connections, respectively. Proposed algorithms are evaluated and compared through simulation. Then we show that the server-initiated flow aggregation (an ideal case in our approach) is most effective, but the receiver-initiated flow aggregation can also offer a reasonably effective mechanism.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_8_1599/_p
Copy
@ARTICLE{e81-b_8_1599,
author={Kentarou FUKUDA, Naoki WAKAMIYA, Masayuki MURATA, Hideo MIYAHARA, },
journal={IEICE TRANSACTIONS on Communications},
title={Effective Algorithms for Multicast Video Transport to Meet Various QoS Requirements},
year={1998},
volume={E81-B},
number={8},
pages={1599-1607},
abstract={In this paper, we propose flow aggregation algorithms for multicast video transport. Because of heterogeneities of network/client environments and users' preference on the perceived video quality, various QoS requirements must be simultaneously guaranteed even for the single video source in the multicast connection. It is easy but ineffective to provide many video streams according to each user's request. Our flow aggregation algorithm arranges similar QoS requirements of clients into a single QoS requirement, by which the required number of video streams that the video server prepares can be decreased. Then the total amount of the required bandwidth can be reduced by sharing the same video stream among a number of clients. Our flow aggregation algorithm has two variants, which are suitable to sender-initiated and receiver-initiated multicast connections, respectively. Proposed algorithms are evaluated and compared through simulation. Then we show that the server-initiated flow aggregation (an ideal case in our approach) is most effective, but the receiver-initiated flow aggregation can also offer a reasonably effective mechanism.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Effective Algorithms for Multicast Video Transport to Meet Various QoS Requirements
T2 - IEICE TRANSACTIONS on Communications
SP - 1599
EP - 1607
AU - Kentarou FUKUDA
AU - Naoki WAKAMIYA
AU - Masayuki MURATA
AU - Hideo MIYAHARA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 1998
AB - In this paper, we propose flow aggregation algorithms for multicast video transport. Because of heterogeneities of network/client environments and users' preference on the perceived video quality, various QoS requirements must be simultaneously guaranteed even for the single video source in the multicast connection. It is easy but ineffective to provide many video streams according to each user's request. Our flow aggregation algorithm arranges similar QoS requirements of clients into a single QoS requirement, by which the required number of video streams that the video server prepares can be decreased. Then the total amount of the required bandwidth can be reduced by sharing the same video stream among a number of clients. Our flow aggregation algorithm has two variants, which are suitable to sender-initiated and receiver-initiated multicast connections, respectively. Proposed algorithms are evaluated and compared through simulation. Then we show that the server-initiated flow aggregation (an ideal case in our approach) is most effective, but the receiver-initiated flow aggregation can also offer a reasonably effective mechanism.
ER -
English
