Abstract

In recent years, IP network has been considered as a new delivery network for TV services. A majority of the telecommunication industries have used IP network to offer on-demand services and linear TV services as it can offer a two-way and high-speed communication. In order to effectively and economically utilize the IP network, caching is the technique which is usually preferred. In IPTV system, a managed network is utilized to bring out TV services, the requests of Video on Demand (VOD) objects are usually combined in a limited period intensively and user preferences are fluctuated dynamically. Furthermore, the VOD content updates often under the control of IPTV providers. In order to minimize this traffic and overall network cost, a segment of the video content is stored in caches closer to subscribers, for example, Digital Subscriber Line Access Multiplexer (DSLAM), a Central Office (CO) and Intermediate Office (IO). The major problem focused in this approach is to determine the optimal cache memory that should be assigned in order to attain maximum cost effectiveness. This approach uses an effective Grate Deluge algorithm based Particle Swarm Optimization (GDPSO) approach for attaining the optimal cache memory size which in turn minimizes the overall network cost. The analysis shows that hierarchical distributed caching can save significant network cost through the utilization of the GDPSO algorithm.

Keywords:

Digital Subscriber Line Access Multiplexer (DSLAM), Grate Deluge (GD) algorithm, IPTV, PSO, Video on Demand (VOD),

References

