基于服务簇和QoS的Web服务组合方法

计算机应用 ›› 2013, Vol. 33 ›› Issue (08): 2167-2170.

基于服务簇和QoS的Web服务组合方法

邓式阳¹,²,杜玉越¹

1. 山东科技大学信息科学与工程学院，山东青岛 266590
2. 潍坊学院计算机工程学院，山东潍坊 261061;

收稿日期:2013-02-21 修回日期:2013-03-28 出版日期:2013-08-01 发布日期:2013-09-11
通讯作者: 邓式阳
作者简介:邓式阳(1971-)，男，山东高密人，讲师，博士研究生，主要研究方向：分布式系统、Web服务发现、Petri网;
杜玉越(1960-)，男，山东聊城人，教授，博士生导师，博士，CCF高级会员，主要研究方向：计算机支持协同工作、软件工程、形式化技术、Petri网。
基金资助:
国家973计划项目;国家自然科学基金资助项目;山东省科技发展计划项目;山东省高等学校科技计划项目;潍坊市科技发展计划项目

Web service composition approach based on service cluster and QoS

DENG Shiyang¹,²,DU Yuyue¹

1. College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao Shandong 266590, China
2. School of Computer Engineering, Weifang University, Weifang Shandong 261061, China

Received:2013-02-21 Revised:2013-03-28 Online:2013-09-11 Published:2013-08-01
Contact: DENG Shiyang

摘要/Abstract

摘要： 针对海量的语义Web 服务组合中如何提高搜索速度和获得最优组合的问题，提出了一种基于服务簇和服务质量(QoS)的快速组合方法。利用预先建立的服务簇进行服务搜索，可以有效缩小搜索空间，降低语义比较的复杂度，快速得到候选服务集合。组合过程中基于服务的最优组合QoS值动态确定阈值进行服务过滤，可以获得多个最优组合。同时采用高效的冗余处理方法保证组合中冗余服务最少，并采用服务簇内部过滤的方法限制候选服务数量，解决了因组合过多造成的运行超时问题。基于海量服务库进行实验，结果表明，服务搜索效率比普通搜索方法可提高几十倍，服务过滤和冗余处理效果明显，可快速获得多个QoS最优的无冗余组合，并且在百万级服务库进行大层次深度的组合时仍可保证良好的运行性能。

关键词: Web服务组合, 服务簇, 服务质量, 冗余处理

Abstract: To improve the searching speed and get optimal services compositions on large scale of semantic Web services, a quick composition approach based on service cluster and Quality of Service (QoS) was proposed. Using the pre-built service clusters, it could quickly get the candidate service set with the effectively reduced searching space and semantic comparison complexity. It could obtain more optimal compositions by filtering service with the dynamically determined threshold based on the best composition QoS in the process of composition. It adopted an effective redundancy processing method to ensure minimum redundant services were used in the composition, and a service cluster internal filtering method was used to limit the number of candidate services, that solved the operation overtime problems caused by too many compositions. The results of experiments performed on large scale service storage illustrate that the searching speed is improved dozens of times than common methods, and the effectiveness of service filtering and redundancy processing is remarkable, so that the approach can quickly get multiple QoS optimal and non-redundant service compositions, and perform well on deep hierarchy composition in service storage of millions level.

Key words: Web service composition, service cluster, Quality of Service (QoS), redundancy processing

中图分类号:

TP311

邓式阳杜玉越. 基于服务簇和QoS的Web服务组合方法[J]. 计算机应用, 2013, 33(08): 2167-2170.

DENG Shiyang DU Yuyue. Web service composition approach based on service cluster and QoS[J]. Journal of Computer Applications, 2013, 33(08): 2167-2170.

参考文献

［1］徐小良, 陈金奎, 吴优. 基于聚类优化的Web 服务发现方法［J］. 计算机工程, 2011, 37(9): 68-70.

［2］NAYAK R, LEE B. Web service discovery with additional semantics and clustering ［C］// ICWI07: Proceedings of IEEE/WIC/ACM International Conference on Web Intelligence. Washington, DC: IEEE Computer Society, 2007: 555-558.

［3］孙萍,蒋昌俊.利用服务聚类优化面向过程模型的语义Web服务发现［J］.计算机学报,2008,31(8): 1340-1353.

［4］刘书雷,刘云翔,张帆,等.一种服务聚合中QoS全局最优服务动态选择算法［J］.软件学报,2007,18(3): 646-656.

［5］KONA S, BANSAL A, GUPTA G. Automatic composition of semantic Web services ［C］// ICWS07: Proceedings of the 5th International Conference on Web Services. Washington, DC: IEEE Computer Society, 2007: 150-158.

［6］KWON J, LEE D. Non-redundant Web services composition based on a two-phase algorithm［J］. Data & Knowledge Engineering, 2012,71(1): 69-91.

［7］NASERI M, TOWHIDI A. QoS-aware automatic composition of Web services using AI planners ［C］// ICIW07: Proceedings of Internet and Web Applications and Service. Washington, DC: IEEE Computer Society, 2007: 29-35

［8］SIRINA E, PARSIAB B, WU D, et al. HTN planning for Web service composition using SHOP2［J］. Journal of Web Semantics, 2004, 1(4):377-396

［9］HUANG Z Q, WEI J, HU S L, et al. Effective pruning algorithm for QoS-aware service composition ［C］// CEC09: Proceedings of IEEE Conference on Commerce and Enterprise Computing. Washington, DC: IEEE Computer Society, 2009:519-522

［10］WEI J, CHARLES Z, HUANG Z Q, et al. QSynth: A tool for QoS-aware automatic service composition ［C］// ICWS10: Proceedings of International Conference of Web Services. Washington, DC: IEEE Computer Society, 2010: 42-49

［11］邓式阳,杜玉越.一种基于逻辑Petri网的Web服务簇模型［J］.计算机应用,2012, 32(8):2328-2332.

［12］JIANG X, WU B, DU Y Y. Architecture of dynamic service composition using logic Petri nets ［J］. Journal of Software Engineering & Applications, 2011, 4(10): 585-589.

［13］DU Y Y, JIANG C J, ZHOU M C. Modeling and analysis of real-time cooperative systems using Petri nets ［J］. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 2007, 37(5): 643-654.

［14］MURATA T. Petri nets: properties, analysis and applications ［J］. Proceedings of the IEEE, 1989, 77(4): 541-580.

［15］DU Y Y, QI L, ZHOU M C. A vector matching method for analyzing logic Petri nets ［J］. Enterprise Information Systems, 2011, 5(4): 449-468.

[1]	周烁, 仇润鹤, 唐旻俊. 基于禁忌搜索和Q-learning的CR-NOMA系统的功率分配算法[J]. 计算机应用, 2021, 41(7): 2026-2032.
[2]	冉家敏, 倪志伟, 彭鹏, 朱旭辉. 考虑空间众包工作者服务质量的任务分配策略及其萤火虫群优化算法求解[J]. 计算机应用, 2021, 41(3): 794-802.
[3]	雷鹰, 郑万波, 魏嵬, 夏云霓, 李晓波, 刘诚武, 谢洪. 基于概率性能感知演化博弈策略的“云+边”混合环境中任务卸载方法[J]. 《计算机应用》唯一官方网站, 2021, 41(11): 3302-3308.
[4]	徐金荣, 郭彩萍, 童恩栋. 面向服务遥感图像处理平台中时间感知的服务质量预测[J]. 计算机应用, 2020, 40(6): 1714-1721.
[5]	郭曙杰, 李志华, 蔺凯青. 云环境下基于模糊隶属度的虚拟机放置算法[J]. 计算机应用, 2020, 40(5): 1374-1381.
[6]	罗际炜, 瞿涛, 邓徳祥. 嵌入式多通道无线视频传输的码率自适应算法[J]. 计算机应用, 2020, 40(4): 1119-1126.
[7]	孙天齐, 胡建鹏, 黄娟, 樊莹. 云环境下Web应用带宽资源预测与管理[J]. 计算机应用, 2020, 40(1): 181-187.
[8]	王妍, 马秀荣, 单云龙. 长期演进系统基于加权平均时延的下行资源调度[J]. 计算机应用, 2019, 39(5): 1429-1433.
[9]	李磊, 薛洋, 吕念玲, 冯敏. 基于李雅普诺夫优化的容器云队列在线任务和资源调度设计[J]. 计算机应用, 2019, 39(2): 494-500.
[10]	郭棉, 李绮琦. 面向延迟敏感型物联网应用的计算迁移策略[J]. 计算机应用, 2019, 39(12): 3590-3596.
[11]	吴沐阳, 刘峥, 王洋, 李云, 李涛. 基于指标相关性的网络运维质量评估模型[J]. 计算机应用, 2018, 38(9): 2535-2542.
[12]	王泽武, 孙磊, 郭松辉, 孙瑞辰. 密码云中基于熵权评价的虚拟密码机调度方法[J]. 计算机应用, 2018, 38(5): 1353-1359.
[13]	李昆仑, 关立伟, 郭昌隆. 基于聚类和改进共生演算法的云任务调度策略[J]. 计算机应用, 2018, 38(3): 707-714.
[14]	喻新荣, 李志华, 闫成雨, 李双俐. 云数据中心高效的虚拟机整合方法[J]. 计算机应用, 2018, 38(2): 550-556.
[15]	唐俊勇, 田鹏辉, 王辉. 基于马尔可夫链与服务质量的网络可用性[J]. 计算机应用, 2018, 38(12): 3518-3523.