We consider wireless interactive data broadcasting environments consisting of the broadcast channel for data dissemination and the communication channels for client requests. Modeling client impatience as the soft deadline of client requests, we propose a broadcast scheduling based on a combination of periodic scheduling and priority-based scheduling. The server partitions data items into hot and cold-item sets according to the optimized cut-off point. We apply periodic and priority-based scheduling to hot and cold item sets, respectively, in order to maximize the average utility of the items. We investigate the optimized cut-off point by analyzing the average utility of items as a function of the cut-off point. Simulation results show that our proposed algorithm outperforms existing methods in various circumstances in terms of average utility as well as average response time.
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
Sang Hyuk KANG, "Wireless Data Broadcast Scheduling with Utility Metric Based on Soft Deadline" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 5, pp. 1424-1431, May 2011, doi: 10.1587/transcom.E94.B.1424.
Abstract: We consider wireless interactive data broadcasting environments consisting of the broadcast channel for data dissemination and the communication channels for client requests. Modeling client impatience as the soft deadline of client requests, we propose a broadcast scheduling based on a combination of periodic scheduling and priority-based scheduling. The server partitions data items into hot and cold-item sets according to the optimized cut-off point. We apply periodic and priority-based scheduling to hot and cold item sets, respectively, in order to maximize the average utility of the items. We investigate the optimized cut-off point by analyzing the average utility of items as a function of the cut-off point. Simulation results show that our proposed algorithm outperforms existing methods in various circumstances in terms of average utility as well as average response time.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.1424/_p
Copy
@ARTICLE{e94-b_5_1424,
author={Sang Hyuk KANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Wireless Data Broadcast Scheduling with Utility Metric Based on Soft Deadline},
year={2011},
volume={E94-B},
number={5},
pages={1424-1431},
abstract={We consider wireless interactive data broadcasting environments consisting of the broadcast channel for data dissemination and the communication channels for client requests. Modeling client impatience as the soft deadline of client requests, we propose a broadcast scheduling based on a combination of periodic scheduling and priority-based scheduling. The server partitions data items into hot and cold-item sets according to the optimized cut-off point. We apply periodic and priority-based scheduling to hot and cold item sets, respectively, in order to maximize the average utility of the items. We investigate the optimized cut-off point by analyzing the average utility of items as a function of the cut-off point. Simulation results show that our proposed algorithm outperforms existing methods in various circumstances in terms of average utility as well as average response time.},
keywords={},
doi={10.1587/transcom.E94.B.1424},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - Wireless Data Broadcast Scheduling with Utility Metric Based on Soft Deadline
T2 - IEICE TRANSACTIONS on Communications
SP - 1424
EP - 1431
AU - Sang Hyuk KANG
PY - 2011
DO - 10.1587/transcom.E94.B.1424
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2011
AB - We consider wireless interactive data broadcasting environments consisting of the broadcast channel for data dissemination and the communication channels for client requests. Modeling client impatience as the soft deadline of client requests, we propose a broadcast scheduling based on a combination of periodic scheduling and priority-based scheduling. The server partitions data items into hot and cold-item sets according to the optimized cut-off point. We apply periodic and priority-based scheduling to hot and cold item sets, respectively, in order to maximize the average utility of the items. We investigate the optimized cut-off point by analyzing the average utility of items as a function of the cut-off point. Simulation results show that our proposed algorithm outperforms existing methods in various circumstances in terms of average utility as well as average response time.
ER -