本文選題：Web服務(wù) + 服務(wù)質(zhì)量��； 參考：《湖南科技大學(xué)》2014年碩士論文

【摘要】：在云環(huán)境下，越來越多的功能相同或相似但非功能屬性不同的Web服務(wù)被采用。服務(wù)質(zhì)量（Quality of Services, QoS），成為了Web服務(wù)選擇中服務(wù)提供者贏得市場的關(guān)鍵非功能屬性之一。隨著Internet技術(shù)的日益發(fā)展，用戶能夠方便地按需獲取滿足其要求的服務(wù)資源，而高質(zhì)量的服務(wù)將受到用戶的青睞。然而，云環(huán)境下的服務(wù)請求具有即時(shí)、并發(fā)以及大規(guī)模等特點(diǎn)，多個(gè)用戶可能同時(shí)調(diào)用同一個(gè)高質(zhì)量的服務(wù)，極有可能出現(xiàn)用戶訪問量超過服務(wù)的負(fù)載容量的情況，致使服務(wù)負(fù)載失衡，從而導(dǎo)致無法即時(shí)響應(yīng)用戶請求，服務(wù)提供能力急劇下降。針對該問題，近年來已有少量學(xué)者考慮了服務(wù)的負(fù)載對服務(wù)性能的影響，并且在這方面已經(jīng)展開了一些研究。然而，目前仍存在著很多亟待解決的問題：當(dāng)多個(gè)用戶同時(shí)訪問單個(gè)服務(wù)或多個(gè)服務(wù)時(shí)，如何合理的為用戶提供滿意的服務(wù)并保證服務(wù)負(fù)載平衡；當(dāng)功能單一或數(shù)量有限的服務(wù)不能滿足用戶需求時(shí)，如何組合這些服務(wù)并考慮服務(wù)負(fù)載的影響以高質(zhì)量地為用戶提供服務(wù)。針對這些問題，本文開展了如下工作： (1)提出了一種基于QoS和負(fù)載平衡的單服務(wù)選擇方法。目前的服務(wù)選擇方法大多是從用戶角度出發(fā)，從眾多服務(wù)中選擇高質(zhì)量的服務(wù)給用戶。然而，云環(huán)境下，隨著Web服務(wù)的用戶訪問量增加，將出現(xiàn)多個(gè)用戶同時(shí)訪問單個(gè)服務(wù)的情況，，服務(wù)負(fù)載能力將急劇下降，服務(wù)的響應(yīng)時(shí)間將延長，致使用戶選擇不到高質(zhì)量的服務(wù)。因此，負(fù)載感知的服務(wù)選擇方法能在保證負(fù)載平衡的情況下有效地幫助用戶選擇滿足需求的高質(zhì)量的服務(wù)。 (2)提出了一種云環(huán)境下基于QoS效應(yīng)值和負(fù)載平衡的全局優(yōu)化多服務(wù)選擇方法。在云環(huán)境下，同一時(shí)刻或極短的時(shí)間內(nèi)可能存在多個(gè)服務(wù)提供者和請求者分別正在提供和請求服務(wù)。在這種情況下，不僅要提供最滿意的服務(wù)給用戶，也要確保整個(gè)服務(wù)系統(tǒng)的負(fù)載平衡。因此，應(yīng)在同一時(shí)刻或在極短的時(shí)間內(nèi)為多個(gè)用戶提供滿意的服務(wù)，從而使得服務(wù)的用戶滿意度整體最大，同時(shí)使得服務(wù)系統(tǒng)的負(fù)載整體最小。 (3)在服務(wù)組合過程中，引入服務(wù)負(fù)載參數(shù)，設(shè)計(jì)基于QoS與服務(wù)負(fù)載的服務(wù)組合模型及算法，并利用粒子群算法進(jìn)行優(yōu)化。在云環(huán)境下，用戶在選擇服務(wù)的過程中，滿足其需求的不一定是單個(gè)服務(wù)，也極有可能是組合服務(wù)。目前的服務(wù)組合方法，充分重視了服務(wù)QoS（如：執(zhí)行價(jià)格、響應(yīng)時(shí)間等）對服務(wù)組合的影響，國內(nèi)外學(xué)者也提出了很多的基于QoS的服務(wù)組合及優(yōu)化方法，但它們大都未考慮服務(wù)負(fù)載變化對服務(wù)組合性能的影響，這將可能導(dǎo)致滿足用戶需求的服務(wù)組合失效。因此，該方法不僅能夠?yàn)橛脩籼峁└哔|(zhì)量的組合服務(wù)，而且保障了組合服務(wù)的負(fù)載平衡，大大提高了服務(wù)組合的成功率。
[Abstract]:In the cloud environment, more and more Web services with the same or similar functions but different non-functional attributes are adopted. Quality of Service (QoS) has become one of the key non-functional attributes for service providers to win the market in Web service selection. With the development of Internet technology, users can easily get service resources to meet their needs on demand, and high quality services will be favored by users. However, the service request in the cloud environment has the characteristics of instant, concurrency and large scale. Multiple users may call the same high quality service at the same time, and it is very likely that the number of users visiting the service exceeds the load capacity of the service. As a result, the service load is out of balance, which leads to the failure to respond to the user's request immediately, and the service delivery capacity drops sharply. In recent years, a small number of scholars have considered the impact of service load on service performance, and some studies have been carried out in this area. However, there are still many problems to be solved: how to provide satisfactory services and ensure load balance for users when multiple users visit a single service or multiple services at the same time; When a single or limited number of services can not meet the needs of users, how to combine these services and consider the impact of service load to provide services to users with high quality. In view of these problems, this paper has carried out the following work: A single service selection method based on QoS and load balancing is proposed. At present, most of the service selection methods are from the user's point of view, and select the high quality service to the user from the numerous services. However, in the cloud environment, as the number of users of Web services increases, there will be multiple users accessing a single service at the same time, the load capacity of the service will decline dramatically, and the response time of the service will be prolonged. Causes the user to choose the high quality service. Therefore, the load-aware service selection method can effectively help users to select high-quality services to meet their needs while ensuring load balance. A global optimal multi-service selection method based on QoS effect and load balancing in cloud environment is proposed. In a cloud environment, multiple service providers and requesters may be providing and requesting services at the same time or in a very short period of time. In this case, not only to provide the most satisfactory service to users, but also to ensure the load balance of the entire service system. Therefore, it is necessary to provide satisfactory services to multiple users at the same time or in a very short time, so as to maximize the overall customer satisfaction of the service, and at the same time to minimize the overall load of the service system. In the process of service composition, service load parameters are introduced, service composition model and algorithm based on QoS and service load are designed, and particle swarm optimization (PSO) is used to optimize the model. In the cloud environment, in the process of choosing services, the users may not satisfy the needs of a single service, but also may be a composite service. In the current service composition methods, the influence of QoS (such as execution price, response time, etc.) on service composition has been fully taken into account. Many service composition and optimization methods based on QoS have also been proposed by domestic and foreign scholars. However, most of them do not consider the impact of service load changes on service composition performance, which may lead to the failure of service composition to meet the needs of users. Therefore, this method can not only provide high quality composite services for users, but also ensure the load balance of composite services, and greatly improve the success rate of service composition.
【學(xué)位授予單位】：湖南科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.09

【參考文獻(xiàn)】

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

1 夏虹;李增智;;粒子群算法求解Web服務(wù)組合中基于QoS的服務(wù)選擇[J];北京郵電大學(xué)學(xué)報(bào);2009年04期

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

3 ;Runtime software architecture based on reflective middleware[J];Science in China(Series F:Information Sciences);2004年05期

4 范小芹;蔣昌俊;方賢文;丁志軍;;基于離散微粒群算法的動態(tài)Web服務(wù)選擇[J];計(jì)算機(jī)研究與發(fā)展;2010年01期

5 劉莉平;陳志剛;劉愛心;;基于粒子群算法的Web服務(wù)組合研究[J];計(jì)算機(jī)工程;2008年05期

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

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

8 胡春華;吳敏;劉國平;;Web服務(wù)工作流中基于信任關(guān)系的QoS調(diào)度[J];計(jì)算機(jī)學(xué)報(bào);2009年01期

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

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

本文編號：1923478