arXiv Machine Learning

The Cost of Saying Hello: An Empirical Study of Handshake Overhead in AI Agent Communication Protocols

The paper reports the first empirical, phase‑decomposed benchmark of handshake overhead in three major AI agent communication protocols—MCP (2025 and 2026 versions), A2A, and ACP—using their official SDKs. It measures round‑trip counts, per‑phase latency, wire bytes, and token cost across cold‑start, warm‑repeat, capability‑mismatch, and degraded‑metadata scenarios, finding that round‑trip count dominates cost (e.g., MCP’s legacy handshake requires three round trips and 230 ms at 50 ms RTT, while A2A needs one round trip and 61 ms). The study also shows that handshake cost scales with the counterpart’s capability inventory, with a 200‑capability counterpart consuming 11 % of a 200k‑token context window, and documents protocol evolution that reduces MCP’s handshake from three to zero round trips on warm reconnects.

arXiv AI
Jul 21

Deterministic Replay for AI Agent Systems

arXiv:2607. 16200v1 Announce Type: new Abstract: AI agent systems that couple large language models (LLMs) with external tools and APIs are inherently non-deterministic: LLM sampling variance, external API state, CDN infrastructure headers, and execution-environment noise collectively prevent any prior agent run from being faithfully re-executed.

By Rasheed Mudasiru
arXiv AI
Oct 2

Worse Together: How Performance Breaks Down in Multi-User Multi-Agent Teams

The paper investigates how coordination among AI agents serving different users degrades performance compared to a single coordinating agent. Across five advanced models and 77 scenarios in four shared-resource environments—API key budgets, clinic calendars, personal assistant bookings, and merge queues—the study finds that multi‑agent teams consistently underperform, sometimes collapsing entirely, and that even with communication channels coordination overhead remains significant. The authors identify specific failure modes such as stalling, action overriding, and claim fabrication, and propose environment‑specific mitigations like team leads and procedural instructions, while releasing the MAMUBench benchmark for future research.

By Sahan Paliskara, Nattaput Namchittai, Andrew Lampinen
arXiv AI
Aug 18

From LLM Inference to Agentic Workloads: Characterization and Implications for Serving Systems

arXiv:2608. 15127v1 Announce Type: cross Abstract: Agentic applications are shifting AI serving from isolated model inference to long-running workloads in which LLMs coordinate tools, environments, and persistent state.

By Chaokun Chang, Yukun Zhou, Kaihua Fu, Dakai An, Tianyu Feng, Hanfeng Lu, Sheng Yao, Pu Guo, Yinghao Yu, Yizhou Shan, Bo Li, Binhang Yuan, Wei Wang
arXiv Machine Learning
Oct 16

When the KV Cache Is Slower Than the GPU: Scaling Remote KV Tiers for Context-Parallel Prefill

The paper investigates the performance impact of using a remote KV cache tier for long‑context language model serving. In a disaggregated deployment of GLM‑5.3 on 8xB300 nodes, enabling the remote tier initially increased the 16k‑token p99 latency from 3.96 s to 17.3 s, and synchronous loading caused severe queue instability. By sharding the KV store across context‑parallel ranks, partitioning the remote tier, adding asynchronous loading, and fixing client bugs, the authors reduced the p99 latency from 83.32 s to 0.67 s and increased prefill throughput by 14–34 %. whyItMatters":"The study demonstrates that careful sharding and asynchronous handling of remote KV caches can dramatically improve latency and throughput in large‑scale LLM serving systems."

By Muhammad Ibrahim