Strategic Defense of Feedback-Controlled Parallel Queues against Reliability and Security Failures

  title={Strategic Defense of Feedback-Controlled Parallel Queues against Reliability and Security Failures},
  author={Qian Xie and Jiayi Wang and Li Jin},
Parallel traffic service systems such as transportation, manufacturing, and computer systems typically involve feedback control (e.g., dynamic routing) to ensure stability and to improve throughput. Such control relies on connected cyber components for computation and communication. These components are susceptible to random malfunctions and malicious attacks, which motivates the design of strategic defense that are both traffic-stabilizing and cost-efficient under reliability/security failures… 

Figures from this paper

Security Risk Analysis of the Shorter-Queue Routing Policy for Two Symmetric Servers

This article forms a non-zero-sum attacker-defender game, characterize the equilibria in multiple regimes, and quantify the security risk of a feedback-controlled system under the influence of malicious attacks.

Game Theoretic Stochastic Routing for Fault Tolerance and Security in Computer Networks

The game-theoretic stochastic routing (GTSR) framework is introduced, a proactive alternative to today's reactive approaches to route repair and it is shown that a beneficial side effect of these algorithms is an increase in throughput, as they make use of multiple paths.

Stability of Fluid Queueing Systems With Parallel Servers and Stochastic Capacities

This note introduces a piecewise-deterministic queueing (PDQ) model to study the stability of traffic queues in parallel-link transportation systems facing stochastic capacity fluctuations and shows that the stability conditions can be strengthened for two-mode PDQs.

Stabilizing Queuing Networks With Model Data-Independent Control

Classical queuing network control strategies typically rely on accurate knowledge of model data, i.e., arrival and service rates. However, such data are not always available and may be time-variant.

Securing Infrastructure Facilities: When Does Proactive Defense Help?

This article investigates how the infrastructure operator should prioritize the investment in securing a set of facilities in order to reduce the impact of a strategic adversary who can target a facility to increase the overall usage cost of the system.

Input-to-State Stabilizing Control Under Denial-of-Service

This paper analyzes networked control systems in the presence of denial-of-service (DoS) attacks, namely attacks that prevent transmissions over the network, to characterize frequency and duration of the DoS attacks under which input-to-state stability (ISS) of the closed-loop system can be preserved.

Routing in queueing networks under imperfect information: stochastic dominance and thresholds

Optimal policies for routing between two servers under imperfect information is treated by discrete time dynamic programming. It is proved that certain inequalities involving stochastic ordering of

Stability of queueing networks and scheduling policies

A programmatic procedure for establishing the stability of queueing networks and scheduling policies that establishes not only positive recurrence and the existence of a steady-state probability distribution, but also the geometric convergence of an exponential moment.

A queueing analysis for the denial of service (DoS) attacks in computer networks

Packet Routing over Parallel Time-Varying Queues with Application to Satellite and Wireless Networks

We consider the problem of routing packets from an arbitrary input stream X over a collection of heterogeneous queues in parallel. When the processing rates (μ1,..., μn) of the queues are constant, a