{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T14:18:56Z","timestamp":1736518736625,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_35","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"330-339","source":"Crossref","is-referenced-by-count":1,"title":["A Tight Analysis of Most-Requested-First for On-Demand Data Broadcast"],"prefix":"10.1007","author":[{"given":"Regant Y. S.","family":"Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. F.","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Aksoy, D., Franklin, M.: Scheduling for large-scale on-demand data broadcasting. In: IEEE INFOCOM, vol.\u00a02, pp. 651\u2013659 (1998)","DOI":"10.1109\/INFCOM.1998.665086"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Goshi, J., Ladner, R.: Offline and on-line guaranteed start-up delay for media-on-demand with stream merging. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architecture, pp. 164\u2013173 (2003)","DOI":"10.1145\/777412.777439"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-27798-9_24","volume-title":"Computing and Combinatorics","author":"W.T. Chan","year":"2004","unstructured":"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: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 210\u2013218. Springer, Heidelberg (2004)"},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Dan, A., Sitaram, D., Shahabuddin, P.: Scheduling policies for an on-demand video server with batching. In: Proceedings of the ACM Multimedia, pp. 15\u201323 (1994)","DOI":"10.1145\/192593.192614"},{"key":"35_CR5","unstructured":"Dykeman, H.D., Ammar, M.H., Wong, J.W.: Scheduling algorithms for videotex systems under broadcast delivery. In: IEEE International Conference on Communications (ICC), pp. 1847\u20131851 (1986)"},{"key":"35_CR6","unstructured":"Edmonds, J., Pruhs, K.: A maiden analysis of Longest Wait First. In: Proceedings of the Fifteenth ACM-SIAM Symposium on Discrete Algorihtms, pp. 818\u2013827 (2004)"},{"key":"35_CR7","unstructured":"Hawkins, A.T., Mao, W.: On multi-channel data broadcast scheduling. In: The Second Workshop on Intelligent Multimedia Computing and Networking, pp. 915\u2013918 (2002)"},{"key":"35_CR8","unstructured":"Hung, R.Y.S.: Scheduling online batching systems. Master\u2019s thesis, The University of Hong Kong (2005)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Hung, R.Y.S., Ting, H.F.: Scheduling online batching systems: a competitiveness study on patience and sharing. In: Proceedings of the Latin American Theoretical Informatics Symposium, pp. 605\u2013616 (2006)","DOI":"10.1007\/11682462_56"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Jiang, S., Vaidya, N.H.: Scheduling data broadcast to \u201cimpatient\u201d users. In: Proceedings of the 1st ACM International Workshop on Data Engineering for Wireless and Mobile Access (MobiDE), pp. 52\u201359 (1999)","DOI":"10.1145\/313300.313385"},{"issue":"6","key":"35_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/jos.87","volume":"4","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K., Velauthapillai, M.: Scheduling broadcasts in wireless networks. Journal of Scheduling\u00a04(6), 339\u2013354 (2000)","journal-title":"Journal of Scheduling"},{"key":"35_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-39658-1_30","volume-title":"Algorithms - ESA 2003","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., Velauthapillai, M.: On-demand broadcasting under deadline. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 313\u2013324. Springer, Heidelberg (2003)"},{"issue":"3","key":"35_CR13","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/j.tcs.2004.02.047","volume":"325","author":"J.H. Kim","year":"2004","unstructured":"Kim, J.H., Chwa, K.Y.: Scheduling broadcasts with deadlines. Theoretical Computer Science\u00a0325(3), 448\u2013479 (2004)","journal-title":"Theoretical Computer Science"},{"key":"35_CR14","unstructured":"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\u2013296 (2000)"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Sarhan, N.J., Das, C.R.: A simulation-based analysis of scheduling policies for multimedia servers. In: Proceedings of the 36th Annual Simulations Symposium, pp. 183\u2013190 (2003)","DOI":"10.1109\/SIMSYM.2003.1192812"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/s005300050101","volume":"6","author":"H. Shachnai","year":"1998","unstructured":"Shachnai, H., Yu, P.: Exploring wait tolerance in effective batching for video-on-demand scheduling. Multimedia Systems\u00a06, 382\u2013394 (1998)","journal-title":"Multimedia Systems"},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11758471_18","volume-title":"Algorithms and Complexity","author":"H.F. Ting","year":"2006","unstructured":"Ting, H.F.: A near optimal scheduler for on-demand data broadcasts. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 163\u2013174. Springer, Heidelberg (2006)"},{"issue":"12","key":"35_CR18","doi-asserted-by":"publisher","first-page":"1566","DOI":"10.1109\/5.16350","volume":"76","author":"J.W. Wong","year":"1988","unstructured":"Wong, J.W.: Broadcast delivery. Proceedings of IEEE\u00a076(12), 1566\u20131577 (1988)","journal-title":"Proceedings of IEEE"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T13:07:28Z","timestamp":1736514448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11809678_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}