【摘要】：隨著互聯(lián)網(wǎng)中視頻內(nèi)容比重的迅速增加,視頻業(yè)務(wù)隨之也在不斷的增加,這些視頻業(yè)務(wù)將占據(jù)大量的互聯(lián)網(wǎng)帶寬.如何節(jié)約帶寬和提高視頻服務(wù)質(zhì)量已成為互聯(lián)網(wǎng)研究中的重要研究課題,而提高視頻業(yè)務(wù)服務(wù)質(zhì)量的兩個(gè)主要途徑是增加網(wǎng)絡(luò)帶寬和增加網(wǎng)絡(luò)中緩存視頻服務(wù)器的容量.為了使得視頻服務(wù)商對(duì)增加帶寬和增加緩存容量的投入最小化,就要決定網(wǎng)絡(luò)視頻內(nèi)容在網(wǎng)絡(luò)服務(wù)器中如何放置和分發(fā).在本文中,首先我們基于內(nèi)容放置和內(nèi)容傳輸代價(jià)對(duì)樹形網(wǎng)絡(luò)中的視頻內(nèi)容放置問題進(jìn)行數(shù)學(xué)建模,其次我們根據(jù)該數(shù)學(xué)模型提出一種有效的動(dòng)態(tài)規(guī)劃算法.該算法不僅可以有效解決了我們提出模型中的整數(shù)規(guī)劃問題,而且其時(shí)間復(fù)雜度為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).
【作者單位】： 中國科學(xué)技術(shù)大學(xué)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院;
【基金】：國家自然科學(xué)基金項(xiàng)目(61170233,60970128)資助
【分類號(hào)】：TP393.02
，

本文編號(hào)：2330773