【摘要】：隨著Web服務(wù)技術(shù)的發(fā)展和廣泛應(yīng)用，越來(lái)越多的服務(wù)提供者將服務(wù)以Web服務(wù)的形式發(fā)布出來(lái)，網(wǎng)絡(luò)上出現(xiàn)了大量功能相同或相似的服務(wù)。由于單個(gè)原子服務(wù)無(wú)法滿(mǎn)足服務(wù)請(qǐng)求者復(fù)雜的服務(wù)需求，需要將現(xiàn)有的單個(gè)原子服務(wù)進(jìn)行整合，促使了服務(wù)組合技術(shù)的研究和發(fā)展。同時(shí)服務(wù)使用者也不僅僅滿(mǎn)足于服務(wù)的功能屬性，對(duì)于服務(wù)的QoS屬性也提出了更高的要求。因此如何選出一組合適的服務(wù)，保證單個(gè)原子服務(wù)質(zhì)量的同時(shí)，，也能確保組合服務(wù)質(zhì)量全局最優(yōu)，成為Web服務(wù)組合領(lǐng)域的研究熱點(diǎn)和難點(diǎn)。 此外，越來(lái)越多的服務(wù)部署在資源受限的環(huán)境中，環(huán)境資源的有限性會(huì)影響到服務(wù)能否成功執(zhí)行，服務(wù)質(zhì)量的高低以及服務(wù)使用者的滿(mǎn)意度。本文在分析傳統(tǒng)Web服務(wù)的基礎(chǔ)上，結(jié)合資源環(huán)境特點(diǎn)，擴(kuò)展服務(wù)描述，增加服務(wù)運(yùn)行所需資源描述信息、服務(wù)所處環(huán)境資源信息等，建立資源受限環(huán)境下服務(wù)的QoS模型，支持服務(wù)的動(dòng)態(tài)部署。從QoS和環(huán)境資源兩個(gè)角度出發(fā)，計(jì)算服務(wù)的可用度，用于衡量資源受限環(huán)境下服務(wù)的質(zhì)量。 提出了資源受限環(huán)境下基于QoS的服務(wù)組合實(shí)現(xiàn)框架，并在此框架下進(jìn)一步研究了資源受限環(huán)境下的服務(wù)組合優(yōu)化問(wèn)題。算法的主要思想是：該方法首先對(duì)候選的實(shí)例服務(wù)根據(jù)服務(wù)的可用度進(jìn)行篩選，降低環(huán)境資源對(duì)服務(wù)質(zhì)量的影響，提高服務(wù)的可靠性，然后根據(jù)服務(wù)的QoS屬性，在每個(gè)服務(wù)組進(jìn)行聚類(lèi)操作，選取服務(wù)簇中質(zhì)量較優(yōu)的服務(wù)，降低候選實(shí)例服務(wù)的規(guī)模，減少搜索空間，最后采用帶備選組合服務(wù)方案集的改進(jìn)后的粒子群優(yōu)化算法實(shí)現(xiàn)組合服務(wù)的全局優(yōu)化。實(shí)驗(yàn)結(jié)果表明，本文提出的算法能夠快速地實(shí)現(xiàn)組合服務(wù)的全局優(yōu)化，有效地保證組合服務(wù)的質(zhì)量，提高了組合服務(wù)的成功率。
[Abstract]:With the development and wide application of Web services technology, more and more service providers publish their services in the form of Web services. Because the single atomic service can not meet the complex service requirements of the service requester, it is necessary to integrate the existing single atomic service, which promotes the research and development of the service composition technology. At the same time, the service consumer is not only satisfied with the functional attributes of the service, but also puts forward higher requirements for the QoS attribute of the service. Therefore, how to select a suitable group of services to guarantee the quality of service of a single atom, and at the same time to ensure the global optimization of the quality of service composition, has become a hot and difficult research topic in the field of Web service composition. In addition, more and more services are deployed in resource-constrained environment. The limitation of environmental resources will affect the success of service execution, the quality of service and the satisfaction of service users. Based on the analysis of traditional Web services, combining the characteristics of resource and environment, this paper extends the description of services, increases the description of resources needed for service operation, and establishes the QoS model of services in resource-constrained environment. Support dynamic deployment of services. From the point of view of QoS and environmental resources, the availability of services is calculated to measure the quality of services in resource-constrained environments. This paper proposes a QoS based service composition implementation framework in resource-constrained environment, and further studies the optimization of service composition in resource-constrained environment. The main idea of the algorithm is as follows: firstly, the candidate instance services are screened according to the availability of the service, which reduces the impact of environmental resources on the quality of service and improves the reliability of the service. Clustering operation is carried out in each service group to select the best quality service in the service cluster, to reduce the scale of candidate instance service and to reduce the search space. Finally, the improved particle swarm optimization algorithm with alternative composite service scheme set is used to realize the global optimization of composite services. Experimental results show that the proposed algorithm can quickly achieve global optimization of composite services, effectively guarantee the quality of composite services, and improve the success rate of composite services.
【學(xué)位授予單位】：南京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TP393.09

【參考文獻(xiàn)】

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

1 張成文;蘇森;陳俊亮;;基于遺傳算法的QoS感知的Web服務(wù)選擇[J];計(jì)算機(jī)學(xué)報(bào);2006年07期

2 代鈺;楊雷;張斌;高巖;;支持組合服務(wù)選取的QoS模型及優(yōu)化求解[J];計(jì)算機(jī)學(xué)報(bào);2006年07期

3 蔣哲遠(yuǎn);韓江洪;王釗;;動(dòng)態(tài)的QoS感知Web服務(wù)選擇和組合優(yōu)化模型[J];計(jì)算機(jī)學(xué)報(bào);2009年05期

4 王勇;代桂平;侯亞榮;;信任感知的組合服務(wù)動(dòng)態(tài)選擇方法[J];計(jì)算機(jī)學(xué)報(bào);2009年08期

5 李剛;孫紅梅;李智;余海燕;;資源受限Web服務(wù)[J];計(jì)算機(jī)學(xué)報(bào);2010年02期

6 侯志榮,呂振肅;基于MATLAB的粒子群優(yōu)化算法及其應(yīng)用[J];計(jì)算機(jī)仿真;2003年10期

7 馮名正;;Web服務(wù)組合研究綜述[J];計(jì)算機(jī)應(yīng)用與軟件;2007年02期

8 溫濤;盛國(guó)軍;郭權(quán);李迎秋;;基于改進(jìn)粒子群算法的Web服務(wù)組合[J];計(jì)算機(jī)學(xué)報(bào);2013年05期

9 岳昆,王曉玲,周傲英;Web服務(wù)核心支撐技術(shù):研究綜述[J];軟件學(xué)報(bào);2004年03期

10 劉書(shū)雷;劉云翔;張帆;唐桂芬;景寧;;一種服務(wù)聚合中QoS全局最優(yōu)服務(wù)動(dòng)態(tài)選擇算法[J];軟件學(xué)報(bào);2007年03期

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

1 尹可挺;Internet環(huán)境中基于QoS的Web服務(wù)組合研究[D];浙江大學(xué);2010年

2 李飛;動(dòng)態(tài)Web服務(wù)組合中基于QoS的服務(wù)選擇研究[D];武漢大學(xué);2009年

本文編號(hào)：2125851