本文選題：Web服務(wù)組合 + 功能屬性��； 參考：《西南大學(xué)》2014年碩士論文

【摘要】：隨著電子商務(wù)快速發(fā)展和網(wǎng)絡(luò)上Web服務(wù)的逐漸增多,Web服務(wù)作為一個(gè)Web上數(shù)據(jù)和信息集成的有效機(jī)制已經(jīng)得到廣泛的認(rèn)可。如何快速、準(zhǔn)確地從海量的Web服務(wù)中獲取并組合成新的、復(fù)雜的服務(wù)同時(shí)并能夠滿足用戶功能屬性和非功能屬性的需求已成為現(xiàn)階段Web服務(wù)組合研究的熱點(diǎn)問(wèn)題。目前,針對(duì)Web服務(wù)組合的研究仍然存在負(fù)載失衡、效率低下、組合方法不當(dāng)?shù)葐?wèn)題,本文針對(duì)以上問(wèn)題開(kāi)展研究,主要工作如下： (1)基于反饋機(jī)制的Web服務(wù)組合框架的構(gòu)建。本文在現(xiàn)有的Web服務(wù)組合框架的基礎(chǔ)上,添加了反饋模塊,建立了基于反饋機(jī)制的Web服務(wù)組合框架。反饋模塊不僅能夠及時(shí)反饋服務(wù)組合狀態(tài),以便于解決負(fù)載均衡、QoS值突變等問(wèn)題,而且能夠反饋服務(wù)請(qǐng)求者的評(píng)價(jià)信息,為其他服務(wù)請(qǐng)求者訪問(wèn)該服務(wù)提供訪問(wèn)依據(jù)。 (2)基于功能屬性的候選服務(wù)集生成框架的確立。在考慮功能屬性的匹配時(shí),即服務(wù)選擇模塊的候選服務(wù)集生成階段,為了提高功能匹配的效率,在已有的Web服務(wù)發(fā)現(xiàn)框架基礎(chǔ)上,添加了基于用戶評(píng)價(jià)和點(diǎn)擊率的索引機(jī)制,設(shè)計(jì)了更新索引機(jī)制,建立了索引評(píng)價(jià)函數(shù),提出了帶索引機(jī)制的候選服務(wù)集生成框架。 (3)基于非功能屬性的Web服務(wù)選擇算法的建立。在考慮非功能屬性選擇時(shí),即服務(wù)選擇模塊的組合服務(wù)集生成階段,為了快速、準(zhǔn)確的從海量功能相同或者相似的Web服務(wù)中選擇出滿足用戶非功能屬性要求的Web服務(wù),提出了基于改進(jìn)蟻群算法的Web服務(wù)選擇算法。該算法在蟻群初始化的時(shí)候引入了混沌模型,在更新信息素的時(shí)候加入了混沌擾動(dòng)量。一方面使用蟻群算法的信息素正反饋原理加強(qiáng)混沌優(yōu)化算法中的搜索區(qū)域,增加搜索次數(shù),降低了混沌優(yōu)化算法搜索的盲目性。另一方面使用混沌優(yōu)化算法的混沌初始化蟻群,提高蟻群的多樣性,利用混沌優(yōu)化算法的混沌擾動(dòng)防止出現(xiàn)早熟現(xiàn)象。 (4)Web服務(wù)組合原型系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)。在分析已有的組合系統(tǒng)的基礎(chǔ)上,設(shè)計(jì)并實(shí)現(xiàn)了原型系統(tǒng),該系統(tǒng)包括服務(wù)查詢(xún)、發(fā)現(xiàn)和組合三個(gè)模塊,驗(yàn)證了功能屬性的候選服務(wù)集生成方法和非功能屬性全局優(yōu)化的Web服務(wù)選擇算法的可行性和高效性。
[Abstract]:With the rapid development of electronic commerce and the increasing number of Web services, Web services have been widely recognized as an effective mechanism for the integration of data and information on the Web. How to quickly and accurately obtain and compose new and complex services from a large number of Web services has become a hot issue in the research of Web service composition at present. At present, there are still some problems in the research of Web service composition, such as load imbalance, low efficiency and improper composition method. The main work of this paper is as follows: 1) Construction of Web services composition framework based on feedback mechanism. Based on the existing Web services composition framework, this paper adds feedback module and establishes a Web service composition framework based on feedback mechanism. The feedback module can not only feedback the state of service composition in time to solve the problem of load balancing and QoS mutation, but also feedback the evaluation information of service requestor. It provides access basis for other service requesters to access the service. 2) the establishment of candidate service set generation framework based on functional attributes. In order to improve the efficiency of function matching, a new indexing mechanism based on user evaluation and click rate is added to the existing Web service discovery framework when considering the matching of functional attributes, that is, the candidate service set generation stage of service selection module. An index updating mechanism is designed, an index evaluation function is established, and a candidate service set generation framework with index mechanism is proposed. When considering non-functional attribute selection, that is, the generation stage of composition service set of service selection module, in order to quickly and accurately select Web services that meet the requirements of users' non-functional attributes from the massive Web services with the same or similar functions. A Web service selection algorithm based on improved ant colony algorithm is proposed. Chaotic model is introduced in ant colony initialization and chaos perturbation is added to update pheromone. On the one hand, the pheromone positive feedback principle of ant colony algorithm is used to strengthen the search area of chaotic optimization algorithm, increase the number of searches, and reduce the blindness of chaotic optimization algorithm. On the other hand, the chaos of chaos optimization algorithm is used to initialize the ant colony to improve the diversity of the ant colony, and the chaos disturbance of the chaos optimization algorithm is used to prevent the premature phenomenon. Based on the analysis of the existing composite system, a prototype system is designed and implemented. The system includes three modules: service query, discovery and composition. The feasibility and efficiency of the candidate service set generation method for functional attributes and the Web service selection algorithm for global optimization of non-functional attributes are verified.
【學(xué)位授予單位】：西南大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TP393.09

