【摘要】：隨著互聯(lián)網(wǎng)普及與發(fā)展，尤其是移動互聯(lián)網(wǎng)的興起促使網(wǎng)絡(luò)數(shù)據(jù)的分發(fā)面臨新的挑戰(zhàn)。傳統(tǒng)的內(nèi)容分發(fā)網(wǎng)絡(luò)通過在網(wǎng)絡(luò)上部署多個代理緩存服務(wù)器來加速用戶訪問，提高用戶體驗(yàn)。然而傳統(tǒng)的CSP-CDN獨(dú)立于ISP，因此在節(jié)點(diǎn)部署以及請求路由過程中無法利用網(wǎng)絡(luò)拓?fù)湫畔⒁愿倪M(jìn)系統(tǒng)性能。為了進(jìn)一步降低ISP跨域流量，壓縮ISP運(yùn)營成本，同時降低ISP域內(nèi)重復(fù)流量，本文提出了基于A-Star算法的內(nèi)容節(jié)點(diǎn)部署機(jī)制，不僅減少域內(nèi)重復(fù)流量，并提升用戶的訪問質(zhì)量。 本文首先分析了ISP域間和域內(nèi)的主要流量構(gòu)成，并根據(jù)ISP域內(nèi)路由節(jié)點(diǎn)所處的位置，將其分為域間節(jié)點(diǎn)、核心節(jié)點(diǎn)和邊緣節(jié)點(diǎn)三類�？紤]到域間節(jié)點(diǎn)為ISP之間的緩存節(jié)點(diǎn)，邊緣節(jié)點(diǎn)數(shù)量眾多管理復(fù)雜；且最優(yōu)化的節(jié)點(diǎn)選擇算法是NP問題，本文提出基于A-Star的節(jié)點(diǎn)部署算法對滿足約束條件的節(jié)點(diǎn)進(jìn)行啟發(fā)式搜索提高服務(wù)效率。在資源定位中，本文提出了基于dl-CBF的dl-RTCBF索引結(jié)構(gòu)，使不同的內(nèi)容節(jié)點(diǎn)之間可進(jìn)行資源定位與重定向請求。 最后，，本文通過仿真實(shí)驗(yàn)驗(yàn)證了提出的節(jié)點(diǎn)部署機(jī)制，并通過與其他的路由機(jī)制相比，本文的方法進(jìn)一步降低了跨域流量與域內(nèi)重復(fù)流量，提高了緩存命中率。
[Abstract]:With the popularity and development of the Internet, especially the rise of mobile Internet, network data distribution faces new challenges. Traditional content distribution networks speed up user access and improve user experience by deploying multiple proxy cache servers on the network. However, the traditional CSP-CDN is independent of ISP, so it is impossible to utilize the network topology information to improve the system performance in the process of node deployment and request routing. In order to further reduce the cross-domain traffic of ISP, compress the cost of ISP operation, and reduce the repeated traffic in ISP domain, a content node deployment mechanism based on A-Star algorithm is proposed in this paper, which not only reduces the repeated traffic in the domain, but also improves the access quality of users. In this paper, the main traffic components between and within ISP domains are analyzed, and the routing nodes in ISP domain are divided into three types: interdomain nodes, core nodes and edge nodes according to the location of routing nodes in ISP domain. Considering that inter-domain nodes are cache nodes between ISP, the number of edge nodes is complex. The optimal node selection algorithm is the NP problem. In this paper, a node deployment algorithm based on A-Star is proposed to improve the service efficiency by heuristic search for the nodes that meet the constraint conditions. In resource location, this paper proposes a dl-RTCBF index structure based on dl-CBF, which enables different content nodes to locate and redirect resources. Finally, the proposed node deployment mechanism is verified by simulation experiments, and compared with other routing mechanisms, the proposed method further reduces cross-domain traffic and intra-domain repeat traffic, and improves cache hit rate.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.01;TN929.5

【共引文獻(xiàn)】

相關(guān)博士學(xué)位論文 前4條

1 史佩昌;云服務(wù)的高效傳遞技術(shù)研究[D];國防科學(xué)技術(shù)大學(xué);2012年

2 劉然;移動互聯(lián)網(wǎng)環(huán)境下高效流媒體分發(fā)關(guān)鍵技術(shù)研究[D];華中科技大學(xué);2013年

3 何俊峰;面向邊緣網(wǎng)絡(luò)的流媒體分發(fā)技術(shù)研究[D];國防科學(xué)技術(shù)大學(xué);2012年

4 李喬;融合型內(nèi)容分發(fā)網(wǎng)絡(luò)關(guān)鍵技術(shù)研究[D];哈爾濱工業(yè)大學(xué);2014年

本文編號：2411287