看PAPER看快一個下午 搞不懂在做什麼 可以解答一下嗎 非常感謝
The M-LWDF algorithm is tailored to schedule multiple
data users sharing a wireless channel. The constraint of MLWDF
is, for a given allowed violation probability δi
Pr{Wi>=τi}<=δi .........(2)
where Wi is the delay of service i and τi is a deadline to be
served. (Comparing between (1) and (2), we use τi and δi as
the PDB and the allowed violation rate of service i during
scheduling, respectively.)
Pr{Packet delay >= PDB} <= 0.02.......(1)
To that end, at every TTI the algorithm selects the best
service k such that
k = arg max i∈Ω -logδi/τi*ri(t)//ri(t)*Wi(t)
where Ω is the set of connected services, ri(t) is the available
data rate of service i at time t, ri(t) is the average transmission
data rate, and Wi is the head-of-line delay of service i. The
average data rate ri(t) of service i can be internally computed
by the scheduler based on the amount of the transmitted data.
The available data rate ri(t) of service i can be estimated
using Adaptive Modulation and Coding (AMC) depending on
the wireless condition.
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 123.194.225.54