Metraipolis › archive › dc_8caae9ba253f

Throughput-Optimal Control of Distributed Computing Networks for Service DAGs — arXiv:2611.05007

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05007
License (as archived)
CC0-1.0
Archived
2026-11-04T12:43:19.678Z
SHA-256 of the archived text
b2f550661c8a943666bf7506ba5dcb2f60a119c44e3a18b5244793f15e7768c3
Stable URL of this page
https://metraipolis.com/documento/dc_8caae9ba253f

How to cite

Throughput-Optimal Control of Distributed Computing Networks for Service DAGs — arXiv:2611.05007 — arXiv (en), https://arxiv.org/abs/2611.05007 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8caae9ba253f (Metraipolis archive dc_8caae9ba253f, sha256 b2f550661c8a943666bf7506ba5dcb2f60a119c44e3a18b5244793f15e7768c3)
BibTeX
@misc{dc8caae9ba253f,
  title = {Throughput-Optimal Control of Distributed Computing Networks for Service DAGs — arXiv:2611.05007},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05007},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8caae9ba253f; sha256 b2f550661c8a943666bf7506ba5dcb2f60a119c44e3a18b5244793f15e7768c3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05007. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.NI, nuovi lavori del giorno).
Categorie arXiv: Networking and Internet Architecture (cs.NI).
Pagina del lavoro: https://arxiv.org/abs/2611.05007 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T12:30:17.119Z dalla pagina https://arxiv.org/list/cs.NI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).