Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Semidefinite programming relaxations for the graph partitioning problem
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Graph separators, with applications
Graph separators, with applications
A spectral method to separate disconnected and nearly-disconnected web graph components
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Security in wireless sensor networks
Communications of the ACM - Wireless sensor networks
The feasibility of launching and detecting jamming attacks in wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Adversarial deletion in a scale free random graph process
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
North America's Electricity Infrastructure: Are We Ready for More Perfect Storms?
IEEE Security and Privacy
Comparison of failures and attacks on random and scale-free networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Security in mobile ad hoc networks: challenges and solutions
IEEE Wireless Communications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Client-server networks are pervasive, fundamental, and include such key networks as the Internet, power grids, and road networks. In a client-server network, clients obtain a service by connecting to one of a redundant set of servers. These networks are vulnerable to node and link failures, causing some clients to become disconnected from the servers. We develop algorithms that quantify and bound the inherent vulnerability of a clientserver network using semidefinite programming (SDP) and branch-and-cut techniques. Further, we develop a divide-and-conquer algorithm that solves the problem for large graphs. We use these techniques to show that: for the Philippine Power Grid removing just over 6% of the transmission lines will disconnect at least 20% but not more than 50% of the substations from all generators; on a large wireless mesh network disrupting 5% of wireless links between relays removes Internet access for half the relays; even after any 16% of Tier 2 ASes are removed, more than 50% of the remaining Tier 2 ASes will be connected to the Tier 1 backbone; when 300 roadblocks are erected in Michigan, it's possible to disconnect 28--43% of the population from all airports.