Meiqi Zhu, Xiaomeng Huang, Songbin Liu, H. Fu, Qiming Fang, Guangwen Yang
{"title":"Optimize Multidimensional Arrays Queries with Heterogeneous Replica Method","authors":"Meiqi Zhu, Xiaomeng Huang, Songbin Liu, H. Fu, Qiming Fang, Guangwen Yang","doi":"10.1109/NAS.2013.43","DOIUrl":"https://doi.org/10.1109/NAS.2013.43","url":null,"abstract":"Multidimensional arrays are commonly used in scientific and engineering applications. The disk layout for the multidimensional arrays will obviously affect the performance of data querying. Homogeneous Replica method are widely used to maintain the data reliability in most of the distributed storage systems and used to improve the data locality in some parallel processing systems. In this paper, we propose a novel method, that is heterogeneous replicas, to makes better use of the replica method to optimize the performance of multidimensional arrays querying. The experimental results shows that heterogeneous replicas method can significantly reduce the overhead of disk I/O for most of the queries. With three heterogeneous replicas, the performance of random generated range queries for multidimensional datasets can be improved for 30% on the average.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123139649","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}
Peipeng Liu, Jinqiao Shi, Lihong Wang, Xiao Wang, Qingfeng Tan
{"title":"IX-Level Adversaries on Entry- and Exit-Transmission Paths in Tor Network","authors":"Peipeng Liu, Jinqiao Shi, Lihong Wang, Xiao Wang, Qingfeng Tan","doi":"10.1109/NAS.2013.27","DOIUrl":"https://doi.org/10.1109/NAS.2013.27","url":null,"abstract":"Tor is a worldwide publicly deployed low-latency anonymity system. In order to prevent observers from telling where the data came from and where it's going, data packets on the Tor network take a pathway through several intermediate relays. However, nodes selection to build such a pathway is oblivious to Internet routing, so anonymity guarantees can break down in cases where an attacker can correlate traffic across the entry- and exit-segments of a Tor circuit. Although many works have been done to avoid this kind of collusion attack, recent researches [18] indicated that some Internet exchanges (IXes) locating at the entry- and exit-transmission paths in Tor network (that are the paths from the client to the chosen entry node and from the chosen exit node to the destination) are still possible to perform a correlation attack. However, few works have been done to suggest and verify modifications to Tor's path selection algorithm that would help clients avoid an IX-level observer. In this paper, we first, based on the entry-exit pairs chosen by Tor's path selection algorithm, demonstrated that the probability of a single IX observing both ends of an anonymous Tor connection is greater than previously thought. And then, we proposed and evaluated the effectiveness of a simple IX-awareness path selection algorithm that help to resist IX-level attackers.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132491983","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}
Zhengwei Zhao, Zhixiong Jiang, Chunyang Lu, Yushan Cai, Jingping Bi
{"title":"A Congestion Control Algorithm for Datacenters","authors":"Zhengwei Zhao, Zhixiong Jiang, Chunyang Lu, Yushan Cai, Jingping Bi","doi":"10.1109/NAS.2013.19","DOIUrl":"https://doi.org/10.1109/NAS.2013.19","url":null,"abstract":"Recently, there has been renewed interest in latency as a primary metric for mainstream data center applications. In this paper, we propose a coordinated mechanism for congestion control and multi-path transmission to reduce flow completion time in data centers. The approach leverages ECN to adaptively react to congestion, prioritizes flows according to their timeliness requirements, and evenly distributes network traffic across multiple paths. Through a real implementation and simulations, we show that our approach can effectively reduce flow completion time under different workflow patterns. Compared to existing solutions based on TCP and flow hashing, our approach achieves an improvement of 30% in application throughput and a reduction of up to 90% in 99th percentile flow completion time for latency-sensitive flows, and a reduction of 50%-80% in average completion time for long background flows.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130209676","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 Analysis of NAND Flash Based Cache for Network Storage System","authors":"Lin Han, Haozhe Huang, C. Xie","doi":"10.1109/NAS.2013.15","DOIUrl":"https://doi.org/10.1109/NAS.2013.15","url":null,"abstract":"The high latency and low bandwidth nature of mobile network connection poses a great challenge in the use of network storage system in portable consumer electronics devices. To extend the use of network storage systems, such as cloud storage services in portable consumer electronics device, the built-in NAND flash device can be taken as a front-end cache for network storage system, so the efficiency of network storage system via mobile network can be boosted. This paper briefly introduces the structure of NAND flash cached network storage system, and analyzes the performance of NAND flash based cache in various important aspects. Performance evaluation is done on a NAND flash cache simulator, and a recommended structure of NAND flash based cache is given based on the results of evaluation experiments.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117179810","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":"D-PALD: A Dynamic Power-Aware Load Dispatcher with Response Time Percentile Guarantee in Heterogeneous Clusters","authors":"Xu Zhou, Q. Cao, C. Xie, Xubin He","doi":"10.1109/NAS.2013.55","DOIUrl":"https://doi.org/10.1109/NAS.2013.55","url":null,"abstract":"The power consumption of a server is not linear to its activeness, i.e., a server with 10% load may still draw as much as 60% of its peak power, therefore, a significant amount of energy has been used to keep servers active even under very light or idle loads. The resulting effect has been increased low power-effectiveness in data centers which elevate ownership costs and put more pressure on rack and enclosure densities. This motivates us to design a scheme to dynamically dispatch load to achieve energy efficiency while maintaining the quality of service (QoS) by exploiting a fundamental characteristic of data centers: heterogeneity. In this work, we propose D-PALD to guarantee response time percentile while dynamically dispatch the workload among the servers to maximize the power efficiency in heterogeneous data centers. We develop a power efficiency model to characterize properties of servers while providing the percentile guarantee and also design a power aware load dispatching algorithm. Our experiments demonstrate that DPALD can save a significant amount of power without sacrificing user performance compared to the baseline power management algorithms.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128624765","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":"E-HiLow: Extended Hierarchical Routing Protocol in 6LoWPAN Wireless Sensor Network","authors":"Li Yue, Dongliang Xie, Jiatong Zhao, Jie Zhang","doi":"10.1109/NAS.2013.8","DOIUrl":"https://doi.org/10.1109/NAS.2013.8","url":null,"abstract":"Deploying the IPv6 protocol in Wireless Sensor Network (WSN) is the key issue of ubiquitous intelligence and mobile computing in the future. IETF 6LoWPAN enables the IPv6 protocol over IEEE 802.15.4 Low-power Wireless Personal Area Networks (Low PAN). The paper proposes an extended hierarchical routing protocol (E-HiLow), which reduces the memory requirement and the number of control packages and improve the path recovery and address allocation in HiLow. The simulation results and the analysis validates that the E-HiLow achieves better E2E packet delay and energy consumption performance.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115328115","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 Vulnerability Optimization Method for Security-Critical Real-Time Systems","authors":"Xia Zhang, Jinyu Zhan, Wei Jiang, Yuexi Ma","doi":"10.1109/NAS.2013.34","DOIUrl":"https://doi.org/10.1109/NAS.2013.34","url":null,"abstract":"In this paper, we focus on task scheduling problems in security-critical real-time systems. We consider that all of the critical tasks are equipped with RC5 algorithm to reduce the vulnerability when facing security attacks. The relationships among security level, vulnerability and execution time of each task are firstly deduced. Then, a Multiple Task Vulnerability Optimization Method (MTVOM), which is based on dynamic programming algorithm, is devised to obtain minimal vulnerability under strict timing constraints. Furthermore, we take task criticality into consideration because each task is not equally important to its system. Finally, simulation experiments demonstrate the effectiveness of this method.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123346799","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":"McDisc: A Reliable Neighbor Discovery Protocol in Low Duty Cycle and Multi-channel Wireless Networks","authors":"Maotian Zhang, Lei Zhang, Panlong Yang, Yubo Yan","doi":"10.1109/NAS.2013.7","DOIUrl":"https://doi.org/10.1109/NAS.2013.7","url":null,"abstract":"Neighbor discovery is the very first step for many mobile applications. Previous neighbor discovery protocols that use single channel may be failed when faced with unreliable channel environment, whereas most of multi-channel schemes do not focus on neighbor discovery in low duty cycle wireless networks. The key challenge for multi-channel slotted neighbor discovery is how to effectively assign the channel during each active slot. We propose McDisc, an energy-efficient and reliable duty-cycle-based neighbor discovery protocol that is built on two basic idea. First, it leverages randomized approach to establish the multi-channel discovery schedule, where the node is assigned to the chosen channel during each active slot randomly. Randomized approach may suffer from extremely low discovery probability in worst case. In tackling this problem, we then employ deterministic channel assignment that can ensure bounded discovery latency. The theoretical analysis and simulation results confirm that McDisc can cope with unreliable channel environment ensuring reliable and low latency discovery efficiently. In terms of 60% packet loss ratio, McDisc outperforms U-Connect [1] by approximate 100% in the worst-case discovery latency.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126211253","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 Prediction Mathematical Model for HO Performance in LTE Networks","authors":"Xiaohui Zhao, Xin-long Luo, Tong Wu, Dengkun Xiao","doi":"10.1109/NAS.2013.31","DOIUrl":"https://doi.org/10.1109/NAS.2013.31","url":null,"abstract":"In this paper, a mathematical model for handover performance indicators in LTE(long time evolution) wireless networks is proposed with the aim of predicting handover parameters and improving handover reliability and efficiency, considering the impact and interdependency of key handover settings (offset, TTT, UE velocity, distance). The best combination of key parameters can be easily achieved by finding the optimal solution of a nonlinear optimization problem, which results in efficient reduction of target handover (HO) failure rate and ping pong rate. The modification of the model is also presented taking the impact of UE location and speed into account. Simulation results and matching error analysis indicate that the proposed fitting functions have an average match quality of over 90% in terms of HO failure rate and ping pong rate, which is good enough to be used for handover prediction.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128251000","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}
Wenchao Jiang, Zhiming Zhao, A. Wibisono, P. Grosso, C. D. Laat
{"title":"Dynamic Workflow Planning on Programmable Infrastructure","authors":"Wenchao Jiang, Zhiming Zhao, A. Wibisono, P. Grosso, C. D. Laat","doi":"10.1109/NAS.2013.53","DOIUrl":"https://doi.org/10.1109/NAS.2013.53","url":null,"abstract":"The Network Service Interface (NSI) has been created as a result of collaborative development of network and application engineers primarily associated with the Research and Education (R&E) community. The NSI allows workflow systems not only to check available service points for a workflow engine to schedule executions, but also to reserve and provide network connections among those service points. The Open Flow technology provides programmability on the network Flow and allows software to define dynamically behaviour of the network. These new features offer data intensive applications new opportunities to optimize the mapping between data Flow patterns and the infrastructure yielding better system level quality. However, they also require the computing support systems effectively capture not only the characteristics of the application workflow but also the controllability of the underlying network. In this paper we discussed the extension of our previous system called Network QoS Planner (NEWQoSPlanner) and investigated how reservation based connection services can be enhanced by dynamic network Flow control. We also discusse how NEWQoSPlanner invokes network services to achieve connection reservation and provisioning, and includes Open Flow to realize dynamic Flow optimization for data intensive workflows.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130477487","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}