To enforce reliability of composite Web Services at run-time, this paper proposes a transaction management model based on Compensation Planning Graph for Web Service composition. First, a web service composition model with transactional properties is introduced. Second, in order to handle transaction when exceptions are occurred, compensation dependency relationships and Compensation Planning Graph is introduced, and an algorithm of automatic generation of compensation dependency relationships and transaction handling based on CPG is proposed. Finally, evaluation methods of QoS of web services and user satisfaction of transaction handling are given. During the execution of composite web services, this approach can guarantee compensation achieving through forward- or backward-compensation. In addition, in this model, a novel concept named Transfer Service is proposed to solve the problem that there are no compensation services or unsuccessful retriable services after many retry times. This model and method can improve self-adjustability and stability of composite services in the course of deployment and execution. Simulations prove that this approach can efficiently guarantee the reliability of composite services at run-time.
{"title":"A Transaction Management Model Based on Compensation Planning Graph for Web Services Composition","authors":"Li-zhen Cui, Zongmin Shang, Yuliang Shi","doi":"10.1109/ICWS.2011.74","DOIUrl":"https://doi.org/10.1109/ICWS.2011.74","url":null,"abstract":"To enforce reliability of composite Web Services at run-time, this paper proposes a transaction management model based on Compensation Planning Graph for Web Service composition. First, a web service composition model with transactional properties is introduced. Second, in order to handle transaction when exceptions are occurred, compensation dependency relationships and Compensation Planning Graph is introduced, and an algorithm of automatic generation of compensation dependency relationships and transaction handling based on CPG is proposed. Finally, evaluation methods of QoS of web services and user satisfaction of transaction handling are given. During the execution of composite web services, this approach can guarantee compensation achieving through forward- or backward-compensation. In addition, in this model, a novel concept named Transfer Service is proposed to solve the problem that there are no compensation services or unsuccessful retriable services after many retry times. This model and method can improve self-adjustability and stability of composite services in the course of deployment and execution. Simulations prove that this approach can efficiently guarantee the reliability of composite services at run-time.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123478003","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}
Nowadays, the exploding number of functionally similar Web services has led to a new challenge of selecting the most relevant services using quality of service (QoS) aspects. Traditionally, the relevance of a service is determined by computing an overall score that aggregates individual QoS values. Users are required to assign weights to QoS attributes. This is a rather demanding task and an imprecise specification of the weights could result in missing some user desired services. Recent approaches focus on computing service skyline over a set of QoS aspects. This can completely free users from assigning weights to QoS attributes. However, two main drawbacks characterize such approaches. First, the service skyline often privileges services with a bad compromise between different QoS attributes. Second, as the size of the service skyline may be quite large, users will be overwhelmed during the service selection process. In this paper, we introduce a new concept, called alpha-dominant service skyline, to address the above issues and we develop a suitable algorithm for computing it efficiently. Experimental evaluation conducted on synthetically generated datasets, demonstrates both the effectiveness of the introduced concept and the efficiency of the proposed algorithm.
{"title":"On the Use of Fuzzy Dominance for Computing Service Skyline Based on QoS","authors":"Karim Benouaret, D. Benslimane, A. Hadjali","doi":"10.1109/ICWS.2011.93","DOIUrl":"https://doi.org/10.1109/ICWS.2011.93","url":null,"abstract":"Nowadays, the exploding number of functionally similar Web services has led to a new challenge of selecting the most relevant services using quality of service (QoS) aspects. Traditionally, the relevance of a service is determined by computing an overall score that aggregates individual QoS values. Users are required to assign weights to QoS attributes. This is a rather demanding task and an imprecise specification of the weights could result in missing some user desired services. Recent approaches focus on computing service skyline over a set of QoS aspects. This can completely free users from assigning weights to QoS attributes. However, two main drawbacks characterize such approaches. First, the service skyline often privileges services with a bad compromise between different QoS attributes. Second, as the size of the service skyline may be quite large, users will be overwhelmed during the service selection process. In this paper, we introduce a new concept, called alpha-dominant service skyline, to address the above issues and we develop a suitable algorithm for computing it efficiently. Experimental evaluation conducted on synthetically generated datasets, demonstrates both the effectiveness of the introduced concept and the efficiency of the proposed algorithm.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125777924","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 view of the need for a highly distributed and federated architecture, a robust query expansion has great impact on the performance of information retrieval. We aim to determine ontology-driven query expansion terms using different weighting techniques. For this, we consider each individual ontology and user query keywords to determine the Basic Expansion Terms (BET) using a number of semantic measures including Betweenness Measure (BM) and Semantic Similarity Measure (SSM). We propose a Map/Reduce distributed algorithm for calculating all the shortest paths in ontology graph. Map/Reduce algorithm will improve considerably the efficiency of BET calculation for large ontologies.
{"title":"Ontology-Driven Query Expansion Using Map/Reduce Framework to Facilitate Federated Queries","authors":"N. Alipanah, L. Khan, B. Thuraisingham","doi":"10.1109/ICWS.2011.21","DOIUrl":"https://doi.org/10.1109/ICWS.2011.21","url":null,"abstract":"In view of the need for a highly distributed and federated architecture, a robust query expansion has great impact on the performance of information retrieval. We aim to determine ontology-driven query expansion terms using different weighting techniques. For this, we consider each individual ontology and user query keywords to determine the Basic Expansion Terms (BET) using a number of semantic measures including Betweenness Measure (BM) and Semantic Similarity Measure (SSM). We propose a Map/Reduce distributed algorithm for calculating all the shortest paths in ontology graph. Map/Reduce algorithm will improve considerably the efficiency of BET calculation for large ontologies.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132859869","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}
With the increasing popularity of using Web services, Quality of Service (QoS) is becoming a significant concern for both service consumers and providers. Several models for considering functional and non-functional QoS requirements for the purpose of Web service discovery and selection have been proposed. We present in this paper a new Web services selection model based on fuzzy logic. In this model, the non-functional QoS requirements are taken into account for the appropriate selection of required services. Our model can handle consumers' imprecise preferences with fuzzy sets. Moreover, a new fuzzy ranking algorithm that is based on the dependencies between quality attributes is proposed. The experimental results obtained from real world Web service domains revealed better performance of our algorithm compared to Entropy-based ranking algorithms.
{"title":"A QoS-Based Fuzzy Model for Ranking Real World Web Services","authors":"M. Almulla, Kawthar Almatori, H. Yahyaoui","doi":"10.1109/ICWS.2011.43","DOIUrl":"https://doi.org/10.1109/ICWS.2011.43","url":null,"abstract":"With the increasing popularity of using Web services, Quality of Service (QoS) is becoming a significant concern for both service consumers and providers. Several models for considering functional and non-functional QoS requirements for the purpose of Web service discovery and selection have been proposed. We present in this paper a new Web services selection model based on fuzzy logic. In this model, the non-functional QoS requirements are taken into account for the appropriate selection of required services. Our model can handle consumers' imprecise preferences with fuzzy sets. Moreover, a new fuzzy ranking algorithm that is based on the dependencies between quality attributes is proposed. The experimental results obtained from real world Web service domains revealed better performance of our algorithm compared to Entropy-based ranking algorithms.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134629209","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}
Service Oriented Architecture (SOA) has become a major application development paradigm. As a basic unit of SOA applications, Web services significantly affect the quality of the applications constructed from them. Since the development and consumption of Web services are completely separated under SOA environment, the consumers are normally provided with limited knowledge of the services and thus have little information about test oracles. The lack of source code and the restricted control of Web services limit the testability of Web services. To address the prominent oracle problem when testing Web services, we propose a metamorphic testing framework for Web services taking into account the unique features of SOA. We conduct a case study where the new metamorphic testing framework is employed to test a Web service that implements the electronic payment. The results of case study show the feasibility of the framework for web services, and also the efficiency of metamorphic testing. The work presented in the paper alleviates the test oracle problem when testing Web services under SOA.
{"title":"Metamorphic Testing for Web Services: Framework and a Case Study","authors":"Chang-ai Sun, Guan Wang, Baohong Mu, Huai Liu, Zhaoshun Wang, T. Chen","doi":"10.1109/ICWS.2011.65","DOIUrl":"https://doi.org/10.1109/ICWS.2011.65","url":null,"abstract":"Service Oriented Architecture (SOA) has become a major application development paradigm. As a basic unit of SOA applications, Web services significantly affect the quality of the applications constructed from them. Since the development and consumption of Web services are completely separated under SOA environment, the consumers are normally provided with limited knowledge of the services and thus have little information about test oracles. The lack of source code and the restricted control of Web services limit the testability of Web services. To address the prominent oracle problem when testing Web services, we propose a metamorphic testing framework for Web services taking into account the unique features of SOA. We conduct a case study where the new metamorphic testing framework is employed to test a Web service that implements the electronic payment. The results of case study show the feasibility of the framework for web services, and also the efficiency of metamorphic testing. The work presented in the paper alleviates the test oracle problem when testing Web services under SOA.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133674791","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}
With the widespread of Service-oriented Computing (SOC) and the increasing number of available web services in several domains, service discovery has become one of the main challenges in SOC. Lack of rich service descriptions is one of the several factors that exacerbate this challenge. Therefore, additional information about web services is required. Several approaches and sources have been proposed in the community to gather this information, such as domain experts, service providers, service consumers, etc. However, the increasing number of web services requires automatic approaches and additional sources of information. In this paper, we introduce a novel approach to generate annotations for web services, e.g., tags, by sampling their automatic invocations. The generated annotations are integrated in web forms that are used for future calls of these web services. Providing correct values for input parameters of web services is one of the main challenges involved in this work. We use four sources to assign values for input parameters, namely, random values, outputs of other operations within the same web service, other web services, and external data sources, e.g., DBpedia, Word Net. We have implemented our approach in the context of our service registry and validated it through several experiments.
{"title":"Automatic Sampling of Web Services","authors":"Mohammed AbuJarour, Sebastian Oergel","doi":"10.1109/ICWS.2011.67","DOIUrl":"https://doi.org/10.1109/ICWS.2011.67","url":null,"abstract":"With the widespread of Service-oriented Computing (SOC) and the increasing number of available web services in several domains, service discovery has become one of the main challenges in SOC. Lack of rich service descriptions is one of the several factors that exacerbate this challenge. Therefore, additional information about web services is required. Several approaches and sources have been proposed in the community to gather this information, such as domain experts, service providers, service consumers, etc. However, the increasing number of web services requires automatic approaches and additional sources of information. In this paper, we introduce a novel approach to generate annotations for web services, e.g., tags, by sampling their automatic invocations. The generated annotations are integrated in web forms that are used for future calls of these web services. Providing correct values for input parameters of web services is one of the main challenges involved in this work. We use four sources to assign values for input parameters, namely, random values, outputs of other operations within the same web service, other web services, and external data sources, e.g., DBpedia, Word Net. We have implemented our approach in the context of our service registry and validated it through several experiments.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131985209","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}
Jun Na, Bin Zhang, Yanxiang Gao, Li Zhang, Zhiliang Zhu
Service-based software system (SBS) is a software system based on service-oriented architecture (SOA). Although often treated as a composite service, an SBS is proposed from a more practical point of view based on restricted service provisions. In the highly competitive market, just meeting such requirements seems not enough to get more customers for service providers, and they usually provide additional preferential policies, such as a special order "buy-two-get-one-free". However, most of current adaptation approaches focus on single transaction, which makes it hard to take full advantage of such preferential policies in reselecting substitutable services. In this paper, we try to make the adaptation decision and reselect services from a broader view, i.e. expand the computation domain from single transaction to the whole lifecycle of an SBS by considering all of the past, current and predicable future executions. We call it "long-term benefit" to distinguish benefit in current approaches and propose a long-term benefit driven adaptation approach in this paper. In our approach, services that would bring the max expected long-term benefit would be selected and substituted into current instance in once adaptation. As the long-term benefit is accumulated in several executions, i.e. it depends on a decision sequence, we model the decision making problem as a sequential decision problem, and describe a realization based on partially observable Markov decision process (POMDP) for maximizing the real income in providing an SBS as an example.
{"title":"Long-Term Benefit Driven Adaptation in Service-Based Software Systems","authors":"Jun Na, Bin Zhang, Yanxiang Gao, Li Zhang, Zhiliang Zhu","doi":"10.1109/ICWS.2011.82","DOIUrl":"https://doi.org/10.1109/ICWS.2011.82","url":null,"abstract":"Service-based software system (SBS) is a software system based on service-oriented architecture (SOA). Although often treated as a composite service, an SBS is proposed from a more practical point of view based on restricted service provisions. In the highly competitive market, just meeting such requirements seems not enough to get more customers for service providers, and they usually provide additional preferential policies, such as a special order \"buy-two-get-one-free\". However, most of current adaptation approaches focus on single transaction, which makes it hard to take full advantage of such preferential policies in reselecting substitutable services. In this paper, we try to make the adaptation decision and reselect services from a broader view, i.e. expand the computation domain from single transaction to the whole lifecycle of an SBS by considering all of the past, current and predicable future executions. We call it \"long-term benefit\" to distinguish benefit in current approaches and propose a long-term benefit driven adaptation approach in this paper. In our approach, services that would bring the max expected long-term benefit would be selected and substituted into current instance in once adaptation. As the long-term benefit is accumulated in several executions, i.e. it depends on a decision sequence, we model the decision making problem as a sequential decision problem, and describe a realization based on partially observable Markov decision process (POMDP) for maximizing the real income in providing an SBS as an example.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132951935","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 this work we construct partial order plans from a pool of atomic services described in OWL-S. We make extensions to Partial Order Planning to allow multiple conditional effects in action definitions. The purpose is to handle the uncertain behavior of Web services with incomplete initial information. We post-process the partial order plan to auto-generate a workflow model. We developed a method to identify a subset of workflow patterns from the solution plan to create a workflow diagram.
{"title":"Generating Workflow Models from OWL-S Service Descriptions with a Partial-Order Plan Construction","authors":"Bochao Wang, A. Haller, Florian Rosenberg","doi":"10.1109/ICWS.2011.88","DOIUrl":"https://doi.org/10.1109/ICWS.2011.88","url":null,"abstract":"In this work we construct partial order plans from a pool of atomic services described in OWL-S. We make extensions to Partial Order Planning to allow multiple conditional effects in action definitions. The purpose is to handle the uncertain behavior of Web services with incomplete initial information. We post-process the partial order plan to auto-generate a workflow model. We developed a method to identify a subset of workflow patterns from the solution plan to create a workflow diagram.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133254768","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}
Z. Azmeh, Maha Driss, Fady Hamoui, M. Huchard, Naouel Moha, Chouki Tibermacine
Building a composite application based on Web services has become a real challenge regarding the large and diverse service space nowadays. Especially when considering the various functional and non-functional capabilities that Web services may afford and users may require. In this paper, we propose an approach for facilitating Web service selection according to user requirements. These requirements specify the needed functionality and expected QoS, as well as the composability between each pair of services. The originality of our approach is embodied in the use of Relational Concept Analysis (RCA), an extension of Formal Concept Analysis (FCA). Using RCA, we classify services by their calculated QoS levels and composability modes. We use a real case study of 901 services to show how to accomplish an efficient selection of services satisfying a specified set of functional and non-functional requirements.
{"title":"Selection of Composable Web Services Driven by User Requirements","authors":"Z. Azmeh, Maha Driss, Fady Hamoui, M. Huchard, Naouel Moha, Chouki Tibermacine","doi":"10.1109/ICWS.2011.47","DOIUrl":"https://doi.org/10.1109/ICWS.2011.47","url":null,"abstract":"Building a composite application based on Web services has become a real challenge regarding the large and diverse service space nowadays. Especially when considering the various functional and non-functional capabilities that Web services may afford and users may require. In this paper, we propose an approach for facilitating Web service selection according to user requirements. These requirements specify the needed functionality and expected QoS, as well as the composability between each pair of services. The originality of our approach is embodied in the use of Relational Concept Analysis (RCA), an extension of Formal Concept Analysis (FCA). Using RCA, we classify services by their calculated QoS levels and composability modes. We use a real case study of 901 services to show how to accomplish an efficient selection of services satisfying a specified set of functional and non-functional requirements.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114311241","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}
Adaptation of service-based applications (SBA) is not trivial in their heterogeneous and dynamic execution context. While different approaches exist, most of them focus on a specific part of the SBA ignoring the overall impact of the adaptation on the whole application. In this paper we propose a cross-layer adaptation manager (CLAM) that tackles this problem.
{"title":"CLAM: Cross-Layer Management of Adaptation Decisions for Service-Based Applications","authors":"Aslı Zengin, R. Kazhamiakin, M. Pistore","doi":"10.1109/ICWS.2011.76","DOIUrl":"https://doi.org/10.1109/ICWS.2011.76","url":null,"abstract":"Adaptation of service-based applications (SBA) is not trivial in their heterogeneous and dynamic execution context. While different approaches exist, most of them focus on a specific part of the SBA ignoring the overall impact of the adaptation on the whole application. In this paper we propose a cross-layer adaptation manager (CLAM) that tackles this problem.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114641574","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
扫码关注我们
求助内容：
应助结果提醒方式：