{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:45:37Z","timestamp":1773153937953,"version":"3.50.1"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2010,2]]},"abstract":"<jats:p>Video on demand, particularly with user-generated content, is emerging as one of the most bandwidth-intensive applications on the Internet. Owing to content control and other issues, some video-on-demand systems attempt to prevent downloading and peer-to-peer content delivery. Instead, such systems rely on server replication, such as via third-party content distribution networks, to support video streaming (or pseudostreaming) to their clients. A major issue with such systems is the cost of the required server resources.<\/jats:p>\n          <jats:p>\n            By synchronizing the video streams for clients that make closely spaced requests for the same video from the same server, server costs (such as for retrieval of the video data from disk) can be amortized over multiple requests. A fundamental trade-off then arises, however, with respect to server selection. Network delivery cost is minimized by selecting the\n            <jats:italic>nearest<\/jats:italic>\n            server, while server cost is minimized by directing closely spaced requests for the same video to a\n            <jats:italic>common<\/jats:italic>\n            server.\n          <\/jats:p>\n          <jats:p>This article compares classes of server selection policies within the context of a simple system model. We conclude that: (i) server selection using dynamic system state information (rather than only proximities and average loads) can yield large improvements in performance, (ii) deferring server selection for a request as late as possible (i.e., until just before streaming is to begin) can yield additional large improvements, and (iii) within the class of policies using dynamic state information and deferred selection, policies using only \u201clocal\u201d (rather than global) request information are able to achieve most of the potential performance gains.<\/jats:p>","DOI":"10.1145\/1671954.1671955","type":"journal-article","created":{"date-parts":[[2010,2,16]],"date-time":"2010-02-16T20:51:06Z","timestamp":1266353466000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Server selection in large-scale video-on-demand systems"],"prefix":"10.1145","volume":"6","author":[{"given":"Niklas","family":"Carlsson","sequence":"first","affiliation":[{"name":"University of Saskatchewan, SK, Canada"}]},{"given":"Derek L.","family":"Eager","sequence":"additional","affiliation":[{"name":"University of Saskatchewan, SK, Canada"}]}],"member":"320","published-online":{"date-parts":[[2010,2,22]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MMCS.1996.534983"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2003.822796"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/378344.378348"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.09.005"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'97)","author":"Carter R. L.","unstructured":"Carter , R. L. and Crovella , M. E . 1997. Server selection using dynamic path characterization in wide-area networks . In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'97) . 1014--1021. Carter, R. L. and Crovella, M. E. 1997. Server selection using dynamic path characterization in wide-area networks. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'97). 1014--1021."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016695006342"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988744"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1135"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/192593.192614"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the IEEE International Conference on Communications (ICC'86)","author":"Dykeman H. D.","unstructured":"Dykeman , H. D. , Ammar , M. H. , and Wong , J. W . 1986. Scheduling algorithms for videotex systems under broadcast delivery . In Proceedings of the IEEE International Conference on Communications (ICC'86) . Dykeman, H. D., Ammar, M. H., and Wong, J. W. 1986. Scheduling algorithms for videotex systems under broadcast delivery. In Proceedings of the IEEE International Conference on Communications (ICC'86)."},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the Annual Multimedia Computing and Networking Conference (MMCN'00)","author":"Eager D. L.","unstructured":"Eager , D. L. , Vernon , M. K. , and Zahorjan , J . 2000. Bandwidth skimming: A technique for cost-effective video-on-demand . In Proceedings of the Annual Multimedia Computing and Networking Conference (MMCN'00) . 206--215. Eager, D. L., Vernon, M. K., and Zahorjan, J. 2000. Bandwidth skimming: A technique for cost-effective video-on-demand. In Proceedings of the Annual Multimedia Computing and Networking Conference (MMCN'00). 206--215."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.892847"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.802069"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/507670.507692"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'00)","author":"Jamin S.","unstructured":"Jamin , S. , Jin , C. , Jin , Y. , Raz , D. , Shavitt , Y. , and Zhang , L . 2000. On the placement of Internet instrumentation . In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'00) . 295--304. Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., and Zhang, L. 2000. On the placement of Internet instrumentation. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'00). 295--304."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'01)","author":"Jamin S.","unstructured":"Jamin , S. , Jin , C. , Kurc , A. , Raz , D. , and Shavitt , Y . 2001. Constrained mirror placement on the Internet . In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'01) . 31--40. Jamin, S., Jin, C., Kurc, A., Raz, D., and Shavitt, Y. 2001. Constrained mirror placement on the Internet. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'01). 31--40."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/PCCC.2007.358909"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(00)00315-7"},{"key":"e_1_2_1_20_1","volume-title":"Will all of us get our 15 minutes on a YouTube video&quest","author":"Lee G.","unstructured":"Lee , G. 2006. Will all of us get our 15 minutes on a YouTube video&quest ; The Wall St. J. Online , 8\/30\/06. Lee, G. 2006. Will all of us get our 15 minutes on a YouTube video&quest; The Wall St. J. Online, 8\/30\/06."},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'01)","author":"Qiu L.","unstructured":"Qiu , L. , Padmanabhan , V. N. , and Voelker , G. M . 2001. On the placement of web server replicas . In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'01) . 1587--1596. Qiu, L., Padmanabhan, V. N., and Voelker, G. M. 2001. On the placement of web server replicas. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'01). 1587--1596."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316205"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'02)","author":"Ratnasamy S.","unstructured":"Ratnasamy , S. , Handley , M. , Karp , R. , and Shenker , S . 2002. Topologically-aware overlay construction and server selection . In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'02) . 1190--1199. Ratnasamy, S., Handley, M., Karp, R., and Shenker, S. 2002. Topologically-aware overlay construction and server selection. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'02). 1190--1199."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the International Workshop on Web Content Caching and Distribution (WCW '01)","author":"Rost S.","unstructured":"Rost , S. , Byers , J. , and Bestavros , A . 2001. The cyclone server architecture: Streamlining delivery of popular content . In Proceedings of the International Workshop on Web Content Caching and Distribution (WCW '01) . 147--163. Rost, S., Byers, J., and Bestavros, A. 2001. The cyclone server architecture: Streamlining delivery of popular content. In Proceedings of the International Workshop on Web Content Caching and Distribution (WCW '01). 147--163."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of IFIP W. G. 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation (Performance'02)","author":"Tan H.","unstructured":"Tan , H. , Eager , D. L. , and Vernon , M. K . 2002. Delimiting the range of effectiveness of scalable on-demand streaming . In Proceedings of IFIP W. G. 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation (Performance'02) . 387--410. Tan, H., Eager, D. L., and Vernon, M. K. 2002. Delimiting the range of effectiveness of scalable on-demand streaming. In Proceedings of IFIP W. G. 7.3 International Symposium on Computer Performance Modeling, Measurement and Evaluation (Performance'02). 387--410."},{"key":"e_1_2_1_26_1","unstructured":"USA Today. 2006. YouTube serves up 100 million videos a day online. USA Today 8\/16\/06.  USA Today. 2006. YouTube serves up 100 million videos a day online. USA Today 8\/16\/06."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.16350"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.865074"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'96)","author":"Zegura E. W.","unstructured":"Zegura , E. W. , Calvert , K. , and Bhattacharjee , S . 1996. How to model an Internetwork . In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'96) . 594--602. Zegura, E. W., Calvert, K., and Bhattacharjee, S. 1996. How to model an Internetwork. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (InfoCom'96). 594--602."}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1671954.1671955","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1671954.1671955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:40:53Z","timestamp":1750250453000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1671954.1671955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["10.1145\/1671954.1671955"],"URL":"https:\/\/doi.org\/10.1145\/1671954.1671955","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"value":"1551-6857","type":"print"},{"value":"1551-6865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2]]},"assertion":[{"value":"2008-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2010-02-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}