On-demand bounded broadcast scheduling with tight deadlines

Authors:
Chung Keung Poon;Feifeng Zheng;Yinfeng Xu
Affiliations:
Department of Computer Science, City University of Hong Kong, Hong Kong;School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi, China;School of Management, Xi'an Jiaotong University, Xi'an, Shaanxi, China
Venue:
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Year:
2006

Citing 7
Cited 1

On-line scheduling of jobs with fixed start and end times

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Scheduling on-demand broadcasts: new metrics and algorithms

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Minimizing maximum response time in scheduling broadcasts

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Broadcast scheduling: when fairness is fine

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling Algorithms for a Data Broadcast System: Minimizing Variance of the Response Time

Scheduling Algorithms for a Data Broadcast System: Minimizing Variance of the Response Time
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem

Journal of Scheduling
Scheduling broadcasts with deadlines

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Scaling-up shopbots: a dynamic allocation-based approach

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be satisfied simultaneously by one broadcast.The HEU algorithm of Woeginger (1994) is proven to be optimal in maximizing the number of satisfied requests when the pages have equal length and the requests have tight deadlines. However, we show that when there are maximum bounds on the number and weight of requests at any time in the system, the HEU algorithm is not optimal. We then propose a modified algorithm, VAR, which is optimal for this case.