Pinjia He, Jieming Zhu, Zibin Zheng, Michael R. Lyu
{"title":"Drain: An Online Log Parsing Approach with Fixed Depth Tree","authors":"Pinjia He, Jieming Zhu, Zibin Zheng, Michael R. Lyu","doi":"10.1109/ICWS.2017.13","DOIUrl":"https://doi.org/10.1109/ICWS.2017.13","url":null,"abstract":"Logs, which record valuable system runtime information, have been widely employed in Web service management by service providers and users. A typical log analysis based Web service management procedure is to first parse raw log messages because of their unstructured format, and then apply data mining models to extract critical system behavior information, which can assist Web service management. Most of the existing log parsing methods focus on offline, batch processing of logs. However, as the volume of logs increases rapidly, model training of offline log parsing methods, which employs all existing logs after log collection, becomes time consuming. To address this problem, we propose an online log parsing method, namely Drain, that can parse logs in a streaming and timely manner. To accelerate the parsing process, Drain uses a fixed depth parse tree, which encodes specially designed rules for parsing. We evaluate Drain on five real-world log data sets with more than 10 million raw log messages. The experimental results show that Drain has the highest accuracy on four data sets, and comparable accuracy on the remaining one. Besides, Drain obtains 51.85%~81.47% improvement in running time compared with the state-of-the-art online parser. We also conduct a case study on an anomaly detection task using Drain in the parsing step, which determines the effectiveness of Drain in log analysis.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"129 33","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113939887","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}
Qun Shi, Guanfeng Liu, Kai Zheng, An Liu, Zhixu Li, Lei Zhao, Xiaofang Zhou
{"title":"Multi-Constrained Top-K Graph Pattern Matching in Contextual Social Graphs","authors":"Qun Shi, Guanfeng Liu, Kai Zheng, An Liu, Zhixu Li, Lei Zhao, Xiaofang Zhou","doi":"10.1109/ICWS.2017.69","DOIUrl":"https://doi.org/10.1109/ICWS.2017.69","url":null,"abstract":"Graph Pattern Matching (GPM) plays a significant role in many real applications, where given a graph pattern Q and a data graph G, computing the set M(Q, G) of matching subgraphs of Q in G. However, many applications like the experts recommendation in social networks, often need to find Top-K matches of a designated node v0, rather than the entire set M(Q, G). Moreover, the existing GPM method for matching the designated node v0 does not consider the multiple constraints of the attributes associated with each vertex and each edge which commonly exist in real applications, like the constraints of social contexts for the experts recommendation in contextual social. In this paper, we first propose the Multi-Constrained Top-K Graph Pattern Matching problem (MC-Top-K-GPM), which involves the NP-Complete Multiple Constrained GPM problem. To address the efficiency and effectiveness issues of MC-Top-K-GPM in large-scale social graphs, we propose a novel index, called HB-Tree, which indexes the label and degree of nodes in G and can get candidates of v0 efficiently. Furthermore, we develop a Multi-Constrained Top-K GPM method, called MTK, which can identify Top-K matches of v0 effectively and efficiently. Using real-life data, we experimentally verify that MTK outperforms the existing GPM algorithms in both efficiency and effectiveness in solving the MC-TOP-K GPM problem.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116545631","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":"A Novel Framework for Service Set Recommendation in Mashup Creation","authors":"Wei Gao, Jian Wu","doi":"10.1109/ICWS.2017.17","DOIUrl":"https://doi.org/10.1109/ICWS.2017.17","url":null,"abstract":"With an overwhelming number of web services online, recommending services for automatic mashup creation greatly facilitates the composition process of developers. Various approaches have been proposed for the task. However, these approaches concentrate on improving the recommending accuracy of an individual service, which give rise to two problems: (1) Top-ranked services may be highly redundant with the same functionality, and (2) The cooperation relations among services are ignored. Therefore, we argue that services should be recommended not individually, but collectively. In this paper, we focus on the problem of recommending service sets instead of services. A service set contains a list of functionally distinct services that collectively match different aspects of functional requirements and are more inclined to compose together following mashup composition patterns. To this end, we propose a novel recommendation framework consisting of two stages: Service Set Generation Stage and Service Set Ranking Stage. We also perform an experimental evaluation on ProgrammableWeb dataset to demonstrate the effectiveness of our framework.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126961537","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":"Extraction of Microservices from Monolithic Software Architectures","authors":"Genc Mazlami, Jürgen Cito, P. Leitner","doi":"10.1109/ICWS.2017.61","DOIUrl":"https://doi.org/10.1109/ICWS.2017.61","url":null,"abstract":"Driven by developments such as mobile computing, cloud computing infrastructure, DevOps and elastic computing, the microservice architectural style has emerged as a new alternative to the monolithic style for designing large software systems. Monolithic legacy applications in industry undergo a migration to microservice-oriented architectures. A key challenge in this context is the extraction of microservices from existing monolithic code bases. While informal migration patterns and techniques exist, there is a lack of formal models and automated support tools in that area. This paper tackles that challenge by presenting a formal microservice extraction model to allow algorithmic recommendation of microservice candidates in a refactoring and migration scenario. The formal model is implemented in a web-based prototype. A performance evaluation demonstrates that the presented approach provides adequate performance. The recommendation quality is evaluated quantitatively by custom microservice-specific metrics. The results show that the produced microservice candidates lower the average development team size down to half of the original size or lower. Furthermore, the size of recommended microservice conforms with microservice sizing reported by empirical surveys and the domain-specific redundancy among different microservices is kept at a low rate.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131414965","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}
Bin Liu, X. Yu, Shiping Chen, Xiwei Xu, Liming Zhu
{"title":"Blockchain Based Data Integrity Service Framework for IoT Data","authors":"Bin Liu, X. Yu, Shiping Chen, Xiwei Xu, Liming Zhu","doi":"10.1109/ICWS.2017.54","DOIUrl":"https://doi.org/10.1109/ICWS.2017.54","url":null,"abstract":"It is a challenge to ensure data integrity for cloud-based Internet of Things (IoT) applications because of the inherently dynamic nature of IoT data. The available frameworks of data integrity verification with public auditability cannot avoid the Third Party Auditors (TPAs). However, in a dynamic environment, such as the IoT, the reliability of the TPA-based frameworks is far from being satisfactory. In this paper, we propose a blockchain-based framework for Data Integrity Service. Under such framework, a more reliable data integrity verification can be provided for both the Data Owners and the Data Consumers, without relying on any Third Party Auditor (TPA). In this paper, the relevant protocols and a subsequent prototype system, which is implemented to evaluate the feasibility of our proposals, are presented. The performance evaluation of the implemented prototype system is conducted, and the test results are discussed. The work lays a foundation for our future work on dynamic data integrity verification in a fully decentralized environment.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121138008","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}
Pengcheng Zhang, Liyan Wang, Wenrui Li, H. Leung, Wei Song
{"title":"A Web Service QoS Forecasting Approach Based on Multivariate Time Series","authors":"Pengcheng Zhang, Liyan Wang, Wenrui Li, H. Leung, Wei Song","doi":"10.1109/ICWS.2017.27","DOIUrl":"https://doi.org/10.1109/ICWS.2017.27","url":null,"abstract":"In order to accurately forecast Quality of Service (QoS) of different Web Services, this paper proposes a novel QoS forecasting approach called MulA-LMRBF (Multi-step fore-casting with Advertisement and Levenberg-Marquardt improved Radial Basis Function) based on multivariate time series. Considering the correlation among different QoS attributes, we use phase-space reconstruction to map historical multivariate QoS data into a dynamic system, use Average Dimension (AD) to estimate the embedding dimension and delay time of reconstructed phase space. We also add the short-term QoS advertisement data of service provider to form a more comprehensive data set. Then, RBF (Radial Basis Function) neural network improved by the Levenberg-Marquardt (LM) algorithm is used to update the weight of the neural network dynamically, which improves the forecasting accuracy and realizes the dynamic multiple-step forecasting. The experimental results demonstrate that MulA-LMRBF is better than previous approaches in term of precision and is more suitable for multi-step forecasting.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126213874","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":"WSO: Developer-Oriented Transactional Orchestration of Web-Services","authors":"A. Leff, J. Rayfield","doi":"10.1109/ICWS.2017.86","DOIUrl":"https://doi.org/10.1109/ICWS.2017.86","url":null,"abstract":"WSO (Web-Services Orchestration) addresses a broad set of failure scenarios that become relevant when web-service implementations encapsulate multiple web-service calls to other systems. Network timeouts introduce uncertainty about the success or failure of a given API call: in certain scenarios, simply retrying the operation may make the situation worse. In order to guarantee pseudo-atomicity of a web-service call sequence, the failure of one API call implies that other, successfully completed, API calls may have to compensated for before retrying the original set of web-service calls. Even if no failure occurs, orchestration of a web-service to deal with edge-cases (such as expiration of credentials) can be difficult to implement correctly. In this paper we describe an approach to solving such scenarios which we have implemented in our WSO project. To facilitate use of WSO, the programming model is designed to wrap existing code rather than requiring rewriting code. We show the benefits of WSO in the context of a motivating scenario and also present a before/after comparison.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115297270","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":"The Aspect of Data Translation in Service Similarity","authors":"Dionysis Athanasopoulos","doi":"10.1109/ICWS.2017.32","DOIUrl":"https://doi.org/10.1109/ICWS.2017.32","url":null,"abstract":"To avoid the lock-in problem in service-oriented software, existing interface-decoupling mechanisms focus on identifying high-level service mappings, which are not necessarily applicable on translating actual data. Based on the fundamental data-translation process, its successful outcome is guaranteed if mappings are low-level, i.e. they satisfy schema constraints. The problem is that if similar services have been identified based on high-level mappings, then schema constraints may be violated. To overcome this problem, we propose a proactive approach to identify similar services that satisfy schema constraints. In particular, our approach follows a composite workflow (instead of existing hybrid workflows), which determines schema constraints (service documents do not specify them) and estimates service-translation cost (actual cost is not available) as a function of ensured schema-constraints. We compare our approach against a state-of-the-art service-similarity approach on benchmark services and the results show that high service-similarity does not necessarily imply low service-translation cost, the bidirectional nature of service similarity can be misleading, ensured schema-constraints improve service similarity, and estimated translation-cost is very close to actual cost.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128451325","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":"Online Reliability Prediction via Long Short Term Memory for Service-Oriented Systems","authors":"Hongbing Wang, Zhengping Yang, Qi Yu","doi":"10.1109/ICWS.2017.19","DOIUrl":"https://doi.org/10.1109/ICWS.2017.19","url":null,"abstract":"A service-oriented System of System (SoS) integrates component services into a value-added and more complex system to satisfy the complex requirements of users. Due to a dynamic running environment, online reliability prediction for the loosely coupled component systems that ensures the runtime quality poses a major challenge and attracts growing attention. To guarantee the stable and continuous operation of systems, we propose a online reliability time series prediction method basing on long short term memory (LSTM), which is a modified Recurrent Neural Networks trained with historical reliability time series to predict the reliability of component systems in the near future. We conduct a series of experiments on a dataset composed of real web services and compare with other competitive approaches. Experimental results have demonstrated the effectiveness of our approach.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129637703","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":"Enabling Multi-Topic and Cross-Language Browsing Using Web-Semantics Service","authors":"S. Sathish, A. Patankar, Nimesh Priyodit","doi":"10.1109/ICWS.2017.77","DOIUrl":"https://doi.org/10.1109/ICWS.2017.77","url":null,"abstract":"Mobile web interaction using multiple modalities such as speech, gesture and touch is a well-researched area with examples of multiple framework deployments within the domain. Here, we explore usage of semantics of web content as a new modality for mobile web content discovery and navigation. In addition to semantics-based interactivity, the framework enables dynamic cross-language switching between web pages represented in different languages representing same topics through use of their inherent semantic relations. The approach uses transforming natural web content representations to an intermediate index of latent topic distributions. As the system is semantically indexed, no translation or transliteration techniques are required for cross language switch. The multi-dimensional topic index is built using content-topic distributions which in turn are inferred using supervised topic models. The end-to-end system has been developed as an industrial application with enhanced navigational capability provided as an extension to Samsung Browser v4.0 for Android platform. The service also allows standard browsers to query limited services using the web services RESTful API. The current system provides semantic navigation along with cross-language support for English, Hindi, and Spanish. The semantics based navigation modality, benchmarked against state of the art semantic browsers on objective and usability metrics by users demonstrate the superiority of this system. The cross-language system has been evaluated by language experts for both cross-mapping accuracy as well as relevance order mapping resulting in a subjective cumulative gain score of over 72%.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127095674","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}