FASHION: Functional and Attack Graph Secured HybrId Optimization of Virtualized Networks

Maintaining a resilient computer network is a delicate task with conflicting priorities. Flows should be served while controlling risk due to attackers. Upon publication of a vulnerability, administrators scramble to manually mitigate risk while waiting for a patch. We introduce <inline-formula><tex-math notation="LaTeX">$\textsc {Fashion}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>F</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="fuller-ieq1-3198843.gif"/></alternatives></inline-formula>: a linear optimizer that balances routing flows with the security risk posed by these flows. <inline-formula><tex-math notation="LaTeX">$\textsc {Fashion}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>F</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="fuller-ieq2-3198843.gif"/></alternatives></inline-formula> formalizes routing as a multi-commodity flow problem with side-constraints. <inline-formula><tex-math notation="LaTeX">$\textsc {Fashion}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>F</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="fuller-ieq3-3198843.gif"/></alternatives></inline-formula> formulates security using two approximations of risk in a probabilistic attack graph (Frigault et al. Network Security Metrics 2017). <inline-formula><tex-math notation="LaTeX">$\textsc {Fashion}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>F</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="fuller-ieq4-3198843.gif"/></alternatives></inline-formula>'s output is a set of software-defined networking rules consumable by Frenetic (Foster et al. ICFP 2011). We introduce a topology generation tool that creates data center network instances including flows and vulnerabilities. <inline-formula><tex-math notation="LaTeX">$\textsc {Fashion}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>F</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="fuller-ieq5-3198843.gif"/></alternatives></inline-formula> is executed on instances of up to 600 devices, thousands of flows, and million edge attack graphs. Solve time averages 30 minutes on the largest instances (seconds on the smallest instances). To ensure the security objective is accurate, the output solution is assessed using risk as defined by Frigault et al. <inline-formula><tex-math notation="LaTeX">$\textsc {Fashion}$</tex-math><alternatives><mml:math><mml:mrow><mml:mi>F</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>h</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:math><inline-graphic xlink:href="fuller-ieq6-3198843.gif"/></alternatives></inline-formula> allows enterprises to reconfigure their network in response to changes in functionality or security requirements.