2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing最新文献_第2页

Colluder Detection in Commercial P2P CDNs Using Reputation Information 基于信誉信息的商业P2P cdn共谋检测

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.19

E. Abdullah, S. Fujita

{"title":"Colluder Detection in Commercial P2P CDNs Using Reputation Information","authors":"E. Abdullah, S. Fujita","doi":"10.1109/3PGCIC.2012.19","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.19","url":null,"abstract":"Peer-to-Peer Content Delivery Networks (P2P CDNs) have attracted considerable attention as a way to distribute digital contents to paid users in a scalable and dependable manner. However, due to its peer-to-peer nature, it faces threat from colluders who paid for the contents but illegally share the contents to unauthorized peers. the detection of colluders is an important task for commercial P2P CDNs to prevent contents leaking which is necessary to preserve the right of contents holders. in this paper, we propose two schemes to detect colluders in P2P CDNs. the objective of the schemes is to detect as many colluders as possible within a short time while avoiding misidentifications. the first scheme manages the reputation of peers by collecting reports from the participants and the second scheme improves the quality of colluder identification by applying a technique used in the system level diagnosis of autonomous systems. the performance of the proposed schemes is evaluated by simulations. the simulation results show that when 10% of peers are colluders, our schemes detect all colluders accurately before forming an illegal cluster of colluders.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114687261","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

Heterogeneity through Proactivity: Enhancing Distributed EAs 通过主动性实现异质性:增强分布式ea

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.34

C. Salto, F. Luna, E. Alba

引用次数: 3

Development of a Disk-Power Monitoring Environment Using a Stream Processing Engine 基于流处理引擎的磁盘电源监控环境的开发

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.29

Yousuke Watanabe, H. Yokota

{"title":"Development of a Disk-Power Monitoring Environment Using a Stream Processing Engine","authors":"Yousuke Watanabe, H. Yokota","doi":"10.1109/3PGCIC.2012.29","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.29","url":null,"abstract":"Rapid increase of digital information accelerates advancement of large capacity and high performance storage systems. Reduction of power-consumption in storage systems is also paid much attention. For improvement of performance and power consumption, storage management techniques utilizing sensing data provided by power meters and operating systems become important. However, we have to collect and process massive sensing data from heterogeneous sources in storage systems. In this paper, to reduce costs for implementing storage management techniques and their evaluation, we propose a disk monitoring environment using a stream processing engine. Stream processing engines are specialized to process continuous queries on data streams. We have developed some wrapper programs to import sensing data. Our monitoring environment covers power-consumption of each disk, disk temperature, file accesses on a file system, IO statistics and so on. Users can specify monitoring requirements for these streams as continuous queries. We also consider changes of hardware configurations such as the number of disks to be monitored. We can dynamically change parameters for wrappers, and add/remove wrappers on the running stream processing engine.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"16 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125783441","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

Load Balancing Optimization Using the Algorithm DEPRO in a Distributed Environment 分布式环境下基于DEPRO算法的负载均衡优化

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.39

E. Niño, Carolina Tamara, K. Gomez

引用次数: 3

Parallel Swarm Intelligence for VANETs Optimization 基于并行群智能的VANETs优化

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.53

J. Toutouh, E. Alba

引用次数: 32

Assessing Trade-Offs between Stealthiness and Node Recruitment Rates in Peer-to-Peer Botnets 点对点僵尸网络中隐身性和节点招募率的权衡评估

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.12

D. Arora, Teghan Godkin, Adam Verigin, S. Neville

{"title":"Assessing Trade-Offs between Stealthiness and Node Recruitment Rates in Peer-to-Peer Botnets","authors":"D. Arora, Teghan Godkin, Adam Verigin, S. Neville","doi":"10.1109/3PGCIC.2012.12","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.12","url":null,"abstract":"Botnets denote collections of compromised computers under adversary control and, although early botnets using centralized command and control (C&C) structures were fairly easily defeated, botnets remain a serious global security threat. in part, this is due to the evolution within the adversarial communities using highly diffuse decentralized peer-to-peer (P2P) based C&C within modern botnets, which has proven far more difficult to address. the resulting increased botnet resilience though comes at the cost of placing the bots further from the botmasterâs direct control, thereby, increasing the time required to recruit subsets of bots to specific malicious tasks, (i.e., to send spam, engage in a DDOS attack, etc.). This work explores the specific tradeoffs that occur between achievable bot recruitment rates and overall botnet stealthiness within P2P structured botnets. It is shown that rapid recruitment of nodes (or bots) leads directly to an order of magnitude increase in the botnetâs generated network traffic, which makes the botnet significantly more visible (and susceptible) to defensive counter-measures. Kademlia is used through out this work as the exemplar P2P protocol as, within the real-world, Kademlia has proven to provide an effective C&C mechanism for a number of the longer-lived botnets.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"216 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121201191","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}

引用次数: 3

Performance Evaluation of Yahoo! S4: A First Look 雅虎业绩评估学生4:第一眼

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.55

Jagmohan Chauhan, S. Chowdhury, D. Makaroff

{"title":"Performance Evaluation of Yahoo! S4: A First Look","authors":"Jagmohan Chauhan, S. Chowdhury, D. Makaroff","doi":"10.1109/3PGCIC.2012.55","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.55","url":null,"abstract":"Processing large data sets has been dominated recently by the map/reduce programming model [1], originally proposed by Google and widely adopted through the Apache Hadoop1 implementation. Over the years, developers have identified weaknesses of processing data sets in batches as in MapReduce and have proposed alternatives. One such alternative is continuous processing of data streams. This is particularly suitable for applications in online analytics, monitoring, financial data processing and fraud detection that require timely processing of data, making the delay introduced by batch processing highly undesirable. This processing paradigm has led to the development of systems such as Yahoo! S4 [2] and Twitter Storm.2 Yahoo! S4 is a general-purpose, distributed and scalable platform that allows programmers to easily develop applications for processing continuous unbounded streams of data. As these frameworks are quite young and new, there is a need to understand their performance for real time applications and find out the existing issues in terms of scalability, execution time and fault tolerance. We did an empirical evaluation of one application on Yahoo! S4 and focused on the performance in terms of scalability, lost events and fault tolerance. Findings of our analyses can be helpful towards understanding the challenges in developing stream-based data intensive computing tools and thus providing a guideline for the future development.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117306460","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}

引用次数: 36

Present the Challenges in Eucalyptus Cloud Infrastructure for Implementing Virtual Machine Migration Technique and Provide a Solution for Solve the Challenges 提出了桉树云基础设施实现虚拟机迁移技术所面临的挑战，并提出了解决这些挑战的解决方案

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.58

S. Rad, M. Akbari, M. S. Javan

引用次数: 0

Paralleled Genetic Algorithm for Solving the Knapsack Problem in the Cloud 求解云环境中背包问题的并行遗传算法

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.54

J. Taheri, S. Sharif, Xing Penju, Albert Y. Zomaya

引用次数: 5

Considerations of Effectiveness of Media Switching and QoS Functions 媒体交换和QoS功能有效性的考虑

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.23

Kaoru Sugita, M. Yokota

引用次数: 5