Scheduling data broadcast: an efficient cut-off point between periodic and on-demand data

Authors:
Sunho Kim;Sang H. Kang
Affiliations:
Department of Electrical and Computer Engineering, University of Seoul, Korea;Department of Electrical and Computer Engineering, University of Seoul, Korea
Venue:
IEEE Communications Letters
Year:
2010

Citing 5
Cited 0

Scheduling data broadcast in asymmetric communication environments

Wireless Networks
R × W: a scheduling approach for large-scale on-demand data broadcast

IEEE/ACM Transactions on Networking (TON)
A new hybrid broadcast scheduling algorithm for asymmetric communication systems: push and pull data based on optimal cut-off point

MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
A new hybrid broadcast scheduling algorithm for asymmetric communication systems: push and pull data based on optimal cut-off point

MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Efficient Processing of Real-Time Multi-item Requests with Network Coding in On-demand Broadcast Environments

RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Collecting statistics from client requests, the broadcast server partitions data items into hot and cold-item sets to perform a hybrid broadcast scheduling. Hot items are broadcast periodically with periods based on their access probabilities. Cold items are scheduled based on the waiting time and the number of outstanding requests. We investigate the optimal cut-off point between hot and cold items by analyzing the average response time as a function of the cut-off point. The effectiveness of our scheme is shown by simulations using web query log data.