Efficient heuristic algorithms for correcting the Cascade Vulnerability Problem for interconnected networks

Fotakis, D; Gritzalis, S

dc.contributor.author	Fotakis, D	en
dc.contributor.author	Gritzalis, S	en
dc.date.accessioned	2014-03-01T01:54:57Z
dc.date.available	2014-03-01T01:54:57Z
dc.date.issued	2006	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/27536
dc.subject	Combinatorial Algorithm	en
dc.subject	Experimental Evaluation	en
dc.subject	Genetic Algorithm	en
dc.subject	Heuristic Algorithm	en
dc.subject	Interconnection Network	en
dc.subject	Network Connectivity	en
dc.subject	Network Security	en
dc.subject	Secure System	en
dc.subject	System Approach	en
dc.subject	Trust Network	en
dc.subject	Vertex Cover	en
dc.title	Efficient heuristic algorithms for correcting the Cascade Vulnerability Problem for interconnected networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.comcom.2006.01.007	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.comcom.2006.01.007	en
heal.publicationDate	2006	en
heal.abstract	The Cascade Vulnerability Problem for interconnected networks is a potential problem faced when the interconnected accredited system approach of the Trusted Network Interpretation is used. It belongs to a subset of the problem set that addresses the issue of whether the composition of secure systems via a secure channel results in a secure network. The Cascade Vulnerability Problem appears when	en
heal.journalName	Computer Communications	en
dc.identifier.doi	10.1016/j.comcom.2006.01.007	en