Optimizing packet scheduling decisions with network coding

Jin Wang, T. Chai, L. Wong
{"title":"Optimizing packet scheduling decisions with network coding","authors":"Jin Wang, T. Chai, L. Wong","doi":"10.1109/ICT.2014.6845081","DOIUrl":null,"url":null,"abstract":"Network coding techniques are usually applied upon network layer protocols to improve throughput in wireless networks. However, the packet scheduling algorithm has long been neglected. With proper scheduling, bottleneck nodes can clear their packet queue faster than a vanilla round-robin scheduling algorithm. Therefore, a higher Coding+MAC gain can be achieved. In this paper, we formulate the scheduling problem and propose a search algorithm to find the optimal solution. A pruning rule and an approximation scheme are proposed to reduce the amount of search branches, and hence to improve the time performance. Results show that the algorithm can improve the throughput gain as compared to round-robin scheduling. The throughput gain is most conspicuous when the network is almost but not saturated.","PeriodicalId":154328,"journal":{"name":"2014 21st International Conference on Telecommunications (ICT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 21st International Conference on Telecommunications (ICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT.2014.6845081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Network coding techniques are usually applied upon network layer protocols to improve throughput in wireless networks. However, the packet scheduling algorithm has long been neglected. With proper scheduling, bottleneck nodes can clear their packet queue faster than a vanilla round-robin scheduling algorithm. Therefore, a higher Coding+MAC gain can be achieved. In this paper, we formulate the scheduling problem and propose a search algorithm to find the optimal solution. A pruning rule and an approximation scheme are proposed to reduce the amount of search branches, and hence to improve the time performance. Results show that the algorithm can improve the throughput gain as compared to round-robin scheduling. The throughput gain is most conspicuous when the network is almost but not saturated.
优化数据包调度决策与网络编码
网络编码技术通常应用于网络层协议,以提高无线网络的吞吐量。然而,分组调度算法一直被人们所忽视。通过适当的调度,瓶颈节点可以比普通的轮循调度算法更快地清除它们的数据包队列。因此,可以实现更高的编码+MAC增益。在本文中,我们提出了调度问题,并提出了一种寻找最优解的搜索算法。提出了一种剪枝规则和一种近似方法,以减少搜索分支的数量,从而提高时间性能。结果表明,与轮循调度相比,该算法可以提高吞吐量增益。当网络几乎饱和但不饱和时,吞吐量增益最为明显。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信