Title page for ETD etd-05092002-152507


Type of Document Master's Thesis
Author Steele, Robert Joshua
Author's Email Address jsteele@vt.edu
URN etd-05092002-152507
Title Determining Communications Resource Feasibility in a Tactical Communications Network
Degree Master of Science
Department Computer Science
Advisory Committee
Advisor Name Title
Nance, Richard E. Committee Chair
Arthur, James D. Committee Member
Varadarajan, Srinidhi Committee Member
Keywords
  • decision support systems
  • communications resource allocation
  • feasibility
  • tactical networks
Date of Defense 2002-04-30
Availability unrestricted
Abstract
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.

Files
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  thesis_steele.PDF 1.15 Mb 00:05:20 00:02:44 00:02:24 00:01:12 00:00:06

Browse All Available ETDs by ( Author | Department )

dla home
etds imagebase journals news ereserve special collections
virgnia tech home contact dla university libraries

If you have questions or technical problems, please Contact DLA.