树形网络中的一种有效视频内容分发算法  

An Efficient Video Content Distribution Algorithm for Tree Networks

作　　者：吴宣够[1] 熊焰[1] 印凤行[1] 

机构地区：[1]中国科学技术大学计算机科学与技术学院,合肥230027

出　　处：《小型微型计算机系统》2013年第8期1728-1731,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61170233;60970128)资助

摘　　要：随着互联网中视频内容比重的迅速增加,视频业务随之也在不断的增加,这些视频业务将占据大量的互联网带宽.如何节约带宽和提高视频服务质量已成为互联网研究中的重要研究课题,而提高视频业务服务质量的两个主要途径是增加网络带宽和增加网络中缓存视频服务器的容量.为了使得视频服务商对增加带宽和增加缓存容量的投入最小化,就要决定网络视频内容在网络服务器中如何放置和分发.在本文中,首先我们基于内容放置和内容传输代价对树形网络中的视频内容放置问题进行数学建模,其次我们根据该数学模型提出一种有效的动态规划算法.该算法不仅可以有效解决了我们提出模型中的整数规划问题,而且其时间复杂度为O(NP).With the gradual increase of the proportion of network video content, video business is also in constant increase. These vid- eo businesses will take up a lot of Intemet bandwidth. How to save bandwidth and improve the video quality of service has become an important research topic in Internet research, the two main ways to improve the quality of video services is to increase the network bandwidth and increase the capacity of the network video cache server. In order to minimize the investment of network＇s bandwidth and cache capacity of video services, it is necessary to determine how network video content distribution in network service nodes. In this paper, we first propose a mathematic model which based on the cost of video content placement and video content transmission in the tree networks, then we also design an efficient video content distribution algorithm for tree networks base on our proposed model. The algorithm not only effectively solves the integer programming problem for our proposed model, but its computational complexity is 0 [NP）.

关 键 词：树形网络 动态规划算法 视频内容分发 内容置换 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]