跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1084新增论文
+883其中 AI 相关
+130已有论文修订
+94新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

统计 2026-11-18 02:16 — 2026-11-19 02:16(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
新论文 · v1arXiv:2611.20810

Prediction-Driven Contract Matching with Controlled Overbooking for Cloud-Edge DDoS Scrubbing Markets

Yue Luo, Houyi Qi, Minghui Liwang, Xinlei Yi, Han Jiang, Xuejiao Zheng

原文摘要

Cloud-edge distributed denial-of-service (DDoS) scrubbing requires ex-ante capacity commitments under uncertain traffic, heterogeneous budgets, resource costs, and fulfillment risks. We develop a prediction-driven two-stage contracting mechanism coordinating business entities (BEs), edge scrubbing nodes (ESs), and a cloud scrubbing center (CS) through BE-ES (B&E) main-service and ES-CS (E&C) supplementary contracts. In the first offline phase, Transformer forecasts generate candidate reserved scrubbing rates, generalized Nash bargaining determines candidate prices, and interim many-to-one B&E matching permits controlled overbooking under scenario-based aggregate ES shortfall-risk assessment. In the second offline phase, formal E&C reservations are established subject to capacity and payment constraints; their finalized rates and prices update ES-side proxy scores and guide localized risk-aware B&E contract adjustment. During online fulfillment, an edge-first, cloud-assisted weighted proportional allocation policy allocates scrubbing capacity under finalized contracts without rematching, renegotiation, or additional cloud reservations. Experiments with CICDDoS2019-derived workloads show that the proposed mechanism satisfies the prescribed empirical shortfall-risk criterion across all 100 evaluated horizon-instance pairs, whereas the NoRisk ablation violates it in all 100. Runtime measurements indicate lightweight online fulfillment relative to offline contract formation. The evaluated configurations also exhibit limited overall scrubbing coverage and near-zero realized cloud utilization.

cs.NI

版本更新 · v2arXiv:2605.02180

Predictive Scheduling and Model Sharing for Continuous UAV Edge Inference

Houyi Qi, Minghui Liwang

原文摘要

Continuous edge inference for unmanned aerial vehicles (UAVs) faces uncertain wireless connectivity, competition for shared computing resources, and the overhead of model loading and session-state migration. These interdependent factors complicate request admission and the continuity of successive inference services. This paper investigates joint request admission, edge-server assignment, and model selection under an admission-priority objective that strictly favors any feasible increase in admitted requests over bounded losses in delay, interruption risk, model quality, migration, and deployment. To address this problem, we propose Service-Window-Guided Admission and Model Placement (SWAP), which integrates predictive service-window information with shared model deployment and coordinated scheduling. Quantile regression and probability calibration estimate the remaining service window and interruption risk, while a bounded residence factor characterizes the potential reuse of shared model instances. We then formulate a constrained exact potential game based on marginal-contribution utilities and develop a solution procedure combining unilateral improvement, coordinated admission, and finite binary logit refinement. Theoretical analysis establishes NP-hardness, the existence of a constrained pure Nash equilibrium, and finite descent, together with feasibility and approximate unilateral equilibrium guarantees for the returned assignment. Simulation results demonstrate improved service continuity and reduced request rejection under increasing resource contention, while characterizing the accompanying tradeoffs in model-deployment traffic, inference quality, and execution delay.

cs.NI

版本更新 · v4arXiv:2606.09537

STEPS: Semantic Contract-Guided Scheduling for LLM-Assisted Natural Language-Driven Edge AI Services

Houyi Qi, Minghui Liwang, Xianbin Wang, Xinlei Yi, Seyyedali Hosseinalipour

原文摘要

Edge user/service scheduling governs where and how AI services are executed under limited communication and computing resources. Existing edge scheduling frameworks typically assume numerically specified service requirements, such as latency bounds and energy budgets. However, users often express ambiguous and context-dependent expectations in natural language, creating a gap between user intent and scheduling decisions. We propose semantic contract-guided edge potential scheduling (STEPS), a natural language-driven framework that introduces semantic contracts as executable interfaces between user-side semantics and edge-side decisions. A large language model (LLM)-assisted semantic parser extracts service requirements and raw confidence scores from natural language requests. Confidence calibration and interpretable mapping rules convert these outputs into preference weights, fulfillment bounds, and semantic uncertainty. STEPS formulates intended per-slot edge scheduling as an exact potential game for execution-node selection, computing-resource provisioning, and bandwidth allocation, followed by capacity-feasible resource realization. Fulfillment-driven feedback signals enable adaptive scheduling under evolving service and network conditions. We establish the existence of pure-strategy Nash equilibrium, prove finite-step convergence of uncapped strict best-response dynamics, and characterize the boundedness of projected adaptive-control parameters. Experiments under synthetic and Melbourne-based hybrid settings demonstrate improved contract fulfillment and reduced service loss relative to several adapted benchmarks. Post-drift evaluations further show that feedback adaptation improves fulfillment and admission coverage under the tested conditions.

cs.NI