Web services composition search systems have received a great deal of attention recently. However, current solutions have limitations of inefficiency and including redundant Web services in the results. In this paper, we proposed a redundant-free Web services composition search based on a two phase algorithm. In the forward phase, the candidate composition will be found efficiently by searching the link Index. In the backward phase, redundant-free Web services compositions are generated from the candidate composition by using the concepts of tokens. Experimental results demonstrate the performance benefits of our proposed techniques compared to state-of-the-art composition approaches.
{"title":"Redundant-Free Web Services Composition Based on a Two-Phase Algorithm","authors":"Joonho Kwon, Hyeonji Kim, Daewook Lee, Sukho Lee","doi":"10.1109/ICWS.2008.91","DOIUrl":"https://doi.org/10.1109/ICWS.2008.91","url":null,"abstract":"Web services composition search systems have received a great deal of attention recently. However, current solutions have limitations of inefficiency and including redundant Web services in the results. In this paper, we proposed a redundant-free Web services composition search based on a two phase algorithm. In the forward phase, the candidate composition will be found efficiently by searching the link Index. In the backward phase, redundant-free Web services compositions are generated from the candidate composition by using the concepts of tokens. Experimental results demonstrate the performance benefits of our proposed techniques compared to state-of-the-art composition approaches.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117284934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Often there are several services providing similar functionality, moving the problem of selecting the most suitable to the forefront of interest. In this paper we consider the selection of services in a dynamic environment with changing requirements. In previous work we considered selecting services in isolation, here we present an enhancement to select services in their relation to each other to gain a global optimal solution which nevertheless respects local criteria. Novel contributions are the definition of a composition context and the global multi-criteria optimization mechanism.
{"title":"Composition Context for Web Services Selection","authors":"H. Yu, S. Reiff-Marganiec, M. Tilly","doi":"10.1109/ICWS.2008.98","DOIUrl":"https://doi.org/10.1109/ICWS.2008.98","url":null,"abstract":"Often there are several services providing similar functionality, moving the problem of selecting the most suitable to the forefront of interest. In this paper we consider the selection of services in a dynamic environment with changing requirements. In previous work we considered selecting services in isolation, here we present an enhancement to select services in their relation to each other to gain a global optimal solution which nevertheless respects local criteria. Novel contributions are the definition of a composition context and the global multi-criteria optimization mechanism.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"119 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120858360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Web Services providing access to datasources with structured data have an important place in the SOA. In this paper we focus on modeling and discovery of generic data providing services (DPS), with the goal of making data providing services available for interactions with service requesters in contexts such as service composition and mediation. In our model RDF Views are used to represent the content provided by the DPS. A characterization of match between description of DPS as RDF Views and the OWL-S service request is specified, based on which we developed a flexible matchmaking algorithm for discovery of data providing services. Finally, we propose a realization of the DPS using a SOAP version of the SPARQL protocol and a dynamic configuration interface allowing easy interactions of service requesters with data providing services.
{"title":"Modeling and Discovery of Data Providing Services","authors":"R. Vaculín, Huajun Chen, Roman Neruda, K. Sycara","doi":"10.1109/ICWS.2008.110","DOIUrl":"https://doi.org/10.1109/ICWS.2008.110","url":null,"abstract":"Web Services providing access to datasources with structured data have an important place in the SOA. In this paper we focus on modeling and discovery of generic data providing services (DPS), with the goal of making data providing services available for interactions with service requesters in contexts such as service composition and mediation. In our model RDF Views are used to represent the content provided by the DPS. A characterization of match between description of DPS as RDF Views and the OWL-S service request is specified, based on which we developed a flexible matchmaking algorithm for discovery of data providing services. Finally, we propose a realization of the DPS using a SOAP version of the SPARQL protocol and a dynamic configuration interface allowing easy interactions of service requesters with data providing services.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125815027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Although the use of workflow techniques based on Web services (WS) has grown rapidly for the past several years, there is still a significant gap to be bridged before such an approach is widely accepted as the standard way to build and represent WS-based applications. One of the reasons for this is the inability in most current workflow languages to support large and complex applications that require workflow integration and data sharing between workflows. In this paper, this issue is addressed by the introduction of the two approaches used in the Service Workflow Language (SWFL): the Procedure-Oriented approach, and the Objected-Oriented approach, for workflow integration. The data sharing and related synchronization issues that are associated with these workflow integration approaches are also discussed.
{"title":"Integration and Data Sharing between WS-Based Workflows","authors":"Coral Walker, D. Walker","doi":"10.1109/ICWS.2008.35","DOIUrl":"https://doi.org/10.1109/ICWS.2008.35","url":null,"abstract":"Although the use of workflow techniques based on Web services (WS) has grown rapidly for the past several years, there is still a significant gap to be bridged before such an approach is widely accepted as the standard way to build and represent WS-based applications. One of the reasons for this is the inability in most current workflow languages to support large and complex applications that require workflow integration and data sharing between workflows. In this paper, this issue is addressed by the introduction of the two approaches used in the Service Workflow Language (SWFL): the Procedure-Oriented approach, and the Objected-Oriented approach, for workflow integration. The data sharing and related synchronization issues that are associated with these workflow integration approaches are also discussed.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122956033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Implementation and modification of non-functional properties related to monitoring quality of service (QoS) can be both a expensive and complex task. This paper presents a model-based approach to the implementation of QoS monitors by describing them as platform-independent models. Then, model-driven development (MDD) transformations are conducted to create both a system implementation and QoS constraints in the form of aspects according to the aspect-oriented programming (AOP) paradigm. Aspects are weaved within the system implementation.
{"title":"Model-Driven Quality of Service for Web Services: An Aspect-Oriented Approach","authors":"Guadalupe Ortiz, B. Bordbar","doi":"10.1109/ICWS.2008.52","DOIUrl":"https://doi.org/10.1109/ICWS.2008.52","url":null,"abstract":"Implementation and modification of non-functional properties related to monitoring quality of service (QoS) can be both a expensive and complex task. This paper presents a model-based approach to the implementation of QoS monitors by describing them as platform-independent models. Then, model-driven development (MDD) transformations are conducted to create both a system implementation and QoS constraints in the form of aspects according to the aspect-oriented programming (AOP) paradigm. Aspects are weaved within the system implementation.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122905827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recently, a new generation of adaptive Process-Aware Information Systems (PAIS) has emerged, which allows for dynamic process and service changes (e.g., to insert, delete, and move activities and service executions in a running process). This, in turn, has led to a large number of process variants derived from the same model, but differing in structure due to the applied changes. Generally, such process variants are expensive to configure and difficult to maintain. This paper provides a sophisticated approach which fosters learning from past process changes and allows for mining process variants. As a result we obtain a generic process model for which the average distance between this model and the respective process variants becomes minimal. By adopting this generic model in the PAIS, need for future process configuration and adaptation decreases. We have validated the proposed mining method and implemented it in a powerful proof-of-concept prototype.
{"title":"Discovering Reference Process Models by Mining Process Variants","authors":"Chen Li, M. Reichert, A. Wombacher","doi":"10.1109/ICWS.2008.13","DOIUrl":"https://doi.org/10.1109/ICWS.2008.13","url":null,"abstract":"Recently, a new generation of adaptive Process-Aware Information Systems (PAIS) has emerged, which allows for dynamic process and service changes (e.g., to insert, delete, and move activities and service executions in a running process). This, in turn, has led to a large number of process variants derived from the same model, but differing in structure due to the applied changes. Generally, such process variants are expensive to configure and difficult to maintain. This paper provides a sophisticated approach which fosters learning from past process changes and allows for mining process variants. As a result we obtain a generic process model for which the average distance between this model and the respective process variants becomes minimal. By adopting this generic model in the PAIS, need for future process configuration and adaptation decreases. We have validated the proposed mining method and implemented it in a powerful proof-of-concept prototype.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114179004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowledge and we use the most general notion of matching, partial matches, where several web services can cooperate, each covering only a part of a requirement. Unsurprisingly, automatic composition in this setting is very hard. We identify a special case with simpler semantics, which covers many relevant scenarios. We develop a composition tool for this special case. Our goal is to achieve scalability: we overcome large search spaces by guiding the search using heuristic techniques. The computed solutions are optimal up to a constant factor. We test our approach on a simple, yet powerful real world use-case; the initial results attest the potential of the approach.
{"title":"Towards Scalable Web Service Composition with Partial Matches","authors":"Adina Sirbu, J. Hoffmann","doi":"10.1109/ICWS.2008.69","DOIUrl":"https://doi.org/10.1109/ICWS.2008.69","url":null,"abstract":"We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowledge and we use the most general notion of matching, partial matches, where several web services can cooperate, each covering only a part of a requirement. Unsurprisingly, automatic composition in this setting is very hard. We identify a special case with simpler semantics, which covers many relevant scenarios. We develop a composition tool for this special case. Our goal is to achieve scalability: we overcome large search spaces by guiding the search using heuristic techniques. The computed solutions are optimal up to a constant factor. We test our approach on a simple, yet powerful real world use-case; the initial results attest the potential of the approach.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116586935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The discovery of suitable web services for a given task from a brokerage system is the core part of current Service Oriented Architecture (SOA). With the number of registered web services growing, organization of search results is critical for improving the utility of any service search engine. A clustering view of search results is more effective than traditional ranked-list style in helping users to navigate into relevant services quickly and accurately. In this paper, we will propose an efficient clustering algorithm for organizing returned services. Our experiments validated the efficiency of the proposed method.
{"title":"A Clustering-Based Approach for Assisting Semantic Web Service Retrieval","authors":"Dong Shou, Chi-Hung Chi","doi":"10.1109/ICWS.2008.121","DOIUrl":"https://doi.org/10.1109/ICWS.2008.121","url":null,"abstract":"The discovery of suitable web services for a given task from a brokerage system is the core part of current Service Oriented Architecture (SOA). With the number of registered web services growing, organization of search results is critical for improving the utility of any service search engine. A clustering view of search results is more effective than traditional ranked-list style in helping users to navigate into relevant services quickly and accurately. In this paper, we will propose an efficient clustering algorithm for organizing returned services. Our experiments validated the efficiency of the proposed method.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130302811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, the issues in web service security have been widely investigated and various security standards have been proposed. But most of these studies and standards focus on the access control policies for individual web services and do not consider the access issues in composed services. Consider a simple service chain where service s1 accesses s2, and s2, in turn, accesses service s3. The information returned from s3 to s2 may be used to compute some results that are further returned to s1. The current web service security framework does not provide any mechanisms to control such an information flow, and hence, sensitive information may be leaked to s1 without the consensus of s3. In this paper, we propose an enhanced security model to facilitate the control of information flow through service chains. It extends the basic security models by introducing the concepts of delegation and pass-on. Based on these concepts, new certificates, certificate chain, delegation and pass-on policies, and how they are used to control the information flow are discussed.
{"title":"Enhancing Security Modeling for Web Services Using Delegation and Pass-On","authors":"Wei She, I. Yen, B. Thuraisingham","doi":"10.4018/jwsr.2010010101","DOIUrl":"https://doi.org/10.4018/jwsr.2010010101","url":null,"abstract":"In recent years, the issues in web service security have been widely investigated and various security standards have been proposed. But most of these studies and standards focus on the access control policies for individual web services and do not consider the access issues in composed services. Consider a simple service chain where service s1 accesses s2, and s2, in turn, accesses service s3. The information returned from s3 to s2 may be used to compute some results that are further returned to s1. The current web service security framework does not provide any mechanisms to control such an information flow, and hence, sensitive information may be leaked to s1 without the consensus of s3. In this paper, we propose an enhanced security model to facilitate the control of information flow through service chains. It extends the basic security models by introducing the concepts of delegation and pass-on. Based on these concepts, new certificates, certificate chain, delegation and pass-on policies, and how they are used to control the information flow are discussed.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123669074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Recent development in daily business life indicates demand for higher reliability of SOA software. After analyzing the traditional software reliability models (Markov chain based), it was found that many software with complicated relationships of components did not satisfy the Markov property. This paper analyzed various complex components' relationships (parallel, loops, backup, fault- tolerance, request and response, etc.) how to influence the reliability of the whole system, and solved these complicated relationships to satisfy the Markov property. This work extended the scope of the application of the Markov Model and improved the accuracy of reliability estimation.
{"title":"Reliability Analysis of Component-Based Software Based on Relationships of Components","authors":"Wang Dong, Huang Ning, Ye Ming","doi":"10.1109/ICWS.2008.83","DOIUrl":"https://doi.org/10.1109/ICWS.2008.83","url":null,"abstract":"Recent development in daily business life indicates demand for higher reliability of SOA software. After analyzing the traditional software reliability models (Markov chain based), it was found that many software with complicated relationships of components did not satisfy the Markov property. This paper analyzed various complex components' relationships (parallel, loops, backup, fault- tolerance, request and response, etc.) how to influence the reliability of the whole system, and solved these complicated relationships to satisfy the Markov property. This work extended the scope of the application of the Markov Model and improved the accuracy of reliability estimation.","PeriodicalId":275591,"journal":{"name":"2008 IEEE International Conference on Web Services","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114776644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：