本文選題：智能UDDI模型　切入點(diǎn)：路由算法　出處：《華北電力大學(xué)》2014年碩士論文　論文類(lèi)型：學(xué)位論文

【摘要】：隨著Internet在各個(gè)領(lǐng)域的應(yīng)用越來(lái)越普及，應(yīng)用種類(lèi)及數(shù)量的迅速增長(zhǎng)，人們急切需要一種可以在Internet上實(shí)現(xiàn)服務(wù)或應(yīng)用的跨平臺(tái)、獨(dú)立及松耦合化的中介技術(shù)。此時(shí)，Web服務(wù)技術(shù)應(yīng)運(yùn)而生。通過(guò)UDDI注冊(cè)中心的中介功能，將網(wǎng)絡(luò)上的Web服務(wù)有效的整合在一起，供服務(wù)請(qǐng)求者使用，但是傳統(tǒng)的UDDI發(fā)現(xiàn)機(jī)制存在網(wǎng)絡(luò)上的、功能上的性能瓶頸。為了打破這種限制，本文使用MAS(Multi-AgentSystem)對(duì)UDDI注冊(cè)中心進(jìn)行了功能擴(kuò)展，并且使用一種混合的P2P網(wǎng)絡(luò)結(jié)構(gòu)作為注冊(cè)中心的網(wǎng)絡(luò)環(huán)境，本文主要研究工作如下。 首先，Chord作為結(jié)構(gòu)化對(duì)等網(wǎng)絡(luò)中的一種協(xié)議類(lèi)型，主要用于網(wǎng)絡(luò)中的資源定位，其路由算法的高效性關(guān)乎整個(gè)網(wǎng)絡(luò)的服務(wù)性能，因此路由算法的查詢(xún)效率是衡量一個(gè)網(wǎng)絡(luò)好壞的關(guān)鍵指標(biāo)。研究發(fā)現(xiàn)，當(dāng)網(wǎng)絡(luò)中存在的節(jié)點(diǎn)數(shù)遠(yuǎn)小于網(wǎng)絡(luò)大小時(shí)，每個(gè)節(jié)點(diǎn)的路由表中會(huì)包含多條冗余路由信息，并不利于對(duì)資源的查詢(xún)和定位。因此本文提出了一種基于指針表(fingertable)的Chord路由改進(jìn)算法：CA-Chord(ContinuousArcChord)路由算法，并通過(guò)仿真實(shí)驗(yàn)證實(shí)，該算法可以消除指針表中的冗余信息，將冗余信息替換為網(wǎng)絡(luò)邏輯位置相互鄰接的一段弧上所包含的節(jié)點(diǎn)的路由信息，由此減少了平均查詢(xún)步長(zhǎng)，從而極大的提高了查詢(xún)效率。 其次，結(jié)合MAS技術(shù)給出了一種智能UDDI模型，將Agent代理封裝在UDDI注冊(cè)中心中，使UDDI模型得到了進(jìn)一步的優(yōu)化，，相比傳統(tǒng)的UDDI模型，更加自動(dòng)化和智能化，并通過(guò)“多Agent系統(tǒng)工程（MaSE）”方法設(shè)計(jì)并初步實(shí)現(xiàn)了該模型的主要功能。 最后，通過(guò)使用領(lǐng)域本體、WordNet、語(yǔ)義相似度計(jì)算、層次聚類(lèi)、Qos本體等方法給出了一種基于智能UDDI模型的Web服務(wù)多級(jí)匹配方法。首先將OWL-S描述的Web服務(wù)文檔進(jìn)行WordNet語(yǔ)義擴(kuò)展，然后將擴(kuò)展后的文檔與領(lǐng)域本體中的概念進(jìn)行語(yǔ)義相似度匹配，用匹配后的概念替換描述文檔中的關(guān)鍵字。服務(wù)數(shù)量達(dá)到某一閾值時(shí)，對(duì)所存儲(chǔ)的服務(wù)進(jìn)行層次聚類(lèi)。對(duì)處理過(guò)的服務(wù)文檔進(jìn)行類(lèi)別確定，分類(lèi)存儲(chǔ)，當(dāng)有服務(wù)請(qǐng)求產(chǎn)生時(shí)，將該請(qǐng)求與同一類(lèi)別中的服務(wù)進(jìn)行功能性IO匹配、Qos匹配，最終得到最佳服務(wù)。經(jīng)過(guò)實(shí)驗(yàn)驗(yàn)證，本方法相比一般基于語(yǔ)義的發(fā)現(xiàn)方法，在服務(wù)查準(zhǔn)率和查全率上均有明顯提高。
[Abstract]:With the increasing popularity of Internet applications in various fields and the rapid growth of the types and the number of applications, people urgently need a cross-platform that can implement services or applications on Internet. Independent and loosely coupled mediation technology. At this point, web services technology emerges as the times require. Through the mediation function of the UDDI registry, the Web services on the network can be effectively integrated together for service requesters to use. But the traditional UDDI discovery mechanism has the performance bottleneck on the network. In order to break this limitation, this paper extends the function of the UDDI registry by using MAS Multi-Agent system. And a hybrid P2P network structure is used as the network environment of registration center. The main research work of this paper is as follows. As a kind of protocol type in structured peer-to-peer network, chord is mainly used to locate the resource in the network. The efficiency of the routing algorithm is related to the service performance of the whole network. Therefore, the query efficiency of routing algorithm is the key index to measure the quality of a network. It is found that when the number of nodes in the network is much smaller than the network size, the routing table of each node will contain multiple redundant routing information. Therefore, this paper proposes an improved Chord routing algorithm based on pointer table: CA-Chord-continuous Arc Chord-routing algorithm. The simulation results show that the algorithm can eliminate redundant information in pointer table. The redundant information is replaced by the routing information of nodes contained on an arc in which the logical positions of the network are adjacent to each other, thus reducing the average query step size and greatly improving the query efficiency. Secondly, an intelligent UDDI model based on MAS technology is given. The Agent agent is encapsulated in the UDDI registry, and the UDDI model is further optimized. Compared with the traditional UDDI model, it is more automatic and intelligent. The main functions of the model are designed and implemented by the method of "multiple Agent system Engineering Maze". Finally, a multi-level matching method of Web services based on intelligent UDDI model is proposed by using domain ontology, semantic similarity calculation, hierarchical clustering and QoS ontology. Firstly, the WordNet semantic extension of Web service documents described by OWL-S is introduced. Then the extended document is matched with the concepts in the domain ontology, and the keywords in the description document are replaced by the matched concepts. When the number of services reaches a certain threshold, Hierarchical clustering of stored services. The processed service documents are classified and stored. When a service request is generated, the request is matched with the service in the same category by functional IO matching / QoS matching. Finally, the best service is obtained. The experimental results show that the service precision and recall rate of this method are significantly higher than that of the semantic discovery method.
【學(xué)位授予單位】：華北電力大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TP393.02

