Robust patrol strategies against attacks at dispersed heterogeneous locations

McGrath, Richard G.; Lin, Kyle Y.

doi:10.1504/ijor.2017.087276

Cited by 5 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Now, once we have determined the membership of each node to exactly 2 rings, the ring can be wired in 12 different ways, as shown in Table 1. This is true for each of the 10 rings, which increases the number of combinations by a factor of 12 10 .…”

Section: Maximally Hop-separated Nodes In Generalized Network Ringsmentioning

confidence: 99%

“…Those challenges include the cost of the resources necessary to support volume packet inspection and the mere fact that the DoS attack is just being redirected to another node, albeit one that is better prepared to handle the load . While techniques to address the scalability challenge have been proposed, only a few solutions seek to exploit topological characteristics, and those solutions are focused on the heterogeneous characteristics of static target nodes …”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Managing risk in high assurance systems by optimizing topological resources

Hyden

McGrath

Moskowitz

et al. 2017

J Software Evolu Process

Self Cite

View full text Add to dashboard Cite

We explore strategies for manipulating the topology of a network to promote increased and pragmatic high assurance systems. Topology matters to network threats and security, and the relative distance between nodes can impact the rate of dispersion of viruses, as well as access times in denial of service, probing, and insider threat attacks. We suggest methods to separate threatening and threatened nodes with enough hops to reduce and degrade risks. This work provides network analysts with an option to include other measures such as risk assessments to the construction and management of high assurance systems. We consider a scaled down model to demonstrate the proof of concept using artificial data. Specifically, we explore the efficacy of ring networks and the structure that occurs on k‐hop networks when there are a prime number of nodes. We introduce techniques for the randomization of network topologies to manage real‐time risk and provide a dynamic means to improve network security by increasing technical debt to a potential attacker.

show abstract

Section: Maximally Hop-separated Nodes In Generalized Network Ringsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%