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

**Harvard**

Sandberg, O. (2006) *Distributed Routing in Small-World Networks*.

** BibTeX **

@conference{

Sandberg2006,

author={Sandberg, Oskar},

title={Distributed Routing in Small-World Networks},

booktitle={Proceedings of the 8th Workshop on Algorithm Engineering and Experiments/3rd Workshop on Analytic Algorithms and Combinatorics Miami, FL, JAN 21, 2006},

isbn={978-0-89871-610-8 },

pages={144-155},

abstract={So called small-world networks clustered networks with small diameters are thought to be prevalent in nature, especially appearing in people's social interactions. Many models exist for this phenomenon, with some of the most recent explaining how it is possible to find short routes between nodes in such networks. Searching for such routes, however, always depends on nodes knowing what their and their neighbors positions are relative to the destination. In real applications where one may wish to search a small-world network, such as peer-to-peer computer networks, this cannot always be assumed to be true. We propose and explore a method of routing that does not depend on such knowledge, and which can be implemented in a completely distributed way without any global elements. The Markov Chain Monte-Carlo based algorithm takes only a graph as input, and requires no further information about the nodes themselves. The proposed method is tested against simulated and real world data.},

year={2006},

}

** RefWorks **

RT Conference Proceedings

SR Print

ID 140979

A1 Sandberg, Oskar

T1 Distributed Routing in Small-World Networks

YR 2006

T2 Proceedings of the 8th Workshop on Algorithm Engineering and Experiments/3rd Workshop on Analytic Algorithms and Combinatorics Miami, FL, JAN 21, 2006

SN 978-0-89871-610-8

SP 144

OP 155

AB So called small-world networks clustered networks with small diameters are thought to be prevalent in nature, especially appearing in people's social interactions. Many models exist for this phenomenon, with some of the most recent explaining how it is possible to find short routes between nodes in such networks. Searching for such routes, however, always depends on nodes knowing what their and their neighbors positions are relative to the destination. In real applications where one may wish to search a small-world network, such as peer-to-peer computer networks, this cannot always be assumed to be true. We propose and explore a method of routing that does not depend on such knowledge, and which can be implemented in a completely distributed way without any global elements. The Markov Chain Monte-Carlo based algorithm takes only a graph as input, and requires no further information about the nodes themselves. The proposed method is tested against simulated and real world data.

LA eng

OL 30