{"title":"Application Configuration Repository for Adaptive Service-Based Systems: Overcoming Challenges in an Evolutionary Online Advertising Environment","authors":"Marcos E. B. Broinizi, D. Mutti, J. E. Ferreira","doi":"10.1109/ICWS.2014.98","DOIUrl":"https://doi.org/10.1109/ICWS.2014.98","url":null,"abstract":"Software engineering has greatly evolved in recent years. Today applications are deployed on heterogeneous distributed infra-structure from mobile devices to cloud computing. Service-oriented architectures, such as SOA and REST Web Services, have been widely used to efficiently design high-availability, scalable and reliable systems for dynamic business environments based on a distributed infra-structure. Despite the improvements these architectures have made to enhance the evolvability of systems, there are some challenges that still need to be overcome. More concretely, service-based systems and development teams are constantly under pressure from business stakeholders who continuously increase their demands for changes in systems. This paper describes a configuration-based approach that can empower adaptive mechanisms in order to overcome this challenge. It presents a solution based on a centralized application configuration repository service specially designed as a RESTful web service API to provide the benefits of configuration, such as adaptability, to high-availability, scalable and loosely coupled systems, allowing them to respond quickly to changes. The solution was successfully implemented in an evolutionary online advertising system used by the largest Brazilian web-portal, responsible for processing 5 billion ad requests per month. It allowed the design of a self-adaptive advertisement ranking mechanism that continuously evolves the system configuration, without human supervision. The adoption of this solution was responsible for a drastic increase in the amount of changes applied in this advertising environment. It also greatly reduced the time from conceiving a new change to having it working in the system. Moreover, the solution is available as open source and it has also being used by several other service-based systems.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127639809","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}
{"title":"Adaptive and Dynamic Service Composition via Multi-agent Reinforcement Learning","authors":"Hongbing Wang, Qin Wu, Xin Chen, Qi Yu, Zibin Zheng, A. Bouguettaya","doi":"10.1109/ICWS.2014.70","DOIUrl":"https://doi.org/10.1109/ICWS.2014.70","url":null,"abstract":"In the era of big data, data intensive applications have posed new challenges to the filed of service composition, i.e. composition efficiency and scalability. How to compose massive and evolving services in such dynamic scenarios is a vital problem demanding prompt solutions. As a consequence, we propose a new model for large-scale adaptive service composition in this paper. This model integrates the knowledge of reinforcement learning aiming at the problem of adaptability in a highly-dynamic environment and game theory used to coordinate agents' behavior for a common task. In particular, a multi-agent Q-learning algorithm for service composition based on this model is also proposed. The experimental results demonstrate the effectiveness and efficiency of our approach, and show a better performance compared with the single-agent Q-learning method.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133814913","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}
{"title":"Constraints Based Web Service Semantic Augmentation","authors":"Xiaocao Hu, Zhiyong Feng, Shizhan Chen","doi":"10.1109/ICWS.2014.109","DOIUrl":"https://doi.org/10.1109/ICWS.2014.109","url":null,"abstract":"Service relations facilitate the automation of service reuse. Most of studies on the service relations focus on the inputs and outputs. However, different Web Services tend to utilize the same parameters without formally specifying their constraints. Due to this, the semantics, introduced by semantic annotation, is still not rich enough for accurate descriptions, thus generating a large number of inappropriate service relations. To address this, we propose an approach for augmenting semantics of Web Services based on constraints, which can be regarded as a complement to semantic annotation. The semantics is augmented via a hybrid analysis of heterogeneous constraints, including the server constraint and object constraint.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115357514","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}
L. H. Nakamura, P. F. Prado, R. M. D. O. Libardi, L. H. Nunes, J. C. Estrella, R. Santana, M. J. Santana, S. Reiff-Marganiec
{"title":"Fast Selection of Web Services with QoS Using a Distributed Parallel Semantic Approach","authors":"L. H. Nakamura, P. F. Prado, R. M. D. O. Libardi, L. H. Nunes, J. C. Estrella, R. Santana, M. J. Santana, S. Reiff-Marganiec","doi":"10.1109/ICWS.2014.100","DOIUrl":"https://doi.org/10.1109/ICWS.2014.100","url":null,"abstract":"This paper presents a solution to performance issues in the quality of service aware selection of Web services using techniques of parallelism and mechanisms of inference provided by Semantic Web. The results point to a significant improvement in the speed of searching Web services and thus makes the use of semantic resources viable in distributed systems to provide better quality of service to the clients.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116309001","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}
{"title":"Parameter Tuning for ABC-Based Service Composition with End-to-End QoS Constraints","authors":"Ruilin Liu, Zhongjie Wang, Xiaofei Xu","doi":"10.1109/ICWS.2014.88","DOIUrl":"https://doi.org/10.1109/ICWS.2014.88","url":null,"abstract":"QoS-aware service composition problem has been drawn great attentions in recent years. As an NP-hard problem, high time complexity is inevitable if global optimization algorithms (such as integer programming) were adopted. Researchers applied various evolutionary algorithms to decrease the time complexity by looking for near optimum solution. However, each evolutionary algorithm has two or more parameters the value of which is to be assigned by algorithm designers and likely has impacts on the optimization results (primarily time complexity and optimality). Our experiments show that there are some dependencies between the features of service composition problems, the value of the evolutionary algorithm's parameters, and the optimization results. In this paper, we use a popular evolutionary algorithm Artificial Bee Colony (ABC) to solve service composition problem and focus on the ABC's parameter turning issue. The objective is to identify the potential dependency to help service composition algorithm designers easily set up the values of ABC parameters to obtain preferable composition solution without many times of tedious attempts. Five features of service composition problem, three ABC parameters and two metrics of the final solution are identified. Based on a large volume of experiment data, ABC parameter tuning for a given service composition problem is conducted using C4.5 algorithm and the dependency between problem features and ABC parameters are established using multiple linear regression method. An experiment on a validation dataset shows the feasibility of our approach.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123462408","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}
Ikbel Guidara, Nawal Guermouche, T. Chaari, S. Tazi, M. Jmaiel
{"title":"Pruning Based Service Selection Approach Under QoS and Temporal Constraints","authors":"Ikbel Guidara, Nawal Guermouche, T. Chaari, S. Tazi, M. Jmaiel","doi":"10.1109/ICWS.2014.15","DOIUrl":"https://doi.org/10.1109/ICWS.2014.15","url":null,"abstract":"Dynamic selection of the best services to execute abstract tasks of business processes is very important. Indeed, it enables to cope with complex user's requirements that require the collaboration of several more elementary services. However, with the increasing amount of candidate services of each business task that offer different QoS (Quality of Service) values, the selection of the optimal combination of services becomes a very hard task. This problem is more complex when dealing with temporal properties of business processes associated with time-dependent QoS parameters that can change according to the execution time. Unlike static QoS which have been deeply studied in the existing service selection approaches, time-dependent QoS are insufficiently taken into consideration. In this paper, we are interested in the problem of service selection to satisfy a given business process while considering temporal properties associated to time-dependent QoS. The selection approach that we propose relies on a new service pruning approach that is applied prior to our selection algorithm to reduce the number of candidate services while guaranteeing that the optimal solution still be found.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129969184","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}
{"title":"Services Adaptation Based on Domain Ontology and Feature Configuration","authors":"Luyao Liu, Lin Liu, Zuo Yang","doi":"10.1109/ICWS.2014.108","DOIUrl":"https://doi.org/10.1109/ICWS.2014.108","url":null,"abstract":"Today's service systems are growing more complex and dynamic due to the coupling of functionalities required under different contexts, which asks for extra effort from both service users and services developers. An ideal service system shall provide just right functionalities and just enough qualities to its user under a given usage context. Moreover, the service shall adapt itself when requirements change. Service systems targeting at different application domains contain domain knowledge as well as reusable system assets that are currently available. In this paper, we propose an approach that integrates domain ontology reasoning and feature configuration during system service design and execution.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128913657","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. Tripathy, M. Patra, M. Khan, Huda Fatima, Pravati Swain
{"title":"Dynamic Web Service Composition with QoS Clustering","authors":"A. Tripathy, M. Patra, M. Khan, Huda Fatima, Pravati Swain","doi":"10.1109/ICWS.2014.99","DOIUrl":"https://doi.org/10.1109/ICWS.2014.99","url":null,"abstract":"The service selection for automatic dynamic service composition with client's requirements oriented service selection becomes more intense. The existing planning and selection algorithms are mostly designed for service discovery. Further, to our knowledge, there are only a few works that incorporate end-user requirements into service composition. In this paper, we propose a graph based multi-grain clustering and selection model for service composition.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"14 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130556755","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}
{"title":"Domain-Aware Service Recommendation for Service Composition","authors":"Bofei Xia, Yushun Fan, Cheng Wu, Keman Huang, Wei Tan, Jia Zhang, Bing Bai","doi":"10.1109/ICWS.2014.69","DOIUrl":"https://doi.org/10.1109/ICWS.2014.69","url":null,"abstract":"Service compositions inherently require multiple services each with its domain-specific functionality. Therefore, how to mine matching patterns between services in relevant domains and compositions becomes crucial to service recommendation for composition. Existing methods usually overlook domain relevance and domain-specific matching patterns, which restrict the quality of recommendations. In this paper, a novel approach is proposed to offer domain-aware service recommendation. First, a K Nearest Neighbor variant (vKNN) based on topic model Latent Dirichlet Allocation (LDA) is introduced to cluster services into semantically coherent domains. On top of service domain clustering results by vKNN, a probabilistic matching model Domain Router (DR) based on Extreme Learning Machine (ELM) is developed for decomposing a requirement to relevant domains. Finally, a comprehensive Domain Topic Matching (DTM) model is built to mine relevant domain-specific matching patterns to facilitate service recommendation. Experiments on a large-scale real-world dataset show that DTM not only gains significant improvement at precision rate but also enhances the diversity of results.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129267052","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}
L. H. Nunes, L. H. Nakamura, B. Kuehne, E. M. Oliveira, R. M. D. O. Libardi, L. Adami, J. C. Estrella, S. Reiff-Marganiec
{"title":"PEESOS: A Web Tool for Planning and Execution of Experiments in Service Oriented Systems","authors":"L. H. Nunes, L. H. Nakamura, B. Kuehne, E. M. Oliveira, R. M. D. O. Libardi, L. Adami, J. C. Estrella, S. Reiff-Marganiec","doi":"10.1109/ICWS.2014.90","DOIUrl":"https://doi.org/10.1109/ICWS.2014.90","url":null,"abstract":"Performing functionality testing in service-oriented architectures is not a trivial task. The difficulty is especially the large number of components that may be present in a SOA such as brokers, providers, service registries, clients, monitoring tools, data storage tools, etc. Thus, in order to facilitate the process of conducting functional testing and capacity planning in service-oriented systems, we present PEESOS. This first version is a functional prototype that offers facilities to assist researchers and industry to test their new applications, allowing collaborations that can be done between the participants to achieve an appropriate objective when developing a new application. The first results show that it is possible to make a planning environment easier to operate and to readily obtain results for performance evaluation of a target architecture. Since this is a first version of the prototype, it has interface and scalability limitations as well as needing improvements in performance of the logs repository and also in a core engine. We hope that such limitations can be corrected in the near future, including gathering information from the scientific community to make the prototype a useful and accessible tool. PEESOS is on-line and available at http://peesos.wsarch.lasdpc.icmc.usp.br.","PeriodicalId":215397,"journal":{"name":"2014 IEEE International Conference on Web Services","volume":"161 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113987979","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}