In this paper, we study the design and analysis of online batching systems, which can be used to model many popular IT systems such as the Video-On-Demand system and the Pull-based Data Dissemination system. We analyze how the start-up delay affects the performance of these systems and investigate the tradeoff relationship between the number of servers and the length of the start-up delay. We also study a simple online algorithm for scheduling online batching systems. By deriving close lower and upper bounds, we prove that our algorithm is near optimal.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Aggarwal, C.C., Wolf, J.L., Yu, P.S.: On optimal batching policies for video-on-demand storage servers. In: Proceedings of the IEEE International Conference on Multimedia Computing and Systems, pp. 253–258 (1996)
Agrawal, R., Chrysanthis, P.K.: Efficient data dissemination to mobile clients in E-commerce applications. In: Proceedings of the Third International Workshop on Advanced issues on E-Commerce and Web Information Systems, pp. 58–65 (2001)
Bar-Noy, A., Garay, J.A., Herzberg, A.: Sharing video on demand. Discrete Appl. Math. 129(1), 3–30 (2003)
Bar-Noy, A., Goshi, J., Ladner, R.: Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging. J. Discrete Algorithms 4(1), 72–105 (2006)
Bar-Noy, A., Ladner, R.E., Tamir, T.: Scheduling techniques for media-on-demand. In: Proceeding of the 14th Annual ACM/SIAM Symposium on Discrete Algorithms, pp. 791–800 (2003)
Bouras, C., Kapoulas, V., Pantziou, G., Spirakis, P.: Competitive video on demand schedulers for popular movies. Discrete Appl. Math. 129(1), 49–61 (2003)
Chan, W.T., Lam, T.W., Ting, H.F., Wong, P.W.H.: A unified analysis of hot video schedulers. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pp. 179–188 (2002)
Chan, W.T., Lam, T.W., Ting, H.F., Wong, W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Proceedings of the 10th Annual International Conference on Computing and Combinatorics, pp. 210–218 (2004)
Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Lavi, R., Sgall, J., Tichý, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. In: Proceedings of the 21st Annual Symposium on Theoretical Aspects on Computer Science, pp. 187–198 (2004)
Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Online scheduling of equal-length jobs: Randomization and restarts help. In: International Colloquium on Automata, Languages and Programming, pp. 358–370 (2004)
Dan, A., Sitaram, D., Shahabuddin, P.: Dynamic batching policies for an on-demand video server. ACM Multimedia Syst. J. 4(3), 112–121 (1996)
Dykeman, H.D., Ammar, M.H., Wong, J.W.: Scheduling algorithms for videotex systems under broadcast delivery. In: Proceeding of the IEEE International Conference on Communications, pp. 1847–1851 (1986)
Evans, W., Kirkpatrick, D.: Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. In: Proceeding of the 14th Annual ACM/SIAM Symposium on Discrete Algorithms, pp. 1041–1049 (2004)
Goldwasser, M.: Patience is a virtue: The effect of slack on competitiveness for admission control. J. Sched. 6(2), 183–211 (2003)
Hung, R.Y.S.: Scheduling online batching systems. Master’s Thesis, The University of Hong Kong (2005)
Hung, R.Y.S., Ting, H.F.: A tight analysis of most-requested-first for on-demand data broadcast. In: Proceedings of the 12th Annual International Conference on Computing and Combinatorics, pp. 330–339 (2006)
Kalyanasundaram, B., Velauthapillai, M.: On-demand broadcasting under deadline. In: Proceedings of the 11th Annual European Symposium on Algorithms, pp. 313–324 (2003)
Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. In: Proceedings of the 8th Annual European Symposium on Algorithms, pp. 290–301 (2000)
Kim, J.H., Chwa, K.Y.: Scheduling broadcasts with deadlines. Theor. Comput. Sci. 325(3), 479–448 (2004)
Mao, W.: Competitive analysis of online algorithm for on-demand data broadcast scheduling. In: Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms, and Networks, pp. 292–296 (2000)
Potts, C.N., Kovalyov, M.Y.: Scheduling with batching: A review. Eur. J. Oper. Res. 120(2), 228–249 (2000)
Sharaf, M.A., Chrysanthis, P.K.: On-demand data broadcasting for mobile decision making. J. ACM Mob. Netw. Appl. 9(6), 703–714 (2004)
Ting, H.F.: A near optimal scheduler for on-demand data broadcasts. In: Proceedings of the 6th International Conference on Algorithms and Complexity, pp. 163–174 (2006)
Wong, J.W.: Broadcast delivery. Proc. IEEE 76(12), 1566–1577 (1988)
Xuan, P., Sen, S., Gonzalez, O., Fernandez, J., Ramamritham, K.: Broadcast on demand: Efficient and timely dissemination of data in mobile environments. In: Proceeding of the 3rd IEEE Real Time Technology and Applications Symposium, pp. 38–48 (1997)
A preliminary version of this paper appears in Proceedings of the 7th Latin American Theoretical Informatics Symposium, pp. 605–616, 2006.
This research was supported in part by Hong Kong RGC Grant HKU-7045/02E.
About this article
Cite this article
Hung, R.Y.S., Ting, H. Design and Analysis of Online Batching Systems. Algorithmica 57, 217–231 (2010). https://doi.org/10.1007/s00453-008-9201-3
- Online batching systems
- Online algorithms
- Competitive analysis