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 ...
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudenc...
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...
Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, F...
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...