Simulated annealing: theory and applications
Simulated annealing: theory and applications
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
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
Windows scheduling problems for broadcast systems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling techniques for media-on-demand
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing Service and Operation Costs of Periodic Scheduling
Mathematics of Operations Research
Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
On the Design of Efficient Video-on-Demand Broadcast Schedules
MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
A Low Bandwidth Broadcasting Protocol for Video on Demand
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Generalized Fibonacci broadcasting an efficient VOD scheme with user bandwidth limit
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Hierarchical video patching with optimal server bandwidth
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
A zero-overhead error-correcting nVoD schema
Multimedia Tools and Applications
A joint interchannel and network coding schema for nVoD services over wireless mesh networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Efficient implementation of the implicit error correction nVoD schema
Multimedia Tools and Applications
| Hi-index | 0.00 |
In Harmonic windows scheduling (HWS), a data file is divided into N pages and the pages are scheduled in c channels in such a way that each page i appears at least once in some channel in every window of size i. The optimal HWS problem aims to maximize N. Let κ be the largest integer satisfying Hκ ≤ c, where Hn is the nth harmonic number. Then κ is an upper bound on N, if the HWS framework is used. Thus an optimal HWS schedule wastes “bandwidth” at least c–Hκ. Harmonic block windows scheduling (HBWS) generalizes HWS by grouping b consecutive pages into a superpage. Let N be the total number of pages scheduled. The ratio N/b is directly proportional to the maximum initial waiting time in Media-on-Demand applications. We propose a method that starts with a HWS schedule and modifies it to generate a HBWS schedule that achieves a higher ratio N/b. For up to five channels, we demonstrate that we can always achieve N/b κ. We also prove that as we increase b, N/b approaches the theoretical upper bound.