2018 IEEE International Conference on Networking, Architecture and Storage (NAS)最新文献

MQRP: QoS Attribute Decision Optimization for Satellite Network Routing 卫星网络路由的QoS属性决策优化

2018 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2018-10-01 DOI: 10.1109/NAS.2018.8515722

Li Yang, Jian Liu, Chengsheng Pan, Qijie Zou, Debin Wei

{"title":"MQRP: QoS Attribute Decision Optimization for Satellite Network Routing","authors":"Li Yang, Jian Liu, Chengsheng Pan, Qijie Zou, Debin Wei","doi":"10.1109/NAS.2018.8515722","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515722","url":null,"abstract":"As an indispensable part of the global communication system, satellite networks are facing a sharp increase of service types and numbers, while users want more reliable and faster services, that is, more stringent QoS requirements. The traditional routing algorithm only considers the single QoS requirement which cannot meet the multi-QoS requirements of services, the priority relationship between different QoS requirements is neglected which will affect the overall utilization of the network. In this paper, the Multi-QoS Routing oPtimization algorithm (MQRP) is proposed which is based on PROMETHEE (preference ranking organization methods for enrichment evaluation). MQRP is based on the characteristics that different types of service on the satellite have difference link attribute requirements. The eigenvector method is used to set different QoS weight vectors for many kinds of services, and the link multi attribute evaluation index is constructed by the priority function and evaluation criterion. The attribute priority and priority index are used to establish the path evaluation model. Under different business requirements, the priority of each path of the feasible path concentration is evaluated, and then the Pareto optimal path is made. The simulation results show that the algorithm can distinguish between different QoS requirements and balance network traffic, and obviously improve the resource utilization rate of the network.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"46 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":"130372209","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}

引用次数: 6

An Adaptive Task Assignment Scheme for Data Service in Heterogeneous Vehicular Networks 异构车辆网络数据业务的自适应任务分配方案

2018 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2018-10-01 DOI: 10.1109/NAS.2018.8515735

Penglin Dai, Kai Liu, Ke Xiao, Junhua Wang, Zhaofei Yu, Huanlai Xing

{"title":"An Adaptive Task Assignment Scheme for Data Service in Heterogeneous Vehicular Networks","authors":"Penglin Dai, Kai Liu, Ke Xiao, Junhua Wang, Zhaofei Yu, Huanlai Xing","doi":"10.1109/NAS.2018.8515735","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515735","url":null,"abstract":"Heterogeneous network resources are expected to cooperate with each other to support data services in vehicular networks. However, individual wireless interface cannot complete services within short vehicular dwelling time. Further, the network heterogeneity further complicates the transmission task assignment among multiple wireless interfaces. To resolve such an issue, we propose a novel architecture, where a scheduler is able to manage heterogeneous network resources in a centralized way. Then, we formulate the heterogeneous wireless interface management (HWIM) problem by considering both the heterogeneities of wireless interfaces and the delay constraints of service requests. On this basis, we design a heuristic algorithm called Adaptive Task Assignment (ATA), which synthesizes mobility feature, broadcast efficiency and service deadline into priority design. Accordingly, ATA is able to adaptively distribute broadcast task of each request among multiple interfaces, so as to improve overall system performance. Last but not the least, we build the simulation model and implement the proposed algorithm. The comprehensive simulation results show the superiority of the proposed algorithm.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"43 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":"132046294","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}

引用次数: 0

Reference-Counter Aware Deduplication in Erasure-Coded Distributed Storage System Erasure-Coded分布式存储系统中基于引用计数器的重复数据删除

2018 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2018-10-01 DOI: 10.1109/NAS.2018.8515697

Tong Liu, Xubin He, Shakeel Alibhai, Chentao Wu

{"title":"Reference-Counter Aware Deduplication in Erasure-Coded Distributed Storage System","authors":"Tong Liu, Xubin He, Shakeel Alibhai, Chentao Wu","doi":"10.1109/NAS.2018.8515697","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515697","url":null,"abstract":"In modern distributed storage systems, space efficiency and system reliability are two major concerns. As a result, contemporary storage systems often employ data deduplication and erasure coding to reduce the storage overhead and provide fault tolerance, respectively. However, little work has been done to explore the relationship between these two techniques. In this paper, we propose Reference-counter Aware Deduplication (RAD), which employs the features of deduplication into erasure coding to improve garbage collection performance when deletion occurs. RAD wisely encodes the data according to the reference counter, which is provided by the deduplication level and thus reduces the encoding overhead when garbage collection is conducted. Further, since the reference counter also represents the reliability levels of the data chunks, we additionally made some effort to explore the trade-offs between storage overhead and reliability level among different erasure codes. The experiment results show that RAD can effectively improve the GC performance by up to 24.8% and the reliability analysis shows that, with certain data features, RAD can provide both better reliability and better storage efficiency compared to the traditional Round- Robin placement.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"63 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":"132645644","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}

