全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
-  2018 

基于时间门限值的低时延编码感知路由算法

DOI: 10.12068/j.issn.1005-3026.2018.11.003

Keywords: 网络编码, 时延, 门限值, 权衡, 路由
Key words: network coding delay threshold value tradeoff routing

Full-Text   Cite this paper   Add to My Lib

Abstract:

摘要 针对大多数编码感知路由算法忽略了不同数据流到达编码节点的时间不一致问题.在已有编码感知路由算法的基础上,提出了基于等待门限值的编码感知路由算法.首先利用编码条件寻找编码节点,然后引入网络测试获得等待编码时间的门限值,最后根据实际值和门限值的关系决定是否等待.仿真结果表明:使用该方案的编码感知路由算法比仅仅考虑编码机会的路由算法在编码时延和吞吐量方面有更好的效果.
Abstract:Existing coding aware routing algorithms ignore a realistic question that different data packets reach the encoding node at different time. To overcome the above problem, an improvement scheme was proposed using a threshold value on the basis of existing coding-aware routing. Firstly encoding condition was used to find the nodes to encode. Then the network delay training phase was introduced to obtain the threshold value of waiting time. Lastly, it was decided whether to wait or not according to the relationship between the actual value and the threshold value. Simulation results show that the algorithm can achieve a better result than the traditional opportunistic coding policy in delivery delay and throughput.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133