文章基本信息

标题：Towards a Fair and Efficient Packet Scheduling Scheme in Inter-Flow Network Coding
本地全文：下载
作者：Jin Wang ; Teck Yoong Chai
期刊名称：Journal of Sensor and Actuator Networks
电子版ISSN：2224-2708
出版年度：2014
卷号：3
期号：4
页码：274-296
DOI：10.3390/jsan3040274
语种：English
出版社：MDPI Publishing
摘要：Network coding techniques are usually applied upon network-layer protocols to improve throughput in wireless networks. In scenarios with multiple unicast sessions, fairness is also an important factor. Therefore, a network coding-aware packet-scheduling algorithm is required. A packet-scheduling algorithm determines which packet to send next from a node’s packet backlog. Existing protocols mostly employ a basic round-robin scheduling algorithm to give “equal” opportunities to different packet flows. In fact, this “equal”-opportunity scheduling is neither fair, nor efficient. This paper intends to accentuate the importance of a coding-aware scheduling scheme. With a good scheduling scheme, we can gain more control over the per-flow throughput and fairness. Specifically, we first formulate a static scheduling problem and propose an algorithm to find the optimal scheduling scheme. We then extend the technique to a dynamic setting and, later, to practical routing protocols. Results show that the algorithm is comparatively scalable, and it can improve the throughput gain when the network is not severely saturated. The fairness among flows is drastically improved as a result of this scheduling scheme.
关键词：network coding; packet scheduling; fairness; weighted clique cover network coding ; packet scheduling ; fairness ; weighted clique cover