153 search results - page 12 / 31 » Towards Scalable Mobility in Distributed Hash Tables |
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
SERSCISA
2009
Springer
15 years 6 months ago
2009
Springer
Node lookup mechanisms constitute an integral part of any overlay network, and hence also of anonymous communication networks. Today, most anonymizers use centralized directories, ...
128
click to vote
PERCOM
2004
ACM
15 years 11 months ago
2004
ACM
In mobile ad hoc networks, nodes interact peer-to-peer. They self-organize, share workloads and provide services that they also use. There are middleware platforms, designed for t...
P2P
2003
IEEE
15 years 5 months ago
2003
IEEE
Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures fo...
101
click to vote
NORDSEC
2009
Springer
15 years 6 months ago
2009
Springer
In our paper, we analyze possibilities to generate true random data in mobile devices such as mobile phones or pocket computers. We show how to extract arguably true random data w...