Metraipolis › archive › dc_1802ecd78230

Finite State Machine-Based Traffic Orchestration for Multi-Engine Analysis Platforms — arXiv:2610.05788

Source
arXiv
Original
https://arxiv.org/abs/2610.05788
License (as archived)
CC0-1.0
Archived
2026-10-06T05:32:43.385Z
SHA-256 of the archived text
efc7e303e169a61964b9de40a37b7a4e43bfe69f72ab30a452581449b25d87ff
Stable URL of this page
https://metraipolis.com/documento/dc_1802ecd78230

How to cite

Finite State Machine-Based Traffic Orchestration for Multi-Engine Analysis Platforms — arXiv:2610.05788 — arXiv, https://arxiv.org/abs/2610.05788 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1802ecd78230 (Metraipolis archive dc_1802ecd78230, sha256 efc7e303e169a61964b9de40a37b7a4e43bfe69f72ab30a452581449b25d87ff)
BibTeX
@misc{dc1802ecd78230,
  title = {Finite State Machine-Based Traffic Orchestration for Multi-Engine Analysis Platforms — arXiv:2610.05788},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.05788},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1802ecd78230; sha256 efc7e303e169a61964b9de40a37b7a4e43bfe69f72ab30a452581449b25d87ff},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.05788. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Modern application-security platforms route live traffic from a single proxy into several independent analysis engines -- behavioral anomaly detection, authentication analysis, resource discovery, access-control inspection, among others. Each engine's appetite for traffic changes on its own schedule, yet the proxy can honor only one forwarding instruction per resource. We present a traffic-orchestration method that models the combined needs of all engines as a single composite finite state machine (FSM) whose state space is the Cartesian product of per-engine states. Every reachable composite state pre-maps to one forwarding configuration, so runtime reduces to a lookup rather than a negotiation. We add two refinements: time-based expiry treated as a first-class FSM transition enabling declarative traffic decay, and per-state multi-tier outputs that let one machine serve every service level. The design is fully declarative, engine-agnostic, and scales to N engines without re-architecture.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.SE, nuovi lavori del giorno).
Categorie arXiv: Software Engineering (cs.SE).
Pagina del lavoro: https://arxiv.org/abs/2610.05788 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T05:27:20.405Z dalla pagina https://arxiv.org/list/cs.SE/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).