Jiz-Hang Liu, Ze-yu Di, Shijun Liu, C. Pu, Lei Wu, Li Pan
{"title":"Finding Optimized Deployment Strategy for Multitenant Services by Iterative Staging","authors":"Jiz-Hang Liu, Ze-yu Di, Shijun Liu, C. Pu, Lei Wu, Li Pan","doi":"10.1109/APSCC.2014.30","DOIUrl":"https://doi.org/10.1109/APSCC.2014.30","url":null,"abstract":"A serious challenge that confronts multi-tenant service systems is finding an optimized deployment strategy according to their business scale and operating characteristics. The tenants want to rent high performance services and services providers demand minimizing cost at the same time of meeting the requirements of tenants. But there are often contradictions between high performance and low cost. Therefore, in order to balance the contradiction, this paper proposes a staging-based optimized deployment method. This method performs iterative optimization based on customized workload generation, continuously emulation and evaluation in a benchmark suite. We demonstrate our method by a case study on a multi-tenant Supplier Business Management (SBM) service, as well as evaluate the capability of our benchmark suite through two sets of experiments. Results from these experiments characterized the relationship between workloads and performance, which can help find optimized deployment strategies for multi-tenant applications. In the case study on multi-tenant SBM service system, we gain an optimized strategy that satisfies the requirement of tenants and makes the maximum use of the resources, which can give useful recommendations in real service instances deployment stage.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131902507","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":"Correlation Search of Web Services","authors":"Fenfang Xie, Jianxun Liu, Mingdong Tang, Buqing Cao, Saixia Lyu","doi":"10.1109/APSCC.2014.23","DOIUrl":"https://doi.org/10.1109/APSCC.2014.23","url":null,"abstract":"With the development of services computing and cloud computing, number of Web services has increased rapidly, and it becomes quite popular for developers to combine different Web services to build innovative Mash up applications. How to quickly locate desired Web service for developers, however, is still a challenging problem that needs to be addressed. Most existing related work employed keyword-based method to search services and focused on matching users' queries with semantic or syntactic Web service description. They seldom took advantage of relationships between services to improve the performance of service searching. This paper presents a correlation search method by making use of several relationships between Web services, to recommend a user with services that are similar, composable or potentially composable to a target service. One important advantage of this method is that it can guide users to find desired services promptly, and thus improves efficiency of the service discovery process. To mine the different relationships between services, several efficient algorithms are presented. Case studies and experiments show, the above correlation search method not only can recommend Web services to users that are relevant to the users' interest, but also can predict composable relationships between services with high performance.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130014081","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":"Network Traffic Analysis for Mobile Terminal Based Multi-scale Entropy","authors":"Xiaoming Chen, Huiqiang Wang, Junyu Lin, Guangsheng Feng, Chao Zhao","doi":"10.1109/APSCC.2014.21","DOIUrl":"https://doi.org/10.1109/APSCC.2014.21","url":null,"abstract":"Future networks devoted much attention to QoS of user experience. This makes it very important to understand the characteristics of user traffic. For network across multiple network layers have the characteristics of varying complexity, put forward a kind of traffic characteristics analysis method based on space and time scales. Firstly, the traffic model is established using multi-scale characterization, and then network behavior at different temporal and spatial scales of structural complexity network behavior is analyzed. Then we explore its change law of time scale, it can success classifies traffic types, so as to accurately forecast the next period of time of business. The results of the experiment data analysis shows that the method can effectively realize online monitoring of the business flow.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117346962","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":"iConCube: A Location-Based Mobile Cloud System for Meeting Organizers and Participants","authors":"Guo Chi, Liu Xuan, Fang Yuan, Cui Jingsong","doi":"10.1109/APSCC.2014.36","DOIUrl":"https://doi.org/10.1109/APSCC.2014.36","url":null,"abstract":"Location-Based Services based on thematic information have become commonplace. Thematic indoor navigation services are also increasingly pervasive with the development of indoor positioning technologies. Extending these technologies, we designed and implemented icon Cube, a mobile cloud computing system integrating Location-Based Services and indoor navigation for meeting organizers and participants. For meeting organizers, our system provides a template library to efficiently customize meeting portal websites for different topics and meeting types, such as academic conferences or art exhibitions. For meeting participants, the Android application in our system not only provides indoor navigation in a meeting space, but also enhances communication among participants through online-to-offline social network services. The system also extracts information from the Internet related to users' location and pushes it to users in sequence based on similarity to location's social attributes. Our system has been used for many academic conferences such as China Satellite Navigation Conference (CSNC), demonstrating its utility.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132343631","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":"Function Level Web Service Discovery Based on Category Function Tree","authors":"Jipeng Cui, Bingxian Ma","doi":"10.1109/APSCC.2014.22","DOIUrl":"https://doi.org/10.1109/APSCC.2014.22","url":null,"abstract":"The potential of web services comes from web service composition, where a series of single web services are chosen and composed to perform compound functionalities. As to Web service composition technology, the key step is function-level Web service discovery, which decides the classes of Web services chosen for the final purpose. This paper proposes a proto model for function-Level Web service discovery. Firstly, the idea is accepted that functions in an application category are limited and therefore can be listed and decomposed in a category function tree. Given users' function requirements for composition, it is possible to locate it exactly on the tree and decide how this function can be decomposed downside the tree to sub-functions, this procedure continues until it reaches the leaf-nodes of the tree whose functions can be described by abstract service classes. Finally, an application example is given to demonstrate the whole idea discussed.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115135254","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":"False Logic Attacks on SCADA Control System","authors":"Weize Li, Lun Xie, Daqian Liu, Zhiliang Wang","doi":"10.1109/APSCC.2014.27","DOIUrl":"https://doi.org/10.1109/APSCC.2014.27","url":null,"abstract":"A cyber security incident in SCADA systems can cause the disruption of physical process, and may result in significant economic loss, environmental disasters or even human casualties. To exploit the feature of the physical process and find the potential attacks, this paper presents and analyzes a new class of cyber-physical attacks, named false logic attacks, against the logic of control process in SCADA systems. In addition, it proposes a model for false logic attacks, which is useful for analyzing how attacks can affect the physical system. An experiment is performed to illustrate the concepts, and the effect of false logic attacks are also discussed.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122478704","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":"An Approach to the Location-Based Services Collaboration Evaluation Algorithm Oriented to Mobile Internet Environment","authors":"M. Lu, Mingjun Xin, Weimin Li","doi":"10.1109/APSCC.2014.24","DOIUrl":"https://doi.org/10.1109/APSCC.2014.24","url":null,"abstract":"With the rapid development of communication technology and mobile Internet, masses of location-based services which can meet users' requirements are appearing explosively. So how to select the personalized service with the higher quality is becoming the research hot spot under mobile Internet environment. In this paper, first of all, it organizes services which meet the requirement of users based on their location information and preference information. Secondly, the LBS composition optimization process is presented, which is mainly to find and acquire the appropriate LBS sequences based on user's QoS constraints. Finally, it adopts the collaboration evaluation method to measure the LBS sequences based on QoS indexes, which can get the optimal service for different users. The above procedures accomplish the evaluation for location-based services, which can satisfy user preferences efficiently.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129971573","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 Twig Join Algorithm for a Query with ID References","authors":"Dong Li, Lin Zhao, Jing Li","doi":"10.1109/APSCC.2014.26","DOIUrl":"https://doi.org/10.1109/APSCC.2014.26","url":null,"abstract":"ID/IDREF feature makes XML document model become graph structure rather than tree structure, while traditional Twig join algorithms can just process simple queries without ID references. Those queries with ID references often involve attribute node or predicates with expressions which do not exist in traditional Twig pattern, so it is necessary to design the Twig join algorithm for the implement of queries involving ID references. There are several typical Twig join algorithms like Twig2Stack, Twig List, Twig Mix. Twig2Stack use over-complicated data structures with large memory overhead. Twig List uses simple lists but lack efficient filtering of useless elements. Twig Mix simply introduces the getNext() function into Twig List to avoid manipulation of useless elements for the ancestor-descendent (AD) relationship in the stack and lists, but it will filter some useful elements when process the queries involving attribute node or predicates within expressions. To this end, we propose a new algorithm, called Twig Expand, which can process the queries involving attribute node or predicates within expressions by avoiding the manipulation of useless elements for both the parent-child (PC) relationship and AD relationship. In addition, Twig Graph is proposed by expanding Twig Expand, which can process the queries involving ID references, and it's much faster than binary structural join proved by experimental study.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127406679","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}
Deng-ao Li, Wen-Hui Niu, Jumin Zhao, Shuai Li, Jin-Qiang Liu
{"title":"Analysis and Application of Secondary Code in BDS","authors":"Deng-ao Li, Wen-Hui Niu, Jumin Zhao, Shuai Li, Jin-Qiang Liu","doi":"10.1109/APSCC.2014.28","DOIUrl":"https://doi.org/10.1109/APSCC.2014.28","url":null,"abstract":"The Chinese Bei Dou Navigation Satellite System Signal (BDS) [1] and the modernized GNSS take along a feature of the new modulations is the presence of two channels which is consist of the data and pilot components. The specific structure promoted by secondary codes and the presence of data/pilot channels. However, thanks to the new tiered code, it limits the coherent integration time for acquisition, in order to extend the coherent integration time, relative signs between subsequent portions of the incoming signal have to be estimated and used to remove the effect of sign transitions. To solve the problem the traditional algorithm like tree-based acquire technique suffers a high computational complexity. The paper demonstrates a new algorithm to acquire the BDS signal with a low complexity. The proposed algorithms are simulated in terms of the performance of a software defined receiver.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114913143","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":"Group Key Agreement in Multimedia Service for Machine Type Communication","authors":"Jieying Li, Yueyu Zhang, Jing Chen, Hui Li, Wujun Zhang","doi":"10.1109/APSCC.2014.31","DOIUrl":"https://doi.org/10.1109/APSCC.2014.31","url":null,"abstract":"As one of the next frontiers in wireless communications, Machine Type Communications not only support traditional short message service, but also provide multimedia services, such as voice and video services. The 3rd Generation Partnership Project has made a series of technical specifications of Multimedia Broadcast/Multicast Service for cellular network. However, they are inflexible for group key update, and will cause the core network over-burdened. Hence It is not suitable for Machine Type Communications, especially when mass MTC devices enjoy a specific Multimedia Broadcast/Multicast Service. A group key agreement in multimedia service for MTC communications is proposed to overcome the above disadvantages. The scheme could transmit group key information using broadcast messages and reduce the interacting rounds. Analysis of the scheme indicates that it is of backward and forward security and collusion resistance. In addition, the proposal could lower the communication costs to staying constant compared with that of MBMS.","PeriodicalId":393593,"journal":{"name":"2014 Asia-Pacific Services Computing Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131050362","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}