Lightwave networks based on de Bruijn graphs
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
A first-principles approach to understanding the internet's router-level topology
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Shrink: a tool for failure diagnosis in IP networks
Proceedings of the 2005 ACM SIGCOMM workshop on Mining network data
IP fault localization via risk modeling
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
High-reliability topological architectures for networks under stress
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications - Part Supplement
A review of fault management in WDM mesh networks: basic concepts and research challenges
IEEE Network: The Magazine of Global Internetworking
On the reliability of large-scale distributed systems - A topological view
Computer Networks: The International Journal of Computer and Telecommunications Networking
Resilience in computer systems and networks
Proceedings of the 2009 International Conference on Computer-Aided Design
Analyzing resiliency of the smart grid communication architectures under cyber attack
CSET'12 Proceedings of the 5th USENIX conference on Cyber Security Experimentation and Test
International Journal of Information and Computer Security
The resilience of WDM networks to probabilistic geographical failures
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this work, we quantify scalability of network re-silience upon failures. We characterize resilience as the percentage of lost traffic upon failures and define scalability as the growth rate of the percentage of lost traffic with respect to network size, link failure probability, and network traffic for given failure protection schemes. We apply probabilistic graphical models to characterize statistical dependence between physical-layer failures and the net-work-layer traffic, and analyze the scalability for large networks of different topologies. We first focus on the scalability of resilience for regular topolo-gies under uniform deterministic traffic with independent and de-pendent link failures, with and without protection. For large net-works with small probabilities of failures and without protection, we show that the scalability of network resilience grows linearly with the average route length and with the "effective" link failure probability. For large networks with 1 + 1 protection, we obtain lower and upper bound of the percentage of lost traffic. We de-rive approximations of the scalability for arbitrary topologies, and attain close-form analytical results for ring, star, and mesh-torus topologies. We then study network resilience under random traffic with Poisson arrivals. We find that when the network is under light load, the network resilience is reduced to that under uniform de-terministic traffic. When the network load is under heavy load, the percentage of lost traffic approaches the marginal probability of link failure. Our scalability analysis shows explicitly how network resilience varies with different factors and provides insights for re-silient network design.