441 research outputs found
Structured P2P Technologies for Distributed Command and Control
The utility of Peer-to-Peer (P2P) systems extends far beyond traditional file sharing. This paper provides an overview of how P2P systems are capable of providing robust command and control for Distributed Multi-Agent Systems (DMASs). Specifically, this article presents the evolution of P2P architectures to date by discussing supporting technologies and applicability of each generation of P2P systems. It provides a detailed survey of fundamental design approaches found in modern large-scale P2P systems highlighting design considerations for building and deploying scalable P2P applications. The survey includes unstructured P2P systems, content retrieval systems, communications structured P2P systems, flat structured P2P systems and finally Hierarchical Peer-to-Peer (HP2P) overlays. It concludes with a presentation of design tradeoffs and opportunities for future research into P2P overlay systems
Socially-Aware Distributed Hash Tables for Decentralized Online Social Networks
Many decentralized online social networks (DOSNs) have been proposed due to
an increase in awareness related to privacy and scalability issues in
centralized social networks. Such decentralized networks transfer processing
and storage functionalities from the service providers towards the end users.
DOSNs require individualistic implementation for services, (i.e., search,
information dissemination, storage, and publish/subscribe). However, many of
these services mostly perform social queries, where OSN users are interested in
accessing information of their friends. In our work, we design a socially-aware
distributed hash table (DHTs) for efficient implementation of DOSNs. In
particular, we propose a gossip-based algorithm to place users in a DHT, while
maximizing the social awareness among them. Through a set of experiments, we
show that our approach reduces the lookup latency by almost 30% and improves
the reliability of the communication by nearly 10% via trusted contacts.Comment: 10 pages, p2p 2015 conferenc
Large-Scale Distributed Coalition Formation
The CyberCraft project is an effort to construct a large scale Distributed Multi-Agent System (DMAS) to provide autonomous Cyberspace defense and mission assurance for the DoD. It employs a small but flexible agent structure that is dynamically reconfigurable to accommodate new tasks and policies. This document describes research into developing protocols and algorithms to ensure continued mission execution in a system of one million or more agents, focusing on protocols for coalition formation and Command and Control. It begins by building large-scale routing algorithms for a Hierarchical Peer to Peer structured overlay network, called Resource-Clustered Chord (RC-Chord). RC-Chord introduces the ability to efficiently locate agents by resources that agents possess. Combined with a task model defined for CyberCraft, this technology feeds into an algorithm that constructs task coalitions in a large-scale DMAS. Experiments reveal the flexibility and effectiveness of these concepts for achieving maximum work throughput in a simulated CyberCraft environment
Optimising Structured P2P Networks for Complex Queries
With network enabled consumer devices becoming increasingly popular, the number of connected devices and available services is growing considerably - with the number of connected devices es- timated to surpass 15 billion devices by 2015. In this increasingly large and dynamic environment it is important that users have a comprehensive, yet efficient, mechanism to discover services.
Many existing wide-area service discovery mechanisms are centralised and do not scale to large numbers of users. Additionally, centralised services suffer from issues such as a single point of failure, high maintenance costs, and difficulty of management. As such, this Thesis seeks a Peer to Peer (P2P) approach.
Distributed Hash Tables (DHTs) are well known for their high scalability, financially low barrier of entry, and ability to self manage. They can be used to provide not just a platform on which peers can offer and consume services, but also as a means for users to discover such services.
Traditionally DHTs provide a distributed key-value store, with no search functionality. In recent years many P2P systems have been proposed providing support for a sub-set of complex query types, such as keyword search, range queries, and semantic search.
This Thesis presents a novel algorithm for performing any type of complex query, from keyword search, to complex regular expressions, to full-text search, over any structured P2P overlay. This is achieved by efficiently broadcasting the search query, allowing each peer to process the query locally, and then efficiently routing responses back to the originating peer. Through experimentation, this technique is shown to be successful when the network is stable, however performance degrades under high levels of network churn.
To address the issue of network churn, this Thesis proposes a number of enhancements which can be made to existing P2P overlays in order to improve the performance of both the existing DHT and the proposed algorithm. Through two case studies these enhancements are shown to improve not only the performance of the proposed algorithm under churn, but also the performance of traditional lookup operations in these networks
A one hop overlay system for Mobile Ad Hoc Networks
Peer-to-Peer (P2P) overlays were initially proposed for use with wired networks.
However, the very rapid proliferation of wireless communication technology has
prompted a need for adoption of P2P systems in mobile networks too. There are
many common characteristics between P2P overlay networks and Mobile Ad-hoc
Networks (MANET). Self-organization, decentralization, a dynamic nature and
changing topology are the most commonly shared features. Furthermore, when
used together, the two approaches complement each other. P2P overlays provide
data storage/retrieval functionality and MANET provides wireless connectivity
between clients without depending on any pre-existing infrastructure. P2P overlay
networks can be deployed over MANET to address content discovery issues.
However, previous research has shown that deploying P2P systems straight over
MANET does not exhibit satisfactory performance. Bandwidth limitation, limited
resources and node mobility are some of the key constraints.
This thesis proposes a novel approach, OneHopOverlay4MANET, to exploit the
synergies between MANET and P2P overlays through cross-layering. It combines
Distributed Hash Table (DHT) based structured P2P overlays with MANET underlay
routing protocols to achieve one logical hop between any pair of overlay
nodes. OneHopOverlay4MANET constructs a cross-layer channel to permit direct
exchange of routing information between the Application layer, where the overlay
operates, and the MANET underlay layer. Consequently, underlay routing information
can be shared and used by the overlay. Thus, OneHopOverlay4MANET
reduces the typical management traffic when deploying traditional P2P systems
over MANET. Moreover, as a result of building one hop overlay, OneHopOverlay4MANET
can eliminate the mismatching issue between overlay and underlay
and hence resolve key lookups in a short time, enhancing the performance of the
overlay.
v
In this thesis, we present OneHopOverlay4MANET and evaluate its performance
when combined with different underlay routing protocols. OneHopOverlay4MANET
has been combined with two proactive underlays (OLSR and BATMAN)
and with three reactive underlay routing protocols (DSR, AODV and
DYMO). In addition, the performance of the proposed system over OLSR has
been compared to two recent structured P2P over MANET systems (MA-SP2P
and E-SP2P) that adopted OLSR as the routing protocol. The results show that
better performance can be achieved using OneHopOverlay4MANET
- …