Determining Communications Resource Feasibility in a Tactical Communications Network

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.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

masters

Discipline thesis:degree_discipline

Computer Science

Department dc:contributor.department

Computer Science

Grantor dc:publisher

Virginia Tech

Year dc:date.issued

2002

Author dc:creator

• Steele, Robert Joshua

Chair dc:contributor.committeechair

• Nance, Richard E.

Committee members dc:contributor.committeemember

• Varadarajan, Srinidhi
• Arthur, James D.

• decision support systems
• communications resource allocation
• feasibility
• tactical networks

Statement dc:rights

• In Copyright

Licence dc:rights.uri

• http://rightsstatements.org/vocab/InC/1.0/

Dc Identifier Other

etd-05092002-152507

OAI identifier oai:identifier

oai:vtechworks.lib.vt.edu:10919/32418