| Summary: | Approved for public release; distribution is unlimited === Routing information is a delicate balance between theoretical ideas, such as optimization of flow, shortest path routing, and the reality of threats to the security of the network. The way information is routed can be massaged to give the best solution-that being one that aptly satisfies both of these constraints. But, are the routers on a nominal Air Force base set up with all of these things in mind? The basis for this study will be graph theory, which will supply the tools necessary to analyze the underlying mathematical construct of the router configuration. A nominal Air Force base will be constructed with all of the functions and organizations that one would find on a nominal Air Force base organized in a nominal physical fashion. The optimal router setup for such a base will then be developed. From there, this design's feasibility will be analyzed from cost, security, and implementation standpoints. The scope of this research will be the routing of all traffic internal to the base-i.e., traffic originating or terminating off base will not be examined.
|
|---|
