By Topic

Data location optimization for a self-organized distributed storage system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hannes Mühleisen ; Networked Information Systems Group, Freie Universität Berlin, Germany ; Tilman Walther ; Robert Tolksdorf

Swarm-inspired algorithms allow the creation of complex systems that are scalable in many dimensions, adaptable to changing conditions, and robust against failure. These properties make them suitable for the challenges inherent in distributed storage systems. However, these swarm-based approaches reach their impressive performance by trading away correctness guarantees, occasionally leading to misplaced data items. In order to achieve consistent storage, there is a need for a constant optimization of the store's data structure. In this paper, we describe a fully distributed and scalable heuristic for the optimization of the location of stored data items within a distributed storage system based on the brood sorting method used by ants. We evaluate our heuristic using best- and worst-case test data sets to determine whether our location optimization method converges and whether it improves the location and organization of data inside a large-scale storage network.

Published in:

Nature and Biologically Inspired Computing (NaBIC), 2011 Third World Congress on

Date of Conference:

19-21 Oct. 2011