Enhancing peer-to-peer systems through redundancy

Flocchini, Paola; Nayak, Amiya; Xie, Ming

doi:10.1109/jsac.2007.070103

Cited by 32 publications

(14 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When systems like DHTs are used, more security mechanisms [Castro et al 2002] and data replication mechanisms [Flocchini et al 2007] must be employed to ensure that requests are successfully performed.…”

Section: Mitigating Denial Of Service Attacksmentioning

confidence: 99%

A survey of attack and defense techniques for reputation systems

2009

View full text Add to dashboard Cite

Reputation systems provide mechanisms to produce a metric encapsulating reputation for a given domain for each identity within the system. These systems seek to generate an accurate assessment in the face of various factors including but not limited to unprecedented community size and potentially adversarial environments.We focus on attacks and defense mechanisms in reputation systems. We present an analysis framework that allows for general decomposition of existing reputation systems. We classify attacks against reputation systems by identifying which system components and design choices are the target of attacks. We survey defense mechanisms employed by existing reputation systems. Finally, we analyze several landmark systems in the peer-to-peer domain, characterizing their individual strengths and weaknesses. Our work contributes to understanding 1) which design components of reputation systems are most vulnerable, 2) what are the most appropriate defense mechanisms and 3) how these defense mechanisms can be integrated into existing or future reputation systems to make them resilient to attacks.

show abstract

Section: Mitigating Denial Of Service Attacksmentioning

confidence: 99%

A survey of attack and defense techniques for reputation systems

2009

View full text Add to dashboard Cite

show abstract

“…Redundant strategy has been proven to be very efficient in Peer to Peer (P2P) file sharing system 13 named Hyper-Chord. Different from that, our proposed A5 is not a structured architecture.…”

Section: Related Workmentioning

confidence: 99%

Redundant Virtual Machines Management in Virtualized Cloud Platform

Zhang

Cao

Cai

et al. 2011

Int. J. Model. Simul. Sci. Comput.

View full text Add to dashboard Cite

Selecting and utilizing proper virtual machines in a virtualized cloud platform to achieve high availability, throughput, reliability, as well as low cost and makespan is very important. The importance lies in the adaptive resource provisioning to satisfy variant of workloads. An Adaptive Accessing Aware Algorithm (A5) is proposed in this paper to deal with this conflicting objective optimization problem. The main strategy of A5 is selecting adaptive upper/lower bound of service capacity to decide the time for scheduling redundant virtual machines and a Pareto-front-based multi-objective optimization method to decide the number of scheduling virtual machines. We carried out experiments in simulation, which show that A5 can achieve much higher performance improvements in four different workload testing environments, compared with other three commonly used methods.

show abstract

“…As the number of data nodes increases, the work load on a single centralized namenode server increases and has a great impact on the performance and availability of the cluster. It is therefore, increasing work load and memory that restricts the scalability of the Hadoop cluster [6,20]. A single centralized namenode server is more prone to failures.…”

Section: Introductionmentioning

confidence: 99%

“…Chord's main goal is the location of entities in P2P environments, like documents, files, or any resource that one might want to share in a computer network [20,21,25,26]. It is a distributed lookup protocol.…”

Section: Introductionmentioning

confidence: 99%

High Scalability of HDFS using Distributed Namespace

Singh¹,

Singh²

2012

IJCA

View full text Add to dashboard Cite

In data intensive computing, Hadoop is widely used by organizations. The client applications of Hadoop require high availability and scalability of the system. Mostly, these applications are online and their data growth rate is unpredictable. The present Hadoop relies on secondary namenode for failover which slows down the performance of the system. Hadoop system's scalability depends on the vertical scalability of namenode server. As the namespace of Hadoop distributed file system grows, it demands additional memory to cache. A namenode server does not have enough primary memory to cache the namespace, its performance and availability effects. A new Hadoop architecture has been proposed to address the issues of namenode scalability, single point of failure and availability of Hadoop. This approach is based on distribution of namespace using distributed hash tables. The growing size of namespace of HDFS is distributed into multiple name node servers. The proposed architecture of Hadoop is simulated by using the multiple name node servers. The name node are arranges in chord ring. This allows HDFS to scale up horizontally. The system provides decartelize managed approach for namespace distribution which gives consistent performance. The results of HDFS namespace to store 1 billion or above files are discussed in this research work. The proposed architecture has shown high availability and adapts to name node failure. General TermsData intensive computing, Scalability, Failover, Availability

show abstract

Enhancing peer-to-peer systems through redundancy

Cited by 32 publications

References 12 publications

A survey of attack and defense techniques for reputation systems

A survey of attack and defense techniques for reputation systems

Redundant Virtual Machines Management in Virtualized Cloud Platform

High Scalability of HDFS using Distributed Namespace

Contact Info

Product

Resources

About