{"title":"NAS 2018 Keynotes","authors":"","doi":"10.1109/nas.2018.8515690","DOIUrl":"https://doi.org/10.1109/nas.2018.8515690","url":null,"abstract":"","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128852466","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}
Tao Yang, Jingcheng Zhao, T. Hong, Weishi Chen, Xinru Fu
{"title":"Automatic Identification Technology of Rotor UAVs Based on 5G Network Architecture","authors":"Tao Yang, Jingcheng Zhao, T. Hong, Weishi Chen, Xinru Fu","doi":"10.1109/NAS.2018.8515719","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515719","url":null,"abstract":"UAVs (Unmanned Aerial Vehicles), also called drones, have drawn the attention of researchers owing to its flexibility, threatening and enormous application value. The construction of 5G network brings a new direction of detecting, identifying, and managing UAVs based on the native cloud architecture. In 5G end-to-end network slices, rotor UAVs are detected and identified by deploying 5G millimeter waves and using a joint algorithm, the improved short-time Fourier transform (STFT) and based on Bessel function base. For one-rotor UAV, the use of STFT following conjugation of sinusoidal frequency modulation (SFM) radar echo data based on millimeter wave doubles the recognition effect compared with the unconjugated processing. For multi-rotors UAV, the number of rotors and the length and rotational speed of each rotor are effectively identified through projection on the SFM data and the introduction of k order Bessel function. According to the results of automatic identification of UAVs by 5G native cloud architecture, the high bandwidth and low delay of 5G network provide a reliable basis for the resolution. Because of good robustness of the Bessel function, it provides an effective solution for the detection, identification and management of UAVs by 5G millimeter wave radar.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124099637","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 Worm Containment Approach Towards Online Social Networks","authors":"Zhaolong Zhang, Zhichao Zhu","doi":"10.1109/NAS.2018.8515718","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515718","url":null,"abstract":"The online social network(OSN) phenomenon has emerged over the past ten years. Unfortunately, worms that target OSNs have become a major security threat to both the websites and their users in recent years. From our observation, we find that propagation features of these worms are highly related to the characteristics of OSNs. In this paper, we propose a new approach to do worm containment in OSNs. Firstly, we capture user connection characteristics and then establish the weighted user relationship graph which can be used in worm containment. Secondly, we propose a novel hierarchical partition algorithm to divide the nodes into difference areas based on analyzing the characteristic of the OSN structure. Finally, we leverage a new worm containment method by taking advantage of the impact of users' crucial influence on propagation. We set up experiments to verify our approach. The experiments shows that our containment strategy can restrain the worm propagation and fix the infection effectively.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116970058","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":"Personalized Behavior Prediction with Encoder-to-Decoder Structure","authors":"Tong Yin, Xiaotie Deng, Yuan Qi, Wei Chu, Jing Pan, X. Yan, Junwu Xiong","doi":"10.1109/NAS.2018.8515696","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515696","url":null,"abstract":"With the rise of the Internet industry and the technique of artificial intelligence, personalized services are increasingly important in recent years for improving user experience and increasing corporates' competitiveness and profits. Precise prediction of customers' behaviors has shown great effects in modern business marketing, especially when making personalized decisions. In this paper, we develop a deep learning network to make personalized predictions of their behaviors among a list of potential choices. The architecture of this model combines each user's features and his historical event lists by sequence-to-sequence (Seq2Seq) structure and make predictions based on his recent event lists. We also modify the long-short- term memory (LSTM) cell forget gate's structure to enhance the attention ability. Such design, called the attetioned LSTM, converges quicker and better while still maintain the similar performance in open dataset IMDB. In addition, in dealing with personalized prediction problems in real-world datasets provided by our cooperative company, our attentioned LSTM achieves a 10% higher precision in average than the standard LSTM model. The advantage is confirmed in evaluation of this generic method on a real dataset of users' behaviors sequences and individuals' attribute profiles from Ant Financial. It also achieves a great result working on the real-world business scene. This model can also achieve a great performance working on the real-world business scene.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127587539","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":"Energy-Efficient Task Offloading and Resource Scheduling for Mobile Edge Computing","authors":"Hongyan Yu, Quyuan Wang, Songtao Guo","doi":"10.1109/NAS.2018.8515731","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515731","url":null,"abstract":"Mobile edge computing is an emerging computing paradigm to augment computational capabilities of mobile devices by offloading computation-intensive tasks from resource- constrained smart mobile device onto edge clouds nearby with potential computation capability. However, in general, edge clouds have limited computation resource and energy. Thus it is critical to achieve high energy efficiency while ensuring satisfactory user experience. In this paper, we first formulate the computation offloading problem for mobile edge computing into the system cost minimization problem by taking into account the completion time and energy. We then transform the optimization problem into a convex problem and propose a distributed algorithm consisting of offloading strategy selection, clock frequency configuration, transmission power allocation and channel rate scheduling. Finally, the experimental results show that our algorithm can achieve energy-efficient offloading performance compared to other existing algorithms.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"276 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129234614","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":"Accelerating Spark Shuffle with RDMA","authors":"Bing Liu, Fang Liu, Nong Xiao, Zhiguang Chen","doi":"10.1109/NAS.2018.8515724","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515724","url":null,"abstract":"Apache Spark is a lightning-fast unified analytics engine for large-scale data processing. When executing an application with Spark, it runs many jobs in parallel. These jobs are divided into stages based on the shuffle boundary. However, shuffling data across the stages in a cluster is time-consuming because it will place significant burden on operating system on both the source and the destination by requiring many remote files and network I/Os. Meanwhile, the latest Spark is based on Netty which is written with Java Sockets and will produce a large number of data copies during the shuffle phase. This has become the major bottleneck for Apache Spark and motivates us to use RDMA technology to accelerate data shuffle. RDMA, with the function of zero-copy transfers, reducing latency and CPU overhead, can reduce stress on operating system during the shuffle phase and improve the throughput of the whole system. In this paper, we present a high-performance RDMA-based design for accelerating data shuffle in Apache Spark framework by providing tiering memory pool and different mechanisms to transfer messages of different sizes. The experimental results show that compared to the default Spark running with IP over InfiniBand (IPoIB), our proposed design can achieve up to 89.8% performance improvement for Spark RDD operation benchmarks (e.g., GroupBy and SortBy), up to 49% performance improvement for iterative algorithms (e.g., TriangleCount and SVM in SparkBench). And the evaluation results also show that our RDMA-based design slightly outperforms Crail-Spark-IO, a recent open-source Spark shuffle plugin from IBM.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126348500","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}
Jiacheng Zhang, Youyou Lu, Keni Qiu, Zejun Shi, Hongsuk Choi, J. Shu
{"title":"Exporting Transactional Interface to Applications in Log-Structured File Systems","authors":"Jiacheng Zhang, Youyou Lu, Keni Qiu, Zejun Shi, Hongsuk Choi, J. Shu","doi":"10.1109/NAS.2018.8515726","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515726","url":null,"abstract":"The write-ahead-logging (WAL) used in SQLite adopts roll-forward mechanism to ensure system consistency, which induces double writes of the updates due to the checkpointing procedure. F2FS is a recent proposed file system that is specifically designed and optimized for flash memory based storage. By leveraging the log-structured update pattern and the atomicity of filesystem-level checkpoint in F2FS, this paper proposes an index remapping mechanism to redirect the DB access to WAL. In this way, the write amplification caused by WAL checkpointing can be mitigated, which further improves the overall performance of the system. The atomicity of the remap operation and the WAL alignment format are discussed in details. In addition, crash recovery under the proposed framework is validated. The experimental results show that the proposed framework can effectively reduce the write traffic and improve system performance.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"343 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128907821","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":"Joint Optimization of Energy and QoE with Fairness in Cooperative Fog Computing System","authors":"Yifan Dong, Cheng Han, Songtao Guo","doi":"10.1109/NAS.2018.8515738","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515738","url":null,"abstract":"Fog Computing as one of Mobile Edge Computing (MEC) paradigms deploys servers to the edge of networks to reduce the transmission latency. However, how to obtain the energy-effective cooperation policy among fog nodes to enhance the users' quality of experience (QoE) under fairness still remains a challenging issue, where the fairness ensures that fog nodes are encouraged to take part in cooperations. Therefore, we first build up a cooperative fog computing system to process offloading workload on the entire Fog layer by data forwarding. Then we propose a joint optimization problem of QoE (average response time) and energy (average energy consumption) in integrated fog computing process with fairness. After that, we prove the convexity of the optimization problem and design a Fairness Cooperation Algorithm to obtain the optimal fairness cooperation policy of all fog nodes. Finally, by comparing with baseline algorithm and Distributed Optimization Algorithm, the numerical results show that our algorithm can effectively reduce response time reduction and energy consumption.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132773667","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}