引用次数: 2

CNNAuth: Continuous Authentication via Two-Stream Convolutional Neural Networks CNNAuth:基于双流卷积神经网络的连续认证

2018 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2018-10-01 DOI: 10.1109/NAS.2018.8515693

Hailong Hu, Yantao Li, Zhangqian Zhu, Gang Zhou

{"title":"CNNAuth: Continuous Authentication via Two-Stream Convolutional Neural Networks","authors":"Hailong Hu, Yantao Li, Zhangqian Zhu, Gang Zhou","doi":"10.1109/NAS.2018.8515693","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515693","url":null,"abstract":"We present a two-stream convolutional neural network based authentication system, CNNAuth, for continuously monitoring users' behavioral patterns, by leveraging the accelerometer and gyroscope on smartphones. We are among the first to exploit two streams of the time-domain data and frequency-domain data from raw sensor data for learning and extracting universal effective and efficient feature representations as the inputs of the convolutional neural network (CNN), and the extracted features are further selected by the principal component analysis (PCA). With these features, we use the one-class support vector machine (SVM) to train the classifier in the enrollment phase, and with the trained classifier and testing features, CNNAuth classifies the current user as a legitimate user or an impostor in the continuous authentication phase. We evaluate the performance of the two-stream CNN and CNNAuth, respectively, and the experimental results show that the two-stream CNN achieves an accuracy of 87.14%, and CNNAuth reaches the lowest authentication EER of 2.3% and consumes approximately 3 seconds for authentication.","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":"129097596","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}

引用次数: 25

User-Customizing Oriented Multipath Inter-Domain Routing 面向用户自定义的多路径域间路由

2018 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2018-10-01 DOI: 10.1109/NAS.2018.8515732

Donghong Qin, Jiahai Yang, Lina Ge

引用次数: 1

Nxt-Freedom: Considering VDC-based Fairness in Enforcing Bandwidth Guarantees in Cloud Datacenter Nxt-Freedom:考虑基于vdc的公平性在云数据中心实施带宽保证

2018 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2018-10-01 DOI: 10.1109/NAS.2018.8515723

Shuo Wang, Jing Li, Hongjie Zhang, Qiqi Wang

{"title":"Nxt-Freedom: Considering VDC-based Fairness in Enforcing Bandwidth Guarantees in Cloud Datacenter","authors":"Shuo Wang, Jing Li, Hongjie Zhang, Qiqi Wang","doi":"10.1109/NAS.2018.8515723","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515723","url":null,"abstract":"In cloud datacenter, it should be rational to enforce fair allocation on network resources among VDCs (virtual datacenters) in terms of multi-tenant model. Traditionally, cloud networks are shared in a best-effort manner, making it hard to reason about how network resources are allocated. Prior works concentrate on either providing minimum bandwidth guarantee or achieving work-conserving based on the VM-to-VM flow policy or per-source policy, or both. However, fair allocation on redundant bandwidth among VDCs is ignored. In this paper, we design NXT-Freedom, a bandwidth guarantees enforcement framework that divides network capacity based on per-VDC fairness while achieving work-conservation. To ensure per-VDC fair allocation, a hierarchical max-min fairness algorithm is proposed. To be applicable to non-congestion-free network core and to be scalable, NXT-Freedom decouples computing per-VDC allocation from enforcing the allocation. Through evaluation of a prototype, we show that NXT-Freedom achieves per-VDC performance isolation, and can be rapidly adapted to flow variation in cloud datacenter.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"95 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":"134151226","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}

引用次数: 1

LCR: Load-Aware Cache Replacement Algorithm for Flash-Based SSDs LCR:基于闪存的ssd的负载感知缓存替换算法

2018 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2018-10-01 DOI: 10.1109/NAS.2018.8515727

Caiyin Liu, Min Lv, Yubiao Pan, Hao Chen, Yongkun Li, Cheng Li, Yinlong Xu

{"title":"LCR: Load-Aware Cache Replacement Algorithm for Flash-Based SSDs","authors":"Caiyin Liu, Min Lv, Yubiao Pan, Hao Chen, Yongkun Li, Cheng Li, Yinlong Xu","doi":"10.1109/NAS.2018.8515727","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515727","url":null,"abstract":"Flash-based SSDs are usually equipped with an onboard cache to further improve system performance by smoothing the gap between the upper-level applications and lower-level flash chips. Since modern SSDs are usually composed of multiple flash chips, and the load of flash chips are significantly different, it is very meaningful to be aware of the chip load condition when designing a cache replacement algorithm. Nevertheless, existing cache replacement algorithms only consider to reduce the cache miss ratio so as to reduce the I/O requests to the underlying flash memory as much as possible, none of them considers the load condition of flash chips. In this paper, we propose a Load- aware Cache Replacement algorithm, called LCR, to improve the performance of flash-based SSDs. The basic idea is to give a higher priority to cache the blocks on overloaded flash chips. We evaluate the performance of our scheme by using a trace- driven simulator with multiple real-world workloads, and results show that compared with the most common algorithm LRU and the state-of-the-art algorithm GCaR, LCR reduces the average response time by as much as 39.2% and 12.3%, respectively.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"15 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":"133801579","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}

引用次数: 13

A Protecting Source-Location Privacy Scheme for Wireless Sensor Networks 一种无线传感器网络源位置隐私保护方案

2018 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2018-10-01 DOI: 10.1109/NAS.2018.8515721

Xu Miao, Guangjie Han, Yu He, Hao Wang, Jinfang Jiang

引用次数: 3

Cache-Friendly Data Layout for Massive Graph 海量图的缓存友好数据布局

2018 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2018-10-01 DOI: 10.1109/NAS.2018.8515737

Yuxiang Shan, Zhan Shi, D. Feng, Ouyang Mengyun, F. Wang

{"title":"Cache-Friendly Data Layout for Massive Graph","authors":"Yuxiang Shan, Zhan Shi, D. Feng, Ouyang Mengyun, F. Wang","doi":"10.1109/NAS.2018.8515737","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515737","url":null,"abstract":"Storage hierarchy is widely used to mitigate the vast performance gap between different storage components economically, and the cache plays an important role in increasing the efficiency of memory access. However, the in-memory data organization of traditional graph computing framework is not well-optimized for various caches, especially the CPU cache, since classical caches are effectiveless towards irregular access pattern of graph applications. This work presents a cache- friendly graph data layout strategy to improve the efficiency of graph processing. By both considering the parameters of cache line and the pattern of access to adjacent list, we sort the edges to generate a sequential layout, and use BFS (Breadth First Search) algorithm to reorder the vertices for improving locality, thus benefit the CPU cache, without altering the code of graph processing toolkits. The efficiency improvement of Sort layout ranges from 11% up to 78.76% on BGL and SNAP with CC (Connected Components [1]). The BFS layout can benefit 3 classical algorithms on GraphChi: CC, TC (Triangle Counting) and PageRank [2], with the ratios of 15%–20%.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"50 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":"122628268","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}

引用次数: 1

Exploiting Minipage-Level Mapping to Improve Write Efficiency of NAND Flash 利用小页级映射提高NAND闪存的写效率

2018 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2018-10-01 DOI: 10.1109/NAS.2018.8515728

Hao Lv, You Zhou, Fei Wu, Weijun Xiao, Xubin He, Zhonghai Lu, C. Xie

{"title":"Exploiting Minipage-Level Mapping to Improve Write Efficiency of NAND Flash","authors":"Hao Lv, You Zhou, Fei Wu, Weijun Xiao, Xubin He, Zhonghai Lu, C. Xie","doi":"10.1109/NAS.2018.8515728","DOIUrl":"https://doi.org/10.1109/NAS.2018.8515728","url":null,"abstract":"Pushing NAND flash memory to higher density, manufacturers are aggressively enlarging the flash page size. However, the sizes of I/O requests in a wide range of scenarios do not grow accordingly. Since a page is the unit of flash read/write operations, traditional flash translation layers (FTLs) maintain the page mapping regularity. Hence, small random write requests become common, leading to extensive partial logical page writes. This write inefficiency significantly degrades the performance and increases the write amplification of flash storage. In this paper, we first propose a configurable mapping layer, called minipage, whose size is set to match I/O request sizes. The minipage-level mapping provides better flexibility in handling small writes at the cost of sequential read performance degradation and a larger mapping table. Then, we propose a new FTL, called PM-FTL, that exploits the minipage-level mapping to improve write efficiency and utilizes the page-level mapping to reduce the costs caused by the minipage-level mapping. Finally, trace-driven simulation results show that compared to traditional FTLs, PM-FTL reduces the write amplification and flash storage response time by an average of 33.4% and 19.1%, up to 57.7% and 34%, respectively, under 16KB flash pages and 4KB minipages.","PeriodicalId":115970,"journal":{"name":"2018 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"30 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":"129080251","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}

引用次数: 4