本文選題：云計算 + 可信服務��； 參考：《南京航空航天大學》2016年博士論文

【摘要】：面向服務的計算模式能夠將功能單一的服務進行組合,形成新的增值服務來滿足用戶的復雜需求。隨著云計算的普及,服務組合也面臨新的問題。開放動態(tài)的云環(huán)境給服務的評估帶來了更多的不確定性,而海量的云服務也對現(xiàn)有服務組合技術的有效性和實時性提出了新的挑戰(zhàn)。隨著云服務的多樣化和規(guī)模化,如何從眾多的候選服務中快速選擇出滿足用戶要求的服務進行組合是目前服務計算領域的研究熱點之一。針對上述問題,本文在分析現(xiàn)有服務評估和組合技術的基礎上,從云服務的可信評估、提高服務組合效率、以及復雜需求下的服務組合等方面開展了系統(tǒng)而深入的研究。本文的主要創(chuàng)新工作概括如下:(1)提出了一種基于一致性強度的云服務可信評估方法。在云服務評估框架下為基礎設施服務和應用服務分別設計了可信評估指標;并提出了基于一致性強度的模糊評估方法,通過引入語義折扣因子和一致性強度,可從模糊的服務評價信息中合理地分析出確定的評估值,從而解決了不確定環(huán)境下云服務的可信評估問題,并在仿真實驗平臺NetLogo上驗證了所提出方法的實用性和有效性。(2)提出了一種基于人工蜂群算法的可信服務組合方法。在服務組合模型中引入時間衰減函數(shù),提高了近期評分值的時間權重,從而使服務質量更符合當前時刻服務的特征;將服務組合問題進行非線性整數(shù)規(guī)劃建模,提出了全局指導人工蜂群(DGABC)算法來求解該模型,通過蜂群對食物源的探索來實現(xiàn)對最佳服務組合方案的搜索。實驗結果表明在大量服務信息下,本文提出的DGABC算法可以在保證服務質量的同時提高服務組合的效率。(3)提出了一種基于成本效益優(yōu)化的多目標服務組合方法。根據(jù)用戶對服務組合的多樣化需求,以最大化服務質量、最小化成本為優(yōu)化目標,將服務組合問題建模為多目標整數(shù)規(guī)劃模型;提出了基于精英指導的多目標人工蜂群算法(EMOABC),在原始人工蜂群算法中加入快速非支配排序、種群選擇、精英指導離散解生成、以及多目標適應度計算等多目標優(yōu)化策略,實現(xiàn)對該模型的求解。相較于同類算法,EMOABC算法無論在運行效率還是求解質量上均具有明顯優(yōu)勢,從而驗證了本文提出的方法可較好地解決復雜需求下的云服務組合問題。(4)提出了一種基于skyline計算的非線性服務組合方法。通過skyline計算篩選掉每個服務群中的冗余服務,可以減少搜索空間,有效提高服務組合的效率;進而采用建模語言AMPL將服務組合問題建模為0-1非線性規(guī)劃問題,并利用求解器Bonmin對所建立的模型進行求解。實驗結果表明本文提出的基于skyline計算的服務組合方法在保證服務質量的同時可顯著提高服務組合的效率。
[Abstract]:The service-oriented computing model can combine the services with a single function to form a new value-added service to meet the complex needs of users. With the popularity of cloud computing, service composition also faces new problems. The open and dynamic cloud environment brings more uncertainty to the evaluation of services, and the massive cloud services also pose a new challenge to the effectiveness and real-time performance of the existing service composition technology. With the diversification and scale of cloud services, it is one of the research hotspots in the field of service computing that how to quickly select the services that meet the needs of users from many candidate services. In order to solve the above problems, based on the analysis of the existing service evaluation and composition techniques, this paper has carried out a systematic and in-depth study on the trusted evaluation of cloud services, improving the efficiency of service composition, and service composition under complex requirements. The main innovation work of this paper is summarized as follows: (1) A cloud service trust evaluation method based on consistency strength is proposed. In the framework of cloud service evaluation, the trusted evaluation indexes for infrastructure services and application services are designed, and a fuzzy evaluation method based on consistency strength is proposed, which introduces semantic discount factor and consistency strength. We can reasonably analyze the definite evaluation value from the fuzzy service evaluation information, and solve the problem of cloud service credible evaluation in uncertain environment. The practicability and validity of the proposed method are verified on the simulation platform NetLogo) and a trusted service composition method based on artificial bee colony algorithm is proposed. The time attenuation function is introduced into the service composition model, which improves the time weight of the recent scoring value, thus making the quality of service more consistent with the characteristics of the service at present time, and the service composition problem is modeled by nonlinear integer programming. A global directed artificial bee colony (DGABC) algorithm is proposed to solve the model, and the best service composition scheme is searched by the colony searching for food source. The experimental results show that the proposed DGABC algorithm can improve the efficiency of service composition while ensuring the quality of service under a large amount of service information. A multi-objective service composition method based on cost-benefit optimization is proposed. In order to maximize the quality of service and minimize the cost, the service composition problem is modeled as a multi-objective integer programming model. This paper presents a multi-objective artificial bee colony algorithm based on elitist guidance, which includes fast undominated sorting, population selection, elitist directed discrete solution generation and multi-objective fitness calculation. The solution of the model is realized. Compared with the similar algorithm, EMOABC algorithm has obvious advantages in terms of running efficiency and solving quality. It is verified that the proposed method can solve the cloud service composition problem with complex requirements. (4) A nonlinear service composition method based on skyline computation is proposed. The redundant services in each service group can be filtered by skyline calculation, the search space can be reduced and the efficiency of service composition can be improved, and then the service composition problem can be modeled as a 0-1 nonlinear programming problem by using the modeling language AMPL. The model is solved by the solver Bonmin. The experimental results show that the proposed service composition method based on skyline computing can significantly improve the efficiency of service composition while ensuring the quality of service.
【學位授予單位】：南京航空航天大學
【學位級別】：博士
【學位授予年份】：2016
【分類號】：TP393.09

【相似文獻】

相關期刊論文 前10條

1 張煜,葛聲,孫海龍,馬殿富;Web服務組合處理系統(tǒng)的研究與實現(xiàn)[J];北京航空航天大學學報;2005年04期

2 孫潔麗;龔立群;;Web服務組合標準規(guī)范的研究[J];現(xiàn)代圖書情報技術;2007年05期

3 萬里平;蔡美玲;高春鳴;;基于服務聯(lián)盟的Web服務組合模型及方法[J];計算機工程與應用;2007年31期

4 郭峰;張萌;;Web服務組合的可靠性分析[J];系統(tǒng)仿真學報;2008年S2期

5 程永上;王志堅;;Web服務組合在水利領域中的應用[J];計算機工程與應用;2008年07期

6 陳世展;馮志勇;;服務網絡:Web服務組合的新基點[J];計算機應用研究;2008年05期

7 劉志紅;;Web服務組合的相關研究[J];農業(yè)科技與裝備;2009年01期

8 熊偉;;Web服務組合綜述[J];信息化縱橫;2009年05期

9 曾偉;胡W，

本文編號：1802983