2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)最新文献_第3页

Online Replacement of Distributed Controllers in Software Defined Networks 软件定义网络中分布式控制器的在线替换

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2015-12-14 DOI: 10.1109/ICPADS.2015.114

J. Zhang, Ping Song, Yi Liu, D. Qian

{"title":"Online Replacement of Distributed Controllers in Software Defined Networks","authors":"J. Zhang, Ping Song, Yi Liu, D. Qian","doi":"10.1109/ICPADS.2015.114","DOIUrl":"https://doi.org/10.1109/ICPADS.2015.114","url":null,"abstract":"To deploy Software Defined Networks (SDN) in large-scale datacenters, distributed controllers need to be used to achieve scalability and reliability. In such kind of continuously running systems, maintenance often involves online replacement of specified nodes in distributed controllers to upgrade their hardware/software, while the service interruption of controllers and processing errors are not allowed. In addition, load-balancing needs to be re-considered since the hardware of controllers may become heterogeneous due to the replacement. To address this problem, this paper proposes ORDIC, an Online Replacement method of DIstributed SDN Controller in a disruption-free manner. ORDIC enables the safe disruption-free replacement of a specified controller while ensuring network switches utilize resources of the new controller efficiently. In this paper, we build the prototype system on Floodlight to demonstrate our design and test the performance. The experimental results show that: during the replacement process, ORDIC can efficiently allocate appropriate loads to the new controller, so as to improve the overall performance of the distributed controller platform.","PeriodicalId":231517,"journal":{"name":"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)","volume":"282 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128400315","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

Differentially Private Wireless Data Publication in Large-Scale WLAN Networks 大规模WLAN网络中的差分私有无线数据发布

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2015-12-14 DOI: 10.1109/ICPADS.2015.44

Jiadi Yu, Xin Dong, Yuan Luo, Minglu Li

{"title":"Differentially Private Wireless Data Publication in Large-Scale WLAN Networks","authors":"Jiadi Yu, Xin Dong, Yuan Luo, Minglu Li","doi":"10.1109/ICPADS.2015.44","DOIUrl":"https://doi.org/10.1109/ICPADS.2015.44","url":null,"abstract":"Wireless trace data play an important role in wireless network researches. However, publishing the raw WLAN traces poses potential privacy risks of network users. Therefore, it is necessary to sanitize users' sensitive information before these traces are published, and provide high data utility for wireless network researches as well. Although some existing works based on various anonymization methods have started to address the problem of sanitizing WLAN traces, the anonymization techniques cannot provide strong and provable privacy guarantees. Differential Privacy is the only framework that can provide strong and provable privacy guarantees. However, we find that existing studies on differential privacy fail to provide effective data utility on multi-dimensional and large-scale datasets. Aim at WLAN trace datasets that have unique characteristics of multi-dimensional and large-scale, this paper proposes a privacy-preserving data publishing algorithm which not only satisfies differential privacy but also realizes high data utility. Furthermore, the theoretical analysis shows the noise variance of our sanitization algorithm is O(logo(1) n/ϵ2) which indicates the algorithm can achieve a higher data utility on large-scale datasets. Moreover, from the results of extensive experiments on an large-scale WLAN trace dataset, we also show that our sanitization algorithm can provide high data utility.","PeriodicalId":231517,"journal":{"name":"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133435402","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

JellyFish: Online Performance Tuning with Adaptive Configuration and Elastic Container in Hadoop Yarn 水母:Hadoop Yarn中自适应配置和弹性容器的在线性能调优

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2015-12-14 DOI: 10.1109/ICPADS.2015.112

Xiaoan Ding, Yi Liu, D. Qian

{"title":"JellyFish: Online Performance Tuning with Adaptive Configuration and Elastic Container in Hadoop Yarn","authors":"Xiaoan Ding, Yi Liu, D. Qian","doi":"10.1109/ICPADS.2015.112","DOIUrl":"https://doi.org/10.1109/ICPADS.2015.112","url":null,"abstract":"MapReduce is a popular computing framework for large-scale data processing. Practical experience shows that inappropriate configurations can result in poor performance of MapReduce jobs, however, it is challenging to pick out a suitable configuration in a short time. Also, current central resource scheduler may cause low resource utilization, and degrade the performance of the cluster. This paper proposes an online performance tuning system, JellyFish, to improve performance of MapReduce jobs and increase resource utilization in Hadoop YARN. JellyFish continually collects real-time statistics to optimize configuration and resource allocation dynamically during execution of a job. During performance tuning process, JellyFish firstly tunes configuration parameters by reducing the dimensionality of search space with a divide-and-conquer approach and using a model-based hill climbing algorithm to improve tuning efficiency; secondly, JellyFish re-schedules resources in nodes by using a novel elastic container that can expand and shrink dynamically according to resource usage, and a resource re-scheduling strategy to make full use of cluster resources. Experimental results show that JellyFish can improve performance of MapReduce jobs by an average of 24% for jobs run for the first time, and by an average of 65% for jobs run multiple times compared to default YARN.","PeriodicalId":231517,"journal":{"name":"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122866807","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}

引用次数: 42

A Mixture Distribution Based System in BitTorrent-Like P2P Networks 类bittorrent P2P网络中基于混合分布的系统

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2015-12-14 DOI: 10.1109/ICPADS.2015.35

Y. Yao, Yong Tian, Weidong Liu, Jiaxing Song

引用次数: 2

Communication Models for Distributed Intel Xeon Phi Coprocessors 分布式Intel Xeon Phi协处理器的通信模型

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2015-12-14 DOI: 10.1109/ICPADS.2015.69

Sarah Neuwirth, Dirk Frey, U. Brüning

{"title":"Communication Models for Distributed Intel Xeon Phi Coprocessors","authors":"Sarah Neuwirth, Dirk Frey, U. Brüning","doi":"10.1109/ICPADS.2015.69","DOIUrl":"https://doi.org/10.1109/ICPADS.2015.69","url":null,"abstract":"The emergence of accelerator technology in current supercomputing systems is changing the landscape of supercom-puting architectures. Accelerators like GPGPUs and coprocessors are optimized for parallel computation while being more energy efficient. Their computational power per watt plays a crucial role in developing exaflop systems. Today's accelerators come with some limitations. They require a local host to configure and operate them. In addition, the number of host CPUs and accelerators does not scale independently. Another problem is the unbalanced communication between distributed accelerators. New communication frameworks are developed to optimize the internode communication. In this paper, four communication models using the Intel Xeon Phi coprocessor technology are compared. The Intel Xeon Phi coprocessor is based on the Intel Many Integrated Cores technology. It is an attractive accelerator due to its embedded Linux operating system, up to 1 TFLOPS of performance on a single chip, and its x86 64 compatibility. DCFA-MPI, MVAPICH2-MIC, and HAM-Offload are compared against the communication architecture for network-attached accelerators (NAA). Each communication model optimizes a different layer of the MIC communication architecture. The NAA approach makes the accelerator device independent from a local host system. Furthermore, it enables the accelerator to source and sink network traffic. Workloads can be dynamically assigned during run-time in an N to M ratio between CPUs and accelerators. The latency, bandwidth, and performance of the MPI communication layer of a prototype implementation are evaluated.","PeriodicalId":231517,"journal":{"name":"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128415375","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

Video Replication over a New Architecture DASH-DMS 基于新架构DASH-DMS的视频复制

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2015-12-14 DOI: 10.1109/ICPADS.2015.85

Haifa Harrouch, M. Kaddes, Majed Abdouli, Claude Duvallet, R. Bouaziz

{"title":"Video Replication over a New Architecture DASH-DMS","authors":"Haifa Harrouch, M. Kaddes, Majed Abdouli, Claude Duvallet, R. Bouaziz","doi":"10.1109/ICPADS.2015.85","DOIUrl":"https://doi.org/10.1109/ICPADS.2015.85","url":null,"abstract":"Nowadays, the video traffic represents more than 65% of global traffic and in the Internet forecasts, it will reach 79% in 2018 in both wired and wireless environments. Hence, major content providers such as Netflix, Youtube, Hulu, and Vudu are leveraging HTTP-based multimedia transmission with adaptative streaming with different solution in order to guarantee a quality of service (QoS). Moreover, in 2012, a new standard called Dynamic Adaptive Streaming over HTTP (DASH) which enables adaptation of the media bitrate to varying throughput conditions by offering multiple representations of the same content is proposed. In this paper, we present a fairness architecture, called DASH-DMS, in combination with the new Dynamic Adaptive Streaming over HTTP (DASH) standard, in order to guarantee a certain QoS under changing conditions in the available bandwidth. DASH-DMS is a hybrid architecture which combines both 2-tiers and 3-tiers architectures. Moreover, we present a replication algorithm to enable load balancing video servers and improve the global QoS. Furthermore, in order to improve the availability of our system, we use a fault tolerance policy. Simulations conducted along this paper show that our proposition significantly outperforms existing and state-of-the-art approaches.","PeriodicalId":231517,"journal":{"name":"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117163688","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

High-Performance Parallel Location-Aware Algorithms for Approximate String Matching on GPUs gpu上近似字符串匹配的高性能并行位置感知算法

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2015-12-14 DOI: 10.1109/ICPADS.2015.77

Cheng-Hung Lin, C. Huang

{"title":"High-Performance Parallel Location-Aware Algorithms for Approximate String Matching on GPUs","authors":"Cheng-Hung Lin, C. Huang","doi":"10.1109/ICPADS.2015.77","DOIUrl":"https://doi.org/10.1109/ICPADS.2015.77","url":null,"abstract":"Approximate string matching has been widely used in many applications, including deoxyribonucleic acid sequence searching, spell checking, text mining, and spam filters. The method is designed to find all locations of strings that approximately match a pattern in accordance with the number of insertion, deletion, and substitution operations. Among the proposed algorithms, the bit-parallel algorithms are considered to be the best and highly efficient algorithms. However, the traditional bit-parallel algorithms lacks the ability of identifying the start and end positions of a matched pattern. Furthermore, acceleration of the bit-parallel algorithms has become a crucial issue for processing big data nowadays. In this paper, we propose two kinds of parallel location-aware algorithms called data-segmented parallelism and high-degree parallelism as means to accelerate approximate string matching using graphic processing units. Experimental results show that the high-degree parallelism on GPUs achieves significant improvement in system and kernel throughputs compared to CPU counterparts. Compared to state-of-the-art approaches, the proposed high-degree parallelism achieves 11 to 105 times improvement.","PeriodicalId":231517,"journal":{"name":"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114912578","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

Dynamic Web Service Composition Based on State Space Searching 基于状态空间搜索的动态网络服务组合

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2015-12-14 DOI: 10.1109/ICPADS.2015.110

Yu Lei, Jiantao Zhou, Yongqiang Gao, Liu Jing, Xuebin Ma

引用次数: 3

Efficient Algorithms for Scheduling XML Data in a Mobile Wireless Broadcast Environment 移动无线广播环境下XML数据调度的高效算法

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2015-12-14 DOI: 10.1109/ICPADS.2015.96

Yongrui Qin, Hua Wang, Ji Zhang, Xiaohui Tao, W. Zhang, K. Taylor, Quan Z. Sheng

{"title":"Efficient Algorithms for Scheduling XML Data in a Mobile Wireless Broadcast Environment","authors":"Yongrui Qin, Hua Wang, Ji Zhang, Xiaohui Tao, W. Zhang, K. Taylor, Quan Z. Sheng","doi":"10.1109/ICPADS.2015.96","DOIUrl":"https://doi.org/10.1109/ICPADS.2015.96","url":null,"abstract":"This paper tackles the key scheduling problem of reducing the overall wait time of mobile clients in wireless data broadcast systems. It is observed that in periodic broadcast, new mobile clients may join in and existing mobile clients may leave anytime; in on-demand broadcast, high uplink communication cost may occur as all clients have to submit their queries every time. These are likely to degrade existing broadcasting approaches. In this work, we study the scheduling problem of XML data broadcast in a hybrid mode, where the system supports both periodic broadcast and on-demand broadcast services at the same. By taking the structural similarity between XML documents into account, only a small portion of mobile clients would be involved in the scheduling process and all mobile clients can be served more effectively. In this way, communication cost at the client side can be reduced greatly. A formal theoretical analysis of the proposed technique is presented. Based on the analysis, a novel clustering-based scheduling algorithm is developed. Moreover, we utilize an aging method to predict the distribution of incoming queries based on small samples of queries from mobile clients. Finally, we evaluate the approach through a set of experiments and the results show that it can significantly improve access efficiency for mobile clients.","PeriodicalId":231517,"journal":{"name":"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126246156","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

Accelerating Crowdsourcing Based Indoor Localization Using CSI 利用CSI加速基于众包的室内定位

2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS) Pub Date : 2015-12-14 DOI: 10.1109/ICPADS.2015.42

H. Xie, Li Lin, Zhiping Jiang, Wei Xi, K. Zhao, Meiyong Ding, Jizhong Zhao

{"title":"Accelerating Crowdsourcing Based Indoor Localization Using CSI","authors":"H. Xie, Li Lin, Zhiping Jiang, Wei Xi, K. Zhao, Meiyong Ding, Jizhong Zhao","doi":"10.1109/ICPADS.2015.42","DOIUrl":"https://doi.org/10.1109/ICPADS.2015.42","url":null,"abstract":"Indoor localization is of importance for many applications. Crowdsourcing individual users' measurements can provide accurate localization without costly site-survey. However, crowdsourcing based approaches suffer from the cold start problem, in which at the beginning of system deployment, there are insufficient users to contribute their measurements, resulting in inaccurate and time-inefficient localization. In this paper, we propose a hybrid indoor localization method to solve such problem, called ACIL. We first employ the inertial navigation technique to localize some core positions or paths. To tackle the inaccuracy problem, we propose an effective method that utilizes the channel state information (CSI) of wireless signals for accurate distance estimation. This method is based on a new observation: there is a ripple-like fading pattern in wireless signals upon moving objects. Leveraging this observation, our system is capable of calculating the distance of human's movement and his/her direction. We also propose a graph-matching algorithm to setup the correlation between the trajectory and floor map. With those extra obtained location information, the impact of cold start issue will be significantly mitigated, while the LBS can be guaranteed with high localization accuracy. Extensive experiments show that the effectiveness in the human localization and movement detection. Extensive experiments validate the great performance of our protocol in case of various human locations and diverse channel conditions.","PeriodicalId":231517,"journal":{"name":"2015 IEEE 21st International Conference on Parallel and Distributed Systems (ICPADS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131424192","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}

引用次数: 9