Skip to content
Conference

Tiered Speculative Decoding with Uplink Scheduling for End-Edge LLM Inference

Aug 2026 · 2026 IEEE/CIC International Conference on Communications in China (ICCC) · pp. 461-466 · 0 citations · 20 references

Abstract

With the large-scale deployment of LLM-driven services, centralized cloud inference faces increasing serving loads and latency bottlenecks. End-edge collaborative speculative decoding has emerged as a promising paradigm because its draftand-verify mechanism enables efficient collaboration between local generation and edge validation. However, existing end-edge speculative decoding schemes still suffer from uplink transmission delays and wireless scheduling uncertainty. In particular, edge-side verification is often delayed by uplink access and scheduling uncertainty, making the verification start time a major source of tail latency. Motivated by this observation, we propose a tiered cross-layer end-edge speculative decoding framework. Specifically, we decompose uplink information into critical tokens and auxiliary distributional information, so that the critical tokens alone are sufficient to trigger edgeside verification, while the auxiliary information is incorporated only if it arrives before verification completes. This improves token acceptance without blocking the critical path. We further introduce a semi-persistent uplink scheduling mechanism that reserves predictable transmission opportunities for critical-token delivery, avoiding request-grant handshakes and reducing delay accumulation across decoding steps. Experimental comparisons against baselines demonstrate that the proposed framework increases inference throughput from 35 tokens per second (TPS) to over 45 TPS while keeping the system's P95 latency stable at approximately 45 ms, thereby improving throughput and suppressing tail latency.

View source

Similar papers

#large language models Book Open access Sep 2026

Online Scheduling of Battery-Aware Speculative Decoding for Energy-Efficient Cloud-Edge Collaborative LLM Inference

This work designs a learning-centric algorithmic framework which employs bandit learning to address the intractability and manage draft length selection in the first subproblem and applies online learning to address the online uncertainty and manage battery states and grid-energy use in the second subproblem, both with...

Heng-Di Wang, Lei Jiao, Kong-Lin Zhu et al. · 0 citations
#edge computing Preprint Sep 2026

AceSpec: An Asymmetric Edge-Cloud Collaborative Framework for Communication-Efficient LLM Inference

AceSpec, an asymmetric edge-cloud collaborative framework that employs an asymmetric communication protocol that transmits minimal main-chain indices uplink and compact sparse distributions downlink and introduces a network-aware, Lagrangian-optimized resource allocation strategy that dynamically maximizes the local ca...

Yi-Da Zhang, Zhi-Yong Gao, Shuai-Bing Yue et al. · 0 citations
#artificial intelligence Preprint Sep 2026

End-to-End Latency-Minimizing and Load-Balanced Request Scheduling for Edge LLM Inference in Agentic AI Services

An online request scheduling framework for edge LLM inference that jointly minimizes long-term average end-to-end latency and regulates workload distribution across heterogeneous edge servers is investigated and the LYREO approach, a cross-slot inference model that captures transmission, prefill, iteration-level decodi...

Zhen Li, Jun Cai, Hao-Ran Gao et al. · 0 citations

Mix-or-Split: Latency-Aware Scheduling for Edge–Cloud LLM Inference

In this paper, we present a latency-aware scheduler for large-language-model (LLM) inference across mobile devices, edge servers, and a remote cloud. Our fine-grained delay model captures OFDMA uplink/downlink rates, KV-cache backhaul serialization, and profiled GPU planning-chunk resource constraints, enabling per-req...

Xinghan Wang, Xiao-Xiong Zhong, Wei-Hong Yang et al. · 0 citations
#small language model Preprint Aug 2026

Multi-Access Speculative Inference: Uplink or Downlink?

A sum-token-goodput maximization problem that jointly accounts for mode selection, draft-length control, and power allocation is formulated, and a simple optimal structure is revealed that enables efficient search over the number of UL devices, with the corresponding transmit powers optimized accordingly.

Changrui Cai, Kaibin Huang · 0 citations
#machine learning Preprint Sep 2026

ASPIRE: Asynchronous Batched Self-Speculative Decoding for Long-Context LLM Inference

This work proposes ASPIRE, a non-synchronized batched self-speculative decoding framework built on three components, which achieves speedup in decoding throughput over autoregressive baselines and improves average speedup by approximately $27\% over the strongest prior self-speculative baselines.

Amir Ziashahabi, Hossein Entezari Zarch, Lei Gao et al. · 1 citation

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