【參考文獻(xiàn)】

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

1 王力;高嶺;丁思博;;基于移動(dòng)Agent檢測(cè)QoS的分級(jí)查詢(xún)UDDI模型[J];東南大學(xué)學(xué)報(bào)(自然科學(xué)版);2008年S1期

2 伍楓;谷建華;趙天海;;跨域服務(wù)注冊(cè)中心的數(shù)據(jù)同步研究[J];計(jì)算機(jī)工程;2011年24期

3 楊勝文,史美林;一種支持QoS約束的Web服務(wù)發(fā)現(xiàn)模型[J];計(jì)算機(jī)學(xué)報(bào);2005年04期

4 邵凌霜;李田;趙俊峰;王亞沙;謝冰;梅宏;;一種可擴(kuò)展的Web Service QoS管理框架[J];計(jì)算機(jī)學(xué)報(bào);2008年08期

5 陳黎飛;姜青山;王聲瑞;;基于層次劃分的最佳聚類(lèi)數(shù)確定方法[J];軟件學(xué)報(bào);2008年01期

6 寧夏;;基于分層聚類(lèi)的Web服務(wù)發(fā)現(xiàn)的模型[J];科技創(chuàng)新導(dǎo)報(bào);2012年15期

7 薛潔;吳兵;杜玉越;;一種面向聚類(lèi)的語(yǔ)義Web服務(wù)發(fā)現(xiàn)方法[J];中國(guó)科技論文;2012年07期

本文編號(hào)：1624913