Mission Mapping
Abstract
Given a network, our problem is to identify all "missions" within the network. From this we can determine how many missions a node is involved as well as the size of those missions. The overarching purpose for this is to assess network vulnerability. If a node is destroyed it has the potential to derail all missions in which it is involved. Thus nodes involved in large missions or a large number of missions may be critical to protect. There are a few key assumptions about what characteristics a "mission" will exhibit within a network. Missions require communication. Even amongst background chatter or noise, missions should have higher density than an average set of nodes because of this required communication. Two nodes in a mission may not be required to directly communicate. However, we assume most will share some common neighbors, and hence the neighborhoods of nodes involved in a mission should overlap, revealing similar communication patterns.
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 07, 2011
- Accession Number
- ADA576733
Entities
People
- Jeffrey Pattillo
Organizations
- Massachusetts Institute of Technology