ID	原文	译文
4293	在不同的服务请求量、服务节点规模、集群数量及虚拟网络功能之间的逻辑连接关系等参数下的对比实验表明，	Extensive simulation was set up to evaluate the effectiveness of the proposed strategy under dif-ferent parameter settings, such as different volume of requests, different scale of service nodes, different number of MECclusters, and logical link relationships between virtual network functions.
4294	该策略能提供更低时延的端到端服务，使时延敏感类移动业务获得更好体验。	Results show that this strategy can providelower end-to-end services delay and better service experience for latency-sensitive mobile application.
4295	通过分析 RLT 码，针对 RLT 码译码算法中存在的缺陷，提出一种过滤式降维（FDR）算法，消除了传统译码算法在收到一定数量编码分组才开始解码的等待时间，实现了边接收边尝试解码的快速译码方式。	By analyzing the shortcomings of RLT coding and decoding algorithm, a filtering dimension reduction (FDR)algorithm was proposed, which eliminated the waiting time of the traditional decoding algorithm and achieves fast decoding.
4296	此外，通过编码分组之间的异或运算，有效增加了度为 1 的编码分组的产生概率，不再仅依赖于从发送端获取度为 1 的编码分组，在降低传输时延的同时通过增加度为 1 的编码分组出现的概率从而提高译码成功率。	In addition, XOR operation between encoded packages effectively increased the number of one-degree encoded packages,and improved decoding probability while reducing transmission delay.
4297	在此基础上，提出一种与 FDR 译码算法相结合的优化度分布函数，适当提高度为 2、度为 3、度为 4 的编码分组的比例，从而大大增加一次降维即可得到度为 1 的编码分组的概率，加快了译码速度。	An optimized degree distribution function for FDRdecoding algorithm was proposed, which increased the proportion of two-degree, three-degree and four-degree encodedpackages, further increased the probability of one-degree packet, so that speeded up the decoding progress.
4298	NS3 仿真结果表明，FDR 算法的解码成功率普遍高于 RLT 码。	Simulation re-sults with NS3 show that the decoding success probability of FDR algorithms higher than RLT algorithm.
4299	针对标准 RAW 机制无法适应网络环境变化做出调整，且分组依赖连续的 AID 问题，提出一种基于伪随机序列的 RAW 重分组方法。	Aiming at the problem that the standard RAW mechanism cannot adjust to changes in the network and thegrouping depends on continuous AIDs, a RAW regrouping method based on a pseudo-random sequence was proposed.
4300	AP 在关联阶段为节点分配一个伪随机序列作为地址码，在分组阶段采用分组复合码携带分组信息。	The AP assigned a pseudo-random sequence to the node as the address code during the association phase, and used com-pound code to carry groups information during the grouping phase.
4301	该方法实现了非连续 AID 节点在线式重分组，减小了重分组的时间开销。	It implemented online regrouping of discontinuousAID nodes and reduced the overhead of regrouping.
4302	为使 RAW 合理分配资源，解决组间负载不平衡问题，提出了基于期望信道时间的 RAW 重分组方法，以信道利用率为分组依据，优化了节点 RAW 组、RAW 持续时间和 RAW 分组数。	In order to rationally allocate resources in RAW and solve the prob-lem of load imbalance between groups, a RAW regrouping method based on expected channel time was proposed. Based on channel utilization, the RAW groups, RAW duration, and numbers of RAW were optimized.