Abstract-the existing distributed ontology evolutionapproaches are not scaled to dynamic environments likeSemantic service architecture (SSOA). As the SSOA-basedsystem grows in size, the complexity of ontology changemanagement increases, especially if the services ontologies areheterogeneous. In this paper, a novel agent-based ontologyevolution framework is developed for services which consumeontologies in semantic SOA-based applications. A prototype isbuilt by using the JADE agent platform for evaluation.
{"title":"A Framework for Ontology Evolution Management in SSOA-Based Systems","authors":"Soumaya Slimani, Salah Baïna, Karim Baïna","doi":"10.1109/ICWS.2011.129","DOIUrl":"https://doi.org/10.1109/ICWS.2011.129","url":null,"abstract":"Abstract-the existing distributed ontology evolutionapproaches are not scaled to dynamic environments likeSemantic service architecture (SSOA). As the SSOA-basedsystem grows in size, the complexity of ontology changemanagement increases, especially if the services ontologies areheterogeneous. In this paper, a novel agent-based ontologyevolution framework is developed for services which consumeontologies in semantic SOA-based applications. A prototype isbuilt by using the JADE agent platform for evaluation.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"32 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":"131192127","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 make tools which used to be merely accessible to the specialist available to all, and permitting previous manual data processing and analysis tasks to be automated. One of key problem is Web services composition in terms of Quality of Service (QoS). There are many task concurrencies, such as remote sensing image processing, in computation-intensive scientific applications. However, existing Web service optimal combination approaches are mainly focused on single tasks by using "selfish" behavior to pursue optimal solutions. This causes conflicts because many concurrent tasks are competing for limited optimal resources, and the reducing of service quality in services. Based on the best reply function of quantified task conflicts and game theory, this paper establishes a mathematical model to depict the competitive relationship between multitasks and Web service under QoS constraints and it guarantees that every task can obtain optimal utility services considering other task combination strategies. Moreover, an iterative algorithm to reach the Nash equilibrium is also proposed. Theory and experimental analysis show the approach has a fine convergence property, and can considerably enhance the actual utility of all tasks when compared with existing Web services combinatorial methods. The proposed approach provides a new path for QoS-aware Web service with optimal combinations for concurrent tasks.
{"title":"Non-cooperative Game Based QoS-Aware Web Services Composition Approach for Concurrent Tasks","authors":"Haifeng Li, Qing Zhu, Y. Ouyang","doi":"10.1109/ICWS.2011.45","DOIUrl":"https://doi.org/10.1109/ICWS.2011.45","url":null,"abstract":"Web services make tools which used to be merely accessible to the specialist available to all, and permitting previous manual data processing and analysis tasks to be automated. One of key problem is Web services composition in terms of Quality of Service (QoS). There are many task concurrencies, such as remote sensing image processing, in computation-intensive scientific applications. However, existing Web service optimal combination approaches are mainly focused on single tasks by using \"selfish\" behavior to pursue optimal solutions. This causes conflicts because many concurrent tasks are competing for limited optimal resources, and the reducing of service quality in services. Based on the best reply function of quantified task conflicts and game theory, this paper establishes a mathematical model to depict the competitive relationship between multitasks and Web service under QoS constraints and it guarantees that every task can obtain optimal utility services considering other task combination strategies. Moreover, an iterative algorithm to reach the Nash equilibrium is also proposed. Theory and experimental analysis show the approach has a fine convergence property, and can considerably enhance the actual utility of all tasks when compared with existing Web services combinatorial methods. The proposed approach provides a new path for QoS-aware Web service with optimal combinations for concurrent tasks.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"9 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":"126569027","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}
Mustapha Aznag, M. Quafafou, Nicolas Durand, Zahi Jarir
This paper analyses the well known web servicesrepresentations based on web services descriptions and moregenerally on the content of WSDL files to evaluate theirinterest for discovery, clustering and recommendation tasks.Unfortunately, this analysis shows that these representationsare very basic and do not lead to good results. Therefore,we introduce a new representation called symbolic reputationwhich is computed from relationships between web services.Different implementation issues are discussed and the resultsconsidering real world web services are analysed to determinethe usefulness of the introduced representations for web servicesdiscovery, clustering and recommendation.
{"title":"Multiple Representations of Web Services: Discovery, Clustering and Recommendation","authors":"Mustapha Aznag, M. Quafafou, Nicolas Durand, Zahi Jarir","doi":"10.1109/ICWS.2011.109","DOIUrl":"https://doi.org/10.1109/ICWS.2011.109","url":null,"abstract":"This paper analyses the well known web servicesrepresentations based on web services descriptions and moregenerally on the content of WSDL files to evaluate theirinterest for discovery, clustering and recommendation tasks.Unfortunately, this analysis shows that these representationsare very basic and do not lead to good results. Therefore,we introduce a new representation called symbolic reputationwhich is computed from relationships between web services.Different implementation issues are discussed and the resultsconsidering real world web services are analysed to determinethe usefulness of the introduced representations for web servicesdiscovery, clustering and recommendation.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"33 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":"121625553","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}
Reliability is an essential quality requirement for service-oriented systems. A number of models have been developed for predicting reliability of traditional software, in which code-based defects are the main concern for the causes of failures. Service-oriented software, however, shares many common characteristics with distributed systems and web applications. In addition to residual defects, the reliabilities of these types of systems can be affected by their execution context, message transmission media, and their usages. We present a case study to demonstrate that the reliability of a service varies on an hourly basis, and reliability forecasts should be recalibrated accordingly. In this study, the failure behavior of a required external service, used by a provided service, was monitored for two months to compute the initial estimates, which then continuously re-computed based on the learning of the new failure patterns. These reliabilities are integrated with the reliability of the component in the provided service. The results show that with this progressive re-calibration we provide more accurate reliability forecasts for the service.
{"title":"Progressive Reliability Forecasting of Service-Oriented Software","authors":"An Liu, Ewa Musial, Mei-Hwa Chen","doi":"10.1109/ICWS.2011.103","DOIUrl":"https://doi.org/10.1109/ICWS.2011.103","url":null,"abstract":"Reliability is an essential quality requirement for service-oriented systems. A number of models have been developed for predicting reliability of traditional software, in which code-based defects are the main concern for the causes of failures. Service-oriented software, however, shares many common characteristics with distributed systems and web applications. In addition to residual defects, the reliabilities of these types of systems can be affected by their execution context, message transmission media, and their usages. We present a case study to demonstrate that the reliability of a service varies on an hourly basis, and reliability forecasts should be recalibrated accordingly. In this study, the failure behavior of a required external service, used by a provided service, was monitored for two months to compute the initial estimates, which then continuously re-computed based on the learning of the new failure patterns. These reliabilities are integrated with the reliability of the component in the provided service. The results show that with this progressive re-calibration we provide more accurate reliability forecasts for the service.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"73 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":"114400258","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}
A common problem that mashup developers face is the discovery of APIs that suit their needs. This primary task becomes harder, tedious and time-consuming with the proliferation of new APIs. As humans, we learn by example, following community previous decisions when creating mashups. Most techniques do not consider at all reusing this social information. In this paper, we propose to combine current discovery techniques (exploration) with social information (exploitation). Our preliminary results show that by considering the reciprocal influence of both sources, the discovery process reveals APIs that would remain with low rank because the preferential attachment (popularity) and/or the lack of better descriptions (discovery techniques). We present a case study focusing on a public Web-based API registry.
{"title":"Improving Web API Discovery by Leveraging Social Information","authors":"Romina Torres, B. Tapia, H. Astudillo","doi":"10.1109/ICWS.2011.96","DOIUrl":"https://doi.org/10.1109/ICWS.2011.96","url":null,"abstract":"A common problem that mashup developers face is the discovery of APIs that suit their needs. This primary task becomes harder, tedious and time-consuming with the proliferation of new APIs. As humans, we learn by example, following community previous decisions when creating mashups. Most techniques do not consider at all reusing this social information. In this paper, we propose to combine current discovery techniques (exploration) with social information (exploitation). Our preliminary results show that by considering the reciprocal influence of both sources, the discovery process reveals APIs that would remain with low rank because the preferential attachment (popularity) and/or the lack of better descriptions (discovery techniques). We present a case study focusing on a public Web-based API registry.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"67 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":"114585207","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 paper, we propose a preliminary approach for automating web service verification. We use Semantic Markup for Web Services (OWL-S) to describe web service behavior. We parse the OWL-S file and transform it automatically to a corresponding Markov chain diagram or Markov decision process, which are then transformed to a PRISM model to be used as input by PRISM, a probabilistic model checker, to verify automatically the web service behavior. We provide an implementation of the transformation algorithm through a developed software tool automating all the transformation and verification activities.
{"title":"On the Verification of Behavioral and Probabilistic Web Services Using Transformation","authors":"Giti Oghabi, J. Bentahar, A. Benharref","doi":"10.1109/ICWS.2011.106","DOIUrl":"https://doi.org/10.1109/ICWS.2011.106","url":null,"abstract":"In this paper, we propose a preliminary approach for automating web service verification. We use Semantic Markup for Web Services (OWL-S) to describe web service behavior. We parse the OWL-S file and transform it automatically to a corresponding Markov chain diagram or Markov decision process, which are then transformed to a PRISM model to be used as input by PRISM, a probabilistic model checker, to verify automatically the web service behavior. We provide an implementation of the transformation algorithm through a developed software tool automating all the transformation and verification activities.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"14 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":"123625046","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 composition has the capability of constructing coarse-grained solutions by dynamically aggregating a set of services to satisfy complex requirements, but it suffers from dramatic decrease on the efficiency of determining the best composition solution when large scale candidate services are available. Most current approaches look for the optimal composition solution by real-time computation, and the composition efficiency greatly depends on the adopted algorithms. To eliminate such deficiency, this paper proposes a semi-empirical composition approach which incorporates two stages, i.e., periodical clustering and real-time composition. The former partitions the candidate services and historical requirements into clusters based on similarity measurement, and then the probabilistic correspondences between service clusters and requirement clusters are identified by statistical analysis. The latter deals with a new requirement by firstly finding its most similar requirement cluster and the corresponding service clusters by leveraging Bayesian inference, then a set of concrete services are optimally selected from such reduced solution space and constitute the final composition solution. Instead of relying on solely historical data exploration or on pure real-time computation, our approach distinguishes from traditional methods by combining the two perspectives together. Experiments demonstrate the advantages of this approach.
{"title":"Semi-empirical Service Composition: A Clustering Based Approach","authors":"Xianzhi Wang, Zhongjie Wang, Xiaofei Xu","doi":"10.1109/ICWS.2011.15","DOIUrl":"https://doi.org/10.1109/ICWS.2011.15","url":null,"abstract":"Service composition has the capability of constructing coarse-grained solutions by dynamically aggregating a set of services to satisfy complex requirements, but it suffers from dramatic decrease on the efficiency of determining the best composition solution when large scale candidate services are available. Most current approaches look for the optimal composition solution by real-time computation, and the composition efficiency greatly depends on the adopted algorithms. To eliminate such deficiency, this paper proposes a semi-empirical composition approach which incorporates two stages, i.e., periodical clustering and real-time composition. The former partitions the candidate services and historical requirements into clusters based on similarity measurement, and then the probabilistic correspondences between service clusters and requirement clusters are identified by statistical analysis. The latter deals with a new requirement by firstly finding its most similar requirement cluster and the corresponding service clusters by leveraging Bayesian inference, then a set of concrete services are optimally selected from such reduced solution space and constitute the final composition solution. Instead of relying on solely historical data exploration or on pure real-time computation, our approach distinguishes from traditional methods by combining the two perspectives together. Experiments demonstrate the advantages of this approach.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"79 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":"127678756","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 Level Agreements (SLAs) play an important role in service-based systems. However, traditional approaches to establish SLAs are mostly manual and predefined which is not suitable for the highly dynamic and unpredictable service-oriented environment. In this paper, we propose a policy-based framework for supporting dynamic and automated SLA negotiations for Web services. In our framework, we extend the WS-Policy framework to provide a domain-independent policy language for specifying QoS constraints over the QoS attributes that are to be negotiated. Negotiation agents are dynamically created to perform SLA negotiations on behalf of each negotiating party in a P2P way using standard web services invocations. Decision making models of negotiation agents are also defined in a declarative way and can be reconfigured easily. We have implemented a prototype of our framework and demonstrated our approach through a case study.
{"title":"A Policy-Based Framework for Automated Service Level Agreement Negotiation","authors":"Z. Xiao, Donggang Cao, Chao You, Hong Mei","doi":"10.1109/ICWS.2011.116","DOIUrl":"https://doi.org/10.1109/ICWS.2011.116","url":null,"abstract":"Service Level Agreements (SLAs) play an important role in service-based systems. However, traditional approaches to establish SLAs are mostly manual and predefined which is not suitable for the highly dynamic and unpredictable service-oriented environment. In this paper, we propose a policy-based framework for supporting dynamic and automated SLA negotiations for Web services. In our framework, we extend the WS-Policy framework to provide a domain-independent policy language for specifying QoS constraints over the QoS attributes that are to be negotiated. Negotiation agents are dynamically created to perform SLA negotiations on behalf of each negotiating party in a P2P way using standard web services invocations. Decision making models of negotiation agents are also defined in a declarative way and can be reconfigured easily. We have implemented a prototype of our framework and demonstrated our approach through a case study.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"31 1 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":"128656810","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}
Warawoot Pacharoen, Toshiaki Aoki, A. Surarerks, P. Bhattarakosol
In this paper, we propose an alternative approach for verifying a conformance between choreography and the black box implementation of stateful Web service whose only external behaviors can be observed. Our framework uses an adapted version of Angluin's algorithm to infer a Mealy machine model that represents the observable behaviors of the implemented Web service. By transforming the Mealy machine to the modeling formalism LTS, the model checker LTSA can be used for checking a trace equivalence relation which is the conformance criterion in this work.
{"title":"Conformance Verification between Web Service Choreography and Implementation Using Learning and Model Checking","authors":"Warawoot Pacharoen, Toshiaki Aoki, A. Surarerks, P. Bhattarakosol","doi":"10.1109/ICWS.2011.113","DOIUrl":"https://doi.org/10.1109/ICWS.2011.113","url":null,"abstract":"In this paper, we propose an alternative approach for verifying a conformance between choreography and the black box implementation of stateful Web service whose only external behaviors can be observed. Our framework uses an adapted version of Angluin's algorithm to infer a Mealy machine model that represents the observable behaviors of the implemented Web service. By transforming the Mealy machine to the modeling formalism LTS, the model checker LTSA can be used for checking a trace equivalence relation which is the conformance criterion in this work.","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":"125935478","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}
providing non interrupted Web Services from resource limited mobile devices needs to be done in a rather light-weight manner. Processing and communication will drain the battery rapidly, hence, both should be kept at a minimum. This paper describes the outcomes of an investigation into simple offloading mechanisms that facilitate provision of adaptive and distributed Restful mobile web services from resource constrained mobile devices. Offloading considers the distributed hosts processing as well as communication capabilities. Using queuing theory, the performance gained from distributing mobile web service tasks is explored. In addition, the theoretical boundaries of different flavours of offloading mechanisms are presented. The analytical, as well as the experimental results show the differences in performance between these mechanisms.
{"title":"Providing Light Weight Distributed Web Services from Mobile Hosts","authors":"F. Alshahwan, K. Moessner, F. Carrez","doi":"10.1109/ICWS.2011.87","DOIUrl":"https://doi.org/10.1109/ICWS.2011.87","url":null,"abstract":"providing non interrupted Web Services from resource limited mobile devices needs to be done in a rather light-weight manner. Processing and communication will drain the battery rapidly, hence, both should be kept at a minimum. This paper describes the outcomes of an investigation into simple offloading mechanisms that facilitate provision of adaptive and distributed Restful mobile web services from resource constrained mobile devices. Offloading considers the distributed hosts processing as well as communication capabilities. Using queuing theory, the performance gained from distributing mobile web service tasks is explored. In addition, the theoretical boundaries of different flavours of offloading mechanisms are presented. The analytical, as well as the experimental results show the differences in performance between these mechanisms.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"8 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":"134008793","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
扫码关注我们
求助内容：
应助结果提醒方式：