本文選題：命名和解析 + 內(nèi)容和服務�。� 參考：《北京郵電大學》2014年碩士論文

【摘要】：互聯(lián)網(wǎng)已成為當前信息社會不可缺少的重要組成部分,隨著互聯(lián)網(wǎng)幾十年的發(fā)展,其接入方式和網(wǎng)絡功能定位發(fā)生了巨大的改變。TCP/IP體系結構在可擴展性、動態(tài)性以及安全可控性等方面的問題日漸突顯,已經(jīng)無法滿足互聯(lián)網(wǎng)持續(xù)發(fā)展的需求,基于此國內(nèi)外研究者開展了未來網(wǎng)絡體系結構的研究。 本文在面向服務的未來互聯(lián)網(wǎng)體系結構(SOFIA)的架構背景下,研究了未來互聯(lián)網(wǎng)中面向內(nèi)容和服務的命名標識機制、尋址與解析體系。首先調(diào)研了下一代互聯(lián)網(wǎng)的研究現(xiàn)狀,并針對命名與解析問題進行了較為深入的研究,互聯(lián)網(wǎng)用戶更關注網(wǎng)絡中可以提供的內(nèi)容和服務比如信息搜索、內(nèi)容分享、云計算等等,而不是他們的位置信息。在未來互聯(lián)網(wǎng)體系的“革命式”架構中,內(nèi)容和服務將取代主機成為網(wǎng)絡中命名的“實體”,詳細調(diào)研了面向內(nèi)容和服務的命名方法和解析機制,并總結分析了命名解析機制中的基本問題和基本思想,然后從對各種基于內(nèi)容和服務的命名方法研究出發(fā),借鑒并提出了適用于描述服務的靈活命名機制,并研究了適用于此命名機制的高效的解析查詢系統(tǒng)。 本文構建了分布式P2P網(wǎng)絡作為解析系統(tǒng),采用Chord算法做為底層路由算法,并提出了一種新的基于DHT的多屬性查詢算法,該算法適用于本文中的層次化屬性-值對描述的服務標識,使得解析系統(tǒng)在查詢效率和負載均衡方面有了更好的平衡。經(jīng)過仿真驗證,該算法減少了服務名字的副本存儲量,并且有更好的負載均衡性和查詢性能。
[Abstract]:The Internet has become an indispensable part of the current information society. With the development of the Internet for decades, its access mode and network function orientation have changed greatly. TCPP / IP architecture is extensible.The problems of dynamic and security controllability are becoming more and more prominent, which can not meet the needs of the sustainable development of the Internet. Based on this, researchers at home and abroad have carried out research on the future network architecture.In this paper, based on the architecture of Service-Oriented Future Internet Architecture (SOFIA), we study the naming and identification mechanism, addressing and parsing architecture of content-oriented and service-oriented Internet in the future.First of all, the research status of next generation Internet is investigated, and the naming and parsing problem is deeply studied. Internet users pay more attention to the content and services that can be provided in the network, such as information search, content sharing, cloud computing and so on.Not their location.In the "revolutionary" architecture of the future Internet system, content and services will replace hosts as named "entities" in the network. The naming methods and parsing mechanisms for content and services are investigated in detail.The basic problems and basic ideas of naming parsing mechanism are summarized and analyzed. Then, based on the research of various naming methods based on content and service, a flexible naming mechanism suitable for describing services is put forward.An efficient parse query system suitable for this naming mechanism is also studied.In this paper, a distributed P2P network is constructed as an analytical system, and Chord algorithm is used as the underlying routing algorithm, and a new multi-attribute query algorithm based on DHT is proposed.This algorithm is suitable for the service identification described by the hierarchical attribute-value pairs in this paper, which makes the parsing system have a better balance between query efficiency and load balance.The simulation results show that the algorithm reduces the storage of service names and has better load balancing and query performance.
【學位授予單位】：北京郵電大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.4

【參考文獻】

相關期刊論文 前4條

1 謝高崗;張玉軍;李振宇;孫毅;謝應科;李忠誠;劉韻潔;;未來互聯(lián)網(wǎng)體系結構研究綜述[J];計算機學報;2012年06期

2 李丹,吳建平,崔勇,徐恪;互聯(lián)網(wǎng)名字空間結構及其解析服務研究[J];軟件學報;2005年08期

3 曹銳;吳建平;徐明偉;;互聯(lián)網(wǎng)命名問題研究[J];軟件學報;2009年02期

4 吳建平;李星;劉瑩;;下一代互聯(lián)網(wǎng)體系結構研究現(xiàn)狀和發(fā)展趨勢[J];中興通訊技術;2011年02期

，

本文編號：1768726