Self-Chord: A Bio-Inspired P2P Framework for Self-Organizing Distributed Systems

@article{Forestiero2010SelfChordAB,
  title={Self-Chord: A Bio-Inspired P2P Framework for Self-Organizing Distributed Systems},
  author={Agostino Forestiero and Emilio Leonardi and Carlo Mastroianni and Michela Meo},
  journal={IEEE/ACM Transactions on Networking},
  year={2010},
  volume={18},
  pages={1651-1664}
}
This paper presents “Self-Chord,” a peer-to-peer (P2P) system that inherits the ability of Chord-like structured systems for the construction and maintenance of an overlay of peers, but features enhanced functionalities deriving from ant-inspired algorithms, such as autonomous behavior, self-organization, and capacity to adapt to a changing environment. As opposed to the structured P2P systems deployed so far, resource indexing and placement is uncorrelated with network structure and topology… 

A self-organizing P2P system with multi-dimensional structure

This paper presents and analyzes Self-CAN, a self-organizing P2P system that, while relying on the multi-dimensional structured organization of peers provided by CAN, exploits the operations of

Bio-Inspired P2P Systems: The Case of Multidimensional Overlay

TLDR
The approach allows peer indexes and resource keys to be defined on different and independent spaces, so that it overcomes the main limitation of standard structured P2P systems, that is, the need to assign each key to a peer having a specified index.

A Self-organizing P2P Architecture for Indexing and Searching Distributed XML Documents

TLDR
X-Pastry is a peer-to-peer system that, maintaining the tree-based overlay of Pastry, exhibits enhanced functionalities thanks to the activity of ant-inspired mobile agents, and its performance when it is used to index and search a large and distributed collection of XML documents is evaluated.

On Possible Connections between Ant Algorithms and Random Matrix Theory

TLDR
This paper reports on a conjecture concerning the statistical behavior of SelfChord, a self-organizing P2P system in which the resource keys are dynamically sorted with an ant algorithm, and it emerged that the statistical distribution of the peer centroids is very similar to the eigenvalues of random matrices taken from the GUE, Gaussian Unitary Ensemble.

A self-organizing P2P framework for collective service discovery

SPIDER: A Bio-inspired Structured Peer-to-Peer Overlay for Data Dissemination

TLDR
SPIDER is presented, a new Peer-to-Peer structured overlay based on a natural structure of a spider web and some possible uses cases for crowd management using data dissemination.

A Self-adaptive Algorithm for Topology Matching in Unstructured Peer-to-Peer Networks

TLDR
A topology matching algorithm that uses learning automata to adapt the neighborhood radius and an adaptation mechanism inspired from the Schelling segregation model to manage the execution of the local operator is proposed and results have shown that the proposed algorithm outperforms the existing algorithms with respect to end-to-end delay and number of mismatched paths.

The grid, the load and the gradient

TLDR
A fully distributed load balancing mechanism, called ozmos, which aims at increasing the efficiency of distributed computing systems through peer-to-peer interaction between nodes, and employs ant-like agents to spread information about the current load on each node.

A New CR-Chord Based P2P Protocol in the Presence of Malicious Nodes

TLDR
Half Cyclic Routing Chord (HCR-Chord) algorithm, taking into account the security gaps in structured peer-to-peer (P2P) networks, and subsequent queries are made over these secure nodes enabled P2P network to operate more robust.

Decentralized resource discovery mechanisms for distributed computing in peer-to-peer environments

TLDR
This paper classifies a number of resource discovery mechanisms, mainly based on peer-to-peer techniques, according to criteria like their topology and the degree of achievement of various common requirements of great importance for the targeted environments, as well as compare their reported performance.

References

SHOWING 1-10 OF 37 REFERENCES

Self-Chord: A Bio-inspired Algorithm for Structured P2P Systems

TLDR
Self-Chord inherits the ability of Chord-like structured systems for the construction and maintenance of an overlay of peers, but features enhanced functionalities deriving from the activity of ant-inspired mobile agents, such as autonomy behavior, self-organization and capacity to adapt to a changing environment.

Designing an information system for Grids: Comparing hierarchical, decentralized P2P and super-peer models

Chord: A scalable peer-to-peer lookup service for internet applications

TLDR
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.

The organic grid: self-organizing computation on a peer-to-peer network

TLDR
This work proposes a biologically inspired and fully-decentralized approach to the organization of computation that is based on the autonomous scheduling of strongly mobile agents on a peer-to-peer network and demonstrates this concept with a reduced-scale proof-of-concept implementation that executes a data-intensive independent-task application on a set of heterogeneous, geographically distributed machines.

Scalable, efficient range queries for grid information services

  • A. AndrzejakZhichen Xu
  • Computer Science
    Proceedings. Second International Conference on Peer-to-Peer Computing,
  • 2002
TLDR
This work proposes a CAN-based extension of a DHT-functionality for distributed storing of pairs which complements current solutions such as MDS-2 by adding self-organization, fault-tolerance and an ability to efficiently handle dynamic attributes, such as server processing capacity.

A Swarm Algorithm for a Self-Structured P2P Information System

TLDR
Performance analysis proves that ant operations allow the information system to be efficiently reorganized, thus improving the efficacy of both simple and range queries, which is a beneficial feature typical of structured systems.

From P2P to Web Services and Grids - Peers in a Client/Server World

  • I. Taylor
  • Computer Science
    Computer Communications and Networks
  • 2005
TLDR
A resulting taxonomy is created giving a context in which to consider the most advanced and broad ranging distributed systems available today, and provides an essential reference text for designing new distributed systems.

A survey of peer-to-peer content distribution technologies

TLDR
This survey proposes a framework for analyzing peer-to-peer content distribution technologies and focuses on nonfunctional characteristics such as security, scalability, performance, fairness, and resource management potential, and examines the way in which these characteristics are reflected in and affected by the architectural design decisions adopted by current peer- to-peer systems.

A new class of nature-inspired algorithms for self-adaptive peer-to-peer computing

TLDR
A set of techniques to translate discrete sequence equations into new p2p protocols called sequence protocols, derived from sequence equations modeling adaptive bee foraging behavior in nature, and a new self-adaptive Grid computing protocol called HoneyAdapt are presented.

So-Grid: A self-organizing Grid featuring bio-inspired algorithms

TLDR
So-Grid is presented, a set of bio-inspired algorithms tailored to the decentralized construction of a Grid information system that features adaptive and self-organization characteristics that make it useful for a dynamic and partially unreliable distributed system.