On the shortest path to network security

The resource constrained shortest path model is a general framework for evaluating and understanding the security of computer networks. This paper derives the model from established computer security and risk analysis principles to provide an informal proof that a network security model based on the resource constrained shortest path is "correct". Thus the resource constrained shortest path concept is a general strategy that can be used to describe and evaluate a large set of computer network security problems. Furthermore, the resource constrained shortest path problem has received extensive study in operations research, so specific model instances can be described mathematically.<<ETX>>