{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:35Z","timestamp":1750221035713,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T00:00:00Z","timestamp":1548288000000},"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. Model. Perform. Eval. Comput. Syst."],"published-print":{"date-parts":[[2019,3,31]]},"abstract":"<jats:p>We consider the task of content replication in distributed content delivery systems used by Video-on-Demand (VoD) services with large content catalogs. The prior work in this area focuses on the setting where each request is generated independent of all past requests. Motivated by the fact that most popular VoD services offer recommendations to users based on their viewing history, in a departure from existing studies, we study the setting with time-correlation in requests coming from each user.<\/jats:p>\n          <jats:p>We use a Markovian process to model each user\u2019s request process. In addition to introducing time-correlation in user requests, our model is consistent with empirically observed properties of the request process for VoD services with recommendation engines. In the setting where the underlying Markov Chain is unknown and has to be learned from the very requests the system is trying to serve, we show that separating the task of estimating content popularity and using the estimates to design a static content replication policy is strictly sub-optimal. To prove this, we show that an adaptive policy, which jointly performs the task of estimation and content replication, outperforms all policies that separate the task of estimation and content replication.<\/jats:p>","DOI":"10.1145\/3289324","type":"journal-article","created":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T14:01:39Z","timestamp":1548684099000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Effect of Recommendations on Serving Content with Unknown Demand"],"prefix":"10.1145","volume":"4","author":[{"given":"Samarth","family":"Gupta","sequence":"first","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sharayu","family":"Moharir","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,24]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Youtube. ({n.d.}). YouTube. Retrieved from http:\/\/www.youtube.com.  Youtube. ({n.d.}). YouTube. Retrieved from http:\/\/www.youtube.com."},{"key":"e_1_2_1_2_1","unstructured":"Netflix. ({n.d.}). Netflix. Retrieved from www.netflix.com.  Netflix. ({n.d.}). Netflix. Retrieved from www.netflix.com."},{"key":"e_1_2_1_3_1","unstructured":"Cisco. ({n.d.}). Cisco Whitepaper. Retrieved from http:\/\/www.cisco.com\/c\/en\/us\/solutions\/collateral\/service-provider\/ip-ngn-ip-next-generation-network\/white_paper_c11-481360.html.  Cisco. ({n.d.}). Cisco Whitepaper. Retrieved from http:\/\/www.cisco.com\/c\/en\/us\/solutions\/collateral\/service-provider\/ip-ngn-ip-next-generation-network\/white_paper_c11-481360.html."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2591978"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254756.2254764"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITC.2015.11"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/msom.1050.0086"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465529.2465757"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2306938"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2015.7308972"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3001647.3001661"},{"key":"e_1_2_1_12_1","unstructured":"Xu Cheng Cameron Dale and Jiangchuan Liu. 2007. Understanding the characteristics of Internet short video sharing: YouTube as a case study. arXiv preprint arXiv:0707.3670 (2007).  Xu Cheng Cameron Dale and Jiangchuan Liu. 2007. Understanding the characteristics of Internet short video sharing: YouTube as a case study. arXiv preprint arXiv:0707.3670 (2007)."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062028"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879193"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716310"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057031"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67235-9_18"},{"key":"e_1_2_1_18_1","unstructured":"zipf-wiki. ({n.d.}). Zipf\u2019s Law on Wikipedia. Retrieved from http:\/\/en.wikipedia.org\/wiki\/Zipf\u2019s_law.  zipf-wiki. ({n.d.}). Zipf\u2019s Law on Wikipedia. Retrieved from http:\/\/en.wikipedia.org\/wiki\/Zipf\u2019s_law."},{"key":"e_1_2_1_19_1","first-page":"143","article-title":"Zipf\u2019s law and the Internet","volume":"3","author":"Adamic Lada A.","year":"2002","journal-title":"Glottometrics"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731118"}],"container-title":["ACM Transactions on Modeling and Performance Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289324","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3289324","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:38Z","timestamp":1750207418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,24]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3,31]]}},"alternative-id":["10.1145\/3289324"],"URL":"https:\/\/doi.org\/10.1145\/3289324","relation":{},"ISSN":["2376-3639","2376-3647"],"issn-type":[{"type":"print","value":"2376-3639"},{"type":"electronic","value":"2376-3647"}],"subject":[],"published":{"date-parts":[[2019,1,24]]},"assertion":[{"value":"2017-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-01-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}