Communications Resource Allocation: Feasibility Assessment for Tactial Networking Applications

The research reported here offers a solution to the communications resource allocation problem. Unlike earlier approaches to this problem, we employ a time-sliced event model where messages are sent and received in a single time slice called an epoch. In addition, we also consider networks that cont...

Full description

Bibliographic Details
Main Author: Bernard, Jon Ashley
Other Authors: Computer Science
Format: Others
Published: Virginia Tech 2014
Subjects:
Online Access:http://hdl.handle.net/10919/31649
http://scholar.lib.vt.edu/theses/available/etd-04072005-151844/
id ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-31649
record_format oai_dc
spelling ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-316492020-09-26T05:37:37Z Communications Resource Allocation: Feasibility Assessment for Tactial Networking Applications Bernard, Jon Ashley Computer Science Nance, Richard E. Midkiff, Scott F. Arthur, James D. communication resource feasibility tactical networks The research reported here offers a solution to the communications resource allocation problem. Unlike earlier approaches to this problem, we employ a time-sliced event model where messages are sent and received in a single time slice called an epoch. In addition, we also consider networks that contain relay nodes capable of only transferring messages. Consequently, network topologies can be considered where a given node is not directly connected to every other node and must use one or more relay nodes in order to get a message to some destination. The resulting architectures broaden the networks to be considered and enable the capability of constructing more realistic communication scenarios. In this paper we modify the standard MCNF model by turning our focus to feasibility instead of optimality in an effort to provide adequate and accurate decision support to communication network planners. Given a network configuration and message requirements, our goal is to determine if the proposed scenario is feasible in terms of the communication resources available. To meet this goal, three algorithms are presented that each solve the extended MCNF problem with varying degrees of accuracy and run-time requirements. Experimental results show that a large number of multi-variable interactions among input parameters play a key role in determining feasibility and predicting expected execution time. Several heuristics are presented that reduce run-time dramatically, in some cases by a factor of 37. Each algorithm is tested on a range of inputs and compared to the others. Preliminary results gathered indicate that the second algorithm of the three (APEA) offers the best balance of accuracy vs. execution time. In summary, the solutions presented here solve the resource allocation problem for message delivery in a way that enables evaluation of real world communication scenarios. Master of Science 2014-03-14T20:33:13Z 2014-03-14T20:33:13Z 2004-12-14 2005-04-07 2005-04-13 2005-04-13 Thesis etd-04072005-151844 http://hdl.handle.net/10919/31649 http://scholar.lib.vt.edu/theses/available/etd-04072005-151844/ thesis_jbernard.pdf In Copyright http://rightsstatements.org/vocab/InC/1.0/ application/pdf Virginia Tech
collection NDLTD
format Others
sources NDLTD
topic communication resource feasibility
tactical networks
spellingShingle communication resource feasibility
tactical networks
Bernard, Jon Ashley
Communications Resource Allocation: Feasibility Assessment for Tactial Networking Applications
description The research reported here offers a solution to the communications resource allocation problem. Unlike earlier approaches to this problem, we employ a time-sliced event model where messages are sent and received in a single time slice called an epoch. In addition, we also consider networks that contain relay nodes capable of only transferring messages. Consequently, network topologies can be considered where a given node is not directly connected to every other node and must use one or more relay nodes in order to get a message to some destination. The resulting architectures broaden the networks to be considered and enable the capability of constructing more realistic communication scenarios. In this paper we modify the standard MCNF model by turning our focus to feasibility instead of optimality in an effort to provide adequate and accurate decision support to communication network planners. Given a network configuration and message requirements, our goal is to determine if the proposed scenario is feasible in terms of the communication resources available. To meet this goal, three algorithms are presented that each solve the extended MCNF problem with varying degrees of accuracy and run-time requirements. Experimental results show that a large number of multi-variable interactions among input parameters play a key role in determining feasibility and predicting expected execution time. Several heuristics are presented that reduce run-time dramatically, in some cases by a factor of 37. Each algorithm is tested on a range of inputs and compared to the others. Preliminary results gathered indicate that the second algorithm of the three (APEA) offers the best balance of accuracy vs. execution time. In summary, the solutions presented here solve the resource allocation problem for message delivery in a way that enables evaluation of real world communication scenarios. === Master of Science
author2 Computer Science
author_facet Computer Science
Bernard, Jon Ashley
author Bernard, Jon Ashley
author_sort Bernard, Jon Ashley
title Communications Resource Allocation: Feasibility Assessment for Tactial Networking Applications
title_short Communications Resource Allocation: Feasibility Assessment for Tactial Networking Applications
title_full Communications Resource Allocation: Feasibility Assessment for Tactial Networking Applications
title_fullStr Communications Resource Allocation: Feasibility Assessment for Tactial Networking Applications
title_full_unstemmed Communications Resource Allocation: Feasibility Assessment for Tactial Networking Applications
title_sort communications resource allocation: feasibility assessment for tactial networking applications
publisher Virginia Tech
publishDate 2014
url http://hdl.handle.net/10919/31649
http://scholar.lib.vt.edu/theses/available/etd-04072005-151844/
work_keys_str_mv AT bernardjonashley communicationsresourceallocationfeasibilityassessmentfortactialnetworkingapplications
_version_ 1719342205892558848