Mathematica: a system for doing mathematics by computer
Mathematica: a system for doing mathematics by computer
Metropolitan area video-on-demand service using pyramid broadcasting
Multimedia Systems
Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Pushing dependent data in clients-providers-servers systems
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Nearly optimal perfectly-periodic schedules
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Harmonic broadcasting is optimal
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Low Bandwidth Broadcasting Protocol for Video on Demand
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Exploiting Client Bandwidth for More Efficient Video Broadcast
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Scheduling on Airdisks: Efficient Access to Personalized InformationServices via Periodic Wireless Data Broadcast
Scheduling techniques for media-on-demand
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Windows scheduling as a restricted version of Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Fairness-free periodic scheduling with vacations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
An optimization problem related to vod broadcasting
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Harmonic block windows scheduling through harmonic windows scheduling
MIS'05 Proceedings of the 11th international conference on Advances in Multimedia Information Systems
| Hi-index | 0.00 |
The windows scheduling problem is defined by the positive integers h and w1, w2,…, wn. The window wi is associated with page i and h is the number of slotted channels available for broadcasting the pages. A schedule that solves the problem assigns pages to slots such that the gap between any two consecutive appearances of page i is at most wi slots. We investigate two optimization problems. (i) The optimal windows scheduling problem: given w1,…, wn find a schedule in which h is minimized. (ii) The optimal harmonic windows scheduling problem: given h find a schedule for the windows wi = i in which n is maximized. The former is a formulation of the problem of minimizing the bandwidth in push systems that support guaranteed delay and the latter is a formulation of the problem of minimizing the startup delay in media-on-demand systems. For the optimal windows scheduling problem we present an algorithm that constructs asymptotically close to optimal schedules and for the optimal harmonic windows scheduling problem, we show how to achieve the largest known n's for all values of h.