100 search results - page 17 / 20 » Foundations of Attack-Defense Trees |
83
Voted
PAM
2007
Springer
15 years 3 months ago
2007
Springer
The DNS root nameservers routinely use anycast in order to improve their service to clients and increase their resilience against various types of failures. We study DNS traffic co...
92
Voted
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
SIGCOMM
2004
ACM
15 years 2 months ago
2004
ACM
We present a Scalable Distributed Information Management System (SDIMS) that aggregates information about large-scale networked systems and that can serve as a basic building bloc...
86
Voted
COMPGEOM
2003
ACM
15 years 2 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
100
click to vote
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...