【參考文獻(xiàn)】

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

1 孫學(xué)勝;曹玖新;劉波;胡波;李和光;;基于多目標(biāo)粒子群優(yōu)化的服務(wù)選擇算法[J];東南大學(xué)學(xué)報(bào)(自然科學(xué)版);2009年04期

2 修春波;張宇河;;蟻群混沌混合優(yōu)化算法[J];計(jì)算機(jī)工程與應(yīng)用;2006年21期

3 崔華;應(yīng)時(shí);袁文杰;胡羅凱;;語(yǔ)義Web服務(wù)組合綜述[J];計(jì)算機(jī)科學(xué);2010年05期

4 楊永齊;符云清;余偉;;基于多階段匹配的語(yǔ)義Web服務(wù)發(fā)現(xiàn)框架[J];計(jì)算機(jī)科學(xué);2010年09期

5 上超望;趙呈領(lǐng);劉清堂;王艷鳳;;組合Web服務(wù)訪問(wèn)控制技術(shù)研究綜述[J];計(jì)算機(jī)科學(xué);2011年10期

6 彭暉;史忠植;邱莉榕;常亮;;基于本體概念相似度的語(yǔ)義Web服務(wù)匹配算法[J];計(jì)算機(jī)工程;2008年15期

7 彭曉明;何炎祥;朱兵艦;;蟻群算法在Web服務(wù)組合中的應(yīng)用[J];計(jì)算機(jī)工程;2009年10期

8 胡建強(qiáng),鄒鵬,王懷民,周斌;Web服務(wù)描述語(yǔ)言QWSDL和服務(wù)匹配模型研究[J];計(jì)算機(jī)學(xué)報(bào);2005年04期

9 夏亞梅;程渤;陳俊亮;孟祥武;劉棟;;基于改進(jìn)蟻群算法的服務(wù)組合優(yōu)化[J];計(jì)算機(jī)學(xué)報(bào);2012年02期

10 唐小燕;李斌;;Web服務(wù)集成中基于QoS的服務(wù)選擇[J];計(jì)算機(jī)應(yīng)用;2006年S1期

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

1 魏登萍;語(yǔ)義Web服務(wù)發(fā)現(xiàn)中匹配策略的研究與實(shí)現(xiàn)[D];國(guó)防科學(xué)技術(shù)大學(xué);2011年

2 龔小勇;基于QoS的Web服務(wù)發(fā)現(xiàn)與組合方法研究[D];重慶大學(xué);2008年

3 高小永;基于多目標(biāo)蟻群算法的土地利用優(yōu)化配置[D];武漢大學(xué);2010年

，

本文編號(hào)：1987647