{"title":"D3: discarding dispensable data for efficient live migration of virtual machines","authors":"Myunghoon Oh, Seungjae Baek, Dongwook Kang, Jongmoo Choi","doi":"10.1145/2663761.2664208","DOIUrl":"https://doi.org/10.1145/2663761.2664208","url":null,"abstract":"Virtualization, one of the most actively adopted technologies today in computer systems, is increasingly widening its range of applications. As multiple virtual machines are concurrently executed on a physical machine, they compete for physical resources such as CPU, DRAM, HDD and NIC. In large scale data centers or cluster systems, therefore, it is required to balance each physical machine's load by migrating a virtual machine to another physical machine. Since system performance is significantly hindered during migration, a technique that can reduce the migration overheads is required. Interestingly, we notice that virtual machines' memory contain numerous dispensable data. Therefore, in this paper, we propose an efficient virtual machine migration technique called D3 (Discarding Dispensable Data). The basic idea is simple but effective: finding indispensable page frames, and then, transferring only those page frames. In D3, simple metadata is handed over for the dispensable page frames, instead of actual data transmission, and the discarded page frames are reconstructed appropriately after the migration process. One issue is that checking whether a page frame is dispensable or not based on comparing the entire content yields excessive overhead. To overcome this problem, we devise a novel sampling based dispensable page frame detection technique. D3 have implemented in Xen virtualization software and evaluated on a realistic environment with relevant workloads. We show that D3 can efficiently reduce migration time up to 64.2% and size of memory required for completing a migration up to 94.8%. We also present that D3 is very useful to provide a certain level of QoS and better performance.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"104 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120850688","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":"DC charger selection scheme for electric vehicle-based tours visiting multiple destinations","authors":"Junghoon Lee, G. Park","doi":"10.1145/2663761.2664186","DOIUrl":"https://doi.org/10.1145/2663761.2664186","url":null,"abstract":"This paper proposes a distance-based heuristic in selecting a DC charger for a trip taking an electric vehicle, aiming at creating a tour schedule with better responsiveness. As a variant of the well-known traveling salesman problem, the tour scheduler finds a visiting order for a given set of destinations and an additional charging spot out of multiple candidates. To cope with the increasing number of candidate charging stations, our heuristic identifies the destination farthest away from the start point in network distance and then picks those chargers close to the selected destination. The reduced number of candidates, combined with a constraint-based search space traversal, significantly cuts down the execution time for tour schedule generation, not much increasing the tour length. The performance measurement result obtained from a prototype implementation reveals that the proposed scheme just brings 2.9% increase in tour length and finds a feasible schedule over 70%, even with a single candidate, for the tours most generally taken in the target city.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124053046","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 study of ensemble based evolutionary classifiers for detecting unsolicited emails","authors":"Shrawan Kumar Trivedi, S. Dey","doi":"10.1145/2663761.2664233","DOIUrl":"https://doi.org/10.1145/2663761.2664233","url":null,"abstract":"Identification of unsolicited emails or spam in a set of email files has become a challenging area of research. A robust classifier is not only appraised by performance accuracy but also false positive rate. Recently, Evolutionary algorithms and ensemble of classifiers methods have gained popularity in this domain. For developing an accurate and sensitive spam classifier, this research conducts a study of Evolutionary algorithm based classifiers i.e. Genetic Algorithm (GA) and Genetic Programming (GP) along with ensemble techniques. Two publicly available datasets (Enron and SpamAssassin) are used for testing, with the help of most informative features selected by Greedy Stepwise Search algorithm. Results show that without ensemble, GA performs better than GP but after an ensemble of many weak classifiers is developed, GP overshoots GA with significantly higher accuracy. Also, Greedy Stepwise Feature Search is found to be a strong method for feature selection in this application domain. Ensemble based GP turns out to be not only good in terms of classification accuracy but also in terms of low False Positive rates, which is considered to be an important criteria for building a robust spam classifier.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127087868","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":"Cross-layer design for optimal throughput of wireless networks","authors":"Kun Hua, Yuenong Zhu, Wei Wang, Honggang Wang","doi":"10.1145/2663761.2664214","DOIUrl":"https://doi.org/10.1145/2663761.2664214","url":null,"abstract":"Cross-layer is becoming a studying area for wireless communications. In this paper, we focus on the cross layer design of PHY and MAC layers. By comparing previous research in such area, we find that there is a strong need to combine multiple key parameters in the multimedia wireless sensor networks through cross-layer schemes. In this paper, we propose a new Choquet fuzzy measure method to achieve optimal transmission throughput by selecting best transmitters and receivers and modulation types, under various channel states. Simulation results show the proposed scheme will support various multimedia wireless transmission applications.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127132276","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":"Content type based adaptation in collaborative recommendation","authors":"Y. Choi","doi":"10.1145/2663761.2666034","DOIUrl":"https://doi.org/10.1145/2663761.2666034","url":null,"abstract":"In this paper, we propose an adaptive and collaborative recommendation method based on content type, which can enhance performance considerably in practice. Conventional collaborative recommendations are troubled with no or little effective rating information for newly comers or even some old users so that they often work poorly. In order to relax such cold start or sparse rating information problems, we employ a user-content type matrix with relatively higher density than commonly-used user-content matrix. By using user-content_type matrix, we evaluate user's preference for a content type and then reflect it to the final prediction of content preference in collaborative recommendation. In such a way, our method adaptively combines content preference with content type preference. In experiments, we identify notable performance improvement compared to traditional collaborative recommendation methods in terms of MAE (Mean Absolute Error) and coverage.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129168041","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 proposal for SDN supported future 5G networks","authors":"S. M. Raza, Dongsoo S. Kim, Hyunseung Choo","doi":"10.1145/2663761.2664237","DOIUrl":"https://doi.org/10.1145/2663761.2664237","url":null,"abstract":"With LTE already in the deployment phase and LTE-A knocking on the door, proposals and research groups for the 5G networks have started to surface. There are no formal specifications or standards for the 5G networks yet. In many recent proposals, people have proposed 5G as a network which provides interoperability among the heterogeneous wireless networks. Continuing this theme, in this paper we propose a Software Defined Network (SDN) supported future 5G network, which provides higher data rates by utilizing the bandwidth of multiple heterogeneous wireless networks simultaneously, and application based adaptive QoS. To achieve these functionalities, we have distributed whole network architecture into three major entities: (1) mobile terminal, (2) radio access network and (3) core network. OpenFlow controller and OpenFlow enabled switches are introduced in all these three entities. This paper presents a detailed description of the modules and functionalities of the OpenFlow controllers present in the proposed 5G network architecture, and communication among these modules to achieve the expected features of 5G networks.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123568489","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}
Byeongho Kang, Taeguen Kim, B. Kang, E. Im, Minsoo Ryu
{"title":"TASEL: dynamic taint analysis with selective control dependency","authors":"Byeongho Kang, Taeguen Kim, B. Kang, E. Im, Minsoo Ryu","doi":"10.1145/2663761.2664219","DOIUrl":"https://doi.org/10.1145/2663761.2664219","url":null,"abstract":"Dynamic Taint Analysis (DTA) is an approach used for software testing and vulnerability analysis. The vanilla DTA method is widely used, but its simple taint propagation does not consider any control dependency. Therefore, vanilla DTA generally suffers from the under-tainting caused by control dependency. The under-tainting can be problematic when analyzers try to check vulnerabilities of software. In this paper, we propose Dynamic Taint Analysis with Selective Control Dependency (TASEL), to mitigate the under-tainting problem caused by control dependency. Our technique detects control-dependent data which have possibilities to change the program's control flows. We implemented TASEL using Intel Pin, and applied it for the commodity programs such as Microsoft Notepad. Experimental results show our proposed method successfully resolves the under-tainting problem, without causing the over-tainting problem.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115960874","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":"Face hallucination based on locally linear embedding and local correlation","authors":"Vinh Nguyen, C. Hung, Xiang Ma","doi":"10.1145/2663761.2663767","DOIUrl":"https://doi.org/10.1145/2663761.2663767","url":null,"abstract":"In this paper, we propose a new face hallucination algorithm based on Locally Linear Embedding and Local Correlation method (LC-LLE). The LC-LLE algorithm is an improved locally linear embedding (LLE) algorithm by combining LLE algorithm and local correlation coefficients. The main difference between LC-LLE and LLE algorithms is that LC-LLE uses two different measures for searching the nearest neighbors for matching the most similar patches, while LLE uses only Euclidean distance for searching the nearest neighbors. Specifically, we calculate the Euclidean distance between the low-resolution input patch and patches in the low-resolution training images to select z-NN (i.e. z number of nearest patches). Then, we use the inner product for local correlation computation between the input patch and selected z-NN to identify k nearest neighbors (i.e. k-NN). After that the reconstruction weights are derived using k-NN patches, and generate the high-resolution image patches based on the reconstruction weights. Finally, high-resolution patches are synthesized into the high-resolution image. Experimental results show that the proposed method achieves better performance for high-resolution image reconstruction than Ma's LLE and PCA methods.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"41 19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131176552","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 reversible data hiding scheme based on histogram shifting using edge direction predictor","authors":"Dae-Soo Kim, Gil-Je Lee, K. Yoo","doi":"10.1145/2663761.2664227","DOIUrl":"https://doi.org/10.1145/2663761.2664227","url":null,"abstract":"In this paper, we propose a novel reversible data hiding scheme based on histogram shifting using edge direction (ED) predictor. The ED predictor utilizes direction of adjusted pixels. Because of reversible character, existing predictor methods don't use all of cases edge direction. However, all of cases edge direction are used in ED predictor. In the proposed scheme, embedding and extraction procedures are classified by odd column and even column to use around adjusted pixels. In our experimental results, the hiding capacity of the proposed scheme is superior to other schemes. The image quality of the proposed scheme is similar or better than other schemes.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132592179","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":"Optimized data transmission using cooperative devices in clustered D2D communication","authors":"Awais Ahmad, Alfred Daniel, Anand Paul","doi":"10.1145/2663761.2664235","DOIUrl":"https://doi.org/10.1145/2663761.2664235","url":null,"abstract":"A fundamental challenge in Device-to-Device Communication (D2D) is that the quality of radio links is subject to high transmission power with high channel impairments. This channel impairment leads to higher error rates and temporary path losses that result in the retransmission of data frames and ultimately limits the efficiency of wireless networks. With such constraints, it is difficult to design an algorithm which has the ability to maximize the reliable communication in D2D. Keeping in view this intriguing aspect of D2D communication, we have proposed an optimal data aggregation frame technique. This ensures reliable data delivery from different D2D to their cluster heads using cooperative devices which includes, a) selection of a cooperative device that ensures reliable data delivery at the cluster head and b) optimized data transmission depends on i) packet loss rate, ii) link utilization, and iii) number of retransmissions. Analyses show that optimized frame technique outperforms automatic repeat request ARQ protocols in terms of link utilization, frame loss rate, energy consumption, network efficiency and end-to-end delay in D2D communication.","PeriodicalId":120340,"journal":{"name":"Research in Adaptive and Convergent Systems","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123571888","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}