發(fā)布時間：2018-03-17 13:19

  本文選題：智能UDDI模型　切入點：路由算法　出處：《華北電力大學》2014年碩士論文　論文類型：學位論文

【摘要】：隨著Internet在各個領域的應用越來越普及，應用種類及數量的迅速增長，人們急切需要一種可以在Internet上實現服務或應用的跨平臺、獨立及松耦合化的中介技術。此時，Web服務技術應運而生。通過UDDI注冊中心的中介功能，將網絡上的Web服務有效的整合在一起，供服務請求者使用，但是傳統(tǒng)的UDDI發(fā)現機制存在網絡上的、功能上的性能瓶頸。為了打破這種限制，本文使用MAS(Multi-AgentSystem)對UDDI注冊中心進行了功能擴展，并且使用一種混合的P2P網絡結構作為注冊中心的網絡環(huán)境，本文主要研究工作如下。 首先，Chord作為結構化對等網絡中的一種協議類型，主要用于網絡中的資源定位，其路由算法的高效性關乎整個網絡的服務性能，因此路由算法的查詢效率是衡量一個網絡好壞的關鍵指標。研究發(fā)現，當網絡中存在的節(jié)點數遠小于網絡大小時，每個節(jié)點的路由表中會包含多條冗余路由信息，并不利于對資源的查詢和定位。因此本文提出了一種基于指針表(fingertable)的Chord路由改進算法：CA-Chord(ContinuousArcChord)路由算法，并通過仿真實驗證實，該算法可以消除指針表中的冗余信息，將冗余信息替換為網絡邏輯位置相互鄰接的一段弧上所包含的節(jié)點的路由信息，由此減少了平均查詢步長，從而極大的提高了查詢效率。 其次，結合MAS技術給出了一種智能UDDI模型，將Agent代理封裝在UDDI注冊中心中，使UDDI模型得到了進一步的優(yōu)化，，相比傳統(tǒng)的UDDI模型，更加自動化和智能化，并通過“多Agent系統(tǒng)工程（MaSE）”方法設計并初步實現了該模型的主要功能。 最后，通過使用領域本體、WordNet、語義相似度計算、層次聚類、Qos本體等方法給出了一種基于智能UDDI模型的Web服務多級匹配方法。首先將OWL-S描述的Web服務文檔進行WordNet語義擴展，然后將擴展后的文檔與領域本體中的概念進行語義相似度匹配，用匹配后的概念替換描述文檔中的關鍵字。服務數量達到某一閾值時，對所存儲的服務進行層次聚類。對處理過的服務文檔進行類別確定，分類存儲，當有服務請求產生時，將該請求與同一類別中的服務進行功能性IO匹配、Qos匹配，最終得到最佳服務。經過實驗驗證，本方法相比一般基于語義的發(fā)現方法，在服務查準率和查全率上均有明顯提高。
[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.
【學位授予單位】：華北電力大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.02

【參考文獻】

相關期刊論文 前7條

1 王力;高嶺;丁思博;;基于移動Agent檢測QoS的分級查詢UDDI模型[J];東南大學學報(自然科學版);2008年S1期

2 伍楓;谷建華;趙天海;;跨域服務注冊中心的數據同步研究[J];計算機工程;2011年24期

3 楊勝文,史美林;一種支持QoS約束的Web服務發(fā)現模型[J];計算機學報;2005年04期

4 邵凌霜;李田;趙俊峰;王亞沙;謝冰;梅宏;;一種可擴展的Web Service QoS管理框架[J];計算機學報;2008年08期

5 陳黎飛;姜青山;王聲瑞;;基于層次劃分的最佳聚類數確定方法[J];軟件學報;2008年01期

6 寧夏;;基于分層聚類的Web服務發(fā)現的模型[J];科技創(chuàng)新導報;2012年15期

7 薛潔;吳兵;杜玉越;;一種面向聚類的語義Web服務發(fā)現方法[J];中國科技論文;2012年07期

本文編號：1624913