Node sampling using random centrifugal walks

Sevilla de Pablo, Andrés and Mozo Velasco, Bonifacio Alberto and Fernández Anta, Antonio (2012). Node sampling using random centrifugal walks. In: "16th International Conference On Principles of Distributed Systems (OPODIS 2012)- December 17th-20th", 17/12/2012 - 20/12/2012, Roma, Italia. ISBN 978-3-642-35475-5. pp. 300-314. https://doi.org/10.1007/978-3-642-35476-2_21.

Description

Title: Node sampling using random centrifugal walks
Author/s:
  • Sevilla de Pablo, Andrés
  • Mozo Velasco, Bonifacio Alberto
  • Fernández Anta, Antonio
Item Type: Presentation at Congress or Conference (Article)
Event Title: 16th International Conference On Principles of Distributed Systems (OPODIS 2012)- December 17th-20th
Event Dates: 17/12/2012 - 20/12/2012
Event Location: Roma, Italia
Title of Book: Principles of Distributed Systems
Date: 2012
ISBN: 978-3-642-35475-5
Volume: Lectur
Subjects:
Faculty: E.U. de Informática (UPM)
Department: Informática Aplicada [hasta 2014]
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB)

Abstract

Sampling a network with a given probability distribution has been identified as a useful operation. In this paper we propose distributed algorithms for sampling networks, so that nodes are selected by a special node, called the source, with a given probability distribution. All these algorithms are based on a new class of random walks, that we call Random Centrifugal Walks (RCW). A RCW is a random walk that starts at the source and always moves away from it. Firstly, an algorithm to sample any connected network using RCW is proposed. The algorithm assumes that each node has a weight, so that the sampling process must select a node with a probability proportional to its weight. This algorithm requires a preprocessing phase before the sampling of nodes. In particular, a minimum diameter spanning tree (MDST) is created in the network, and then nodes weights are efficiently aggregated using the tree. The good news are that the preprocessing is done only once, regardless of the number of sources and the number of samples taken from the network. After that, every sample is done with a RCW whose length is bounded by the network diameter. Secondly, RCW algorithms that do not require preprocessing are proposed for grids and networks with regular concentric connectivity, for the case when the probability of selecting a node is a function of its distance to the source. The key features of the RCW algorithms (unlike previous Markovian approaches) are that (1) they do not need to warm-up (stabilize), (2) the sampling always finishes in a number of hops bounded by the network diameter, and (3) it selects a node with the exact probability distribution.

More information

Item ID: 20806
DC Identifier: http://oa.upm.es/20806/
OAI Identifier: oai:oa.upm.es:20806
DOI: 10.1007/978-3-642-35476-2_21
Official URL: http://opodis2012.dis.uniroma1.it/
Deposited by: Memoria Investigacion
Deposited on: 27 Sep 2013 17:39
Last Modified: 22 Sep 2014 11:21
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM