树形网络中的一种有效视频内容分发算法
发布时间：2018-11-14 09:21
【摘要】：随着互联网中视频内容比重的迅速增加,视频业务随之也在不断的增加,这些视频业务将占据大量的互联网带宽.如何节约带宽和提高视频服务质量已成为互联网研究中的重要研究课题,而提高视频业务服务质量的两个主要途径是增加网络带宽和增加网络中缓存视频服务器的容量.为了使得视频服务商对增加带宽和增加缓存容量的投入最小化,就要决定网络视频内容在网络服务器中如何放置和分发.在本文中,首先我们基于内容放置和内容传输代价对树形网络中的视频内容放置问题进行数学建模,其次我们根据该数学模型提出一种有效的动态规划算法.该算法不仅可以有效解决了我们提出模型中的整数规划问题,而且其时间复杂度为O(NP).
[Abstract]:With the rapid increase of the proportion of video content in the Internet, the video services will occupy a large amount of Internet bandwidth. How to save bandwidth and improve the quality of video service has become an important research topic in the Internet. The two main ways to improve the quality of service of video services are to increase the bandwidth of the network and increase the capacity of cached video servers in the network. In order to minimize the investment of video service providers to increase bandwidth and cache capacity, it is necessary to decide how to place and distribute network video content in network servers. In this paper, we first model the video content placement problem in a tree network based on content placement and content transfer cost, and then we propose an effective dynamic programming algorithm based on this mathematical model. This algorithm not only solves the integer programming problem in our model effectively, but also has a time complexity of O (NP).
【作者单位】： 中国科学技术大学计算机科学与技术学院;
【基金】：国家自然科学基金项目(61170233,60970128)资助
【分类号】：TP393.02
，
本文编号：2330773
[Abstract]:With the rapid increase of the proportion of video content in the Internet, the video services will occupy a large amount of Internet bandwidth. How to save bandwidth and improve the quality of video service has become an important research topic in the Internet. The two main ways to improve the quality of service of video services are to increase the bandwidth of the network and increase the capacity of cached video servers in the network. In order to minimize the investment of video service providers to increase bandwidth and cache capacity, it is necessary to decide how to place and distribute network video content in network servers. In this paper, we first model the video content placement problem in a tree network based on content placement and content transfer cost, and then we propose an effective dynamic programming algorithm based on this mathematical model. This algorithm not only solves the integer programming problem in our model effectively, but also has a time complexity of O (NP).
【作者单位】： 中国科学技术大学计算机科学与技术学院;
【基金】：国家自然科学基金项目(61170233,60970128)资助
【分类号】：TP393.02
，
本文编号：2330773
本文链接：https://www.wllwen.com/guanlilunwen/ydhl/2330773.html
