Now 8731 visitors
Today:0 Yesterday:0
Total: 143022 216S 51P 5R
2026-10-21, Week 43
Member Login
TACT Journal Homepage
Call for Paper
Committee
Find My Paper
Author Homepage
Statistics & History
Welcome Message
Paper Procedure
FAQ
Paper Archives
Outstanding Papers
Program & Proceedings
Presentation Platform
Hotel & Travel Info
Photo Gallery
Scheduler Login
Seminar
Archives Login
Sponsors




















IEEE/ICACT20260355 Question.4
Questioner: yangyn@dsp.ac.cn    2026-02-05 ¿ÀÈÄ 8:58:27
IEEE/ICACT20260355 Answer.4
Answer by Auhor xueyy@dsp.ac.cn   2026-02-05 ¿ÀÈÄ 8:58:27
The conclusion mentions future work on theoretical analysis of the control law and overhead profiling. What specific tools from stochastic approximation will be used, and how will you address the feedback overhead for small data blocks? Concretely, this will follow the standard stochastic-approximation route for noisy iterative updates (e.g., ODE-based/stability-style analysis) to explain when and how 𝑟𝑡 tracks the optimum in random-routing environments. For small data blocks, I will explicitly address the fact that the benefit of adaptation can be reduced because feedback and state-evaluation overhead is no longer negligible. I will therefore profile the overhead quantitatively—both bandwidth consumption and processing time—and incorporate these measurements (including practical encoding/decoding costs) into the completion-time model, so the evaluation reflects the net end-to-end gain when blocks are small.

Select Voice