SearcharxivSearch

arXiv subjects

Andrea Francini

Publications and source records attributed to Andrea Francini.

3 recordsLinked to original sources

Assurance-Scoped Reliability for Agentic Networks: Capturing the State That Matters

Agentic networks transform accepted intents into operational services through autonomous reasoning, adaptive planning, tool use, and cross-domain coordination, but these capabilities introduce failure modes that conventional reliability measures do not fully capture. An accepted intent may still be carried out incorrectly, for example because the system acts on stale information, repeats an external action, applies only part of a change, or enters a fallback mode that quietly relaxes policy enforcement. Such failures can leave a service running and apparently healthy while its behavior is unsafe or unaccountable, with too little evidence to detect, explain, or recover from them. This article proposes Reliability Assurance Intelligence (RAI), a general assurance architecture for such systems. From the service description, RAI derives a per-service reliability profile that states what must be checked, recorded, recovered, and audited. At runtime, generic functions use the service profile to retain the durable state needed for recovery and accountability in a context capsule adapted to service conditions. Using an agentic lifecycle manager for deterministic network services as a running example, we design the RAI architecture and propose a methodology for validating its reliability assurances.

cs.NI

Evaluation of TCP Congestion Control for Public High-Performance Wide-Area Networks

Practitioners of a growing number of scientific and artificial-intelligence (AI) applications use High-Performance Wide-Area Networks (HP-WANs) for moving massive data sets between remote facilities. Accurate prediction of the flow completion time (FCT) is essential in these data-transfer workflows because compute and storage resources are tightly scheduled and expensive. We assess the viability of three TCP congestion control algorithms (CUBIC, BBRv1, and BBRv3) for massive data transfers over public HP-WANs, where limited control of critical data-path parameters precludes the use of Remote Direct Memory Access (RDMA) over Converged Ethernet (RoCEv2), which is known to outperform TCP in private HP-WANs. Extensive experiments on the FABRIC testbed indicate that the configuration control limitations can also hinder TCP, especially through microburst-induced packet losses. Under these challenging conditions, we show that the highest FCT predictability is achieved by combination of BBRv1 with the application of traffic shaping before the HP-WAN entry points.

cs.NI

Global Synchronization Protection for Bandwidth Sharing TCP Flows in High-Speed Links

In a congested network link, synchronization effects between bandwidth-sharing TCP flows cause wide queue length oscillations, which may translate into poor link utilization if insufficiently buffered. We introduce global synchronization protection (GSP), a simple extension to the ordinary operation of a tail-drop queue that safely suppresses the flow synchronization. Our minimalistic solution is well suited for scaling with leading-edge link rates: it adds only few extra operations in the fast path and does not require accelerated memory access compared to the line rate. GSP makes it easier to provide advanced control of TCP congestion in high-speed links and in low-power packet processing hardware. Using experiments with a Linux prototype of GSP, we show that, despite its exclusive focus on removing global synchronization, the new scheme performs as well as far more complex active queue management (AQM) schemes like CoDel and PIE.

cs.NI