Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
EDCC-1 Proceedings of the First European Dependable Computing Conference on Dependable Computing
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Anthill: A Framework for the Development of Agent-Based Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Coordination without communication: the case of the flocking problem
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Search for Compromise Solutions in Multiobjective State Space Graphs
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Pond: the oceanstore prototype
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
| Hi-index | 0.00 |
In this paper, we present the design of a robust decentralized peer-to-peer (P2P) platform for data storage. We use Fragmentation Redundancy and Scattering (FRS) mechanism on a file to provide fault tolerance capability, and information availability. To build a fully decentralized system, we consider each fragment of information as an autonomous bio-inspired agent capable to choose his own place of storage (to move from a peer to another peer). To reconstruct a file we have to gather a subset of fragments (defined by a minimal threshold to reconstruct the entire document), thus we have implemented flocking rules to maintain a swarm of fragments. These simple local rules allows us to find just one fragment to steer the whole flock towards a peer in the network. Another issue is the use of all network capabilities. We show in this paper how the flock mobility (based on pheromones) can provide the load distribution, while avoiding suspicious peers.