Chune Li, Richong Zhang, J. Huai, Xiaohui Guo, Hailong Sun
Web service discovery is a vital problem in service computing with the increasing number of services. Existing service discovery approaches merely focus on WSDL-based keyword search, semantic matching based on domain knowledge or ontologies, or QoS-based recommendations. The keyword search omits the underlying correlations and semantic knowledge or QoS information is not always available. In this paper, we propose a probabilistic service discovery approach to help web service users to retrieve related services and to improve the search performance. Specifically, we apply a probabilistic model to characterize the latten topics between services and queries, and then propose a matching method based on the topic relevance. Experiments on services from a real service repository confirm the feasibility and efficiency of this proposed method.
{"title":"A Probabilistic Approach for Web Service Discovery","authors":"Chune Li, Richong Zhang, J. Huai, Xiaohui Guo, Hailong Sun","doi":"10.1109/SCC.2013.107","DOIUrl":"https://doi.org/10.1109/SCC.2013.107","url":null,"abstract":"Web service discovery is a vital problem in service computing with the increasing number of services. Existing service discovery approaches merely focus on WSDL-based keyword search, semantic matching based on domain knowledge or ontologies, or QoS-based recommendations. The keyword search omits the underlying correlations and semantic knowledge or QoS information is not always available. In this paper, we propose a probabilistic service discovery approach to help web service users to retrieve related services and to improve the search performance. Specifically, we apply a probabilistic model to characterize the latten topics between services and queries, and then propose a matching method based on the topic relevance. Experiments on services from a real service repository confirm the feasibility and efficiency of this proposed method.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126731815","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}
Cloud services are Internet-based XaaS (X as a Service) services, where X can be hardware, software or applications. As Cloud consumers value QoS (Quality of Service), Cloud providers should make certain service level commitments in order to achieve business success. This paper argues for Cloud service negotiation. It outlines a research roadmap, reviews the state of the art, and reports our work on Cloud service negotiation. Three research problems that we formulate are QoS measurement, QoS negotiation, and QoS enforcement. To address QoS measurement, we pioneer a quality model named CLOUDQUAL for Cloud services. To address QoS negotiation, we propose a tradeoff negotiation approach for Cloud services, which can achieve a higher utility. We also give some ideas to solve QoS enforcement, and balance utility and success rate for QoS negotiation.
{"title":"Cloud Service Negotiation: A Research Roadmap","authors":"Xianrong Zheng, Patrick Martin, Kathryn Brohman","doi":"10.1109/SCC.2013.93","DOIUrl":"https://doi.org/10.1109/SCC.2013.93","url":null,"abstract":"Cloud services are Internet-based XaaS (X as a Service) services, where X can be hardware, software or applications. As Cloud consumers value QoS (Quality of Service), Cloud providers should make certain service level commitments in order to achieve business success. This paper argues for Cloud service negotiation. It outlines a research roadmap, reviews the state of the art, and reports our work on Cloud service negotiation. Three research problems that we formulate are QoS measurement, QoS negotiation, and QoS enforcement. To address QoS measurement, we pioneer a quality model named CLOUDQUAL for Cloud services. To address QoS negotiation, we propose a tradeoff negotiation approach for Cloud services, which can achieve a higher utility. We also give some ideas to solve QoS enforcement, and balance utility and success rate for QoS negotiation.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114409559","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 view the cloud as market place for trading instances of web services, which can be bought or leased by web applications. Applications can buy diversity by selecting web services from multiple cloud sellers in a cloud-based market. We argue that by diversifying the selection, we can improve the dependability of the application and reduce risks associated with service level agreements violations. We propose a novel dynamic adaptive search based software engineering approach, which uses portfolio theory to construct a diversify portfolio of web service instances, traded from multiple cloud providers. The approach systematically evaluates the Quality of Service and risks of the portfolio, compare it to the optimal traded portfolio at a given time. It can then dynamically decide on a new portfolio and adapt the application accordingly. We use a hypothetical scenario to demonstrate the effective use of the portfolio-based optimization.
{"title":"Risk-Aware Web Service Allocation in the Cloud Using Portfolio Theory","authors":"Faisal Alrebeish, R. Bahsoon","doi":"10.1109/SCC.2013.40","DOIUrl":"https://doi.org/10.1109/SCC.2013.40","url":null,"abstract":"In this paper, we view the cloud as market place for trading instances of web services, which can be bought or leased by web applications. Applications can buy diversity by selecting web services from multiple cloud sellers in a cloud-based market. We argue that by diversifying the selection, we can improve the dependability of the application and reduce risks associated with service level agreements violations. We propose a novel dynamic adaptive search based software engineering approach, which uses portfolio theory to construct a diversify portfolio of web service instances, traded from multiple cloud providers. The approach systematically evaluates the Quality of Service and risks of the portfolio, compare it to the optimal traded portfolio at a given time. It can then dynamically decide on a new portfolio and adapt the application accordingly. We use a hypothetical scenario to demonstrate the effective use of the portfolio-based optimization.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129489794","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}
Storage services based on public clouds provide customers with elastic storage and on-demand accessibility. However, moving data to remote cloud storage also raises privacy concerns. Cryptographic cloud storage and search over encrypted data have attracted attentions from both industry and academics. In this paper, we present a new approach to constructing efficient oblivious keyword search (OKS) protocol, which permits fast search (i.e., sub-linear time) and relatively short ciphertext, while providing provably strong privacy for both users and cloud storage service providers. Previous OKS protocols have ciphertext size linear in the number of keywords, which consume much storage space and relatively long searching time. We formally define a Disjunctively Oblivious Keyword Search (DOKS) protocol realizing oblivious keyword search with the ciphertext size constant in size of keywords, which is significantly less than that of previous OKS protocols. Our approach improves both the privacy and efficiency of existing OKS protocols. With DOKS, adversary cannot distinguish two search keywords submitted by users, and cannot know the relations between ciphertext of documents and search keywords. A search keyword cannot be reused by adversaries. Users can get the matching documents without revealing statistical information on search keywords.
{"title":"Secure Cloud Storage Service with an Efficient DOKS Protocol","authors":"Zhengtao Jiang, Ling Liu","doi":"10.1109/SCC.2013.37","DOIUrl":"https://doi.org/10.1109/SCC.2013.37","url":null,"abstract":"Storage services based on public clouds provide customers with elastic storage and on-demand accessibility. However, moving data to remote cloud storage also raises privacy concerns. Cryptographic cloud storage and search over encrypted data have attracted attentions from both industry and academics. In this paper, we present a new approach to constructing efficient oblivious keyword search (OKS) protocol, which permits fast search (i.e., sub-linear time) and relatively short ciphertext, while providing provably strong privacy for both users and cloud storage service providers. Previous OKS protocols have ciphertext size linear in the number of keywords, which consume much storage space and relatively long searching time. We formally define a Disjunctively Oblivious Keyword Search (DOKS) protocol realizing oblivious keyword search with the ciphertext size constant in size of keywords, which is significantly less than that of previous OKS protocols. Our approach improves both the privacy and efficiency of existing OKS protocols. With DOKS, adversary cannot distinguish two search keywords submitted by users, and cannot know the relations between ciphertext of documents and search keywords. A search keyword cannot be reused by adversaries. Users can get the matching documents without revealing statistical information on search keywords.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116349763","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 wide applications of Internet-based services, service reliability has received more and more attention in the research field of Services Computing. Reliability prediction approaches basically compute reliability according to historical records. However, in most current prediction methods, each user is supposed to return a Boolean feedback representing his/her subjective evaluation on service reliability. This binary feedback cannot express the user's evaluation of reliability precisely. Even though some researchers propose to compute reliability according to feedback from similar users or similar services, accuracy of reliability prediction cannot be guaranteed successfully. To address the problems above, this paper presents a fine-grained reliability prediction method based on grouping (RPMBG). In RPMBG, feedback is divided into several dimensions and each user can choose a service degree for each dimension to represent his/her evaluation on consumed service. A quantifying approach of users' feedback on each dimension will be given with the employment of entropy in information theory. At the same time, a grouping methodology including grouping of users and grouping of services is described with the employments of fuzzy c-means theory, PCC, and Levenshtein Distance. Based on grouping, filtered feedback from similar user group and similar service group will be engaged into reliability prediction. Experimental results demonstrate that our proposed RPMBG has significantly increased the accuracy of prediction result compared with other prediction methods.
{"title":"Prediction of Service Reliability Based on Grouping","authors":"Haiyan Wang, Wei Li, Junzhou Luo","doi":"10.1109/SCC.2013.54","DOIUrl":"https://doi.org/10.1109/SCC.2013.54","url":null,"abstract":"With the wide applications of Internet-based services, service reliability has received more and more attention in the research field of Services Computing. Reliability prediction approaches basically compute reliability according to historical records. However, in most current prediction methods, each user is supposed to return a Boolean feedback representing his/her subjective evaluation on service reliability. This binary feedback cannot express the user's evaluation of reliability precisely. Even though some researchers propose to compute reliability according to feedback from similar users or similar services, accuracy of reliability prediction cannot be guaranteed successfully. To address the problems above, this paper presents a fine-grained reliability prediction method based on grouping (RPMBG). In RPMBG, feedback is divided into several dimensions and each user can choose a service degree for each dimension to represent his/her evaluation on consumed service. A quantifying approach of users' feedback on each dimension will be given with the employment of entropy in information theory. At the same time, a grouping methodology including grouping of users and grouping of services is described with the employments of fuzzy c-means theory, PCC, and Levenshtein Distance. Based on grouping, filtered feedback from similar user group and similar service group will be engaged into reliability prediction. Experimental results demonstrate that our proposed RPMBG has significantly increased the accuracy of prediction result compared with other prediction methods.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114687877","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 considerable number of business process modeling approaches are developed for end-users in recent years. The core issue of end-user oriented business process modeling is how to fill the gap between end-user friendly business process model and professional IT process model. In our previous work, a wizard based lightweight event-driven modeling method is designed for end-users to create their own personalized process. We observe that such a process created by end-users often cause execution time errors, which cannot be effectively detected by existing modeling languages. In this paper, we propose a formal model based on extended event-driven process chain (eEPC), which is named lightweight event-driven process chain (lightEPC). We give complete formalization of lightEPC and present two error patterns and corresponding detection algorithms to perform design-time model checking based on this model. These approaches effectively help end-users to create correct business process satisfying their personalized requirements.
{"title":"lightEPC: A Formal Approach for Modeling Personalized Lightweight Event-Driven Business Process","authors":"S. Xue, Budan Wu, Junliang Chen","doi":"10.1109/SCC.2013.65","DOIUrl":"https://doi.org/10.1109/SCC.2013.65","url":null,"abstract":"A considerable number of business process modeling approaches are developed for end-users in recent years. The core issue of end-user oriented business process modeling is how to fill the gap between end-user friendly business process model and professional IT process model. In our previous work, a wizard based lightweight event-driven modeling method is designed for end-users to create their own personalized process. We observe that such a process created by end-users often cause execution time errors, which cannot be effectively detected by existing modeling languages. In this paper, we propose a formal model based on extended event-driven process chain (eEPC), which is named lightweight event-driven process chain (lightEPC). We give complete formalization of lightEPC and present two error patterns and corresponding detection algorithms to perform design-time model checking based on this model. These approaches effectively help end-users to create correct business process satisfying their personalized requirements.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127685279","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}
Classroom scheduling problem has long been proven to be a NP-Complete problem. This paper presents a novel services-oriented scheduling approach. Regarding each type of resource as a service, Smart Class originally introduces SOA into this problem to efficiently facilitate educational programmers with the design space exploration (DSE) and greedy algorithms based approach. Furthermore, the Smart Class architecture can be dynamically coupled to different algorithms to fit in any specific demands. Typical case studies demonstrate that Smart Class provides a new efficient research paradigm to the traditional problem of class scheduling, providing high flexibility and scalability.
{"title":"SmartClass: A Services-Oriented Approach for University Resource Scheduling","authors":"Aili Wang, Chao Wang, Xi Li, Xuehai Zhou","doi":"10.1109/SCC.2013.29","DOIUrl":"https://doi.org/10.1109/SCC.2013.29","url":null,"abstract":"Classroom scheduling problem has long been proven to be a NP-Complete problem. This paper presents a novel services-oriented scheduling approach. Regarding each type of resource as a service, Smart Class originally introduces SOA into this problem to efficiently facilitate educational programmers with the design space exploration (DSE) and greedy algorithms based approach. Furthermore, the Smart Class architecture can be dynamically coupled to different algorithms to fit in any specific demands. Typical case studies demonstrate that Smart Class provides a new efficient research paradigm to the traditional problem of class scheduling, providing high flexibility and scalability.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"574 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134272137","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}
Ahmed El-Hassany, E. Kissel, D. Gunter, D. M. Swany
A holistic view of the network is key to the successful operation of many distributed, cloud-based, and service-oriented computing architectures. Supporting network-aware applications and application-driven networks requires a detailed representation of network resources, including multi-layer topologies, associated measurement data, and in-the-network service location and availability information. The rapid development of increasingly configurable and dynamic networks has increased the demand for information services that can accurately and efficiently store and expose the state of the network. This work introduces our Unified Network Information Service (UNIS), designed to represent physical and virtual networks and services. We describe the UNIS network data model and its RESTful interface, which provide a common interface to topology, service, and measurement resources. In addition, we describe the security mechanisms built into the UNIS framework. Our analysis of the UNIS implementation shows significant performance and scalability gains over an existing and widely-deployed topology, service registration, and lookup information service architecture.
{"title":"Design and Implementation of a Unified Network Information Service","authors":"Ahmed El-Hassany, E. Kissel, D. Gunter, D. M. Swany","doi":"10.1109/SCC.2013.81","DOIUrl":"https://doi.org/10.1109/SCC.2013.81","url":null,"abstract":"A holistic view of the network is key to the successful operation of many distributed, cloud-based, and service-oriented computing architectures. Supporting network-aware applications and application-driven networks requires a detailed representation of network resources, including multi-layer topologies, associated measurement data, and in-the-network service location and availability information. The rapid development of increasingly configurable and dynamic networks has increased the demand for information services that can accurately and efficiently store and expose the state of the network. This work introduces our Unified Network Information Service (UNIS), designed to represent physical and virtual networks and services. We describe the UNIS network data model and its RESTful interface, which provide a common interface to topology, service, and measurement resources. In addition, we describe the security mechanisms built into the UNIS framework. Our analysis of the UNIS implementation shows significant performance and scalability gains over an existing and widely-deployed topology, service registration, and lookup information service architecture.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133248583","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}
This paper describes the methodology and practices in applying cloud in China top banks' next generation banking system. The core banking system will help China top banks from world largest retail banks into integrated financial services providers. The services-oriented new system will require reliable, flexible and manageable infrastructure frameworks. The existing data centers do not meet the criteria. This paper describes a new approach for mapping application patterns onto private cloud based technology services. The application patterns will be mapped into deployment patterns, which will help data centers to provide orchestration just-in-time. Meanwhile, Key Performance Indicators are identified for manage the non-functional requirements of application components. The frameworks, together with key algorithms are described in the paper. The paper comes from real design projects in China top banks, which have over 4 thousand million accounts. This is the first time to use private cloud in such a large enterprise core business.
{"title":"An Infrastructure Framework for Deploying Enterprise Private Cloud","authors":"Liu Yaxiao, L. Weidong, Li Lining, Wang Feng","doi":"10.1109/SCC.2013.99","DOIUrl":"https://doi.org/10.1109/SCC.2013.99","url":null,"abstract":"This paper describes the methodology and practices in applying cloud in China top banks' next generation banking system. The core banking system will help China top banks from world largest retail banks into integrated financial services providers. The services-oriented new system will require reliable, flexible and manageable infrastructure frameworks. The existing data centers do not meet the criteria. This paper describes a new approach for mapping application patterns onto private cloud based technology services. The application patterns will be mapped into deployment patterns, which will help data centers to provide orchestration just-in-time. Meanwhile, Key Performance Indicators are identified for manage the non-functional requirements of application components. The frameworks, together with key algorithms are described in the paper. The paper comes from real design projects in China top banks, which have over 4 thousand million accounts. This is the first time to use private cloud in such a large enterprise core business.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124299465","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}
Cloud environments are being increasingly used for deploying and executing business processes and particularly service-based business processes (SBPs). One of the expected facilities of Cloud environments is elasticity at different levels. In this work, we argue the need of supporting elasticity at the service level. We propose a formal model for describing elasticity mechanisms and their strategies for SBPs. Our contribution consists in composing SBP models with models of controllers that describe the behavior of services and container replicas. In addition, we provide means for specifying both reactive and predictive elasticity strategies.
{"title":"Formal Modeling of Elastic Service-Based Business Processes","authors":"Kais Klai, S. Tata","doi":"10.1109/SCC.2013.75","DOIUrl":"https://doi.org/10.1109/SCC.2013.75","url":null,"abstract":"Cloud environments are being increasingly used for deploying and executing business processes and particularly service-based business processes (SBPs). One of the expected facilities of Cloud environments is elasticity at different levels. In this work, we argue the need of supporting elasticity at the service level. We propose a formal model for describing elasticity mechanisms and their strategies for SBPs. Our contribution consists in composing SBP models with models of controllers that describe the behavior of services and container replicas. In addition, we provide means for specifying both reactive and predictive elasticity strategies.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114463919","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
扫码关注我们
求助内容：
应助结果提醒方式：