本文關(guān)鍵詞： Web服務(wù) 服務(wù)組合 逆向Vickrey拍賣 服務(wù)質(zhì)量　出處：《揚州大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著網(wǎng)絡(luò)技術(shù)和電子商務(wù)的迅猛發(fā)展,功能單一的Web服務(wù)往往無法滿足人們?nèi)找鎻?fù)雜的業(yè)務(wù)需求。如何有效集成分布于網(wǎng)絡(luò)中的各類服務(wù),實現(xiàn)具備強大功能的組合服務(wù)越來越受到人們的關(guān)注。但是,由于Internet的規(guī)模增大以及網(wǎng)絡(luò)環(huán)境的動態(tài)性,不同的服務(wù)提供商往往會為了最大化自身利益虛報其服務(wù)的QoS,因此,傳統(tǒng)的Web服務(wù)組合方法已無法在有效時間內(nèi)找到一組滿足用戶需求的最優(yōu)Web服務(wù)組合。針對這一問題,本文提出了一種基于Vickrey拍賣理論的Web服務(wù)組合方法,該方法一方面確保Web服務(wù)提供者不會虛報其服務(wù)的QoS,另一方面還考慮組合Web服務(wù)的全局QoS約束和組合流程中的單一節(jié)點的局部QoS約束,主要工作如下： 1.提出了一個基于拍賣理論的Web服務(wù)組合模型 該模型主要包括：抽象的服務(wù)組合框架(Auction-Based Service Composition Framework, ABCF)和QoS組合模型 ABCF由三個參與者、兩個功能模塊和一個服務(wù)注冊中心組成。參與者分別是User、Broker和Seller。User向Broker發(fā)送組合服務(wù)請求；Broker負(fù)責(zé)服務(wù)的選擇,并將結(jié)果返回給User: Seller提供具有相應(yīng)QoS約束的Web服務(wù)。功能模塊包括拍賣模塊和全局優(yōu)化模塊。拍賣模塊負(fù)責(zé)Web服務(wù)的拍賣和局部服務(wù)選擇；全局優(yōu)化模塊負(fù)責(zé)對QoS約束調(diào)整。服務(wù)注冊中心提供服務(wù)發(fā)布和查詢功能。 User在選擇服務(wù)時不僅關(guān)注服務(wù)的功能性需求,也關(guān)注服務(wù)QoS屬性。由于不同類型QoS評價標(biāo)準(zhǔn)不同,無法直接通過他們大小來確定Web服務(wù)的好壞。因此,本文提出了QoS組合模型,首先將各QoS規(guī)范化到同一維度,然后采用加權(quán)求和的方法計算每個服務(wù)的效用值,最后給出組合服務(wù)QoS計算方法。 2.提出兩個基于逆向Vickrey拍賣的服務(wù)選擇算法 在上述拍賣模型的基礎(chǔ)上,本文提出了一個基于逆向Vickrey拍賣的服務(wù)選擇算法(RVBSSA)。算法包括兩個階段：局部選擇階段和全局調(diào)整階段。在局部選擇階段,通過逆向Vickrey拍賣為組合流程中的每個抽象服務(wù)節(jié)點選擇效用值最大的前K(K0)個具體服務(wù)。全局調(diào)整階段首先判斷選局部選擇階段選擇的一組最優(yōu)具體服務(wù)是否滿足全局QoS約束,若滿足則該組服務(wù)即為最優(yōu)解,否則按照用戶的偏好高低對不滿足用戶約束的QoS屬性進(jìn)行降序排序,然后利用逆向Vickrey拍賣策略依次調(diào)整相應(yīng)的QoS值。此外,本文在RVBSSA算法的基礎(chǔ)上,提出了基于逆向Vickrey拍賣協(xié)商的RVBSSA2算法,通過拍賣協(xié)商激勵Seller提供更加真實的QoS屬性值。通過將這兩個算法與整數(shù)規(guī)劃(IP)算法比較分析,論文的算法消耗時間遠(yuǎn)小于IP算法,且性能接近IP算法。 3.原型系統(tǒng)的設(shè)計與實現(xiàn) 根據(jù)ABCF框架,利用NetBeans工具模擬服務(wù)組合的過程,實現(xiàn)了各模塊功能,用MySql實現(xiàn)服務(wù)注冊中心中Web服務(wù)的存儲。通過原型系統(tǒng)的運行,表明該系統(tǒng)可以快速找出滿足用戶需求的近似最優(yōu)組合Web服務(wù)。
[Abstract]:With the rapid development of network technology and electronic commerce, the single Web service is often unable to meet people's increasingly complex business needs. However, due to the increasing scale of Internet and the dynamic nature of the network environment, different service providers often falsely report the QoS of their services in order to maximize their own interests, therefore, because of the increase of the scale of Internet and the dynamic nature of the network environment, different service providers often falsely report the QoS of their services in order to maximize their own interests. The traditional Web service composition method can not find a set of optimal Web service composition in the effective time. In order to solve this problem, a Web service composition method based on Vickrey auction theory is proposed in this paper. On the one hand, this method ensures that the Web service provider does not falsely report the QoS of its service, on the other hand, it also considers the global QoS constraint of the Web service and the local QoS constraint of a single node in the composition process. The main work is as follows:. 1. A Web service composition model based on auction theory is proposed. This model mainly includes: abstract service composition framework Auction-Based Service Composition Framework (ABCFF) and QoS composition model. ABCF consists of three participants, two functional modules and a service registry. The participants are user broker and Seller.User who send a composite service request to Broker to select the service. The result is returned to user: Seller to provide Web service with corresponding QoS constraints. The function module includes auction module and global optimization module. The auction module is responsible for the auction of Web service and the selection of local service. The global optimization module is responsible for adjusting the QoS constraints. The service registry provides service publishing and query functions. User not only pays attention to the functional requirements of the service, but also the QoS attribute of the service. Because different types of QoS evaluation standards are different, it is impossible to determine the quality of the Web service directly by their size. Therefore, this paper proposes a QoS composition model. First, each QoS is normalized to the same dimension, then the utility value of each service is calculated by weighted summation method. Finally, the calculation method of composite service QoS is given. 2. Two service selection algorithms based on reverse Vickrey auction are proposed. Based on the above auction model, a service selection algorithm based on reverse Vickrey auction is proposed in this paper. The algorithm consists of two stages: local selection and global adjustment. The reverse Vickrey auction is used to select the pre-KK0 (pre-KK0) with the largest utility value for each abstract service node in the composition process. The global adjustment phase first determines whether the optimal set of specific services selected in the local selection phase satisfies the global QoS constraints. If satisfied, the group of services is the optimal solution. Otherwise, according to the preference of the user, the QoS attributes that do not satisfy the user constraints are sorted in descending order, and the corresponding QoS values are adjusted in turn by using the reverse Vickrey auction strategy. In this paper, based on the RVBSSA algorithm, a RVBSSA2 algorithm based on reverse Vickrey auction negotiation is proposed, which provides a more real QoS attribute value through the auction negotiation. The two algorithms are compared with the integer programming (IP) algorithm. The algorithm in this paper consumes much less time than IP algorithm, and its performance is close to that of IP algorithm. 3. Design and implementation of prototype system. According to ABCF framework, using NetBeans tools to simulate the process of service composition, the function of each module is realized, and the storage of Web services in service registry is realized by MySql. The results show that the proposed system can quickly find the approximate optimal composition Web services to meet the needs of users.
【學(xué)位授予單位】：揚州大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.09

【參考文獻(xiàn)】

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

1 苑慶濤;陳彥萍;;Web服務(wù)組合方法研究綜述[J];電腦知識與技術(shù);2010年07期

2 G.B.Dantzig;章祥蓀;杜鏈;;回顧線性規(guī)劃的起源[J];運籌學(xué)雜志;1984年01期

，

本文編號：1523491