Proxy pair optimizations for increased service reliability in DIL networks

Lindquister, Joakim Johanson; Johnsen, Frank T.; Bloebaum, Trude H.

doi:10.1109/milcom.2017.8170733

“…The investigation in [7] reports a quantitative evaluation of a proxy implementing three different application protocols tested over a tactical network with disconnected, limited and intermittent states [15]. The tactical network was composed by both simulated and emulated network technologies, such as SatCom, WiFi and Combat Network Radio (CNR).…”

Section: Tactical Systemsmentioning

confidence: 99%

“…6 shows a complete graph with the three network states, where state 0 is disconnected (red), state 1 limited (yellow) and state 2 connected (green). In the literature [7], [15], other authors define the network states as disconnected, intermittent and low-bandwidth, here we include the connected state and assume that intermittent is any variation of states in a given time window. The precise definition of these three network states depends on the network technology.…”

Section: Motivation Amentioning

confidence: 99%

“…Given a radio network r, if the buffer occupancy ∆Q size 0 is zero, then the delay is also zero, see Eq. (7). If the buffer occupancy is below a threshold (∆Q size 0 < Q threshold 0 ), the relation in (7) computes the inter-packet interval Q delay 1 using the time window ω (seconds), the IP packet size o MTU 0 (bytes), the amount of bytes the radio will send within the time-window out.Q size 0 (8a), how many bytes is left until the threshold in.Q size 0 (8b) and minimum latency o latency 0 (seconds).…”

Section: Inter-packet Interval C 1 |Omentioning

confidence: 99%

“…These three problems are partially addressed in the literature reporting simulations and field experiments in tactical networks (e.g. [5], [6], [7], [8], [9], [10]). For example, it is common to find studies using non-stochastic user-generated data flows with few types of messages sent to the network within an uniform time window (problem A).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Queuing Over Ever-Changing Communication Scenarios in Tactical Networks

Lopes

¹

,

Balaraju

²

,

Rettore

³

et al. 2022

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

This paper introduces a hierarchy of queues complementing each other to handle ever-changing communication scenarios in tactical networks. The first queue stores the QoS-constrained messages from command and control systems. These messages are fragmented into IP packets, which are stored in a queue of packets (second) to be sent to the radio buffer (third), which is a queue with limited space therefore, open to overflow. We start with the hypothesis that these three queues can handle ever-changing user(s) data flows (problem A) through ever-changing network conditions (problem B) using cross-layer information exchange, such as buffer occupancy, data rate, queue size and latency (problem A|B). We introduce two stochastic models to create sequences of QoS-constrained messages (A) and to create ever-changing network conditions (B). In sequence, we sketch a control loop to shape A to B to test our hypothesis using model A|B, which defines enforcement points at the incoming/outgoing chains of the system together with a control plane. Then, we discuss experimental results in a network with VHF radios using data flows that overflows the radio buffer over ever-changing data rate patterns. We discuss quantitative results showing the performance and limitations of our solutions for problems A, B and A|B.

show abstract

“…The goal is to construct mathematical arguments explaining why systems, also called middlewares, brokers or proxies (e.g. [6], [7], [11], [12], [13], [14], [15], [16], [17], [18]), can handle changes in both A and B relying on crosslayer information exchange with the radios and routers (e.g. buffer occupancy, link data rate, latency, packet loss and so on).…”

Section: Introductionmentioning

confidence: 99%

Queuing over Ever-changing Communication Scenarios in Tactical Networks

Lopes¹,

Balaraju²,

Rettore³

et al. 2020

Preprint

0

View full text Add to dashboard Cite

This paper introduces a hierarchy of queues complementing each other to handle ever-changing communication scenarios in tactical networks. The first queue stores the QoS-constrained messages from command and control systems. These messages are fragmented into IP packets, which are stored in a queue of packets (second) to be sent to the radio buffer (third), which is a queue with limited space therefore, open to overflow. We start with the hypothesis that these three queues can handle ever-changing user(s) data flows (problem A) through ever-changing network conditions (problem B) using cross-layer information exchange, such as buffer occupancy, data rate, queue size and latency (problem A|B). We introduce two stochastic models to create sequences of QoS-constrained messages (A) and to create ever-changing network conditions (B). In sequence, we sketch a control loop to shape A to B to test our hypothesis using model A|B, which defines enforcement points at the incoming/outgoing chains of the system together with a control plane. Then, we discuss experimental results in a network with VHF radios using data flows that overflows the radio buffer over ever-changing data rate patterns. We discuss quantitative results showing the performance and limitations of our solutions for problems A, B and A|B.

show abstract

Quantizing Radio Link Data Rates to Create Ever-Changing Network Conditions in Tactical Networks

Lopes

¹

,

Loevenich

²

,

Rettore

³

et al. 2020

View full text Add to dashboard Cite

Several sources of randomness can change the radio link data rate at the edge of tactical networks. Simulations and field experiments define these sources of randomness indirectly by choosing the mobility pattern, communication technology, number of nodes, terrain, obstacles and so on. Therefore, the distribution of change in the network conditions is unknown until the experiment is executed. We start with the hypothesis that a model can quantize the network conditions, using a set of states updated within a time window, to define and control the distribution of change in the link data rate before the experiment is executed. The goal is to quantify how much variation in the link data rate a tactical system can handle and how long it takes to resume IP data-flows after link disconnections. Our model includes functions to combine patterns of change together, transforming one pattern into another, jumping between patterns, and creating loops among different patterns of change. We use exemplary patterns to show how the change in the data rate impacts other link metrics, such as latency and jitter. Our hypothesis is verified with experiments using VHF radios over different patterns of change created by our model. We compute the inter-packet latency of three types of IP data-flows (broadcast, unicast and overlay) to highlight the time to resume data-flows after long link disconnections. The experimental results also support the discussion on the advantages and limitations of our model, which was designed to test tactical systems using military radios.

show abstract

Proxy pair optimizations for increased service reliability in DIL networks

Cited by 8 publications

References 3 publications

Queuing Over Ever-Changing Communication Scenarios in Tactical Networks

Queuing Over Ever-Changing Communication Scenarios in Tactical Networks

Queuing over Ever-changing Communication Scenarios in Tactical Networks

Quantizing Radio Link Data Rates to Create Ever-Changing Network Conditions in Tactical Networks

Contact Info

Product

Resources

About