# Throughput-Optimal Control of Distributed Computing Networks for Service DAGs

DevFeed: [Throughput-Optimal Control of Distributed Computing Networks for Service DAGs](<https://devfeed.tech/articles/throughput-optimal-control-of-distributed-computing-networks-for-service-dags-116526.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.05007>)

Author: Peng Li, Jianan Zhang, Jaime Llorca, Xinzhe Fu, Xiang Cheng, Chen Chen

Published: 2026-11-04T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>), [scheduling](<https://devfeed.tech/topics/scheduling.md>), [queueing theory](<https://devfeed.tech/topics/queueing-theory.md>), [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [dag](<https://devfeed.tech/tags/dag.md>), [distributed-computing](<https://devfeed.tech/tags/distributed-computing.md>), [networks](<https://devfeed.tech/tags/networks.md>), [optimal-control](<https://devfeed.tech/tags/optimal-control.md>), [throughput](<https://devfeed.tech/tags/throughput.md>), [wireless](<https://devfeed.tech/tags/wireless.md>), [workflow](<https://devfeed.tech/tags/workflow.md>)

## AI overview

The paper presents DCNC-DAG for executing service DAGs over wireless computing networks with stochastic arrivals, changing links, and interference. It maps functions to computation nodes and dependencies to routes, then uses queue-aware mappings and nearest-to-origin scheduling while synchronizing request inputs at merge points. The authors state that synchronization does not reduce the capacity region. With exact minimum-cost mappings, the policy is throughput-optimal and keeps physical queues rate-stable under bounded arrivals, even with finite mapping-update intervals and boundedly stale queue information. For larger DAGs, DCNC-DAG-H uses a queue-aware heuristic instead of exact optimization. Simulations report 2.7-5.5 times the throughput of queue-blind baselines for DCNC-DAG and up to 2.68 times that of corresponding baselines for DCNC-DAG-H.

## Source excerpt

arXiv:2611.05007v1 Announce Type: new Abstract: Executing service workflows with directed acyclic graph (DAG) dependencies over wireless distributed computing networks requires joint control of function placement, routing, and scheduling, together with synchronization of inputs from the same request at merge points. We study throughput-optimal control of these networks under stochastic request arrivals, time-varying wireless links, and interference constraints. We use a valid mapping abstraction that assigns each service function to a computation node and each DAG dependency to a routing path. Using this abstraction, we characterize the network capacity region to support service DAGs, and prove that synchronizing the packets of a request at merge points does not shrink the region. We develop Dynamic Computing Network Control for service DAGs (DCNC-DAG), a dynamic control policy that selects queue-aware valid mappings and schedules service DAG execution by nearest-to-origin (NTO) while enforcing input synchronization at merge points. With exact minimum-cost valid mappings, DCNC-DAG is throughput-optimal and ensures rate stability of the physical queues under bounded arrivals. These guarantees hold for any fixed finite interval between mapping updates, even when mapping decisions rely on boundedly stale queue length information. For larger service DAGs, we develop DCNC-DAG-H, which replaces exact mapping optimization with a queue-aware heuristic. Simulations show that DCNC-DAG supports $2.7\times$-$5.5\times$ the throughput of queue-blind baselines, while DCNC-DAG-H achieves up to $2.68\times$ those of the corresponding baselines on larger workflow and AI service DAGs.