Automatic Discovery of Distributed Algorithms for Large-Scale Systems

In recent years, large-scale systems have become mainstream at a very high pace. Typical examples of large-scale systems are MANETs, Wireless Sensor Networks, Pervasive Computing, Swarm Robotics, etc. These systems distinguish them- selves by the large number of devices they embody, and emergent behaviors they exhibit: Behavior that is globally perceivable, but that is made up of only local interactions of the system elements. Because of the vast amount of devices that make up a large-scale system, it is infeasible to exhibit centralized control. As an alternative, we need to leverage distributed algorithms to create and control emergent behaviors for the global goal we want the system to exhibit. Since there is no linear mapping from local interactions to global behavior, we present a global-to-local compiler to automatically generate these distributed algorithms for large-scale systems. By using Genetic Programming to combine already known building blocks from other distributed algorithms, we provide a high-level, goal-driven framework for algorithm designers to design distributed algorithms. Evaluation shows that the framework we present is indeed a valuable tool for designing distributed algorithms for large-scale systems. Improving the develop- ment speed, allowing the designer to be agnostic to the underlying details, but nevertheless providing a flexible interface, to acquire the algorithm desired.

Subject

large-scale systems
global-to-local compiler
distributed systems
agent-based systems
netlogo
distributed algorithms
manet
pervasive computing
genetic programming
grammatical evolution
wireless sensor networks
swarm robotics

To reference this document use:

http://resolver.tudelft.nl/uuid:9b542aca-20fd-4bcf-a8f4-c0231e625404

Embargo date

2012-08-22

Part of collection

Student theses

Document type

master thesis

Rights

Files

PDF

Automatic_Discovery_of_Di ... Berkel.pdf

2.24 MB

Close viewer