{"title":"Deterministic Dendritic Cell Algorithm Application to Smart Grid Cyber-Attack Detection","authors":"O. Igbe, Ihab Darwish, T. Saadawi","doi":"10.1109/CSCloud.2017.12","DOIUrl":"https://doi.org/10.1109/CSCloud.2017.12","url":null,"abstract":"The Distributed Network Protocol v3.0 (DNP3) is one of the most widely used protocols for smart grid communications. Security challenges which could cause great scale of damages to critical infrastructure like the smart grid have emerged in recent years. This paper investigates the attacks that target smart grids which utilize the DNP3 protocol, and how these attacks can be detected using the deterministic version of the Dendritic Cell Algorithm (DCA) which is an Artificial Immune System (AIS)-based algorithm. To evaluate DCAs effectiveness, we generated a testing dataset, by implementing various attacks then executing them in a DNP3 smart grid environment. We present our results, showing that these attacks can be successfully detected using an architecture based on the DCA.","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"26 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":"132403373","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":"Performance of Scientific Simulations on QCT Developer Cloud: A Case Study of Molecular Dynamic and Quantum Chemistry Simulations","authors":"P. Madhavan, P. Young, Stephen Chang","doi":"10.1109/CSCloud.2017.54","DOIUrl":"https://doi.org/10.1109/CSCloud.2017.54","url":null,"abstract":"We present direct performance measurements for four popular scientific simulations on the Knights Landing (KNL) platform. Performance numbers for Broadwell processors are provided for contrast. The applications (NAMD, LAMMPS, GROMACS and CP2K) were selected from among the ten most used in the QCT developer cloud as well as best representative of workloads used by many users and, given their diversity, should be representative of typical high performance computing workloads. All runs were performed with publicly available codes without modification and so results should be expected to improve as developers gain access to Knights Landing (KNL) processor. Current results are promising, with execution on a single KNL processor showing speedups up to 1.5x with respect to a dual socket Broadwell.","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"14 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":"132448810","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":"Research on Faceted Search Method for Water Data Catalogue Service","authors":"Jun Feng, Shengqiu Kong, B. Du, Jiamin Lu","doi":"10.1109/CSCloud.2017.38","DOIUrl":"https://doi.org/10.1109/CSCloud.2017.38","url":null,"abstract":"Traditionally the data retrieval is achieved by searching the metadata with keywords, though it is often difficult for ordinary users to express professional and precise query demands in the water industry. Regarding this issue, this paper introduces an exploratory retrieval method called faceted search by gradually recommending relevant facets to the users. Firstly, a unified modeling algorithm is proposed to construct the unified metadata model in XML for heterogeneous water metadata. Based on this model, candidate facet terms can be extracted and filtered, in order to retrieve the various water metadata uniformly. At last, a facet recommendation algorithm is proposed to help the users to sharpen their queries by prompting less but more accurate facets as the search gets deeper, after excluding those \"irrelevant facets\" and \"redundant facets\". The experimental results demonstrate that our facet recommendation algorithm can significantly improve the retrieval precision on querying the water data.","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"25 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":"116714441","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}
Risa Savold, Natalie Dagher, Preston Frazier, D. McCallam
{"title":"Architecting Cyber Defense: A Survey of the Leading Cyber Reference Architectures and Frameworks","authors":"Risa Savold, Natalie Dagher, Preston Frazier, D. McCallam","doi":"10.1109/CSCloud.2017.37","DOIUrl":"https://doi.org/10.1109/CSCloud.2017.37","url":null,"abstract":"The rapid development of cyber threats and intelligence challenges the traditional design of static cyber defense platforms. This paper discusses the need for an agile structure to inform the development of cybersecurity solutions that are not only widely adaptable to unknown threats, specific business practices, and technical requirements, but are also efficiently translatable to products. It employs a systems engineering approach in the evaluation of several Reference Architectures for cyber defense that were gathered from the both the public and private sector. The Northrop Grumman Cyber Defense Reference Architecture is introduced in this paper to go beyond basic cyber hygiene by focusing on cognitive tasks through functional implementations of advanced analytics and automation. The limitations of frameworks, design patterns, and security control checklists in comparison to reference architectures are also discussed.","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"48 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":"132826577","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":"Speed Up Weather Prediction on QCT Developer Cloud: A Case Study on Knights Landing Platform","authors":"Gong-Do Hwang, Stephen Chang","doi":"10.1109/CSCloud.2017.48","DOIUrl":"https://doi.org/10.1109/CSCloud.2017.48","url":null,"abstract":"We present the direct performance measurements of two popular weather forecast models, Weather Research and Forecast Model (WRF) and Models for Predictions Across Scales (MPAS) on Intel's Knight Landing Platform (KNL). WRF is widely evaluated over different platforms while the benchmarks of MPAS are still scarce. In this study we measured the running time of WRF and MPAS on the QCT Developer Cloud, both on its KNL-based nodes and Xeon Broadwell-based nodes. We found that for WRF its performance on single KNL node is 1.55 times faster than Broadwell one, while for MPAS is 1.1 times faster. Generally the scalability of two models on a single node is linear, and drops when across multiple nodes. Further optimization might be needed for those two models","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"33 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":"114490470","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":"Improving the Energy Efficiency for Parallel Applications Running on Clusters","authors":"Weifeng Liu, Bin Gong, Meng Guo","doi":"10.1109/CSCloud.2017.52","DOIUrl":"https://doi.org/10.1109/CSCloud.2017.52","url":null,"abstract":"Now cloud computing is rapidly growing as an alternative to traditional computing architecture. However, it is based on models like cluster computing in general. Thus, improving the energy consumption of the cluster system is the basis for the green cloud. In order to reach exascale computing, more and more efforts are made to improve the energy consumption and efficiency in high performance computing systems. As the de facto standard for designing parallel applications in cluster environment, the Message Passing Interface has been widely used in high performance computing. Therefore, getting the energy consumption information of MPI applications is critical for improving the energy efficiency of cluster systems. By creating a distributed measuring framework which can collect all nodes' energy consumption without the aid of power meters, it is possible to get the detailed energy information of an MPI application. In this work, we present MEMT, a software framework that eases the energy collection in cluster environment. Using this tool, it is viable to find out parameters that affect an MPI program's energy efficiency and to build the models for execution time and energy consumption. Based on the pre-built models, energy saving strategy can be designed. The use of this tool is tested in a cluster.","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"70 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":"121904448","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}
K. Zhang, Tong Wu, Siyuan Chen, Linsen Cai, Chao Peng
{"title":"A New Energy Efficient VM Scheduling Algorithm for Cloud Computing Based on Dynamic Programming","authors":"K. Zhang, Tong Wu, Siyuan Chen, Linsen Cai, Chao Peng","doi":"10.1109/CSCloud.2017.46","DOIUrl":"https://doi.org/10.1109/CSCloud.2017.46","url":null,"abstract":"As a new computing paradigm, cloud computing has significantly contributed to the rapid development of massive data centers. However, the corresponding energy issue becomes increasingly challenging. In this paper, we focus on the energy saving issue for virtual machine (VM) selections on an overloaded host in a cloud computing environment. We analyze the energy influencing factors during a VM migration, then design energy efficient VM selection algorithms based on greedy algorithm and dynamic programming method. We conduct experiments with CloudSim and results show that the proposed algorithm in this paper can effectively reduce energy consumption while satisfying the SLA constraints.","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"69 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":"114024065","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":"FUD — Balancing Scheduling Parameters in Shared Computing Environments","authors":"A. Sedighi, Milton L. Smith, Yuefen Deng","doi":"10.1109/CSCloud.2017.60","DOIUrl":"https://doi.org/10.1109/CSCloud.2017.60","url":null,"abstract":"Shared computing environments such as Cloud, HPC and Grid Computing present a challenge for scheduling systems as they seek to balance incoming requests with available resources, maintain high utilization, be fair among users, and cope with environmental dynamicity. In this paper, we will introduce the FUD theorem. The FUD theorem is based on the premise that a scheduler's desire to optimize the three system parameters: Fairness, Utilization and Dynamicity (FUD) comes at a cost. These parameters adversely affect one another, and thus, in a shared computing environment, a scheduler is unable to be fair while fully utilizing the available resources and still deal with the dynamicity of the environment. The presented FUD model argues for relaxing one of the three parameters to optimize scheduling decisions based on the remaining two.","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"10 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":"122641979","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":"HDFT++ Hybrid Data Flow Tracking for SaaS Cloud Services","authors":"Alexander Fromm, Vladislav Stepa","doi":"10.1109/CSCloud.2017.9","DOIUrl":"https://doi.org/10.1109/CSCloud.2017.9","url":null,"abstract":"SaaS based cloud computing promises to provide dedicated and specialized computational resources on-premise and on a pay-per-use base to cloud consumers. These benefits, however, are traded with data confidentiality concerns: once data is transmitted to a cloud service, cloud consumers loose control over their data and remain in uncertainty about how their data is processed and disseminated inside the service. To counteract those concerns, we provide HDFT++, a hybrid data flow tracking approach to screen how data disseminate inside a cloud service. That way for instance, cloud service consumers are provided with valuable and detailed information to audit their cloud-resident data. Our approach is innovative, as we combine statically computed information flow analysis results with dynamic run-time data flow tracking mechanisms to monitor only those program locations inside a SaaS service that are actually relevant for a flow of data. Our evaluation results show, that our solution, while collecting run-time information, imposes less or at least equivalent performance overhead on the service under scrutiny than related work. Moreover, as we only track the flow of data at the service level, we could achieve by design a better balance between performance overhead and portability of the monitored service.","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"190 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":"117347476","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 Improved Straggler Identification Scheme for Data-Intensive Computing on Cloud Platforms","authors":"Wei Dai, Ibrahim Adel Ibrahim, M. Bassiouni","doi":"10.1109/CSCloud.2017.64","DOIUrl":"https://doi.org/10.1109/CSCloud.2017.64","url":null,"abstract":"One of the challenges faced by data-intensive computing is the problem of stragglers, which can significantly increase the job completion time. Various proactive and reactive straggler mitigation techniques have been developed to address the problem. The straggler identification scheme is a crucial part of the straggler mitigation techniques, as only when stragglers are detected not only correctly but also early enough, the improvement in job completion time can make a real difference. Although the classical standard deviation method is a widely adopted straggler identification scheme, it is not an ideal solution due to certain inherent limitations. In this paper, we present Tukey's method, another statistical method for outlier detection, which is more suitable for the identification of stragglers for two reasons. First, it is robust to extreme observations from stragglers. Second, it can identify stragglers and, more importantly, start speculative execution earlier than the standard deviation method. Our extensive simulation results confirm that Tukey's method can remarkably outperform the standard deviation method.","PeriodicalId":436299,"journal":{"name":"2017 IEEE 4th International Conference on Cyber Security and Cloud Computing (CSCloud)","volume":"47 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120878220","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}