Sciweavers

6 search results - page 1 / 2
» Peer counting and sampling in overlay networks: random walk ...
Sort
View
PODC
2006
ACM
13 years 11 months ago
Peer counting and sampling in overlay networks: random walk methods
Laurent Massoulié, Erwan Le Merrer, Anne-Ma...
TOCS
2008
107views more  TOCS 2008»
13 years 4 months ago
RaWMS - Random Walk Based Lightweight Membership Service for Wireless Ad Hoc Networks
RaWMS is a novel lightweight random membership service for ad hoc networks. The service provides each node with a partial uniformly chosen view of network nodes. Such a membership...
Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot
IMC
2006
ACM
13 years 11 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
P2P
2010
IEEE
207views Communications» more  P2P 2010»
13 years 3 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
SAC
2009
ACM
13 years 11 months ago
Prestige-based peer sampling service: interdisciplinary approach to secure gossip
The Peer Sampling Service (PSS) has been proposed as a method to initiate and maintain the set of connections between nodes in unstructured peer to peer (P2P) networks. The PSS us...
Gian Paolo Jesi, Edoardo Mollona, Srijith K. Nair,...