Simplifying Web Service Discovery & Validating Service Composition

S. Mallick, R. Pandey, Sanjeev Neupane, Shakti Mishra, D. S. Kushwaha
{"title":"Simplifying Web Service Discovery & Validating Service Composition","authors":"S. Mallick, R. Pandey, Sanjeev Neupane, Shakti Mishra, D. S. Kushwaha","doi":"10.1109/SERVICES.2011.60","DOIUrl":null,"url":null,"abstract":"Web services are software components developed to simplify machine-to-machine interaction over the Web. Many researches are targeted towards Web service standardization, and these efforts have significantly contributed towards improving functionality of Service Oriented Architecture (SOA). However, there are number of issues yet to be resolved. Among them, one of the major challenges is the standardization of Web service composition. When a single web service cannot satisfy the given request, composition of web services need to be incorporated. In this paper, we address Web service composition problem with the signature-based service discovery and composition approach[30]. In the proposed approach, each web service is described by WSDL. Our design eliminates the need of complicated discovery agents like UDDI and also facilitates validation of the service before actually accessing it for integration. The composition problem has been modelled as a finite state machine, which means if the all the intermediate states are rightly composed then the final composition is successful. We propose a simple yet efficient algorithm DISCOMP for the discovery and composition. This paper analyses build time and runtime issues related to signature-based approach. We support our design decision with implementation and performance results obtained on a decentralized setup.","PeriodicalId":429726,"journal":{"name":"2011 IEEE World Congress on Services","volume":"164 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE World Congress on Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SERVICES.2011.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Web services are software components developed to simplify machine-to-machine interaction over the Web. Many researches are targeted towards Web service standardization, and these efforts have significantly contributed towards improving functionality of Service Oriented Architecture (SOA). However, there are number of issues yet to be resolved. Among them, one of the major challenges is the standardization of Web service composition. When a single web service cannot satisfy the given request, composition of web services need to be incorporated. In this paper, we address Web service composition problem with the signature-based service discovery and composition approach[30]. In the proposed approach, each web service is described by WSDL. Our design eliminates the need of complicated discovery agents like UDDI and also facilitates validation of the service before actually accessing it for integration. The composition problem has been modelled as a finite state machine, which means if the all the intermediate states are rightly composed then the final composition is successful. We propose a simple yet efficient algorithm DISCOMP for the discovery and composition. This paper analyses build time and runtime issues related to signature-based approach. We support our design decision with implementation and performance results obtained on a decentralized setup.
简化Web服务发现和验证服务组合
Web服务是为简化Web上的机器对机器交互而开发的软件组件。许多研究都以Web服务标准化为目标,这些努力对改进面向服务体系结构(service Oriented Architecture, SOA)的功能做出了重大贡献。然而,仍有许多问题有待解决。其中,主要的挑战之一是Web服务组合的标准化。当单个web服务不能满足给定的请求时,需要合并web服务的组合。在本文中,我们使用基于签名的服务发现和组合方法来解决Web服务组合问题[30]。在建议的方法中,每个web服务都由WSDL描述。我们的设计消除了像UDDI这样复杂的发现代理的需要,并且还简化了在实际访问服务进行集成之前对其进行验证的过程。组合问题被建模为一个有限状态机,这意味着如果所有的中间状态被正确组合,那么最终的组合是成功的。我们提出了一种简单而有效的算法DISCOMP用于发现和合成。本文分析了与基于签名的方法相关的构建时间和运行时问题。我们通过在分散设置上获得的实现和性能结果来支持我们的设计决策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信