Title :
On the shortest path to network security
Author :
Fitch, John A., III ; Hoffman, Lance J.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., George Washington Univ., Washington, DC, USA
Abstract :
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
Keywords :
computer networks; operations research; security of data; computer security; network security; network security model; resource constrained; risk analysis; security evaluation; security model; security of computer networks; shortest path; Cities and towns; Computer networks; Computer security; Cost function; Mathematical model; Open systems; Operations research; Polynomials; Risk analysis; Shortest path problem;
Conference_Titel :
Computer Security Applications Conference, 1993. Proceedings., Ninth Annual
Conference_Location :
Orlando, FL
Print_ISBN :
0-8186-4330-7
DOI :
10.1109/CSAC.1993.315443