Hasslinger, Gerhard and Kempken, Sebastian (2010) Efficiency of random walks for search in different network structures. In: 1st International ICST Workshop on Tools for solving Structured Markov Chains.
![[thumbnail of 8306.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "8306.pdf")
PDF
8306.pdf
Download (191kB)
Abstract
Dynamic overlay networks on the Internet as well as ad hoc networks often rely on self-organizing distributed communication and construction techniques. When there are no central management facilities and search indices available, flooding is a standard method to collect knowledge about the network
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 08:45 |
| Last Modified: | 18 Apr 2026 06:30 |
| URI: | http://eprints.eai.eu/id/eprint/949 |
Actions (login required)
- View Item