z-logo
Premium
Information security: Designing a stochastic‐network for throughput and reliability
Author(s) -
Schavland Jeffrey,
Chan Yupo,
Raines Richard A.
Publication year - 2009
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.20365
Subject(s) - reliability (semiconductor) , computer science , throughput , adversarial system , adversary , nash equilibrium , computer security , game theory , value (mathematics) , operations research , reliability engineering , mathematical optimization , artificial intelligence , economics , engineering , mathematics , microeconomics , telecommunications , power (physics) , quantum mechanics , machine learning , wireless , physics
Todas information and communication network requires a design that is secure to tampering. Traditional performance measures of reliability and throughput must be supplemented with measures of security. Recognition of an adversary who can inflict damage leads toward a game‐theoretic model. Through such a formulation, guidelines for network designs and improvements are derived. We opt for a design that is most robust to withstand both natural degradation and adversarial attacks. Extensive computational experience with such a model suggests that a Nash‐equilibrium design exists that can withstand the worst possible damage. Most important, the equilibrium is value‐free in that it is stable irrespective of the unit costs associated with reliability vs. capacity improvement and how one wishes to trade between throughput and reliability. This finding helps to pinpoint the most critical components in network design. From a policy standpoint, the model also allows the monetary value of information‐security to be imputed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here