4-dimensional Model for Describing Status of Peers in Peer-to-Peer Distributed Systems

Awerbuch and Scheideler have shown that peer-to-peer overlay networks can survive Byzantine attacks only if malicious nodes are not able to predict what will be the topology of the network for a given sequence of join and leave operations. In this paper we investigate adversarial strategies by following specific protocols. Our analysis demonstrates first that an adversary can very quickly subvert overlays based on distributed hash tables by simply never triggering leave operations. We then show that when all nodes (honest and malicious ones) are imposed on a limited lifetime, the system eventually reaches a stationary regime where the ratio of polluted clusters is bounded, independently from the initial amount of corruption in the system.

Download Full-text

Dynamic Knowledge Discovery in Open, Distributed and Multi-Ontology Systems

Web Semantics & Ontology ◽

10.4018/978-1-59140-905-2.ch008 ◽

2006 ◽

pp. 226-258 ◽

Cited By ~ 9

Author(s):

Silvana Castano ◽

Alfio Ferrara ◽

Stefano Montanelli

Keyword(s):

Distributed Systems ◽

Knowledge Discovery ◽

Resource Discovery ◽

Peer To Peer ◽

Information Resources ◽

Information Resource ◽

Peer To Peer Networks ◽

Open Distributed Systems ◽

Ontology Metadata ◽

Share Information

In open distributed systems like peer-to-peer networks and Grids, many independent peers, possibly spanned across multiple organizations, need to share information resources (e.g., data, documents, services) provided by other nodes. By dynamic knowledge discovery we mean the capability of each node of finding knowledge in the system about information resources that, at a given moment, best match the requirements of a request for given target resource(s). The chapter will focus on describing models and techniques for ontology metadata management and ontology-based dynamic knowledge discovery in open distributed systems, by describing the architecture of a toolkit for information resource discovery and sharing developed in the Helios peer-based system.

Download Full-text

Beernet

Technological Innovations in Adaptive and Dependable Systems ◽

10.4018/978-1-4666-0255-7.ch017 ◽

2012 ◽

pp. 282-304

Author(s):

B. Mejías ◽

P. Van Roy

Keyword(s):

Distributed Systems ◽

Large Scale ◽

Single Point ◽

Peer To Peer ◽

Self Healing ◽

Decentralized System ◽

Large Scale Systems ◽

Self Organized ◽

Peer To Peer Networks ◽

Control And Synchronization

Distributed systems with a centralized architecture present the well known problems of single point of failure and single point of congestion; therefore, they do not scale. Decentralized systems, especially as peer-to-peer networks, are gaining popularity because they scale well, and do not need a server to work. However, their complexity is higher due to the lack of a single point of control and synchronization, and because consistent decentralized storage is difficult to maintain when data constantly evolves. Self-management is a way of handling this higher complexity. In this paper, the authors present a decentralized system built with a structured overlay network that is self-organized and self-healing, providing a transactional replicated storage for small or large scale systems.

Download Full-text

Token Based Mutual Exclusion in Peer-to-Peer Systems

Technologies and Protocols for the Future of Internet Design ◽

10.4018/978-1-4666-0203-8.ch011 ◽

2012 ◽

pp. 214-228 ◽

Cited By ~ 1

Author(s):

Mayank Singh ◽

Shashikala Tapaswi

Keyword(s):

Distributed Systems ◽

Message Passing ◽

Mutual Exclusion ◽

Hash Table ◽

Peer To Peer ◽

Distributed Hash Table ◽

Shared Resources ◽

Peer To Peer Systems ◽

Mutual Exclusion Algorithm ◽

Message Overhead

Mutual exclusion is one of the well-studied fundamental primitives in distributed systems, and a number of vital solutions have been proposed to achieve the same. However, the emerging Peer to Peer systems bring forward several challenges to protect consistent and concurrent access to shared resources, as classical peer-to-peer systems, like Napster, Gnutella, et cetera, have been mainly used for sharing files with read only permission. In this chapter, the authors propose a quorum based mutual exclusion algorithm that can be used over any Peer to Peer Distributed Hash Table (DHT). The proposed approach can be seen as extension to traditional Sigma protocol for mutual exclusion in Peer to Peer systems. The basic idea is to reduce message overhead with use of smart nodes present in each quorum set and message passing between the current owners of resource with next resource requester nodes.

Download Full-text

Workshop on reliable peer-to-peer distributed systems

21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings. ◽

10.1109/reldis.2002.1180202 ◽

2005 ◽

Author(s):

O. Babaoglu ◽

A. Kermarrec ◽

R. van Renesse ◽

L. Rodrigues ◽

M. van Steen ◽

...

Keyword(s):

Distributed Systems ◽

Peer To Peer

Download Full-text