In this paper, we present solutions concerning communications resource allocation for tactical communication networking. Given a mission definition (which defines communication needs among participants) and participant capabilities (such as processing power and bandwidth), algorithms are presented to determine if the mission as presented is feasible.
The mathematical foundation of the problem is presented, and a "static" model to determine feasibility is shown. Further evolution of the algorithm into a "dynamic" model and the reasons for the more demanding requirements are presented. Reasoning behind use of the Netflo algorithm in the dynamic model is also discussed.
The inclusion of the algorithm in a stand-alone program is discussed, including overall program structure, graphical user interface components and alternative output (such as the generation of high level network policy). Finally, future work in this area is discussed. / Master of Science
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/32418 |
| Date | 24 May 2002 |
| Creators | Steele, Robert Joshua |
| Contributors | Computer Science, Nance, Richard E., Varadarajan, Srinidhi, Arthur, James D. |
| Publisher | Virginia Tech |
| Source Sets | Virginia Tech Theses and Dissertation |
| Detected Language | English |
| Type | Thesis |
| Format | application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | thesis_steele.PDF |
Page generated in 0.0018 seconds