SOA and cloud computing have brought new opportunities for the long expected agility, reuse and the adaptive capability of IT to the ever changing business requirements and environments. But due to the immature nature of the rapidly evolving technologies, especially in the areas of security, service or information integrity, privacy, quality of service and their possible detrimental consequences, many enterprises have been hesitating to make the shift. This paper adopts the concept of insurance and establishes a framework and the supporting reference model for cloud computing. We utilize the value-at-risk (VAR) approach to establish several appropriate mechanisms, and use a set of measurable metrics. Those quantitative or qualitative metrics can be applied as the basis for the business value and risk assessment, and eventually for insurance premium and compensation calculation for the failures of the services offered in Cloud environment. This model can also establish a potential new innovative market branch for the insurance industry.
{"title":"An Insuanrance Model for Guranteeing Service Assurance, Integrity and QoS in Cloud Computing","authors":"M. Luo, Liang-Jie Zhang, Fengyun Lei","doi":"10.1109/ICWS.2010.113","DOIUrl":"https://doi.org/10.1109/ICWS.2010.113","url":null,"abstract":"SOA and cloud computing have brought new opportunities for the long expected agility, reuse and the adaptive capability of IT to the ever changing business requirements and environments. But due to the immature nature of the rapidly evolving technologies, especially in the areas of security, service or information integrity, privacy, quality of service and their possible detrimental consequences, many enterprises have been hesitating to make the shift. This paper adopts the concept of insurance and establishes a framework and the supporting reference model for cloud computing. We utilize the value-at-risk (VAR) approach to establish several appropriate mechanisms, and use a set of measurable metrics. Those quantitative or qualitative metrics can be applied as the basis for the business value and risk assessment, and eventually for insurance premium and compensation calculation for the failures of the services offered in Cloud environment. This model can also establish a potential new innovative market branch for the insurance industry.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128270138","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 an approach for approximate matching of OWL-S process model. We also propose a similarity measure that captures structural and semantic differences between two process models. To do so, we reduce the process matching to a graph matching problem and we adapt existing algorithms for this purpose.
{"title":"OWL-S Process Model Matchmaking","authors":"A. Gater, Daniela Grigori, M. Bouzeghoub","doi":"10.1109/ICWS.2010.85","DOIUrl":"https://doi.org/10.1109/ICWS.2010.85","url":null,"abstract":"In this paper, we propose an approach for approximate matching of OWL-S process model. We also propose a similarity measure that captures structural and semantic differences between two process models. To do so, we reduce the process matching to a graph matching problem and we adapt existing algorithms for this purpose.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128655922","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 DynaSOAr framework presents a wholly service-oriented approach to grid and Internet-based computing that makes a clear and explicit separation of concerns between service-provision and resource-provision for each service invocation. The separation allows the dynamic deployment of code at runtime, in the form of a service implementation, between a service provider and an explicit resource provider. This paper presents work in progress towards an integrated tripartite security model and framework that enables the security constraints of each engaging party to be expressed, propagated, unified and enforced as part of a DynaSOAr service invocation.
{"title":"A Tripartite Security Model for Dynamic Service-Oriented Systems Using DynaSOAr","authors":"C. Fowler, P. Watson","doi":"10.1109/ICWS.2010.84","DOIUrl":"https://doi.org/10.1109/ICWS.2010.84","url":null,"abstract":"The DynaSOAr framework presents a wholly service-oriented approach to grid and Internet-based computing that makes a clear and explicit separation of concerns between service-provision and resource-provision for each service invocation. The separation allows the dynamic deployment of code at runtime, in the form of a service implementation, between a service provider and an explicit resource provider. This paper presents work in progress towards an integrated tripartite security model and framework that enables the security constraints of each engaging party to be expressed, propagated, unified and enforced as part of a DynaSOAr service invocation.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130545727","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 is nowadays mainly seen as a once-for-all activity. Supporting a dynamic service world, where both available services and needs may change, requires runtime adaptive features for service composition. In this paper we propose a repair technique for internal composition adaptation, as opposed to external adaptation. Moreover, setting up our proposal in the planning framework, we compare our repair technique with reference to re-composition, that is re-planning.
{"title":"Self-Adaptive Service Composition Through Graphplan Repair","authors":"Yuhong Yan, P. Poizat, Ludeng Zhao","doi":"10.1109/ICWS.2010.91","DOIUrl":"https://doi.org/10.1109/ICWS.2010.91","url":null,"abstract":"Service composition is nowadays mainly seen as a once-for-all activity. Supporting a dynamic service world, where both available services and needs may change, requires runtime adaptive features for service composition. In this paper we propose a repair technique for internal composition adaptation, as opposed to external adaptation. Moreover, setting up our proposal in the planning framework, we compare our repair technique with reference to re-composition, that is re-planning.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127935187","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}
Liang Chen, Jian Wu, Ru Jia, Shuiguang Deng, Ying Li
In this paper, we propose a time-sensitive probability skyline (TPS) approach to recommend services with uncertainty. We project services to n-dimensional data space and recommend services in TPS. Experimental evaluation on real data shows the great performance of TPS in service recommendation by comparing the experiment result with results of other approaches.
{"title":"Recommendation on Uncertain Services","authors":"Liang Chen, Jian Wu, Ru Jia, Shuiguang Deng, Ying Li","doi":"10.1109/ICWS.2010.66","DOIUrl":"https://doi.org/10.1109/ICWS.2010.66","url":null,"abstract":"In this paper, we propose a time-sensitive probability skyline (TPS) approach to recommend services with uncertainty. We project services to n-dimensional data space and recommend services in TPS. Experimental evaluation on real data shows the great performance of TPS in service recommendation by comparing the experiment result with results of other approaches.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131213152","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}
Efficient and accurate discovery of user desired Web services is a key component for achieving the full potential of service computing. However, service discovery is a non-trivial task considering the large and fast growing service space. Meanwhile, Web services are typically autonomous and a priori unknown. This further complicates the service discovery problem. We propose a service community learning algorithm that can generate homogeneous communities from the heterogeneous service space. This can greatly facilitate the service discovery process as the users only need to search within their desired service communities. A key ingredient of the community learning algorithm is a co-clustering scheme that leverages the duality relationship between services and operations. Experimental results on both synthetic and real Web services demonstrate the effectiveness of the proposed service community learning algorithm.
{"title":"On Service Community Learning: A Co-clustering Approach","authors":"Qi Yu, M. Rege","doi":"10.1109/ICWS.2010.47","DOIUrl":"https://doi.org/10.1109/ICWS.2010.47","url":null,"abstract":"Efficient and accurate discovery of user desired Web services is a key component for achieving the full potential of service computing. However, service discovery is a non-trivial task considering the large and fast growing service space. Meanwhile, Web services are typically autonomous and a priori unknown. This further complicates the service discovery problem. We propose a service community learning algorithm that can generate homogeneous communities from the heterogeneous service space. This can greatly facilitate the service discovery process as the users only need to search within their desired service communities. A key ingredient of the community learning algorithm is a co-clustering scheme that leverages the duality relationship between services and operations. Experimental results on both synthetic and real Web services demonstrate the effectiveness of the proposed service community learning algorithm.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132643320","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 Architectures support the provision, discovery, and usage of services in different application contexts. The Web Service specifications provide a technical foundation to implement this paradigm. Moreover, mechanisms are provided to face the new security challenges raised by SOA. To enable the seamless usage of services, security requirements can be expressed as security policies (e.g. WS-Policy and WS-SecurityPolicy) that enable the negotiation of these requirements between clients and services. However, the codification of security policies is a difficult and error-prone task due to the complexity of the Web Service specifications. In this paper, we introduce our model-driven approach that facilitates the transformation of architecture models annotated with simple security intentions to security policies. This transformation is driven by security configuration patterns that provide expert knowledge on Web Service security. Therefore, we will introduce a formalised pattern structure and a domain-specific language to specify these patterns.
{"title":"A Pattern-Driven Generation of Security Policies for Service-Oriented Architectures","authors":"Michael Menzel, Robert Warschofsky, C. Meinel","doi":"10.1109/ICWS.2010.25","DOIUrl":"https://doi.org/10.1109/ICWS.2010.25","url":null,"abstract":"Service-oriented Architectures support the provision, discovery, and usage of services in different application contexts. The Web Service specifications provide a technical foundation to implement this paradigm. Moreover, mechanisms are provided to face the new security challenges raised by SOA. To enable the seamless usage of services, security requirements can be expressed as security policies (e.g. WS-Policy and WS-SecurityPolicy) that enable the negotiation of these requirements between clients and services. However, the codification of security policies is a difficult and error-prone task due to the complexity of the Web Service specifications. In this paper, we introduce our model-driven approach that facilitates the transformation of architecture models annotated with simple security intentions to security policies. This transformation is driven by security configuration patterns that provide expert knowledge on Web Service security. Therefore, we will introduce a formalised pattern structure and a domain-specific language to specify these patterns.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133921983","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}
I. Silva-Lepe, I. Rouvellou, Rahul P. Akolkar, A. Iyengar
This paper proposes an approach for cross-domain connectivity that enables domain autonomy and that preserves across domains properties that are taken for granted by services within a domain.
本文提出了一种跨域连接方法，该方法支持域自治，并保留域内服务认为理所当然的跨域属性。
{"title":"Seamless Cross-Domain Connectivity for Enabling Domain Autonomy in a Federated SOA","authors":"I. Silva-Lepe, I. Rouvellou, Rahul P. Akolkar, A. Iyengar","doi":"10.1109/ICWS.2010.57","DOIUrl":"https://doi.org/10.1109/ICWS.2010.57","url":null,"abstract":"This paper proposes an approach for cross-domain connectivity that enables domain autonomy and that preserves across domains properties that are taken for granted by services within a domain.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134607110","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}
WS-Policy is a standard to express requirements and capabilities in Web service systems. Policies are based on domain-specific assertions. In this paper we present a lightweight approach to semantic annotations of policy assertions. The approach allows matching of requirements and capabilities based not only on the syntactical representation of their corresponding assertions but also on their semantic meaning. Besides vocabulary mismatches our approach can also handle granularity mismatches, e.g. if two capabilities in combination satisfy a single requirement. We present a validation of our approach consisting of a performance evaluation and the realization of a use case, both based on our implementation of the semantic policy matching algorithm. We furthermore show the advantages of our approach compared to existing related work.
{"title":"Semantic Annotations for WS-Policy","authors":"Sebastian Speiser","doi":"10.1109/ICWS.2010.15","DOIUrl":"https://doi.org/10.1109/ICWS.2010.15","url":null,"abstract":"WS-Policy is a standard to express requirements and capabilities in Web service systems. Policies are based on domain-specific assertions. In this paper we present a lightweight approach to semantic annotations of policy assertions. The approach allows matching of requirements and capabilities based not only on the syntactical representation of their corresponding assertions but also on their semantic meaning. Besides vocabulary mismatches our approach can also handle granularity mismatches, e.g. if two capabilities in combination satisfy a single requirement. We present a validation of our approach consisting of a performance evaluation and the realization of a use case, both based on our implementation of the semantic policy matching algorithm. We furthermore show the advantages of our approach compared to existing related work.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131538034","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, mashups are gaining tremendous popularity as an important Web 2.0 application. Mashups provide end-users with an opportunity to create personalized Web services which aggregate and manipulate data from multiple diverse sources distributed across the Web. However, this increase in personalization also results in new scalability and performance challenges. Surprisingly, there are very few studies on the performance aspect of mashups. In this paper, we propose two novel techniques to enhance the scalability and performance of mashup platforms. The first is an efficient mashup merging scheme that avoids duplicate computations and unnecessary data retrievals by detecting common operator sequences in different mashups and executing them together. Second, we propose a canonical form-based mashup reordering scheme that not only transforms individual mashups to their most efficient forms but also increases the effectiveness of mashup merging. This paper also reports a number of experiments studying the benefits and costs of the proposed techniques.
{"title":"Enhancing Scalability and Performance of Mashups Through Merging and Operator Reordering","authors":"O. Hassan, Lakshmish Ramaswamy, J. Miller","doi":"10.1109/ICWS.2010.92","DOIUrl":"https://doi.org/10.1109/ICWS.2010.92","url":null,"abstract":"Recently, mashups are gaining tremendous popularity as an important Web 2.0 application. Mashups provide end-users with an opportunity to create personalized Web services which aggregate and manipulate data from multiple diverse sources distributed across the Web. However, this increase in personalization also results in new scalability and performance challenges. Surprisingly, there are very few studies on the performance aspect of mashups. In this paper, we propose two novel techniques to enhance the scalability and performance of mashup platforms. The first is an efficient mashup merging scheme that avoids duplicate computations and unnecessary data retrievals by detecting common operator sequences in different mashups and executing them together. Second, we propose a canonical form-based mashup reordering scheme that not only transforms individual mashups to their most efficient forms but also increases the effectiveness of mashup merging. This paper also reports a number of experiments studying the benefits and costs of the proposed techniques.","PeriodicalId":170573,"journal":{"name":"2010 IEEE International Conference on Web Services","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132910771","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
扫码关注我们
求助内容：
应助结果提醒方式：