为边缘生成式AI设计信任感知路由,提升分布式推理可靠性。
Trust-Aware Routing for Distributed Generative AI Inference at the Edge
- 构建风险约束最短路径模型,结合信任阈值剪枝与Dijkstra算法。
- 在实际边缘规模下实现亚毫秒级平均延迟,大尺度下低于10毫秒。
- 采用混合信任架构,动态隔离不可靠节点,适合高故障场景应用。
生成式AI的部署正越来越多地在去中心化、异构的边缘设备上执行推理,而非单一可信服务器。在此环境下,单个设备故障或异常行为可能导致整个推理过程中断,传统尽力而为的点对点路由已不适用。因此,协调分布式生成式推理需显式考虑可靠性、性能波动及参与方间的信任关系。本文提出G-TRAC,一种融合算法路径选择与系统协议设计的信任感知协调框架,以保障分布式推理的鲁棒性。首先,将路由问题建模为风险约束最短路径计算,提出一种多项式时间解法,结合信任下界剪枝与Dijkstra搜索,在实际边缘规模下实现亚毫秒级中位数路由延迟,大规模下仍低于10毫秒。其次,为支持动态环境中的路由逻辑,框架采用混合信任架构,在稳定锚点维护全局声誉状态,并通过后台同步向边缘节点传播轻量更新。在由商品化设备组成的异构测试平台上进行的实验表明,G-TRAC显著提升推理完成率,有效隔离不可靠节点,并在节点故障和网络分区下维持稳健运行。
原文摘要 · Abstract (English)
Emerging deployments of Generative AI increasingly execute inference across decentralized and heterogeneous edge devices rather than on a single trusted server. In such environments, a single device failure or misbehavior can disrupt the entire inference process, making traditional best-effort peer-to-peer routing insufficient. Coordinating distributed generative inference therefore requires mechanisms that explicitly account for reliability, performance variability, and trust among participating peers. In this paper, we present G-TRAC, a trust-aware coordination framework that integrates algorithmic path selection with system-level protocol design to ensure robust distributed inference. First, we formulate the routing problem as a \textit{Risk-Bounded Shortest Path} computation and introduce a polynomial-time solution that combines trust-floor pruning with Dijkstra's search, achieving sub-millisecond median routing latency at practical edge scales, and remaining below 10 ms at larger scales. Second, to operationally support the routing logic in dynamic environments, the framework employs a \textit{Hybrid Trust Architecture} that maintains global reputation state at stable anchors while disseminating lightweight updates to edge peers via background synchronization. Experimental evaluation on a heterogeneous testbed of commodity devices demonstrates that G-TRAC significantly improves inference completion rates, effectively isolates unreliable peers, and sustains robust execution even under node failures and network partitions.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。