111 search results - page 4 / 23 » Minimum-cost network hardening using attack graphs |
ACSAC
2005
IEEE
14 years 19 days ago
2005
IEEE
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
WSC
2004
13 years 8 months ago
2004
Supervisory Control And Data Acquisition (SCADA) systems gather and analyze data for real-time control. SCADA systems are used extensively, in applications such as electrical powe...
ENTCS
2007
13 years 6 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
—One key adaptation mechanism often deployed in networking and computing systems is dynamic load balancing. The goal from employing dynamic load balancers is to ensure that the o...
NETWORKS
2008
13 years 7 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...