Resource location based on precomputed partial random walks in dynamic networks
Impacto
![Google Scholar](/xmlui/themes/Mirage2/images/uji/logo_google.png)
![Microsoft Academico](/xmlui/themes/Mirage2/images/uji/logo_microsoft.png)
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7038
comunitat-uji-handle3:10234/8634
comunitat-uji-handle4:
INVESTIGACIONEste recurso está restringido
http://dx.doi.org/10.1016/j.comnet.2016.04.008 |
Metadatos
Título
Resource location based on precomputed partial random walks in dynamic networksFecha de publicación
2016Editor
ElsevierISSN
1389-1286Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
http://www.sciencedirect.com/science/article/pii/S1389128616301062Palabras clave / Materias
Resumen
The problem of finding a resource residing in a network node (the resource location problem) is a challenge
in complex networks due to aspects as network size, unknown network topology, and network
dynamics. The ... [+]
The problem of finding a resource residing in a network node (the resource location problem) is a challenge
in complex networks due to aspects as network size, unknown network topology, and network
dynamics. The problem is especially difficult if no requirements on the resource placement strategy or
the network structure are to be imposed, assuming of course that keeping centralized resource information
is not feasible or appropriate. Under these conditions, random algorithms are useful to search the
network. A possible strategy for static networks, proposed in previous work, uses short random walks
precomputed at each network node as partial walks to construct longer random walks with associated
resource information. In this work, we adapt the previous mechanisms to dynamic networks, where resource
instances may appear in, and disappear from, network nodes, and the nodes themselves may leave
and join the network, resembling realistic scenarios. We analyze the resulting resource location mechanisms,
providing expressions that accurately predict average search lengths, which are validated using
simulation experiments. Reduction of average search lengths compared to simple random walk searches
are found to be very large, even in the face of high network volatility. We also study the cost of the
mechanisms, focusing on the overhead implied by the periodic recomputation of partial walks to refresh
the information on resources, concluding that the proposed mechanisms behave efficiently and robustly
in dynamic networks. [-]
Publicado en
Computer Networks 103 (2016) 165–180Derechos de acceso
© 2016 Published by Elsevier B.V.
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
Aparece en las colecciones
- LSI_Articles [362]