Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment

TL;DR

This paper introduces a novel algorithm for creating highly efficient patrolling strategies in large-scale Internet environments, enabling rapid construction of near-optimal solutions for networks with hundreds of millions of nodes.

Contribution

It presents a new compositional algorithmic approach tailored for large-scale network patrolling, significantly improving efficiency and scalability over existing methods.

Findings

Algorithm constructs near-optimal strategies quickly

Scales to networks with hundreds of millions of nodes

Demonstrates effectiveness in simulated Internet environments

Abstract

We propose an algorithm for constructing efficient patrolling strategies in the Internet environment, where the protected targets are nodes connected to the network and the patrollers are software agents capable of detecting/preventing undesirable activities on the nodes. The algorithm is based on a novel compositional principle designed for a special class of strategies, and it can quickly construct (sub)optimal solutions even if the number of targets reaches hundreds of millions.