8,420 research outputs found
Improvements in DCCP congestion control for satellite links
We propose modifications in the TCP-Friendly Rate Control (TFRC) congestion control mechanism from the Datagram Congestion Control Protocol (DCCP) intended for use with real-time traffic, which are aimed at improving its performance for long delay (primarily satellite) links. Firstly, we propose an algorithm to optimise the number of feedback messages per round trip time (RTT) rather than use the currently standard of at least one per RTT, based on the observed link delay. We analyse the improvements achievable with proposed modification in different phases of congestion control and present results from simulations with modified ns-2 DCCP and live experiments using the modified DCCP Linux kernel implementation. We demonstrate that the changes results in improved slow start performance and a reduced data loss compared to standard DCCP, while the introduced overhead remains acceptable
Recommended from our members
Improving TCP performance over heterogeneous networks : The investigation and design of End to End techniques for improving TCP performance for transmission errors over heterogeneous data networks.
Transmission Control Protocol (TCP) is considered one of the most important protocols
in the Internet. An important mechanism in TCP is the congestion control
mechanism which controls TCP sending rate and makes TCP react to congestion
signals. Nowadays in heterogeneous networks, TCP may work in networks with some
links that have lossy nature (wireless networks for example). TCP treats all packet
loss as if they were due to congestion. Consequently, when used in networks that
have lossy links, TCP reduces sending rate aggressively when there are transmission
(non-congestion) errors in an uncongested network.
One solution to the problem is to discriminate between errors; to deal with congestion
errors by reducing TCP sending rate and use other actions for transmission
errors. In this work we investigate the problem and propose a solution using an
end-to-end error discriminator. The error discriminator will improve the current
congestion window mechanism in TCP and decide when to cut and how much to
cut the congestion window.
We have identified three areas where TCP interacts with drops: congestion window
update mechanism, retransmission mechanism and timeout mechanism. All of
these mechanisms are part of the TCP congestion control mechanism. We propose
changes to each of these mechanisms in order to allow TCP to cope with transmission
errors. We propose a new TCP congestion window action (CWA) for transmission
errors by delaying the window cut decision until TCP receives all duplicate acknowledgments
for a given window of data (packets in flight). This will give TCP a clear
image about the number of drops from this window. The congestion window size is
then reduced only by number of dropped packets. Also, we propose a safety mechanism
to prevent this algorithm from causing congestion to the network by using
an extra congestion window threshold (tthresh) in order to save the safe area where
there are no drops of any kind. The second algorithm is a new retransmission action
to deal with multiple drops from the same window. This multiple drops action
(MDA) will prevent TCP from falling into consecutive timeout events by resending
all dropped packets from the same window. A third algorithm is used to calculate
a new back-off policy for TCP retransmission timeout based on the networkÂżs available
bandwidth. This new retransmission timeout action (RTA) helps relating the
length of the timeout event with current network conditions, especially with heavy
transmission error rates.
The three algorithms have been combined and incorporated into a delay based
error discriminator. The improvement of the new algorithm is measured along with
the impact on the network in terms of congestion drop rate, end-to-end delay, average
queue size and fairness of sharing the bottleneck bandwidth. The results show that
the proposed error discriminator along with the new actions toward transmission
errors has increased the performance of TCP. At the same time it has reduced the
load on the network compared to existing error discriminators. Also, the proposed
error discriminator has managed to deliver excellent fairness values for sharing the
bottleneck bandwidth.
Finally improvements to the basic error discriminator have been proposed by
using the multiple drops action (MDA) for both transmission and congestion errors.
The results showed improvements in the performance as well as decreases in the
congestion loss rates when compared to a similar error discriminator.Ministry of Higher Education and
King Saud University in Saudi Arabia
On the quality of VoIP with DCCP for satellite communications
We present experimental results for the performance of selected voice codecs using DCCP with CCID4 congestion control over a satellite link. We evaluate the performance of both constant and variable data rate speech codecs for a number of simultaneous calls using the ITU E-model. We analyse the sources of packet losses and additionally analyse the effect of jitter which is one of the crucial parameters contributing to VoIP quality and has, to the best of our knowledge, not been considered previously in the published DCCP performance results. We propose modifications to the CCID4 algorithm and demonstrate how these improve the VoIP performance, without the need for additional link information other than what is already monitored by CCID4. We also demonstrate the fairness of the proposed modifications to other flows. Although the recently adopted changes to TFRC specification alleviate some of the performance issues for VoIP on satellite links, we argue that the characteristics of commercial satellite links necessitate consideration of further improvements. We identify the additional benefit of DCCP when used in VoIP admission control mechanisms and draw conclusions about the advantages and disadvantages of the proposed DCCP/CCID4 congestion control mechanism for use with VoIP applications
Promoting the use of reliable rate based transport protocols: the Chameleon protocol
Rate-based congestion control, such as TFRC, has not been designed to enable reliability. Indeed, the birth of TFRC protocol has resulted from the need for a congestion-controlled transport protocol in order to carry multimedia traffic. However, certain applications still prefer the use of UDP in order to implement their own congestion control on top of it. The present contribution proposes to design and validate a reliable rate-based protocol based on the combined use of TFRC, SACK and an adapted flow control. We argue that rate-based congestion control is a perfect alternative to window-based congestion control as most of today applications need to interact with the transport layer and should not be only limited to unreliable services. In this paper, we detail the implementation of a reliable rate-based protocol named Chameleon and bring out to the networking community an ns-2 implementation for evaluation purpose
Transport congestion events detection (TCED): towards decorrelating congestion detection from TCP
TCP (Transmission Control Protocol) uses a loss-based algorithm to estimate whether the network is congested or not.
The main difficulty for this algorithm is to distinguish spurious from real network congestion events. Other research studies have proposed to enhance the reliability of this congestion estimation by modifying the internal TCP algorithm.
In this paper, we propose an original congestion event algorithm implemented independently of the TCP source code. Basically, we propose a modular architecture to implement a congestion event detection algorithm to cope with the increasing complexity of the TCP code and we use it to understand why some spurious congestion events might not be
detected in some complex cases. We show that our proposal is able to increase the reliability of TCP NewReno congestion detection algorithm that might help to the design of detection criterion independent of the TCP code. We find out that solutions based only on RTT (Round-Trip Time) estimation are not accurate enough to cover all existing cases.
Furthermore, we evaluate our algorithm with and without network reordering where other inaccuracies, not previously
identified, occur
X-TCP: A Cross Layer Approach for TCP Uplink Flows in mmWave Networks
Millimeter wave frequencies will likely be part of the fifth generation of
mobile networks and of the 3GPP New Radio (NR) standard. MmWave communication
indeed provides a very large bandwidth, thus an increased cell throughput, but
how to exploit these resources at the higher layers is still an open research
question. A very relevant issue is the high variability of the channel, caused
by the blockage from obstacles and the human body. This affects the design of
congestion control mechanisms at the transport layer, and state-of-the-art TCP
schemes such as TCP CUBIC present suboptimal performance. In this paper, we
present a cross layer approach for uplink flows that adjusts the congestion
window of TCP at the mobile equipment side using an estimation of the available
data rate at the mmWave physical layer, based on the actual resource allocation
and on the Signal to Interference plus Noise Ratio. We show that this approach
reduces the latency, avoiding to fill the buffers in the cellular stack, and
has a quicker recovery time after RTO events than several other TCP congestion
control algorithms.Comment: 6 pages, 5 figures, accepted for presentation at the 2017 16th Annual
Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET
Throughput and fairness of multiple TCP connections in wireless networks
TCP suffers from poor throughput performance in wireless networks. Furthermore, when multiple TCP connections compete at the base station, link errors and congestion lead to serious unfairness among the connections. Although the issue of TCP performance in wireless networks has attracted significant attention, most reports focus only on TCP throughput and assume that there is only a single connection in a congestion-free network. This paper studies the throughput and fairness of popular improvement mechanisms (the Snoop [8] and ELN [5]) and TCP variants with multiple TCP connections. Simulation results show that the improvement mechanisms under investigation are effective to improve TCP throughput in a wireless network. However, they cannot provide fairness among multiple TCP connections. From the studies presented, it is concluded that mechanisms to enhance TCP fairness are needed in wireless network
Understanding the impact of TFRC feedbacks frequency over long delay links
TFRC is a transport protocol specifically designed to carry multimedia streams. TFRC does not enable a reliable and in order data delivery services. However the mechanism is designed to be friendly with TCP flows and thus, enables a control congestion algorithm. This congestion control relies in a feedback mechanism allowing receivers to communicate to the senders an experienced drop rate. Several studies attempted to adapt TFRC to a wide range of network conditions and topologies. Although the current TFRC RFC writes that there is little gain from sending a large number of feedback messages per RTT, recent studies have shown that in long-delay contexts, such as satellite-based networks, the performance of TFRC can be greatly improved by increasing the feedback frequency. Nevertheless, currently it is not clear how and why this increase may improve the performance of TFRC. Therefore, in this paper, we aim at understanding the impact that multiple feedback per RTT may have (i) on the key parameters of TFRC (RTT, drop rate, and sending rate) and (ii) on the network parameters (reactiveness and link utilization).We also provide a detailed description of the micro-mechanisms at the origin of the improvements of the TFRC behaviour when multiple feedback per RTT are delivered, and determine the context where such feedback frequencies should be applied
- âŠ