论文部分内容阅读
考虑到对数据包延迟等服务质量要求比较高的流媒体应用,文章研究了在有记忆接收节点模型也即接收节点可以缓存多个数据包的前提下,数据包有延迟约束的无线网络中基于网络编码的广播调度问题,目标在于最小化超过延迟约束数据包的数目。本文提出一种利用着色图的方法来进行编码调度的算法,可以显著减少超过延迟约束数据包的数目,为以后针对QoS需求的网络编码问题提供了参考。模拟实验表明相比于接收节点丢弃暂时无用数据包的无记忆模型,在有记忆模型下我们的算法可以在很多情况下有效地降低超出延迟约束率,这对时间关键的应用非常重要。
Considering streaming media applications with high service quality requirements such as packet delay, this paper studies the feasibility of using streaming media based on the memory node model, ie, the receiving node can cache multiple data packets. Network coding broadcast scheduling problem, the goal is to minimize the number of delay constraints over the number of packets. In this paper, an algorithm of coding and scheduling using shading graph is proposed, which can significantly reduce the number of packets that exceed the delay constraint and provide a reference for future network coding problems with QoS requirements. Simulation experiments show that our algorithm can effectively reduce the delay constraint rate in many cases under the memory model, which is very important for time critical applications, compared to the memoryless model in which the receiving node discards the temporarily useless packets.