Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity
暂无分享,去创建一个
[1] Hans J. Herrmann,et al. Onion-like network topology enhances robustness against malicious attacks , 2011 .
[2] Jean C. Walrand,et al. How to Choose Communication Links in an Adversarial Environment? , 2011, GAMENETS.
[3] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[4] James J. Filliben,et al. Predicting Macroscopic Dynamics in Large Distributed Systems | NIST , 2011 .
[5] Alan T. Murray,et al. Comparative Approaches for Assessing Network Vulnerability , 2008 .
[6] K. L. Mills,et al. PREDICTING MACROSCOPIC DYNAMICS IN LARGE DISTRIBUTED SYSTEMS , 2011 .
[7] Assane Gueye,et al. A Game Theoretical Approach to Communication Security , 2011 .
[8] Anthony H. Dekker,et al. Network Robustness and Graph Topology , 2004, ACSC.
[9] Satyajayant Misra,et al. Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[10] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[11] Beom Jun Kim,et al. Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.
[12] Aron Laszka,et al. Quantifying all-to-one network topology robustness under budget constraints , 2014, PERV.
[13] Vladimir Marbukh,et al. A Game-Theoretic Framework for Network Security Vulnerability Assessment and Mitigation , 2012, GameSec.
[14] Hans J. Herrmann,et al. Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.
[15] Aron Laszka,et al. Quantifying Network Topology Robustness under Budget Constraints: General Model and Computational Complexity , 2013, GameSec.
[16] S. Havlin,et al. Optimization of network robustness to waves of targeted and random attacks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[17] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[18] Ernesto Estrada,et al. Network robustness to targeted attacks. The interplay of expansibility and degree distribution , 2006 .
[19] Albert-László Barabási,et al. Error and attack tolerance of complex networks , 2000, Nature.
[20] William H. Cunningham,et al. Optimal attack and reinforcement of a network , 1985, JACM.
[21] Cohen,et al. Resilience of the internet to random breakdowns , 2000, Physical review letters.
[22] Jian Yuan,et al. How to model a TCP/IP network using only 20 parameters , 2010, Proceedings of the 2010 Winter Simulation Conference.
[23] Mohamed F. Younis,et al. Strategies and techniques for node placement in wireless sensor networks: A survey , 2008, Ad Hoc Networks.
[24] R. Linsker,et al. Improving network robustness by edge modification , 2005 .
[25] Jean C. Walrand,et al. Design of Network Topology in an Adversarial Environment , 2010, GameSec.
[26] Satyajayant Misra,et al. Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[27] Samir Khuller,et al. Relay Placement for Higher Order Connectivity in Wireless Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[28] Xiang Cao,et al. Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.
[29] Levente Buttyán,et al. Linear Loss Function for the Network Blocking Game: An Efficient Model for Measuring Network Robustness and Link Criticality , 2012, GameSec.
[30] Béla Bollobás,et al. Robustness and Vulnerability of Scale-Free Random Graphs , 2004, Internet Math..
[31] Edward F. Schmeichel,et al. Toughness in Graphs – A Survey , 2006, Graphs Comb..
[32] F. Chung. Laplacians and the Cheeger Inequality for Directed Graphs , 2005 .
[33] James J. Filliben,et al. Predicting Macroscopic Dynamics in Large Distributed Systems: Part I , 2011 .
[34] Lachlan L. H. Andrew,et al. Connectivity, Coverage and Placement in Wireless Sensor Networks , 2009, Sensors.
[35] Alessandro Vespignani,et al. Vulnerability of weighted networks , 2006, physics/0603163.
[36] Edgar M. Palmer,et al. On the spanning tree packing number of a graph: a survey , 2001, Discret. Math..
[37] Stephan Mertens. The Easiest Hard Problem: Number Partitioning , 2006, Computational Complexity and Statistical Physics.
[38] Levente Buttyán,et al. Game-theoretic Robustness of Many-to-one Networks , 2012, GAMENETS.
[39] Massimo Marchiori,et al. Error and attacktolerance of complex network s , 2004 .
[40] D S Callaway,et al. Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.
[41] S. Havlin,et al. Optimization of robustness of complex networks , 2004, cond-mat/0404331.
[42] S. Havlin,et al. Breakdown of the internet under intentional attack. , 2000, Physical review letters.
[43] H. Stanley,et al. Optimization of network robustness to random breakdowns , 2005, cond-mat/0507249.
[44] H. Herrmann,et al. How to Make a Fragile Network Robust and Vice Versa , 2009, Physical review letters.
[45] Bernard Harris,et al. Graph theory and its applications , 1970 .