Skip to main content
SpringerLink
Log in

Content-aware replica placement strategy for IPTV services over peer-service area architecture

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Due to the enormous improvement in networking and multimedia, IPTV has become recently a popular means to distribute high quality TV services over IP networks. Accordingly, Telecommunication companies started the competition to provide IPTV services to increase their customer base and profit. The key concern of service providers in this hectic competition is to provide high quality service with lower cost. However, the contents’ popularity and the users’ preferences are fluctuated rapidly, which leads to resources waste and load imbalance. Thus, the contents’ status should be considered during the content replication to save resources and reduce service cost. To the best of our knowledge, there is no work investigate the impact of contents’ status on building Replica Placement Strategy. Therefore, this paper studies the impact of contents’ status on replica placement strategy over the peer-service area architecture. Two optimization models are proposed Cost Effective Model (CE), which replicates the contents partially without considering contents’ status and Cost Effective with Load Balance model (CELB), which considers the contents’ status. Both models have been solved using Hybrid Genetic Algorithm. The experimental results show that CELB model outperforms the other models in terms of Storage Saving Ratio (SSR), load distribution, and allocation cost.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Almeida JM (2003) Streaming content distribution networks with minimum delivery cost, Ph.D. thesis, University of Wisconsin, Madison

  2. Bektas T, Cordeau J, Erkut E, Laporte G (2008) Exact algorithms for the joint object placement and request routing problem in content distribution networks. J Comput Opera Res 35(12):3860–3884

    Article  MATH  Google Scholar 

  3. Bisdikian CC, Patel BB (1996) Cost-based program allocation for distributed multimedia-on-demand systems. IEEE Multimed 3(3):62–72

    Article  Google Scholar 

  4. Bolosky WJ, Barrera JS, Draves RP, Fitzgerald RP, Gibson GA, Jones MB, Levi SP, Myhrvold NP, Rashid RF (1996) The tiger video fileserver. Technical Report (MSR-TR-96-09), Microsoft Research

  5. Bowen Y, Haochun W, Jiazheng L, Yunwen G (2011) An adaptive simulated annealing genetic algorithm for the data placement problem in SaaS. Am J Eng Technol Res 11(9):2429–2435

    Google Scholar 

  6. Brubeck DW, Rowe LA (1996) Hierarchical storage management in a distributed video-on-demand system. IEEE Multimed 3(3):37–47

    Article  Google Scholar 

  7. Choi KMF, Lee JHM, Stuckey PJ (1998) A Lagrangian reconstruction of a class of local search methods. Proceedings of 10th IEEE International Conference on Tools with Artificial Intelligence. IEEE Press, Taipei, pp 166–175

    Google Scholar 

  8. Cholvi V, Segarra J (2008) Analysis and placement of storage capacity in large distributed video servers. Comput Commun 31(15):3604–3612

    Article  Google Scholar 

  9. Chou C, Golubchik L, Lui JCS (2000) Striping doesn’t scale: how to achieve scalability for continuous media servers with replication. The 20th Int Conf Distrib Comput Syst, Taipei, 64–71

  10. Cidon I, Kutten S, Soffer R (2002) Optimal allocation of electronic content. J Comput Netw 40(2):205–218

    Article  Google Scholar 

  11. Cruz Llopis L, Rodas A, Gargallo E, Igartua MA (2012) Load splitting in clusters of video servers. Comput Commun 35(8):993–1003

    Article  Google Scholar 

  12. Diaz MEA, Huh EN (2011) Cost analysis on IPTV hosting service for 3rd party providers. Proc 5th ACM Int Conf Ubiquitous Inform Manag Commun (ICUIMC ’11) 114–121

  13. Du Z, Hu J, Chen Y, Cheng Z, Wang X (2011) Optimized QoS-aware replica placement heuristics and applications in astronomy data grid. J Syst Softw 84(7):1224–1232

    Article  Google Scholar 

  14. Dukes J, Jones J (2004) Using dynamic replication to manage service availability in a multimedia server cluster. In: Vincent R, Franck R (eds) Interactive multimedia and next generation networks (3311), Lecture notes in computer science. Springer, Berlin / Heidelberg, pp 194–205

    Chapter  Google Scholar 

  15. Ebara H, Abe Y, Ikeda D, Tsutsui T, Sakai K, Nakaniwa A, Okada H (2005) A cost effective dynamic content migration method in CDNs. IEICE Trans Commun 88-B(12):4598–4604

    Article  Google Scholar 

  16. Elmihoub T, Hopgood AA, Nolle L, Battersby A (2006) Hybrid genetic algorithms—a review. Eng Lett 13:124–137

    Google Scholar 

  17. Fati S, Sumari P, Budiartu R (2015) Fair and popularity based content allocation scheme for IPTV delivery networks. Int J Comput Appl 131(5):21–26

    Google Scholar 

  18. Gaber S, Sumari P (2012) Predictive and content-aware load balancing algorithm for peer-service area based IPTV networks. Multimed Tools Appl, Springer Netherlands, (Available Online). doi: 10.1007/s11042-012-1209-7

  19. Gafsi J, Biersack EW (2000) Modeling and performance comparison of reliability strategies for distributed video servers. IEEE Trans Parallel Distrib Syst 11(4):412–430

    Article  Google Scholar 

  20. Ganger GR, Worthington BL, Hou RY, Patt YN (1993) Disk subsystem load balancing: disk striping vs. conventional data placement, the Twenty-Sixth International Conference on System Sciences, Hawaii, 40–49

  21. Gkatzikis L, Sourlas V, Fischione C, Koutsopoulos, Dan G (2015) Clustered content replication for hierarchical content delivery networks. IEEE Int Conf Commun (ICC) 5872–5877

  22. Goldberg DE (1989) Genetic algorithm in search, optimization, and machine learning (Eds.), Addison-Wesley

  23. Guo J, Wang Y, Tang K, Chan S, Wong E, Taylor P, Zukerman M (2008) Evolutionary optimization of file assignment for a large-scale video-on-demand system. IEEE Trans Knowl Data Eng 20(6):836–850

    Article  Google Scholar 

  24. Hei X, Liang C, Liang J, Liu Y, Ross KW (2007) A measurement study of a large-scale P2P IPTV system. IEEE Trans Multimed 9(8):1672–1687

    Article  Google Scholar 

  25. Henny Bekker H, Verharen E (2000) Streaming media cashing and replication techniques. Technical Report, Surfnet. VIP/D3.1 C2

  26. Ho K, Poon W, Lo K (2010) An evolutionary video assignment optimization technique for VOD system in heterogeneous environment. Int J Digit Multimed Broadcast 2010, Article ID 645049, 13 pages

  27. Huang C, Li J, Ross KW (2007) Can internet video-on-demand be profitable?, the ACM conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM ’07), New York, 133–144

  28. Joe I, Yi JH, Sohn KS (2012) A content-based caching algorithm for streaming media cache servers in CDN. In Multimedia, Computer Graphics and Broadcasting (28–36). Springer Berlin Heidelberg

  29. Karlsson M, Karamanolis C (2004) Choosing replica placement heuristics for wide-area systems. Proc 24th Int Conf Distrib Comput Syst (ICDCS ’04) 350–359

  30. Karlsson M, Karamanolis C, Mahalingam M (2002) A framework for evaluating replica placement algorithms, Technical Report HPL-2002, HP Laboratories

  31. Khan S, Ahmad I (2008) Comparison and analysis of ten static heuristics-based Internet data replication techniques. J Parallel Distrib Comput 68(2):113–136

    Article  MATH  Google Scholar 

  32. Kim C, Bak Y, Woo S, Lee W, Min O, Kim H (2006) Design and implementation of a storage management method for content distribution. 8th Int Conf Adv Commun Technol, Phoenix Park 2:1147–1151

    Google Scholar 

  33. Kokash N (2005) An introduction to heuristic algorithms. technical report. Department of Informatics and Telecommunications. University of Trento, Italy

    Google Scholar 

  34. Konak A, Bartolacci M (2007) Designing survivable resilient networks: a stochastic hybrid genetic algorithm approach OMEGA. Int J Manag Sci 35(6):645–658

    Google Scholar 

  35. Konak A, Kulturel-Konak S, Norman B, Smith A (2006) A new mixed integer programming formulation for facility layout design using flexible bays. Oper Res Lett 34(6):660–672

    Article  MathSciNet  MATH  Google Scholar 

  36. Kulatunga C, Kandavanam G, Rana AI, Balasubramaniam S, Botvich D (2011) HySAC: a hybrid delivery system with adaptive content management for IPTV networks. IEEE Int Conf Commun (ICC), Kyoto 1–5

  37. Laoutaris N, Zissimopoulos V, Stavrakakis I (2005) On the optimization of storage capacity allocation for content distribution. J Comput Netw 47(3):409–428

    Article  Google Scholar 

  38. Lee S, Muntean GM, Smeaton AF (2009) Performance-aware replication of distributed pre-recorded IPTV content. IEEE Trans Broadcast 55(2):516–526

    Article  Google Scholar 

  39. Lee JYB, Wong PC (2000) Performance analysis of a pull-based parallel video server. IEEE Trans Parallel Distrib Syst 11(12):1217–1231

    Article  Google Scholar 

  40. Li M, Wu C (2010) A cost-effective resource allocation and management scheme for content networks supporting IPTV services. J Comput Commun 33(1):83–91

    Article  Google Scholar 

  41. Lin Y, Lai H, Lai Y (1996) A hierarchical network storage architecture for video-on-demand services, the 21st Annual IEEE Conference on Local Computer Networks. IEEE Computer Society, Washington, DC, pp 355–364

    Google Scholar 

  42. Little T, Venkatesh D (1993) Probabilistic assignment of movies to storage devices in a video-on-demand system. In: Doug S, Blair GS, Coulson G, Davies N, Garcia F (eds) Network and operating system support for digital audio and video (846), Lecture notes in computer science. Springer, London, pp 204–215

    Google Scholar 

  43. Loukopoulos T, Ishfaq A (2004) Static and adaptive distributed data replication using genetic algorithms. J Parallel Distrib Comput 64(11):1270–1285

    Article  MATH  Google Scholar 

  44. Maaranen H, Miettinen K, Penttinen A (2007) On initial populations of a genetic algorithm for continuous optimization problems. J Glob Optim 37(3):405–436

    Article  MathSciNet  MATH  Google Scholar 

  45. Mahmood A (2010) Replicating web contents using a hybrid particle swarm optimization. J Inform Process Manag 46(2):170–179

    Article  Google Scholar 

  46. Montpetit M, e Klym N, Mirlacher T (2011) The future of IPTV - connected, mobile, personal and social. J Multimed Tools Appl Springer 53(3):519–532

    Article  Google Scholar 

  47. Montpetit M, Klym N, Blain E (2010) The future of mobile TV: when mobile TV meets the internet and social networking. In Mobile TV: Customizing Content and Experience, Human-Computer Interaction Series, Springer 305–326

  48. Nafaa A, Murphy S, Murphy L (2008) Analysis of large scale VoD architecture for broadband operators: a p2p-based solution. IEEE Commun Mag 46(12):47–55

    Article  Google Scholar 

  49. Neves T, Drummond L, Ochi L, Albuquerque C, Uchoa E (2010) Solving replica placement and request distribution in content distribution networks. Electron Notes Discrete Math 36(1):89–96

    Article  MATH  Google Scholar 

  50. Nowsu K, Bobbie P, Thuraisingham B (1995) Data allocation and spatio-temporal implications for video-on-demand systems. 14th IEEE Ann Int Phoenix Conf Comput Commun, Scottsdale, AZ, USA 629–635

  51. Nussbaumer J, Patel B, Schaffa F, Sterbenz J (1995) Networking requirements for interactive video on demand. IEEE Jo Select Areas Commun 13(5):779–787

    Article  Google Scholar 

  52. Osorio-Hernandez LG, Mezura-Montes E, Cruz-Cortes N, Rodriguez-Henriquez F (2009) A genetic algorithm with repair and local search mechanisms able to find minimal length addition chains for small exponents. Proceedings of the Eleventh conference on Congress on Evolutionary Computation (CEC’09). IEEE Press, Piscataway, pp 1422–1429

    Google Scholar 

  53. Peter WK, Lui LJCS, Golubchik L (2000) Threshold-based dynamic replication in large-scalevideo-on-demand systems. Multimed Tools Appl 11(1):35–62

    Article  MATH  Google Scholar 

  54. Philippe Codognet and Daniel Diaz (2001) Yet another local search method for constraint solving. In: Steinhfel K (ed) Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications (SAGA ’01). Springer, London, pp 73–90

    Google Scholar 

  55. Salcedo-Sanz S (2009) A survey of repair methods used as constraint handling techniques in evolutionary algorithms. Comput Sci Rev 3(3):175–192

    Article  MATH  Google Scholar 

  56. Saxena D, Raychoudhury V, Suri N, Becker C, Cao J (2016) Named data networking: a survey. Comput Sci Rev

  57. Scheuermann P, Weikum G, Zabback P (1998) Data partitioning and load balancing in parallel disk systems. VLDB J 7(1):48–66

    Article  Google Scholar 

  58. Sobe A, Elmenreich W, Böszörmenyi L (2010) Towards a self-organizing replication model for non-sequential media access, the 2010 ACM workshop on Social, adaptive and personalized multimedia interaction and access(SAPMIA ’10), New York, NY, USA 3–8

  59. Sujatha DN, Girish K, Venugopal KR, Patnaik LM (2008) In: Shrisha R, Mainak C, Prasad J, Murthy C, Saha S (eds) An efficient storage mechanism to distribute disk load in a VoD server, the 9th international conference on Distributed computing and networking (ICDCN’08). Springer, Berlin, pp 478–483

    Google Scholar 

  60. Sun J, Gao S, Yang W, Jiang Z (2011) Heuristic replica placement algorithms in content distribution networks. J Netw 6(3):416–423

    Google Scholar 

  61. Tang K, Ko K, Chan S, Wong E (2001) Optimal file placement in VOD system using genetic algorithm. IEEE Trans Indust Electron 48(5):891–897

    Article  Google Scholar 

  62. Tang X, Xu J (2005) QoS-aware replica placement for content distribution. IEEE Trans Parallel Distrib Syst 16(10):921–932

    Article  Google Scholar 

  63. Tenzakhti F, Day K, Olud-Khaoua M (2004) Replication algorithms for the world-wide web. J Syst Architect 50(10):591–605

    Article  Google Scholar 

  64. Tsao S, Chen M, Ko M, Ho J, Huang Y (1999) Data allocation and dynamic load balancing for distributed video storage server. J Vis Commun Image Represent 10(2):197–218

    Article  Google Scholar 

  65. Vinay A, Prakash A, Kumar DSK, Nagabhushan K, Anitha TN (2011) A novel and optimal video replication technique for video-on-demand systems, the International Conference Workshop on Emerging Trends in Technology (ICWET ”11). ACM, New York, pp 344–350

    Google Scholar 

  66. Wah BW (1984) File placement on distributed computer systems. IEEE Comput 17(1):23–32

    Article  Google Scholar 

  67. Wang Y, Du D (1997) Weighted striping in multimedia servers, the International Conference on Multimedia Computing and Systems (ICMCS ”97). IEEE Computer Society, Washington, DC, pp 102–119

    Google Scholar 

  68. Wang Z, Li T, Xiong N, Pan Y (2012) A novel dynamic network data replication scheme based on historical access record and proactive deletion. J Supercomput 62(1):227–250

    Article  Google Scholar 

  69. Wauters T, Coppens J, Turck F, Dhoedt B, Demeester P (2006) Replica placement in ring based content delivery networks. Comput Commun 29(16):3313–3326

    Article  Google Scholar 

  70. Wolf J (1989) The placement optimization program: a practical solution to the disk file assignment problem. SIGMETRICS Perform Eval Rev 17(1):1–10

    Article  MathSciNet  Google Scholar 

  71. Xinjie Y, Mitsuo G (2010) Introduction to evolutionary algorithms, Springer

  72. Yarali A, Cherry A (2005) Internet Protocol Television (IPTV), the international technical conference sponsored by IEEE Region (TENCON05), Melbourne, Australia, 1–6

  73. Zaman S, Grosu D (2011) A distributed algorithm for the replica placement problem. IEEE Trans Parallel Distrib Syst 22(9):1455–1468

    Article  Google Scholar 

  74. Zhiyong X, Bhuyan L (2005) “QoS-aware object replica placement in CDNs,” Global Telecommunications Conference, 2005. GLOBECOM ’05. IEEE 2, 5, 866

  75. Zhou X, Xu C (2002) Optimal video replication and placement on a cluster of video-on-demand servers. IEEE Int Conf Parallel Process (ICPP ’02), Washington, 547–552

  76. Zhou X, Xu CZ (2007) Efficient algorithms of video replication and placement on a cluster of streaming servers. J Netw Comput Appl 30(2):515–540

    Article  MathSciNet  Google Scholar 

  77. Zhu L, Sahinoglu Z, Cheng G, Vetro A, Ansari N, Sun H (2003) Proxy caching for video on demand systems in multicast networks, Conference on Information Sciences and Systems (CISS’03). Johns Hopkins University, Baltimore

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Communications and Technology, Universiti Tunku Abdulrahman, Kampar, Malaysia

    Suliman Mohamed Fati

  2. Multimedia Research Group, School of Computer Sciences, University Sains Malaysia (USM), 11800, P. Penang, Malaysia

    Putra Sumari

Authors
  1. Suliman Mohamed Fati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Putra Sumari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suliman Mohamed Fati.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fati, S.M., Sumari, P. Content-aware replica placement strategy for IPTV services over peer-service area architecture. Multimed Tools Appl 76, 10041–10065 (2017). https://doi.org/10.1007/s11042-016-3593-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-016-3593-x

Keywords

Search

Navigation