PROJECT TITLE :

Queuing over Ever-changing Communication Scenarios in Tactical Networks

ABSTRACT:

In order to manage the ever-shifting communication scenarios that arise in tactical networks, the author of this paper presents a hierarchy of queues that are complementary to one another. The messages that are subject to QoS constraints and come from command and control systems are stored in the first queue. These messages are shattered into IP packets, which are then stored in a queue of packets (second) before being sent to the radio buffer (third), which is a queue with limited space and is, as a result, susceptible to overflow. We begin with the hypothesis that these three queues are capable of handling ever-changing user(s) data flows (problem A) despite ever-changing network conditions (problem B) with the help of cross-layer information exchange, such as buffer occupancy, data rate, queue size, and latency (problem A|B). We present two stochastic models, one to generate sequences of QoS-constrained messages (model A) and another to generate constantly shifting conditions on the network (model B). In order to test our hypothesis using model A|B, which defines enforcement points at the incoming/outgoing chains of the system along with a control plane, we sequentially sketch a control loop to shape A to B. This allows us to shape A to B. After that, we talk about the results of some experiments that were conducted in a network that utilized VHF radios and had data flows that caused the radio buffer to become full due to constantly shifting data rate patterns. Quantitative results demonstrating the performance of our solutions for problems A, B, and A|B are discussed, along with their strengths and weaknesses.