Information security: Designing A stochastic-network for throughput and reliability

Naval Research Logistics

Volumn 56, Issue 7, 2009, Pages 625-641

  Schavland, Jeffrey ^a   Chan, Yupo ^b   Raines, Richard A ^c  

^a University of Arkansas at Little Rock ^*  (United States)

^b Air Force Institute of Technology ^*  (United States)

^c Air Force Institute of Technology   (United States)

Author keywords

Game theory; Mulicriteria decision making; Network security; Stochastic network

Indexed keywords

CAPACITY IMPROVEMENT; CRITICAL COMPONENT; GAME-THEORETIC MODEL; IN-NETWORK; INFORMATION AND COMMUNICATION NETWORKS; INFORMATION SECURITY; MONETARY VALUE; MULICRITERIA DECISION-MAKING; NATURAL DEGRADATION; NETWORK DESIGN; PERFORMANCE MEASURE; STOCHASTIC NETWORK; UNIT COST;

DECISION MAKING; DECISION THEORY; DESIGN; ELECTRIC INSULATORS; GAME THEORY; INTERNET; RELIABILITY;

NETWORK SECURITY;

EID: 70349592142     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20365     Document Type: Article

References (31)

1. M. O. Ball and J. S. Provan, Bounds on the reliability polynomial for shellable independence systems, SIAM J Algebraic Dis Methods 3 (1982), 166-181.
2. M. G. H. Bell, The use of game theory to measure the vulnerability of stochastic networks, IEEE Transactions on Reliability 52 (2003), 63-68.
3. D. Bienstock and G. Muratore, Strong inequalities for capacitated survivable network design problems, Math Program 89 (2001), 127-147.
4. Y. Chan, L. Jansen, W. Gaught, and S. Kissin, Singlecommodity multicriteria stochastic-networks: Improving reliability vs. throughput, Working paper, Department of Systems Engineering, University of Arkansas at Little Rock, Little Rock, Arkansas, 2006.
5. (Pubitemid 127827229) Y. Chan, E. Yam, and A. Marsh, Exact and approximate throughput to a stochastic network, IEEE Trans Reliabil 46 (1997), 473-486.
6. M. Chari and C. J. Colbourn, Reliability polynomials: A survey, J Combinatorics Info System Sci 22 (1997), 177-193.
7. M. K. Chari, T. A. Feo, and J. S. Provan, The Delta-Wye approximation procedure for two-terminal reliability, Oper Res 44 (1996), 745-757.
8. M. K. Chari and J. S. Provan, Calculating k-connectedness reliability using Steiner bounds, Math Oper Res 21 (1996), 905-921.
9. C. J. Colbourn, The combinatorics of network reliability, Oxford University Press, Oxford, 1987.
10. M. Combs, R. Laubenbacher, and A. Taha, An application of q-analysis as a tool for detecting and evaluating the presence of information warfare, Physical Science Laboratory, Report NMMP 97-02, New Mexico State University, Las Cruces, New Mexico, 1997.
11. (Pubitemid 126326485) F. R. Fernadez and J. Puerto, Vector linear programming in zero-sum multicriteria matrix games, J Optim Theory Appl 89 (1996), 115-127.
12. (Pubitemid 46498512) T. Gomes and J. Craveirinha, Efficient calculation of the most reliable pair of link disjoint paths in telecommunication networks, Eur J Oper Res 181 (2007), 1055-1064.
13. D. D. Harms, M. Kraetzl, C. J. Colbourn, and J. S. Devitt, Network reliability: Experiments with a symbolic algebra environment, CRC Press, Boca Raton, 1995.
14. C.-C. Hsieh and M.-H. Lin, Simple algorithms for updating multi-resource allocations in an unreliable flow network, Computers Ind Eng 50 (2006), 120-129.
15. (Pubitemid 40550041) K.-P. Hui, N. Bean, M. Kraetzl, and D. P. Kroese, The crossentropy method for network reliability estimation, Annal Oper Res 134 (2005), 101-118.
16. C. Humes, Linear programming derived functional bounds for closed queueing networks: A primal approach, Lect Appl Math 33 (1997), 139-162.
17. S. P. Jain and K. Gopal, A heuristic method of link reliability assignment for maximal reliability, Microelectron Reliab 30 (1990), 673-679.
18. (Pubitemid 23588327) H. Kalyoncu and B. Sankur, Estimation of survivability of communication network, Electron Lett 28 (1992), 1790-1791.
19. H. Karaa and J. Y. Lau, Game theory applications in network reliability, Proceedings of the 23rd Biennial Symposium on Communications, 2006, pp. 236-239.
20. E. Karasakal and M. Koksalan, Generating a representative subset of the nondominated frontier in multiple criteria decision making, Oper Res 57 (2009), 187-199.
21. (Pubitemid 127684746) P. Korhonen, S. Salo, and R. E. Steuer, A heuristic for estimating nadir criterion values in multiple objective linear programming, Oper Res 45 (1997), 751-757.
22. Y.-S. Lai, IMOST: Interactive multiple objective system technique, J Oper Res Soc 46 (1995), 958-976.
23. D. Lyle, Y. Chan, and E. Head, Improving information network performance: reliability vs. invulnerability, Trans Inst Ind Eng 31 (1999), 909-919.
24. Y. Y. Malashenko, V. S. Rogozhin, and Y. V. Ferapontov, Deterministic models for estimating vulnerability of networks, Soviet J Computer Systems Sci 27 (1989), 125-135.
25. (Pubitemid 129320701) C. Murat and V. T. Paschos, The probabilistic longest path problem, Networks 33 (1999), 207-219.
26. L. B. Page and J. E. Perry, Reliability of directed networks using the factoring theorem, IEEE Trans Reliab 36 (1989), 445-453.
27. (Pubitemid 43296626) A. R. Robinson, Y. Chan, and D. C. Dietz, Detecting a security disturbance in multi commodity stochastic networks, Telecommun Systems 31 (2006), 11-27.
28. M. Sengoku, S. Shinoda, and R. Yatsuboshi, On a function for the vulnerability of a directed flow network, Networks 18 (1988), 73-83.
29. R. Steuer, Multiple criteria optimization: Theory, computation, and application, Wiley, 1986.
30. (Pubitemid 351159542) J. Zhuang and V. M. Bier, Balancing terrorism and natural disastersdefensive strategy with endogenous attacker effort, Oper Res 55 (2007), 976-991.
31. A. Zolfaghari and F. J. Kaudel, Framework for network survivability performance, IEEE J Selected Areas Commun 12 (1994), 46-51.