38 research outputs found
Insights into the Design of Congestion Control Protocols for Multi-Hop Wireless Mesh Networks
The widespread deployment of multi-hop wireless mesh networks will depend on the performance seen by the user. Unfortunately, the most predominant transport protocol, TCP, performs poorly over such networks, even leading to starvation in some topologies. In this work, we characterize the root causes of starvation in 802.11 scheduled multi-hop wireless networks via simulations. We analyze the performance of three categories of transport protocols. (1) end-to-end protocols that require implicit feedback (TCP SACK), (2) Explicit feedback based protocols (XCP and VCP) and (3) Open-loop protocol (UDP). We ask and answer the following questions in relation to these protocols: (a) Why does starvation occur in different topologies? Is it intrinsic to TCP or, in general, to feedback-based protocols? or does it also occur in the case of open-loop transfers such as CBR over UDP? (a) What is the role of application behavior on transport layer performance in multi-hop wireless mesh networks? (b) Is sharing congestion in the wireless neighborhood essential for avoiding starvation? (c) For explicit feedback based transport protocols, such as XCP and VCP, what performance can be expected when their capacity estimate is inaccurate? Based on the insights derived from the above analysis, we design a rate-based protocol called VRate that uses the two ECN bits for conveying load feedback information. VRate achieves near optimal rates when configured with the correct capacity estimate
ABC: A Simple Explicit Congestion Controller for Wireless Networks
We propose Accel-Brake Control (ABC), a simple and deployable explicit
congestion control protocol for network paths with time-varying wireless links.
ABC routers mark each packet with an "accelerate" or "brake", which causes
senders to slightly increase or decrease their congestion windows. Routers use
this feedback to quickly guide senders towards a desired target rate. ABC
requires no changes to header formats or user devices, but achieves better
performance than XCP. ABC is also incrementally deployable; it operates
correctly when the bottleneck is a non-ABC router, and can coexist with non-ABC
traffic sharing the same bottleneck link. We evaluate ABC using a Wi-Fi
implementation and trace-driven emulation of cellular links. ABC achieves
30-40% higher throughput than Cubic+Codel for similar delays, and 2.2X lower
delays than BBR on a Wi-Fi path. On cellular network paths, ABC achieves 50%
higher throughput than Cubic+Codel
Network emulation focusing on QoS-Oriented satellite communication
This chapter proposes network emulation basics and a complete case study of QoS-oriented Satellite Communication
An enhanced TCP congestion avoidance scheme and its performance evaluation in high speed satellite networks
High speed satellite communication networks are
emerging as part of the future global wireless communication
systems. However, existing transmission control protocols for
satellite networks do not provide satisfactory performance over
high speed satellite links due to their inefficient congestion
avoidance algorithms. This paper identifies the reason for low
throughput of a widely used protocol Space Communications
Protocol Specification (SCPS) in such networks and proposes a
new Transmission Control Protocol (TCP) congestion avoidance
algorithm to overcome the drawback of the congestion avoidance
algorithm used in the SCPS protocol. Numerical results through
simulations demonstrate that the proposed new algorithm can
achieve significant throughput improvement over links with
variable error rates, compared with its legacy counterpart
Active queue management with discrete sliding modes in TCP networks
In this paper, a new active queue management (AQM) algorithm for data traffic control in TCP/IP networks is developed. The algorithm design is based on the principles of discrete sliding-mode control. Unlike majority of earlier studies, the design procedure considers the effects of both non-negligible delay in transferring data and feedback information and unpredictable capacity variations. The switching function is selected to incorporate a delay compensation mechanism, which ensures efficient network operation even for large bandwidthdelay product connections. The proposed algorithm, implemented as a packet marking scheme, is tested in discrete event ns-2 simulator. The results show that the algorithm provides fast convergence to steady state after sudden, unanticipated capacity changes. By generating smaller overshoots, the proposed algorithm also allows for reducing buffer space requirements to avoid packet loss as compared to the benchmark AQM solutions
SLBN: A Scalable Max-min Fair Algorithm for Rate-Based Explicit Congestion Control
The growth of the Internet has increased the need for scalable congestion control mechanisms in high speed networks. In this context, we propose a rate-based explicit congestion control mechanism with which the sources are provided with the rate at which they can transmit. These rates are computed with a distributed max-min fair algorithm, SLBN. The novelty of SLBN is that it combines two interesting features not simultaneously present in existing proposals: scalability and fast convergence to the max-min fair rates, even under high session churn. SLBN is scalable because routers only maintain a constant amount of state information (only three integer variables per link) and only incur a constant amount of computation per protocol packet, independently of the number of sessions that cross the router. Additionally, SLBN does not require processing any data packet, and it converges independently of sessions' RTT. Finally, by design, the protocol is conservative when assigning rates, even in the presence of high churn, which helps preventing link overshoots in transient periods. We claim that, with all these features, our mechanism is a good candidate to be used in real deployments
On the Performance Evaluation of High-Speed Transport Protocols
As high-speed networks with large bandwidth delay products (BDP) become more common, high-speed transport protocols must be developed that perform well in these contexts. TCP has limitations in high BDP networks. A number of high-speed TCP proposals have emerged, including BIC TCP, High Speed TCP, and H-TCP. XCP is an intraprotocol communication mechanism that promises even greater performance by providing explicit feedback from routers about congestion. It requires changes to routers and end hosts, though, whereas the other experimental protocols only require changes to an end host. We evaluated the performance ofXCP against BIC TCP, High Speed TCP, H-TCP, and . NewReno TCP. We found that in a controlled environment, XCP gave much better performance than the other TCPs. XCP was sensitive to misconfiguration and environmental factors, though, and was more difficult to deploy. More work is required to make XCP more stable. The other TCPs did not perform better than NewReno TCP but show promise, as most performed almost as well as NewReno TCP