Skip to content
Preprint

AsymSpec: Efficient Cloud-Edge Speculative Decoding over Asymmetric Networks

Aug 2026 · 0 citations · 37 references
Computer Science

TL;DR

This work presents AsymSpec, which addresses uplink-gated verification and invalid dependent work with two corresponding mechanisms, and shows that AsymSpec delivers 2.82-28.03$\times the output-token throughput of the strongest baseline.

Abstract

Cloud-edge speculative decoding places a lightweight draft model at an edge gateway and a higher-quality target model in the cloud, but inserts communication into every speculative block. Under a constrained uplink, candidate messages may queue while the verifier is idle. Stop-and-wait scheduling leaves edge compute underutilized; optimistic same-request runahead can waste work when a rejection or an unexpected bonus token invalidates dependent drafts. We present AsymSpec, which addresses uplink-gated verification and invalid dependent work with two corresponding mechanisms. Its asymmetric verification protocol keeps the common-path acceptance upload compact and moves richer, rejection-only correction information to the downlink. A total-variation (TV) certificate for the residual distribution determines whether a small target top-K response suffices; if not, the protocol progressively escalates through proposal-based exact recovery before falling back to the full distribution. Its confirmed-prefix pipeline exposes only independent, valid requests to the edge scheduler and lets the cloud re-batch arrived blocks, hiding verification waits when another confirmed-prefix request is ready without using same-request runahead. Across three draft-target pairs, two workloads, and three asymmetric network profiles, our end-to-end evaluation shows that AsymSpec delivers 2.82-28.03$\times$ the output-token throughput of the strongest baseline.

View source

Similar papers

Sep 2026

Co-Optimizing Request Scheduling and KV Caching for Edge LLM Serving

Deploying large language models (LLMs) on edge nodes enables low-latency and privacy-preserving inference, but faces severe resource constraints under high-concurrence workloads. While existing inference systems leverage intranode key–value (KV) caching to improve efficiency, they largely neglect the unique complexitie...

Xishuo Li, Wei Jiao, Jun He et al. · 0 citations
Preprint Aug 2026

SPADE: Speculative Decoding for Precise and Low Cost Distributed Edge Cloud Inference

This work presents a distributed inference framework that integrates speculative decoding across edge and cloud, and shifts the bulk of computation to the edge, significantly lowers inference time and cloud cost, and preserves the accuracy of the big model without any retraining requirement.

D. J. Bajpai, K. Upadhyay, M. Hanawal · 0 citations
Preprint Jul 2026

Roomie: Interference-Aware Colocation for Efficient Model Serving

Roomie is presented, a model serving orchestration architecture that predicts and avoids kernel-level interference between colocated DNNs, and reduces SLO violations by up to 3x, while maintaining comparable, and in many cases superior, goodput relative to existing approaches.

Youssouph Faye, Francescomaria Faticanti, Shubham Jain et al. · 0 citations
Preprint Jul 2026

General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing

This work presents the first constant-competitive algorithm for arbitrary prompt lengths and arbitrary response lengths with no additional assumptions, built on a novel regime-aware routing framework.

Yiding Feng, Siyu Liu, Zonghan Yang et al. · 1 citation
Preprint Aug 2026

CacheRoute: Planned Prefix-Affinity Routing for Large-Scale LLM Serving

When affinity recovers too little KV work, its residual load skew reduces or erases the improvement, so gating any deployment with a shadow replay rather than enabling affinity from workload statistics alone is recommended.

Huang Cheng · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.