Aug 2026· International Journal of Integrative Studies (IJIS)· pp. 1-12· 0 citations
TL;DR
An explainable agentic AI framework for multi-cloud task allocation built on a contextual-bandit agent that observes each provider's current price, estimated latency, and load before autonomously selecting a placement, then updates its policy online from the resulting cost, latency, and service-level-agreement (SLA) outcome.
Abstract
Enterprises increasingly distribute computing workloads across multiple public and private cloud providers to reduce cost, avoid vendor lock-in, and improve resilience, but this multiplies the complexity of deciding, for every incoming task, which provider to use. Static or single-objective heuristics — always choosing the cheapest or always the fastest provider — routinely fail because cost, latency, and reliability trade off against one another in ways that shift with demand and provider conditions. This paper proposes and evaluates an explainable agentic AI framework for multi-cloud task allocation built on a contextual-bandit agent (LinUCB) that observes each provider's current price, estimated latency, and load before autonomously selecting a placement, then updates its policy online from the resulting cost, latency, and service-level-agreement (SLA) outcome. Because no public multi-cloud trace exposes simultaneous, ground-truth price/latency/capacity data across providers, the framework is evaluated on a controlled, fully documented discrete-time simulation of four heterogeneous providers under realistic load dynamics — a standard and disclosed methodology in this research area. Across 30 independent simulation runs of 3,000 tasks each, the agent achieved a statistically significant improvement over the strongest single fixedweight heuristic baseline (Static-Weighted) on every safety- and balance-related metric: 86.2% fewer SLA violations, 20.9% lower average latency, and 19.6% higher load-balancing fairness (Jain's index = 0.955 vs. 0.799, paired t-test, all p < 0.001), at a 20.6% higher cost. Under a simulated transient provider degradation (a 5× latency spike on one provider for 20% of a run), the agent held SLA violations to 0.4%, versus 9.9% for naive round-robin routing and 40.2% for cost-only routing, while remaining markedly cheaper than a purely latencyreactive baseline. To support the "explainable" requirement of agentic systems intended for production use, the framework exposes two complementary explanation layers: the bandit's own per-provider linear coefficients, and a surrogate Random Forest trained to imitate the agent's decisions (99.6% fidelity), whose permutation importance identifies observed latency and price as the dominant drivers of every allocation decision. These results indicate that a lightweight, interpretable contextual-bandit agent can deliver a favourable, auditable balance of cost, latency, SLA compliance, and fairness in multi-cloud environments, including under operational stress, without the opacity of deeper reinforcement learning or black-box agentic architectures.
LLM agents increasingly drive long-running cloud inference workloads in which model calls differ in urgency, redundancy, completion semantics, and replay cost. Model-as-a-Service (MaaS) platforms expose several service models for trading cost against latency, availability, and capacity commitment. These models operate primarily at request, job, or endpoint scopes and provide limited support for combining transient platform supply with the evolving semantics of an agent task. We present SemSpot, a semantics-aware service model that allows agent applications to leverage the spot capacity of LLM inference platforms. At the request level, SemSpot lets a provider publish short-lived offers over successful price, completion probability, and failure-notification deadline; the agent runtime selects among these offers using the current task state and completion rule. An audit of 1,535 cases from six agent benchmarks identifies four recurring workflow structures and shows how this service model may produce different cost, service-time, and fallback behavior. With specialized MaaS support, token-level SemSpot further preserves provider inference state and runtime-verified semantic segments inside a long request. We develop the service model, economic boundary, and the cross-layer research agenda required to realize SemSpot.
The Efficiency-Adjusted Success Rate (EASR) is reported - success weighted by resource consumption relative to declared budgets - revealing that high accuracy at unbounded cost is not production-viable.
Meher Bhaskar Madiraju, Meher Sai Preetam Madiraju· 0 citations
HACO is proposed, a runtime control scheme that treats each role request as a reliability-constrained selection problem over candidate agent instances, each coupling a role type, an LLM, and a concrete execution environment.
This work presents MetaRoute-Bench, an open, inspectable framework for comparing meta-decision policies under a shared execution model, and releases task generation, policies, traces, tests, and analysis artifacts to support live-system validation.
Natan Vidra, Alina Kapanova, Arun Kanhai et al.· 0 citations
X-CODE is an explainable offline MARL that operates offline without environmental interaction, nor inter-agent communication, nor inter-agent communication, and exploits explainability-aware reward shaping to modify the relative preference among joint offline transitions during centralized training to improve decentralized resource-allocation behavior.
The main conclusion is that practical Agentic IoT depends less on placing an entire agent at one tier than on partitioning perception, memory, reasoning, and action under explicit latency, privacy, reliability, and safety constraints.