Synthesizing Efficient Solutions for Patrolling Problems in the Internet Environment
This addresses the need for scalable security monitoring in large-scale networks, though it appears incremental as it builds on existing patrolling concepts with a novel compositional principle.
The paper tackles the problem of constructing efficient patrolling strategies for protecting nodes in the Internet environment, proposing an algorithm that can quickly generate (sub)optimal solutions for up to hundreds of millions of targets.
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.