{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/32418"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/32418","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Determining Communications Resource Feasibility in a Tactical Communications Network","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Steele, Robert Joshua"],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Computer Science","degree_department":"Computer Science","school":null,"contributors":[],"advisors":[],"committee_chairs":["Nance, Richard E."],"committee_members":["Varadarajan, Srinidhi","Arthur, James D."],"year":2002,"date_issued":"2002-04-30","date_published":"2002-04-30","updated_at":"2026-07-22T22:18:41Z","subjects":["decision support systems","communications resource allocation","feasibility","tactical networks"],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-05092002-152507"],"render_values":[{"text":"etd-05092002-152507","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/32418","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Nance, Richard E."]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Varadarajan, Srinidhi","Arthur, James D."]},{"key":"dc:contributor.department","label":"Department","values":["Computer Science"]},{"key":"dc:creator","label":"Author","values":["Steele, Robert Joshua"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T20:35:47Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T20:35:47Z","2003-05-24"]},{"key":"dc:date.issued","label":"Date","values":["2002-04-30"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["decision support systems","communications resource allocation","feasibility","tactical networks"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-05092002-152507"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/32418"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:title","label":"Title","values":["Determining Communications Resource Feasibility in a Tactical Communications Network"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Nance, Richard E."],"dc:contributor.committeemember":["Varadarajan, Srinidhi","Arthur, James D."],"dc:contributor.department":["Computer Science"],"dc:creator":["Steele, Robert Joshua"],"dc:date.accessioned":["2014-03-14T20:35:47Z"],"dc:date.available":["2014-03-14T20:35:47Z","2003-05-24"],"dc:date.issued":["2002-04-30"],"dc:description.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."],"dc:description.degree":["Master of Science"],"dc:identifier.other":["etd-05092002-152507"],"dc:identifier.uri":["http://hdl.handle.net/10919/32418"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["decision support systems","communications resource allocation","feasibility","tactical networks"],"dc:title":["Determining Communications Resource Feasibility in a Tactical Communications Network"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:18:41Z"}