Name
Abstract | ||
|---|---|---|
We study the use of local heuristics to determine spanning subgraphs for use in the dissemination of information in complex networks. We introduce two different heuristics and analyze their behavior in giving rise to spanning subgraphs that perform well in terms of allowing every node of the network to be reached, of requiting relatively few messages and small node bandwidth for information dissemination, and also of stretching paths with respect to the underlying network only modestly. We contribute a detailed mathematical analysis of one of the heuristics and provide extensive simulation results on random graphs for both of them. These results indicate that, within certain limits, spanning subgraphs are indeed expected to emerge that perform well in respect to all requirements. We also discuss the spanning subgraphs' inherent resilience to failures and adaptability to topological changes. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.tcs.2005.12.007 | Theoretical Computer Science - Complex networks |
Keywords | DocType | Volume |
information dissemination,spanning subgraphs.,inherent resilience,extensive simulation result,underlying network,local heuristics,different heuristics,small node bandwidth,detailed mathematical analysis,certain limit,complex networks,spanning subgraphs,complex network | Journal | 355 |
Issue | ISSN | Citations |
1 | Theoretical Computer Science 355 (2006), 80-95 | 0 |
PageRank | References | Authors |
0.34 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandre O. Stauffer | 1 | 130 | 11.34 |
| Valmir C. Barbosa | 2 | 350 | 56.76 |