本文選題：發(fā)布訂閱網(wǎng)絡(luò)技術(shù)　切入點(diǎn)：內(nèi)容中心網(wǎng)絡(luò)　出處：《電子科技大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：當(dāng)前互聯(lián)網(wǎng)有著根本性的缺陷,需要革命性的改變,于是內(nèi)容中心網(wǎng)絡(luò)這種新型的架構(gòu)在近些年被提出。由于互聯(lián)網(wǎng)中內(nèi)容流量的飛速增長(zhǎng)以及用戶Qos需求的不斷提高,內(nèi)容中心網(wǎng)絡(luò)被認(rèn)為是下一代互聯(lián)網(wǎng)發(fā)展趨向。本文介紹了PURSUIT這一網(wǎng)絡(luò)體系,PURSUIT是一種發(fā)布訂閱網(wǎng)絡(luò)技術(shù),并在網(wǎng)絡(luò)平臺(tái)實(shí)現(xiàn)的基礎(chǔ)上對(duì)服務(wù)器選擇算法和路由規(guī)劃算法進(jìn)行了研究。本文闡述了PURSUIT架構(gòu),以及BF轉(zhuǎn)發(fā)機(jī)制,它實(shí)現(xiàn)了線速網(wǎng)際互聯(lián)。本文利用OMNET++仿真軟件對(duì)PURSUIT進(jìn)行研究,服務(wù)器選擇算法和路由規(guī)劃算法本質(zhì)上均為選路算法,它們都在系統(tǒng)的核心節(jié)點(diǎn)上實(shí)現(xiàn)。但目的不同,服務(wù)器選擇算法是給定源點(diǎn)找宿點(diǎn)以及源點(diǎn)和宿點(diǎn)之間的路徑,路由規(guī)劃算法是給定源點(diǎn)和宿點(diǎn)找路徑。這導(dǎo)致了它們的實(shí)現(xiàn)有很大區(qū)別。內(nèi)容路由器與IP路由器的不同在于其真正具有緩存數(shù)據(jù)的功能,因而在PURSUIT中路由與緩存的結(jié)合顯得尤為重要。目前關(guān)于內(nèi)容中心網(wǎng)絡(luò)中的關(guān)鍵策略研究仍很少。本文對(duì)于服務(wù)器選擇提出了最近緩存點(diǎn)策略、最大重復(fù)度策略、最小鏈路利用率策略,這些策略均以最短路為基礎(chǔ)。前兩種方式要義都在于利用緩存,第三種策略要義在于負(fù)載均衡。在靠近客戶機(jī)端附近內(nèi)容的命中率高會(huì)使最近緩存點(diǎn)策略表現(xiàn)良好,然而總體來(lái)看,最大重復(fù)度策略命中率最佳。最小鏈路利用率策略在負(fù)載較重時(shí)最佳,在負(fù)載較輕時(shí)會(huì)較差。總的來(lái)說(shuō)利用緩存更好的算法性能要更好。另外,本文對(duì)實(shí)現(xiàn)負(fù)載均衡的三種不同策略進(jìn)行了對(duì)比,得到了有效的結(jié)論。本文對(duì)于路由規(guī)劃提出了最近點(diǎn)策略、較多緩存次數(shù)策略、較多點(diǎn)策略以及緩存通告重路由策略。這些策略并不一定以最短路為基礎(chǔ),它們要找的是一條符合條件的簡(jiǎn)單路徑,這是為了避開(kāi)環(huán)路使得BF機(jī)制有效。最近點(diǎn)策略在命中率高時(shí)更有效,而較多緩存次數(shù)策略在命中率低時(shí)更好。緩存通告重路由策略在一跳甚至多跳的搜尋中表現(xiàn)良好。較多點(diǎn)策略的命中率在五種策略中最高。由于較多緩存次數(shù)策略與較多點(diǎn)策略都僅可求得近似解,因此本文對(duì)它們產(chǎn)生的近似解與最優(yōu)解的性能進(jìn)行了對(duì)比。另外,將路由規(guī)劃中的算法應(yīng)用于服務(wù)器選擇,并且對(duì)相應(yīng)的算法進(jìn)行了對(duì)比,得到了有效的結(jié)論。
[Abstract]:Because of the fundamental defects of the Internet and the need for revolutionary change, the new architecture of content-centric network has been proposed in recent years. Because of the rapid growth of content traffic in the Internet and the increasing demand of users' Qos, The content center network is regarded as the development trend of the next generation Internet. This paper introduces PURSUIT, a network architecture, is a kind of publish / subscribe network technology. On the basis of the implementation of the network platform, the server selection algorithm and route planning algorithm are studied. The PURSUIT architecture and BF forwarding mechanism are described in this paper, which realizes the internetwork interconnection at line speed. In this paper, the PURSUIT is studied by using the OMNET simulation software. Both the server selection algorithm and the routing algorithm are routing algorithms, which are implemented on the core nodes of the system, but for different purposes, the server selection algorithm is a given source location point and the path between the source point and the location point. The routing algorithm is a given source point and a fixed location point to find a path. This leads to a great difference in their implementation. The difference between a content router and an IP router is that it really has the function of caching data. Therefore, the combination of routing and caching in PURSUIT is particularly important. At present, there are few researches on the key strategies in content-centric network. This paper proposes the nearest cache point policy and the maximum repetition policy for server selection. Minimum link utilization policies, which are based on the shortest path. The third strategy is about load balancing. A high hit ratio near the client side makes the nearest cache point policy perform well, however, in general, the. The maximum repeatability strategy is the best hit rate. The minimum link utilization strategy is optimal when the load is heavy and worse when the load is low. Overall, the algorithm with better cache is better. In addition, In this paper, three different strategies for load balancing are compared, and an effective conclusion is drawn. More poly-point policies and cache notification rerouting policies. These policies are not necessarily based on the shortest path, they are looking for a simple path that meets the criteria. This is to avoid the loop to make BF mechanism effective. The nearest point strategy is more effective when the hit rate is high. The cache notification rerouting strategy performs well in one-hop or even multi-hop search. The hit ratio of multi-point strategy is the highest among the five strategies. The approximate solution can only be obtained by using the simple and multi-point strategies. In addition, the algorithms in routing planning are applied to server selection, and the corresponding algorithms are compared, and an effective conclusion is obtained.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.05

【參考文獻(xiàn)】

相關(guān)期刊論文 前1條

1 余曉磊;江紅;楊璀瓊;;WSN中改進(jìn)的IPv6路由查找算法[J];計(jì)算機(jī)工程;2010年21期

，

本文編號(hào)：1573410