1. Agrawal, D., M.S. Beigi, C. Bisdikian and L. Kang-Won, 2007. Planning and managing the IPTV service deployment. Proceeding of the 10th IFIP/IEEE International Symposium on Integrated Network Management (IM '07). Munich, Germany, pp: 353-362.
   CrossRef    
2. Almeida, J.M., D.L. Eager and M.K. Vernon, 2001. A hybrid caching strategy for streaming media files. Proceeding of the SPIE/ACM Conference on Multimedia Computing and Networking.
   
3. Anna, S. and P. Michael, 2006. Efficient caching of video content to an architecture of proxies according to a frequency-based cache management policy. Proceedings of the 2nd International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA '06), NY.
   
4. Bill, K., B.S. Lev and A. Anshul, 2008. Optimal cache partitioning in IPTV network. Proceedings of 11th Communications and Networking Simulation Symposium (CNS'08). Ottawa, Canada, April 14-17, pp: 79-84.
   PMid:18251336    
5. Bill, K., B.S. Lev and A. Anshul, 2009. Hierarchical cache optimization in IPTV networks. Proceeding of the IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB '09).
   
6. Breslau, L., P. Cao, L. Fan, G. Phillips and S. Shenker, 1999. Web caching and Zipf-like distributions: Evidence and implications. Proceedings of the 18th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '99), 1: 126-134.
   CrossRef    
7. Chae, Y., K. Guo, M.M. Buddhikot, S. Suri and E.W. Zegura, 2002. Silo, rainbow and caching token: Schemes for scalable, fault tolerant stream caching. IEEE J. Sel. Area Comm., 20(7): 1328-1344.
   CrossRef    
8. De-Vleeschauwer, D. and K. Laevens, 2007. Caching to Reduce the Peak Rate. Alcatel-lucent Internal Report. Retrieved from: www.docstoc.com/.../ Particle-Swarm-Intelligence-Approach-for-Enhanc.
   
9. De Vleeschauwer, D. and K. Laevens, 2009. Performance of caching algorithms for IPTV on-demand services. IEEE T. Broadcast., 55(2): 491-501.
   CrossRef    
10. Eager, D., M. Ferris and M. Vernon, 1999. Optimized regional caching for on-demand data delivery. Proceedings of the Multimedia Computing and Networking (MMCN'99). San Jose, California.
    
11. Eberhart, R. and Y. Shi, 1998. Comparison between genetic algorithms and particle swarm optimization. Proceedings of the 7th Annual Conference on Evolutionary Programming. Springer, Berlin, pp: 611-618.
    CrossRef    
12. Henrik, A. and B. Mats, 2010. Simulation of IPTV caching strategies. Proceeding of the International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS). Ottawa, ON, pp: 187-193.
    
13. Hsuan, C., C. Chi-He, T. Chao-Wei and L. Chi-Shi, 2011. Window-based popularity caching for IPTV on-demand services. ISRN Commun. Network., 2011(2011): 1-11.
    CrossRef    
14. Imran, K., M. Mellia and M. Meo, 2007. Measurements of multicast television over IP. Proceeding of the 15th IEEE Workshop on Local and Metropolitan Area Networks (LANMAN 2007). Princeton, NJ, pp: 170-175.
    CrossRef    
15. Kennedy, J., 1997. The particle swarm: Social adaptation of knowledge. Proceedings of the IEEE International Conference on Evolutionary Computation. Indianapolis, IN, 1: 303-308.
    CrossRef    
16. Kennedy, J. and R. Eberhart, 1995. Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks. Perth, WA, pp: 1942-1948.
    CrossRef    
17. Krogfoss, B., L. Sofman and A. Agrawal, 2008. Caching architectures and optimization strategies for IPTV networks. Bell Labs Tech. J., 13: 13-28.
    CrossRef    
18. Liu, J. and J. Xu, 2004. Proxy caching for media streaming over the internet. IEEE Commun. Mag., 42: 88-94.
    CrossRef    
19. Po-Han, W. and H. Yu-Hen, 2011. Optimal layered video IPTV multicast streaming over mobile WiMAX systems. IEEE T. Multimedia, 13(6): 1395-1403.
    CrossRef    
20. Prasad, C., C. Prashanth, T. Gregg, H. Nathan, R. Rajiv, Y. Delei, L. Ying, X. Lixia and Y. Daoyan, 2012. Multi-resolution multimedia QoE models for IPTV applications. Int. J. Digit. Multimedia Broadcast., 2012(2012): 1-13.
    
21. Sajjad, G., P.K. Rahim, S.M. Mahdi and R.M. Mohammad, 2012. A modified PSO using great deluge algorithm for optimization. J. Basic Appl. Sci. Res., 2(2): 1362-1367.
    
22. Sarhan, N.J. and C.R. Das, 2008. Caching and scheduling in NAD-based multimedia servers. IEEE T. Parall. Distr., 15(10): 921-933.
    CrossRef    
23. Sentinelli, A., G. Marfia, M. Gerla, L. Kleinrock and S. Tewari, 2007. Will IPTV ride the peer-to-peer stream? [Peer-to-peer multimedia streaming]. IEEE Commun. Mag., 45(6): 86-92.
    CrossRef    
24. Shi, Y.H. and R.T. Eberhart, 1998. A modified particle swarm optimizer. Proceedings of the IEEE International Conference on Evolutionary Computation, Proceedings of IEEE World Congress on Computational Intelligence. Anchorage, AK, pp: 69-73.
    CrossRef    
25. Smith, D.E., 2007. IPTV bandwidth demand: Multicast and channel surfing. Proceeding of the 26th IEEE International Conference on Computer Communications (INFOCOM 2007). Anchorage, AK, 6-12 May, pp: 2546-2550.
    CrossRef    
26. Somu, M. and N. Rengarajan, 2012. Particle swarm intelligence approach for enhanced hierarchical cache optimization in IPTV networks. Eur. J. Sci. Res., 76(3): 366-378.
    
27. Turrini, D. and F. Panzieri, 2002. Using p2p techniques for content distribution internetworking: A research proposal. Proceeding of the 2nd IEEE International Conference on Peer-to-Peer Computing, pp: 171-172.
    
28. Van den Bergh, F., 2002. An analysis of particle swarm optimizers. Ph.D. Thesis, University of Pretoria, Elandspoort 357-Jr, Pretoria 0002, South Africa.
    
29. Vanichpun, S. and A.M. Makowski, 2004. Comparing strength of locality of reference-popularity, majorization and some folk theorems. Proceeding of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), 2: 838-849.
    CrossRef    
30. Vleeschauwer, D.D., Z. Avramova, S. Wittevrongel and H. Brueel, 2009. Transport capacity for a catch-up television service. Proceedings of the EuroITV'09. Leuven, Belgium, pp: 161-170.
    CrossRef    
31. Won, J.W., J.W.K. Hong, C. Mi-Jung, H. Chan-Kyu and Y. Jae-Hyoung, 2008. Measurement of download and play and streaming IPTV traffic. IEEE Commun. Mag., 46(10): 154-16.
    CrossRef    
32. Xin, W., Z. Changyi, Z. Zhenyuan, L. Hong and X. Xiangyang, 2008. The design of video segmentation aided VCR support for P2P VoD systems. IEEE T. Consum. Electr., 54(2): 531-537.
    CrossRef    
33. Zipf-Mandelbrot, 1999. Law.
    Direct Link

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.