Sciweavers

121 search results - page 7 / 25
» Distributed Construction of Random Expander Networks
Sort
View
SPAA
2003
ACM
15 years 2 months ago
A practical algorithm for constructing oblivious routing schemes
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
Marcin Bienkowski, Miroslaw Korzeniowski, Harald R...
INFOCOM
2012
IEEE
13 years 1 days ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
ICPP
2005
IEEE
15 years 3 months ago
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...
Haiying Shen, Cheng-Zhong Xu
TC
2008
14 years 9 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
74
Voted
TOCS
2008
107views more  TOCS 2008»
14 years 9 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