7,975 research outputs found
Network coding meets TCP
We propose a mechanism that incorporates network coding into TCP with only
minor changes to the protocol stack, thereby allowing incremental deployment.
In our scheme, the source transmits random linear combinations of packets
currently in the congestion window. At the heart of our scheme is a new
interpretation of ACKs - the sink acknowledges every degree of freedom (i.e., a
linear combination that reveals one unit of new information) even if it does
not reveal an original packet immediately. Such ACKs enable a TCP-like
sliding-window approach to network coding. Our scheme has the nice property
that packet losses are essentially masked from the congestion control
algorithm. Our algorithm therefore reacts to packet drops in a smooth manner,
resulting in a novel and effective approach for congestion control over
networks involving lossy links such as wireless links. Our experiments show
that our algorithm achieves higher throughput compared to TCP in the presence
of lossy wireless links. We also establish the soundness and fairness
properties of our algorithm.Comment: 9 pages, 9 figures, submitted to IEEE INFOCOM 200
Network Coding Meets TCP: Theory and Implementation
The theory of network coding promises significant benefits in network performance, especially in lossy networks and in multicast and multipath scenarios. To realize these benefits in practice, we need to understand how coding across packets interacts with the acknowledgment (ACK)-based flow control mechanism that forms a central part of today's Internet protocols such as transmission control protocol (TCP). Current approaches such as rateless codes and batch-based coding are not compatible with TCP's retransmission and sliding-window mechanisms. In this paper, we propose a new mechanism called TCP/NC that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the source transmits random linear combinations of packets currently in the congestion window. At the heart of our scheme is a new interpretation of ACKs-the sink acknowledges every degree of freedom (i.e., a linear combination that reveals one unit of new information) even if it does not reveal an original packet immediately. Thus, our new TCP ACK rule takes into account the network coding operations in the lower layer and enables a TCP-compatible sliding-window approach to network coding. Coding essentially masks losses from the congestion control algorithm and allows TCP/NC to react smoothly to losses, resulting in a novel and effective approach for congestion control over lossy networks such as wireless networks. An important feature of our solution is that it allows intermediate nodes to perform re-encoding of packets, which is known to provide significant throughput gains in lossy networks and multicast scenarios. Simulations show that our scheme, with or without re-encoding inside the network, achieves much higher throughput compared to TCP over lossy wireless links. We present a real-world implementation of this protocol that addresses the practical aspects of incorporating network coding and decoding with TCP's wind ow management mechanism. We work with TCP-Reno, which is a widespread and practical variant of TCP. Our implementation significantly advances the goal of designing a deployable, general, TCP-compatible protocol that provides the benefits of network coding.National Science Foundation (U.S.) (Grant CNS-0627021)National Science Foundation (U.S.) (Grant CNS-0721491)National Science Foundation (U.S.) (Grant CCF-0915922)United States. Defense Advanced Research Projects Agency (Subcontract 18870740-37362-C)United States. Defense Advanced Research Projects Agency (Subcontract 060786)United States. Defense Advanced Research Projects Agency (Subcontract 069145)United States. Defense Advanced Research Projects Agency (Contract N66001-06-C-2020)Space and Naval Warfare Systems Center San Diego (U.S.) (Contract N66001- 08-C-2013
End-to-End Algebraic Network Coding for Wireless TCP/IP Networks
The Transmission Control Protocol (TCP) was designed to provide reliable
transport services in wired networks. In such networks, packet losses mainly
occur due to congestion. Hence, TCP was designed to apply congestion avoidance
techniques to cope with packet losses. Nowadays, TCP is also utilized in
wireless networks where, besides congestion, numerous other reasons for packet
losses exist. This results in reduced throughput and increased transmission
round-trip time when the state of the wireless channel is bad. We propose a new
network layer, that transparently sits below the transport layer and hides non
congestion-imposed packet losses from TCP. The network coding in this new layer
is based on the well-known class of Maximum Distance Separable (MDS) codes.Comment: Accepted for the 17th International Conference on Telecommunications
2010 (ICT2010), Doha, Qatar, April 4 - 7, 2010. 6 pages, 7 figure
Can network coding bridge the digital divide in the Pacific?
Conventional TCP performance is significantly impaired under long latency
and/or constrained bandwidth. While small Pacific Island states on satellite
links experience this in the extreme, small populations and remoteness often
rule out submarine fibre connections and their communities struggle to reap the
benefits of the Internet. Network-coded TCP (TCP/NC) can increase goodput under
high latency and packet loss, but has not been used to tunnel conventional TCP
and UDP across satellite links before. We report on a feasibility study aimed
at determining expected goodput gain across such TCP/NC tunnels into island
targets on geostationary and medium earth orbit satellite links.Comment: 5 pages, 3 figures, conference (Netcod2015
Random Linear Network Coding for 5G Mobile Video Delivery
An exponential increase in mobile video delivery will continue with the
demand for higher resolution, multi-view and large-scale multicast video
services. Novel fifth generation (5G) 3GPP New Radio (NR) standard will bring a
number of new opportunities for optimizing video delivery across both 5G core
and radio access networks. One of the promising approaches for video quality
adaptation, throughput enhancement and erasure protection is the use of
packet-level random linear network coding (RLNC). In this review paper, we
discuss the integration of RLNC into the 5G NR standard, building upon the
ideas and opportunities identified in 4G LTE. We explicitly identify and
discuss in detail novel 5G NR features that provide support for RLNC-based
video delivery in 5G, thus pointing out to the promising avenues for future
research.Comment: Invited paper for Special Issue "Network and Rateless Coding for
Video Streaming" - MDPI Informatio
Modeling Network Coded TCP Throughput: A Simple Model and its Validation
We analyze the performance of TCP and TCP with network coding (TCP/NC) in
lossy wireless networks. We build upon the simple framework introduced by
Padhye et al. and characterize the throughput behavior of classical TCP as well
as TCP/NC as a function of erasure rate, round-trip time, maximum window size,
and duration of the connection. Our analytical results show that network coding
masks erasures and losses from TCP, thus preventing TCP's performance
degradation in lossy networks, such as wireless networks. It is further seen
that TCP/NC has significant throughput gains over TCP. In addition, we simulate
TCP and TCP/NC to verify our analysis of the average throughput and the window
evolution. Our analysis and simulation results show very close concordance and
support that TCP/NC is robust against erasures. TCP/NC is not only able to
increase its window size faster but also to maintain a large window size
despite losses within the network, whereas TCP experiences window closing
essentially because losses are mistakenly attributed to congestion.Comment: 9 pages, 12 figures, 1 table, submitted to IEEE INFOCOM 201
Reliable Video Streaming over mmWave with Multi Connectivity and Network Coding
The next generation of multimedia applications will require the
telecommunication networks to support a higher bitrate than today, in order to
deliver virtual reality and ultra-high quality video content to the users. Most
of the video content will be accessed from mobile devices, prompting the
provision of very high data rates by next generation (5G) cellular networks. A
possible enabler in this regard is communication at mmWave frequencies, given
the vast amount of available spectrum that can be allocated to mobile users;
however, the harsh propagation environment at such high frequencies makes it
hard to provide a reliable service. This paper presents a reliable video
streaming architecture for mmWave networks, based on multi connectivity and
network coding, and evaluates its performance using a novel combination of the
ns-3 mmWave module, real video traces and the network coding library Kodo. The
results show that it is indeed possible to reliably stream video over cellular
mmWave links, while the combination of multi connectivity and network coding
can support high video quality with low latency.Comment: To be presented at the 2018 IEEE International Conference on
Computing, Networking and Communications (ICNC), March 2018, Maui, Hawaii,
USA (invited paper). 6 pages, 4 figure
In-Order Delivery Delay of Transport Layer Coding
A large number of streaming applications use reliable transport protocols
such as TCP to deliver content over the Internet. However, head-of-line
blocking due to packet loss recovery can often result in unwanted behavior and
poor application layer performance. Transport layer coding can help mitigate
this issue by helping to recover from lost packets without waiting for
retransmissions. We consider the use of an on-line network code that inserts
coded packets at strategic locations within the underlying packet stream. If
retransmissions are necessary, additional coding packets are transmitted to
ensure the receiver's ability to decode. An analysis of this scheme is provided
that helps determine both the expected in-order packet delivery delay and its
variance. Numerical results are then used to determine when and how many coded
packets should be inserted into the packet stream, in addition to determining
the trade-offs between reducing the in-order delay and the achievable rate. The
analytical results are finally compared with experimental results to provide
insight into how to minimize the delay of existing transport layer protocols
- …