Self-adaptive Scheme to Adjust Redundancy for Network Coding with TCP
Network coding has emerged as an important potential approach to improve the robustness and efficiency of data transmission over lossy wireless network. TPC/NC protocol proposed by Sundararajan et al incorporating network coding into TCP by online coding,
- PDF / 576,830 Bytes
- 11 Pages / 439.363 x 666.131 pts Page_size
- 30 Downloads / 140 Views
Abstract. Network coding has emerged as an important potential approach to improve the robustness and efficiency of data transmission over lossy wireless network. TPC/NC protocol proposed by Sundararajan et al incorporating network coding into TCP by online coding, TCP/NC has the advantage of naturally adding network coding to current network systems and masking non-congestion packet losses from the congestion control algorithm, However, in TCP/NC the values of redundancy factor R can’t be adapted based on the characteristics of the underlying channel. In this paper we propose a novel self-adaptive scheme to dynamically adjust R based on the collective feedback information of ACKs, which contain the information of sinks decoding matrix. Since the scale of decoding matrix is indicators of the lossy channel condition, the source adjusts R based on the channel conditions, avoiding unnecessary TCP rate reduction and preventing the network from entering in a congestion state. The TCP/NC with our self-adaptive scheme is realized in OMNET++. Simulation results over realistic network scenarios show that our scheme in conjunction with the standard TCP/NC significantly outperforms the previous redundancy approach in reducing size of decoding matrix , and produces better TCP-throughputs than the standard TCP/NC, TCP-Reno. Keywords: network coding, TCP, packet loss, redundancy packet.
1
Introduction
It is well known that TCP protocol has an awful performance in the lossy wireless network[2][3][4]. It is because that each loss is interpreted as a congestion signal in TCP. Network Coding allows nodes of a network to send packets that are linear combinations of previously received information, instead of delivering the information to their destination in the standard store-and-forward-manner[1][2].
The work described in this paper is partially supported by the project of National Science Foundation of China under grant No. 61103182; the National High Technology Research and Development Program of China (863 Program) No. 2011AA01A103.
W. Xu et al. (Eds.): NCCET 2013, CCIS 396, pp. 81–91, 2013. c Springer-Verlag Berlin Heidelberg 2013
82
H. Zhang et al.
Network coding has emerged as an important potential approach in the operation of communication networks [1].The main benefits of network coding are the potential throughput improvements and a high degree of robustness to packet losses[7]. Despite this potential of network coding, we still seem far from seeing widespread implementation of network coding across networks[5][6]. In [5] Sundararajan et al. propose a new TCP-friendly protocol that successfully implemented the network coding into TCP with minor changes to the protocol stack. The key idea was introducing a new network coding layer between the transport layer and IP layer in TCP/IP stack, which masks non-congestion packet losses from congestion control algorithm. In this layer TCP segments are encoded at the sender and decoded at the receiver. In[6]Sundararajan et al. present a real-world implementation of this pro
Data Loading...
