Towards Traffic Modelling of Multi-Agent Systems: The Role of Coordination Topology

• URL: http://arxiv.org/abs/2608.20494v1
• Date: Thu, 20 Aug 2026 18:30:46 GMT
• Title: Towards Traffic Modelling of Multi-Agent Systems: The Role of Coordination Topology
• Abstract summary: Multi-agent LLM systems generate requests internally.<n>A single user task can induce a structured sequence of model calls whose timing is governed by coordination logic.<n>It is not clear whether classical traffic models, designed for human-driven workloads, apply to this setting.
• Score: 1.8105377206423159
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multi-agent LLM systems are an emerging networked workload whose rapid deployment raises questions about the traffic patterns they generate. Compared to conventional applications, these systems generate requests internally: a single user task can induce a structured sequence of model calls whose timing is governed by coordination logic rather than by user arrival rate. It is not clear whether classical traffic models, designed for human-driven workloads, apply to this setting. We present an empirical characterisation of LLM-call interarrival time distributions across sequential, star, and full-mesh agentic coordination topologies, using a multi-layer measurement framework over 500 repeated runs per topology. We find that topology fundamentally shapes the arrival process of requests to the LLM backend: fan-out coordination introduces a structural bimodality absent in sequential execution, and the reasoningphase component is best described by a log-normal distribution, with the Poisson exponential null model decisively rejected across all topologies. These differences propagate to inference and network level metrics. The framework and analysis pipeline are released openly at https://github.com/dlamagna/agentraffic.

Related papers

• Inference-Time Graph Engineering for Multi-Agent LLM Workflows [51.56038180639833]
  We introduce ReActNet, a training-free framework that compiles a query and a set of role-specialized agents into a sequence of directed communication graphs.<n>We show that ReActNet consistently improves over fixed-topology and learned-topology baselines while maintaining competitive inference cost.
  arXiv  Detail & Related papers  (2026-09-04T23:32:11Z)
• INFRAMIND: Infrastructure-Aware Multi-Agent Orchestration [18.376319491516266]
  We introduce INFRAMIND, a framework that makes the entire multi-agent stack infrastructure-aware.<n>An infra-aware executor then observes per-model queue depths, cache utilization, and response latencies at each agent step to decide which model to call.<n>A budget-aware scheduler further reorders each model's queue so that urgent requests are served first.
  arXiv  Detail & Related papers  (2026-06-09T20:50:12Z)
• Adaptive Multimodal Agents-Based Framework for Automatic Workflow Execution [1.2132786136735432]
  We propose a novel multi-agent framework that achieves automatic workflow execution through a distinct two-phase pipeline.<n>During inference, agents leverage Adaptive Retrieval-Augmented Generation (RAG) over this fixed, pre-established graph.<n>We validate our framework in a real-world context, demonstrating its ability to maintain high reliability and semantic awareness even with limited training data.
  arXiv  Detail & Related papers  (2026-05-27T15:23:22Z)
• AgensFlow: A Coordination-Policy Substrate for Multi-Agent Systems [0.0]
  AgensFlow treats multi-agent coordination as an online policy-learning problem under partial observability.<n>AgensFlow is evaluated on two corpora: distributed-systems incident tasks and security-advisory tasks.
  arXiv  Detail & Related papers  (2026-05-26T08:10:52Z)
• Task-Aware LLM Routing with Multi-Level Task-Profile-Guided Data Synthesis for Cold-Start Scenarios [51.44288759906005]
  Large language models (LLMs) exhibit substantial variability in performance and computational cost across tasks and queries.<n>We introduce T, a task-type-aware router approach that models query-conditioned cost and performance via latent task-type variables.
  arXiv  Detail & Related papers  (2026-04-10T14:46:20Z)
• Chimera: Latency- and Performance-Aware Multi-agent Serving for Heterogeneous LLMs [62.17306142810532]
  We present Chimera, a predictive scheduling system for multi-agent workflow serving on heterogeneous LLM clusters.<n>Chime traces the best latency, reducing end-to-end latency by 1.2--2.4$times$ and improving task performance by 8.0-9.5 percentage points on average over competitive baselines.
  arXiv  Detail & Related papers  (2026-03-23T17:01:42Z)
• OFA-MAS: One-for-All Multi-Agent System Topology Design based on Mixture-of-Experts Graph Generative Models [57.94189874119267]
  Multi-Agent Systems (MAS) offer a powerful paradigm for solving complex problems.<n>Current graph learning-based design methodologies often adhere to a "one-for-one" paradigm.<n>We propose OFA-TAD, a one-for-all framework that generates adaptive collaboration graphs for any task described in natural language.
  arXiv  Detail & Related papers  (2026-01-19T12:23:44Z)
• Dynamic Generation of Multi-LLM Agents Communication Topologies with Graph Diffusion Models [99.85131798240808]
  We introduce a novel generative framework called textitGuided Topology Diffusion (GTD)<n>Inspired by conditional discrete graph diffusion models, GTD formulates topology synthesis as an iterative construction process.<n>At each step, the generation is steered by a lightweight proxy model that predicts multi-objective rewards.<n>Experiments show that GTD can generate highly task-adaptive, sparse, and efficient communication topologies.
  arXiv  Detail & Related papers  (2025-10-09T05:28:28Z)
• AgentRouter: A Knowledge-Graph-Guided LLM Router for Collaborative Multi-Agent Question Answering [51.07491603393163]
  tAgent is a framework that formulates multi-agent QA as a knowledge-graph-guided routing problem supervised by empirical performance signals.<n>By leveraging soft supervision and weighted aggregation of agent outputs, Agent learns principled collaboration schemes that capture the complementary strengths of diverse agents.
  arXiv  Detail & Related papers  (2025-10-06T23:20:49Z)
• Multi-Agent Routing Value Iteration Network [88.38796921838203]
  We propose a graph neural network based model that is able to perform multi-agent routing based on learned value in a sparsely connected graph. We show that our model trained with only two agents on graphs with a maximum of 25 nodes can easily generalize to situations with more agents and/or nodes.
  arXiv  Detail & Related papers  (2020-07-09T22:16:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.