Sciweavers

18 search results - page 2 / 4
» Uniform Sampling for Directed P2P Networks
Sort
View
HIPC
2007
Springer
13 years 10 months ago
Distributed Ranked Search
P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necess...
Vijay Gopalakrishnan, Ruggero Morselli, Bobby Bhat...
TC
2008
13 years 4 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
INFOCOM
2005
IEEE
13 years 10 months ago
Distributed, secure load balancing with skew, heterogeneity and churn
— Numerous proposals exist for load balancing in peer-to-peer (p2p) networks. Some focus on namespace balancing, making the distance between nodes as uniform as possible. This te...
Jonathan Ledlie, Margo I. Seltzer
SIGCOMM
2010
ACM
13 years 4 months ago
Unbiased sampling in directed social graph
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...
Tianyi Wang, Yang Chen, Zengbin Zhang, Peng Sun, B...
RSA
2008
123views more  RSA 2008»
13 years 4 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang