### Skapa referens, olika format (klipp och klistra)

**Harvard**

Sohier, D., Georgiadis, G., Claviere, S., Papatriantafilou, M. och Bui, A. (2012) *Physarum-inspired self-biased walkers for distributed clustering*.

** BibTeX **

@conference{

Sohier2012,

author={Sohier, Devan and Georgiadis, Giorgos and Claviere, Simon and Papatriantafilou, Marina and Bui, Alain},

title={Physarum-inspired self-biased walkers for distributed clustering},

booktitle={16th International Conference On Principles Of Distributed Systems (OPODIS2012)},

abstract={We propose a distributed scheme to compute distance-based
clusters. We first present a mechanism based on the
ow of distributed tokens called walkers, circulating randomly between a source and a sink to compute a shortest path. Each time a walker takes an edge, it reinforces
the probability that subsequent walkers take it. This mechanism is a discrete emulation of the slime mould (Physarum polycephalum) dynamics presented in [16]: each node observes the flow of walkers going through each adjacent edge and uses this flow to compute the probabilities with which it sends the walkers through each edge. Then, based on this mechanism, we show how several sources compute a shortest path DAG to a given sink. Finally, given some clusterheads acting like sinks, we show that this process converges to distance-based clusters (i.e. nodes join the clusterhead to which they are closest) with shortest-path DAGs. The algorithm is designed with a special focus on dynamic networks: the flow locally adapts to the appearance and disappearance of links and nodes, including clusterheads.},

year={2012},

}

** RefWorks **

RT Conference Proceedings

SR Print

ID 170867

A1 Sohier, Devan

A1 Georgiadis, Giorgos

A1 Claviere, Simon

A1 Papatriantafilou, Marina

A1 Bui, Alain

T1 Physarum-inspired self-biased walkers for distributed clustering

YR 2012

T2 16th International Conference On Principles Of Distributed Systems (OPODIS2012)

AB We propose a distributed scheme to compute distance-based
clusters. We first present a mechanism based on the
ow of distributed tokens called walkers, circulating randomly between a source and a sink to compute a shortest path. Each time a walker takes an edge, it reinforces
the probability that subsequent walkers take it. This mechanism is a discrete emulation of the slime mould (Physarum polycephalum) dynamics presented in [16]: each node observes the flow of walkers going through each adjacent edge and uses this flow to compute the probabilities with which it sends the walkers through each edge. Then, based on this mechanism, we show how several sources compute a shortest path DAG to a given sink. Finally, given some clusterheads acting like sinks, we show that this process converges to distance-based clusters (i.e. nodes join the clusterhead to which they are closest) with shortest-path DAGs. The algorithm is designed with a special focus on dynamic networks: the flow locally adapts to the appearance and disappearance of links and nodes, including clusterheads.

LA eng

OL 30