Bounds on service quality for networks subject to augmentation and attack
Assessing a network's vulnerability to attack and random failure is a difficult and important problem that changes with network application and representation. We furnish algorithms that bound the robustness of a network under attack. We utilize both static graph-based and dynamic trace-driven...
| Main Author: | |
|---|---|
| Language: | ENG |
| Published: |
ScholarWorks@UMass Amherst
2010
|
| Subjects: | |
| Online Access: | https://scholarworks.umass.edu/dissertations/AAI3427502 |