On Problem of Conflict Interaction of Two Players in the Network Environment

TL;DR

This paper extends fluid models to network conflict scenarios, analyzing attacker and defender strategies, and provides conditions for winning, supported by theoretical proofs and computational simulations.

Contribution

It introduces a new conflict model in network environments based on control theory, with proven conditions for player victory.

Findings

Conditions for attacker or defender victory are established.

Theoretical results are validated through computational simulations.

The model extends classic fluid models to network conflict scenarios.

Abstract

In this work the single server model with counteraction is considered. We extend the classic fluid model using results from the theory of conflict controlled processes. Our new model describes conflict processes in neworks. For this model were defined two players - an attacker and a defender. Dynamic of the system depends on strategies of these players. There are formulated conditions that guarantee possibility of winning of one player. This fact proved by the main theorem. Theoretical results were illustrated on the experimental computational modeling.