The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
La diffusion de données de diffusion est intéressante pour la distribution de données à grande échelle où une grande communauté d'utilisateurs est connectée à un serveur via un réseau. Il est important d'envisager une méthode de planification de diffusion qui minimise le temps de réponse moyen. Le système devrait également garantir le temps d'attente prévu au moment de la demande. Dans cet article, nous proposons une méthode qui divise tous les titres en plusieurs groupes et attribue un FIFO à chaque groupe. La méthode proposée permet de garantir le temps d'attente pour chaque utilisateur à sa demande, et est supérieure au FIFO (en forte charge) et à une méthode d'allocation fixe (en faible charge).
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.
Copier
Noriaki KAMIYAMA, "Broadcast Scheduling for Large Contents Distribution" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 4, pp. 1053-1061, April 2001, doi: .
Abstract: Broadcast data delivery is attractive for large-size data distribution where a large user community is connected to a server through a network. It is important to consider a broadcast scheduling method which minimizes the average response time. The scheme should also guarantee the expected waiting time at the time of request. In this paper, we propose a method which divides all titles into several groups and assigns FIFO to each group. The proposed method can guarantee the waiting time for each user at his request, and is superior to FIFO (in high load) and a fixed allocation method (in low load).
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_4_1053/_p
Copier
@ARTICLE{e84-b_4_1053,
author={Noriaki KAMIYAMA, },
journal={IEICE TRANSACTIONS on Communications},
title={Broadcast Scheduling for Large Contents Distribution},
year={2001},
volume={E84-B},
number={4},
pages={1053-1061},
abstract={Broadcast data delivery is attractive for large-size data distribution where a large user community is connected to a server through a network. It is important to consider a broadcast scheduling method which minimizes the average response time. The scheme should also guarantee the expected waiting time at the time of request. In this paper, we propose a method which divides all titles into several groups and assigns FIFO to each group. The proposed method can guarantee the waiting time for each user at his request, and is superior to FIFO (in high load) and a fixed allocation method (in low load).},
keywords={},
doi={},
ISSN={},
month={April},}
Copier
TY - JOUR
TI - Broadcast Scheduling for Large Contents Distribution
T2 - IEICE TRANSACTIONS on Communications
SP - 1053
EP - 1061
AU - Noriaki KAMIYAMA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2001
AB - Broadcast data delivery is attractive for large-size data distribution where a large user community is connected to a server through a network. It is important to consider a broadcast scheduling method which minimizes the average response time. The scheme should also guarantee the expected waiting time at the time of request. In this paper, we propose a method which divides all titles into several groups and assigns FIFO to each group. The proposed method can guarantee the waiting time for each user at his request, and is superior to FIFO (in high load) and a fixed allocation method (in low load).
ER -