Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems

Keyani, Pedram; Larson, Brian; Senthil, M.

doi:10.1007/3-540-45745-3_29

Cited by 22 publications

(12 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The protocol is therefore highly efficient and scalable. It is noted that many existing P2P applications in the Internet have good expansion properties and are therefore expanders [Keyani et al 2002;Pandurangan et al 2001].…”

Section: P2p Environment and A Self-organization Problemmentioning

confidence: 99%

A self-organization mechanism based on cross-entropy method for P2P-like applications

Chen

Sarrafzadeh

Low

et al. 2010

ACM Trans. Auton. Adapt. Syst.

View full text Add to dashboard Cite

P2P-like applications are quickly gaining popularity in the Internet. Such applications are commonly modeled as graphs with nodes and edges. Usually nodes represent running processes that exchange information with each other through communication channels as represented by the edges. They often need to autonomously determine their suitable working mode or local status for the purpose of improving performance, reducing operation cost, or achieving system-level design goals. In order to achieve this objective, the concept of status configuration is introduced in this article and a mathematical correspondence is further established between status configuration and an optimization index (OI), which serves as a unified abstraction of any system design goals. Guided by this correspondence and inspired by the cross-entropy algorithm, a cross-entropy-driven selforganization mechanism (CESM) is proposed in this article. CESM exhibits the self-organization property since desirable status configurations that lead to high OI values will quickly emerge from purely localized interactions. Both theoretical and experimental analysis have been performed. The results strongly indicate that CESM is a simple yet effective technique which is potentially suitable for many P2P-like applications.

show abstract

Section: P2p Environment and A Self-organization Problemmentioning

confidence: 99%

A self-organization mechanism based on cross-entropy method for P2P-like applications

Chen

Sarrafzadeh

Low

et al. 2010

ACM Trans. Auton. Adapt. Syst.

View full text Add to dashboard Cite

show abstract

“…When the underlying graph is an expander, or at least expected to have good expansion, results similar to the above can be obtained. Fortunately, it is known that several peer-to-peer topologies induce expander graphs [18,16].…”

Section: Theoremmentioning

confidence: 99%

Gossip-based aggregation of trust in decentralized reputation systems

Procaccia

Bachrach

Rosenschein

2008

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

Abstract. Decentralized reputation systems have of late emerged as the prominent method of establishing trust among selfish agents in today's online environments. A key issue is the efficient aggregation of data in the system; several approaches have hitherto been advanced, but are plagued by major shortcomings. We put forward a novel decentralized data management scheme grounded in gossip-based algorithms. Rumor mongering is known to possess algorithmic advantages, and indeed, our framework inherits numerous salient features: scalability, robustness, globality, and simplicity. We also demonstrate that our scheme motivates agents to maintain a sparkling clean reputation, and is inherently impervious to certain attacks.

show abstract

“…As we know, it is extremely difficult, if not impossible, to obtain such topology information in large scale distributed systems. P. Keyani et al [17] address distributed recovery from attacks in P2P systems. They propose to modify the P2P overlay so as to reduce the number of high degree nodes.…”

Section: Related Workmentioning

confidence: 99%

“…W. Zhang et al [17] propose a node placement algorithm in WSNs. Their approach focuses on a small portion of critical nodes to support fault-tolerant communication and the computation complexity is approximated to O (1).…”

Section: Related Workmentioning

confidence: 99%