Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Content Placement for Video-on-Demand Services Over Cellular Networks

  • 181 Accesses


The issues of content placement and content replication for video-on-demand streaming over cellular networks are addressed in this study. Using many replications of a relatively small number of the most popular items a significant performance improvement can be achieved. Our method was verified using real video streaming data taken from traces of live content distribution networks. Simulation results show that replicating a relatively small number of video files can significantly reduce the incoming bandwidth from the Internet backbone, as well as the (time) latency for content delivery. The proposed scheme is particularly suitable for IP-based TV services, for which the content popularity can be very often predicted with relatively high accuracy. In addition, we propose a hybrid cache management scheme, in which the cache is partitioned into two components. The first component is for long-term items, and it is updated relatively rarely, while the second component is updated more frequently.

This is a preview of subscription content, log in to check access.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13


  1. 1.

  2. 2.

  3. 3.

  4. 4.

  5. 5.

    Abrahamsson, H., & Bjorkman, M. (2013). Caching for IPTV distribution with time-shift. In: ICNC 2013 (pp. 916–921).

  6. 6.

    Griwodz, C., Bar, M., & Wolf, L. C. (1997). Long-term movie popularity models in video-on-demand systems or the life of an on-demand movie. Proceedings of the fifth ACM international conference on multimedia (Vol. 97, pp. 349–357).

  7. 7.

    Huang, C., Li, J., & Rose, K. W. (2007). Can internet video on demand be profitable? In Proceeding of ACM SIGCOMM 2007.

  8. 8.

    Applegate, D., Archer, A., Gopalakrishnan, V., Lee, S., & Ramakrishnan, K. K. (2016). Optimal content placement for large-scale VoD system. IEEE/ACM Transactions on Networking, 24(4), 2114–2127.

  9. 9.

    Borst, S., Gupta, V., & Walid, A. (2010) Distributed caching algorithms for content distribution networks. In Proceedings of IEEE/ACM INFOCOM 2010.

  10. 10.

    Golrezaei, N., Shanmugan, K. et al. (2012). FemtoCaching: Wireless video content delivery through distributed caching helpers. In Proceedings of IEEE Infocom 2012.

  11. 11.

    Blaszczyszyn, B., & Giovanidis A. (2015). Optimal geographic caching in cellular networks. In: Proceedings of IEEE ICC 2015.

  12. 12.

    Dehghan, M., Seetharam, A., & Jiang, B., et al. (2015). On the complexity of optimal routing and content caching in heterogeneous networks. In Proceedings of IEEE/ACM INFOCOM 2015.

  13. 13.

    Bernardini, C., Silverston, T., & Feswtor, O. (2013). MPC: Popularity-based caching strategy for content centric networks. Proceeding of IEEE ICC 2013 (pp. 3619–3623).

  14. 14.

    Cho, K., Lee, M., & Park, K. (2012). WAVE: Popularity-based and collaborative in-network caching for content-oriented networks. In Proceeding of IEEE INFOCOM 2012 WKSHPS (pp. 316–321).

  15. 15.

    Ong, M. D., Chen, M., Taleb, T., Wang, X., & Leung, V. C. M. (2014). FGPC: Fine-grained popularity-based caching design for content centric networking. Proceeding of ACM MSWiM 2014 (pp. 295–302).

  16. 16.

    Naor, Z., Das, S. K., & Raj, M. (2015). Content placement for video streaming over cellular networks. In IEEE ICNC, February 16–19, 2015.

  17. 17.

    Tewari, S., & Kleinrock, L. (2006). Proportional replication in peer-to-peer networks. In IEEE Infocom 2006.

  18. 18.

    Bo, T., & Massoulie, L. (2013). Optimal content placement for peer-to-peer video-on-demand systems. IEEE/ACM Transactions on Networking (TON), 21(2), 566–579.

  19. 19.

    3GPP TS 23.246 V7.1.0. (2006). Technical Specification Group Services and System Aspects; Multimedia Broadcast/Multicast Service; Stage 1 (Release 7).

  20. 20.

    Holma, H., & Toskala, A. (2003). WCDMA for UMTS: Radio access for third generation mobile communications. London: Wiley.

  21. 21.

    Zipf, G. K. (1949). Human behaviour and the principle of leas-effort. Boston: Eddison-Wesley.

  22. 22.

    Hun, K. A., Cai, Y., Sheu, S. (1998). Patching: A multicast technique for true video-on-demand services. In Proceeding of ACM multimedia (pp. 191–200).

  23. 23.

    Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman.

  24. 24.

    Ibarra, O. H., & Kim, C. E. (1975). Fast approximation algorithms for the Knapsack and sum of subset problems. JACM, 22(4), 463–468.

  25. 25.

    Lawler, E. L. (1979). Fast approximation algorithms for Knapsack problems. Mathematics of operations research, 4(4), 339–356.

  26. 26.

    OMNET\({++}\) Network Simulator,

  27. 27.

    Silverston, T., & Fourmaux, O. (2007). MeasuringP2PIPTVsystems. In Proceedings of ACM NOSSDAV 2007.

  28. 28.


  29. 29.


  30. 30.


Download references

Author information

Correspondence to Zohar Naor.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Naor, Z., Das, S.K. & Raj, M. Content Placement for Video-on-Demand Services Over Cellular Networks. Wireless Pers Commun 98, 467–486 (2018).

Download citation


  • IPTV
  • Content distribution networks
  • Video streaming
  • Content placement
  • Cellular networks