2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献_第3页

Prevent DNS Cache Poisoning Using Security Proxy 使用安全代理防止DNS缓存中毒

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.69

Lejun Fan, Yuanzhuo Wang, Xueqi Cheng, Jinming Li

{"title":"Prevent DNS Cache Poisoning Using Security Proxy","authors":"Lejun Fan, Yuanzhuo Wang, Xueqi Cheng, Jinming Li","doi":"10.1109/PDCAT.2011.69","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.69","url":null,"abstract":"DNS has been suffering from cache poisoning attack for a long time. The attacker sends camouflaged DNS response to trick the domain name server, and inserts malicious resource record into the cached database. Because the original DNS protocol only depends on 16-bit transaction ID to verify the response packet, it is prone to be guessed by the attacker. Although many strategies such as transaction randomizing, source port randomizing and the 0x20 technique have been applied to improve the resistance of DNS, the attacker still has chance to poison DNS server in an acceptable time. Other more complicated strategy such as DNSSEC which provides stricter prevention mechanism is not easy to deploy and is not widely adopted yet. To address the problem, we present a novel strategy called Security Proxy. The architecture can be easily implemented and deployed on existing DNS server without modification of DNS server itself. The embedded two schemes Selective Re-Query and Security Label Communication can cooperate and effectively prevent the cache poisoning attack. We analyze our strategy from both the capability and efficiency. Then we find that our Security Proxy has obvious advantage over the original transaction ID, the source port randomizing and 0x20 techniques.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121262068","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}

引用次数: 15

Green Scheduling: A Scheduling Policy for Improving the Energy Efficiency of Fair Scheduler 绿色调度:提高公平调度器能效的调度策略

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.42

Tao Zhu, Chengchun Shu, Haiyan Yu

{"title":"Green Scheduling: A Scheduling Policy for Improving the Energy Efficiency of Fair Scheduler","authors":"Tao Zhu, Chengchun Shu, Haiyan Yu","doi":"10.1109/PDCAT.2011.42","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.42","url":null,"abstract":"Energy efficiency of data centers has draw a great attention due to the cost of power consumption increases dramatically as the size of data center grows. Nowadays, Map Reduce is a framework widely used for processing large data sets in data center, its energy efficiency directly affects the energy efficiency of data center. MapReduce's energy efficiency is closely tied to its scheduler, we find that fair scheduler outperforms FIFO scheduler in energy efficiency when CPU-intensive job and IO-intensive job running simultaneously on the cluster, because fair scheduler achieves better resource utilization by overlapping resource complementary tasks on slaves. However this behavior is occasional, because fair scheduler has no information about task's resource requirement. This occasional behavior lets us identify the area that energy efficiency of fair scheduler can be improved. We propose an energy-efficient scheduling policy called green scheduling which relaxes fairness slightly to create as many opportunities as possible for overlapping resource complementary tasks. The results show that green scheduling can save between 7% and 9% energy consumption of fair scheduler.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126657888","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}

引用次数: 8

A Propagation Model for Social Engineering Botnets in Social Networks 社交网络中社会工程僵尸网络的传播模型

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.8

Shuhao Li, Xiao-chun Yun, Zhiyu Hao, Xiang Cui, Yipeng Wang

引用次数: 5

Data Flow Error Recovery with Checkpointing and Instruction-Level Fault Tolerance 数据流错误恢复与检查点和指令级容错

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.33

Lei Xiong, QingPing Tan

{"title":"Data Flow Error Recovery with Checkpointing and Instruction-Level Fault Tolerance","authors":"Lei Xiong, QingPing Tan","doi":"10.1109/PDCAT.2011.33","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.33","url":null,"abstract":"Soft error detection and recovery are important to the system reliability, especially for the improvement of fabrication technology. Instruction-level soft error tolerance method which needs not additional hardware is broadly discussed. This paper proposes an application level data flow error recovery approach which combines the technique check pointing with instruction level fault tolerance method. On the instruction level, those codes are divided into protected codes and unprotected codes based on their sensibility to soft errors on hardware. For those protected codes, every data is copied with two versions. At some program points such as store instruction and branch instruction in the program, these related data are checked. If the two version data are not identical, we consider that there is a happened soft error. Then the program state is restored from a prior check point which is related to the error data. For a checked data, the check point which is related to the data is saved based on the program slice whose original program is from the beginning of the program to the checked data. Finally, the approach is implemented in our experiments, and experimental results demonstrate our approach.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127450873","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

Mobile Element Path Planning for Gathering Transit-Time Constrained Data 移动单元路径规划收集传输时间约束数据

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.53

Khaled Almiani, Anastasios Viglas, M. Aalsalem

引用次数: 4

Investigation and Survey of Secret Sharing in Verifiable Distributed Systems 可验证分布式系统中秘密共享的研究与探讨

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.47

Kun Peng

引用次数: 3

Computation Pattern Driven Reuse of Manual Optimizations for GPGPUs 计算模式驱动的gpgpu手动优化重用

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.30

Shixiong Xu, D. Han, Li Chen

{"title":"Computation Pattern Driven Reuse of Manual Optimizations for GPGPUs","authors":"Shixiong Xu, D. Han, Li Chen","doi":"10.1109/PDCAT.2011.30","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.30","url":null,"abstract":"The wide application of General Purpose Graphic Processing Units (GPGPUs) results in large manual efforts on porting and optimizing algorithms on them. However, most existing automatic ways of generating GPGPU code fail to conduct optimization strategies regarding a specific computation and to reuse constantly evolving manual optimizations. In this paper, we present a computation pattern driven approach for computation-specific GPGPU code generation and optimization, which in turn reuses manual optimizations to a certain extent. We suggest language extensions to OpenMP, high-level data structure attributes, in order to assist the process of computation pattern matching and to help give users intuitive performance tuning parameters in the view of data structure attributes. We illustrate the feasibility of this approach through three important computation dwarfs, which are dense matrix, sparse matrix, and structured mesh computation in scientific computing. We also build a prototype OpenMP-to-CUDA translator that consists of computation pattern recognition and code template instantiation. The experimental results demonstrate the performance benefits of computation pattern driven method. To our best knowledge, it is the first work on reusing manual optimizations for GPGPUs with computation pattern driven approach.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129016100","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

CHMasters: A Scalable and Speed-Efficient Metadata Service in Distributed File System CHMasters:分布式文件系统中可扩展、高效的元数据服务

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.26

Min Xu, Junrui Zhou, Wei Zhou, Hong An

{"title":"CHMasters: A Scalable and Speed-Efficient Metadata Service in Distributed File System","authors":"Min Xu, Junrui Zhou, Wei Zhou, Hong An","doi":"10.1109/PDCAT.2011.26","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.26","url":null,"abstract":"Distributed file system (DFS) is playing important roles of supporting large distributed data-intensive applications to meet storage needs. Typically, the design of DFS, such as GFS in Google, DMS in Cisco and TFS in Alibaba, is driven by observations of specific application workloads, internal demands and technological environment. In such systems, the metadata service is a critical factor that can affect the file system performance and availability to a great degree. Five requirements have been summarized for the metadata service: location transparent file service, smart director, efficient speed, strong scalability and friendly collaborator. In this paper, we present metadata service module called CH Masters in our DFS. Consistent hashing protocol is used to relieve potential hot spots on name servers. Files' metadata and master nodes are mapped into the same hash space by consistent hash function. And then files' metadata are scattered to master nodes by clockwise \"closest\" principle. Chunk server acts as a client when report its chunks info. Only a small proportion of files' metadata will be rehashed when master nodes state change. A new scalable file mapping strategy is also proposed to map file sizes from few MB to several GB efficiently. After intensive experiments, it shows CH Masters is satisfying the above five requirements.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116438352","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

Mobile-Element Data Gathering Scheme 移动元素数据收集计划

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.54

M. Aalsalem

{"title":"Mobile-Element Data Gathering Scheme","authors":"M. Aalsalem","doi":"10.1109/PDCAT.2011.54","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.54","url":null,"abstract":"In sensor network applications, data gathering mechanisms, which are based on multi-hop forwarding can be expensive in terms of energy. This limitation reduces the lifetime of the network and challenges the use of sensor networks for applications that demand a predefined operational lifetime. To avoid this problem, the benefits of using mobile gateway to prolong sensor life-time have been explored in the literature. However, practical considerations such as the gateway speed and route planning, sensor buffer size and data frequency generation constraints impose limits on the mobile elements. In this work, we consider the natural hybrid solution that combines the two approaches of mobile gateways and multi-hop forwarding to address more constraints for sensor applications. We provide algorithmic solutions that attempt to balance the benefits of both approaches. Based on a given predetermined time deadline, a gateway tour will be established to involve a subset of the sensors. These selected sensors will work as gathering points and will aggregate the other sensors' data. The gathering points/nodes are selected with the aim of reducing the energy expenditures due to multi-hop forwarding. Using approximation-preserving reductions, we discuss the hardness of this problem. We also present a heuristic-based solution and validate its performance through an extensive set of experiments.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130785949","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

Architecture for Peer-to-Peer Databases with Routing Queries Using Ant Colony Algorithm and Semantic Support 基于蚁群算法和语义支持的路由查询点对点数据库体系结构

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2011-10-20 DOI: 10.1109/PDCAT.2011.23

C. R. Valêncio, Paulo Scarpelini Neto, L. R. Costa, A. Cansian

{"title":"Architecture for Peer-to-Peer Databases with Routing Queries Using Ant Colony Algorithm and Semantic Support","authors":"C. R. Valêncio, Paulo Scarpelini Neto, L. R. Costa, A. Cansian","doi":"10.1109/PDCAT.2011.23","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.23","url":null,"abstract":"In a peer-to-peer network, the nodes interact with each other by sharing resources, services and information. Many applications have been developed using such networks, being a class of such applications are peer-to-peer databases. The peer-to-peer databases systems allow the sharing of unstructured data, being able to integrate data from several sources, without the need of large investments, because they are used existing repositories. However, the high flexibility and dynamicity of networks the network, as well as the absence of a centralized management of information, becomes complex the process of locating information among various participants in the network. In this context, this paper presents original contributions by a proposed architecture for a routing system that uses the Ant Colony algorithm to optimize the search for desired information supported by ontologies to add semantics to shared data, enabling integration among heterogeneous databases and the while seeking to reduce the message traffic on the network without causing losses in the amount of responses, confirmed by the improve of 22.5% in this amount.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"31 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133685686","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