Emergent Sorting in Networks of Router Agents

Alexander Scheidler, Christian Blum, Daniel Merkle, Martin Middendorf

Research output: Contribution to journalConference articleResearchpeer-review

Abstract

In this paper we study basic properties of so called Emergent Sorting Networks. These are directed networks which consist of router agents and buffer sites that are located between every two neighbouring agents. The agents can move objects from their input buffer sites to their output buffers. It is assumed that the objects may differ in type and are inserted randomly at an input agent. Brueckner (2000) presented a set of simple local policies for the agents which lead to a sorted outflow (batches of objects of the same type) of the objects out of an output agent. In this paper we introduce a pheromone based variant of the routing policies. The different policies are studied on quadratic and linear network topologies in terms of sorting performance and fairness.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Pages (from-to)299-306
ISSN0302-9743
Publication statusPublished - 2008
Event6th International Conference on Ant Colony Optimization and Swarm Intelligence (ANTS 2008) - Brussels, Belgium
Duration: 24. Aug 2010 → …

Conference

Conference6th International Conference on Ant Colony Optimization and Swarm Intelligence (ANTS 2008)
CountryBelgium
CityBrussels
Period24/08/2010 → …

    Fingerprint

Cite this

Scheidler, A., Blum, C., Merkle, D., & Middendorf, M. (2008). Emergent Sorting in Networks of Router Agents. Lecture Notes in Computer Science, 299-306.