Article ID: | iaor20023640 |
Country: | United States |
Volume: | 7 |
Issue: | 1 |
Start Page Number: | 69 |
End Page Number: | 77 |
Publication Date: | Jan 2002 |
Journal: | Military Operations Research |
Authors: | Deckro Richard F., Jackson Jack A., Kloeber Jack M., Leinart James A. |
Keywords: | networks |
Identifying network components, which when targeted will effectively disrupt a command, control, communication, and computer (C4) network, can be a difficult task. Since C4 networks can be very large, with components having many characteristics, it is important to have a sound method for evaluating and selecting targets to accomplish network disruption. In this effort James Leinart, Dick Deckro, Jack Kloeber and Jack Jackson present a methodology for suggesting targets to disrupt a C4 network. The method uses graph theory, value-focused thinking and decision analysis techniques. A vertex cut-set algorithm is applied on a transformation of the graph representing a notional C4 network. The mixed cut-sets generated represent potential target sets, which in turn are ranked according to decision maker preferences and the overall objectives for achieving a network disruption. A decision maker or planner can use the ranked list of potential target sets to nominate targets or can pare down the list and conduct more in-depth analysis.