TY - JOUR
T1 - On-demand broadcast for multiple-item requests in a multiple-channel environment
AU - Liu, Kai
AU - Lee, Victor C.S.
PY - 2010/11/15
Y1 - 2010/11/15
N2 - On-demand broadcast is an effective approach to disseminating data in mobile computing environments. Substantial efforts have been devoted to improving the scheduling efficiency of on-demand broadcast. Previous studies focused mainly on the case of scheduling single-item requests in single-channel environments. However, requesting multiple dependent data items is common in many advanced applications such as electronic stock trading and traffic information enquiry services. In addition, multi-channel architectures are widely deployed in data broadcast systems. In this work, we investigate the issues arising in scheduling multi-item requests in multi-channel on-demand broadcast environments. Two problems, namely, the request starvation problem and the bandwidth utilization problem are identified in existing algorithms. To tackle the observed problems, an innovative algorithm is proposed. Results from our simulation study demonstrate the superiority of the proposed algorithm. © 2010 Elsevier B.V. All rights reserved.
AB - On-demand broadcast is an effective approach to disseminating data in mobile computing environments. Substantial efforts have been devoted to improving the scheduling efficiency of on-demand broadcast. Previous studies focused mainly on the case of scheduling single-item requests in single-channel environments. However, requesting multiple dependent data items is common in many advanced applications such as electronic stock trading and traffic information enquiry services. In addition, multi-channel architectures are widely deployed in data broadcast systems. In this work, we investigate the issues arising in scheduling multi-item requests in multi-channel on-demand broadcast environments. Two problems, namely, the request starvation problem and the bandwidth utilization problem are identified in existing algorithms. To tackle the observed problems, an innovative algorithm is proposed. Results from our simulation study demonstrate the superiority of the proposed algorithm. © 2010 Elsevier B.V. All rights reserved.
KW - Multi-channel architecture
KW - Multi-item request
KW - On-demand broadcast
KW - Scheduling algorithm
UR - http://www.scopus.com/inward/record.url?scp=77956394806&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-77956394806&origin=recordpage
U2 - 10.1016/j.ins.2010.07.030
DO - 10.1016/j.ins.2010.07.030
M3 - RGC 21 - Publication in refereed journal
SN - 0020-0255
VL - 180
SP - 4336
EP - 4352
JO - Information Sciences
JF - Information Sciences
IS - 22
ER -