Sciweavers

153 search results - page 23 / 31
» Randomized Decentralized Broadcasting Algorithms
Sort
View
SRDS
2003
IEEE
15 years 2 months ago
Autonomous Replication for High Availability in Unstructured P2P Systems
We consider the problem of increasing the availability of shared data in peer-to-peer (P2P) systems so that users can access any content, regardless of the current subset of onlin...
Francisco Matias Cuenca-Acuna, Richard P. Martin, ...
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
14 years 11 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
WAW
2007
Springer
157views Algorithms» more  WAW 2007»
15 years 3 months ago
Stochastic Kronecker Graphs
A random graph model based on Kronecker products of probability matrices has been recently proposed as a generative model for large-scale real-world networks such as the web. This...
Mohammad Mahdian, Ying Xu 0002
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 1 months ago
Navigating Low-Dimensional and Hierarchical Population Networks
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
Ravi Kumar, David Liben-Nowell, Andrew Tomkins
MOBIHOC
2012
ACM
12 years 12 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn