2427 search results - page 187 / 486 » Survivability Computation of Networked Information Systems |
169
click to vote
CCGRID
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
180
click to vote
MOBISYS
2004
ACM
16 years 6 months ago
2004
ACM
The amount of personal digital media is increasing, and managing it has become a pressing problem. Effective management of media content is not possible without content-related me...
176
click to vote
POLICY
2001
Springer
15 years 11 months ago
2001
Springer
To control complicated and decomposable networking functions, such as Diffserv, two or more policies must cooperate. Combining two or more mutually dependent policies for a specifi...
198
click to vote
SASN
2003
ACM
15 years 12 months ago
2003
ACM
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
199
click to vote
CCS
2010
ACM
15 years 6 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...