121 search results - page 23 / 25 » Distributed Construction of Random Expander Networks |
DEBS
2007
ACM
15 years 1 months ago
2007
ACM
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
CCR
2005
14 years 9 months ago
2005
There exist a wide variety of network design problems that require a traffic matrix as input in order to carry out performance evaluation. The research community has not had at it...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
117
Voted
MOBIHOC
2001
ACM
15 years 9 months ago
2001
ACM
A Bluetooth ad hoc network can be formed by interconnecting piconets into scatternets. The constraints and properties of Bluetooth scatternets present special challenges in formin...
100
click to vote
CCS
2010
ACM
14 years 9 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...