Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: IPTV service providers offering Video-on-Demand currently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes, it will soon become infeasible to replicate the entire library at each office.  present an approach for intelligent content placement that scales to large library sizes (e.g., 100 Ks of videos).  formulate the problem as a mixed integer program (MIP) that takes into account constraints such as disk space, link bandwidth, and content popularity. To overcome the challenges of scale,  employ a Lagrangian relaxation-based decomposition technique combined with integer rounding. Our technique finds a near-optimal solution (e.g., within 1%–2%) with orders of magnitude speedup relative to solving even the linear programming (LP) relaxation via standard software.  also present simple strategies to address practical issues such as popularity estimation, content updates, short-term popularity fluctuation, and frequency of placement updates. Using traces from an operational system,  show that our approach significantly outperforms simpler placement strategies. For instance, our MIP-based solution can serve all requests using only half the link bandwidth used by least recently used (LRU) or least frequently used (LFU) cache replacement policies.  also investigate the tradeoff beten disk space and network bandwidth.
['David Applegate', 'Aaron Archer', 'Vijay Gopalakrishnan', 'Seungjoon Lee', 'K. K. Ramakrishnan']
I am writing a research paper on a idea Optimal Content Placement for a Large-Scale VoD System
[{"from": "human", "value": "I am writing a research paper on a idea Optimal Content Placement for a Large-Scale VoD System"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: IPTV service providers offering Video-on-Demand currently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes, it will soon become infeasible to replicate the entire library at each office.  present an approach for intelligent content placement that scales to large library sizes (e.g., 100 Ks of videos).  formulate the problem as a mixed integer program (MIP) that takes into account constraints such as disk space, link bandwidth, and content popularity. To overcome the challenges of scale,  employ a Lagrangian relaxation-based decomposition technique combined with integer rounding. Our technique finds a near-optimal solution (e.g., within 1%\u20132%) with orders of magnitude speedup relative to solving even the linear programming (LP) relaxation via standard software.  also present simple strategies to address practical issues such as popularity estimation, content updates, short-term popularity fluctuation, and frequency of placement updates. Using traces from an operational system,  show that our approach significantly outperforms simpler placement strategies. For instance, our MIP-based solution can serve all requests using only half the link bandwidth used by least recently used (LRU) or least frequently used (LFU) cache replacement policies.  also investigate the tradeoff beten disk space and network bandwidth."}]