On the impact of link layer retransmission schemes on TCP over 4G satellite links

We study the impact of reliability mechanisms introduced at the link layer on the performance of transport protocols in the context of 4G satellite links. Specifically, we design a software module that performs realistic analysis of the network performance, by utilizing real physical layer traces of a 4G satellite service. Based on these traces, our software module produces equivalent link layer traces, as a function of the chosen link layer reliability mechanism. We further utilize the link layer traces within the ns-2 network simulator to evaluate the impact of link layer schemes on the performance of selected Transmission Control Protocol (TCP) variants. We consider erasure coding, selective-repeat automatic request (ARQ) and hybrid-ARQ link layer mechanisms, and TCP Cubic, Compound, Hybla, New Reno and Westwood. We show that, for all target TCP variants, when the throughput of the transport protocol is close to the channel capacity, using the ARQ mechanism is most beneficial for TCP performance improvement. In conditions where the physical channel error rate is high, hybrid-ARQ results in the best performance for all TCP variants considered, with up to 22% improvements compared to other schemes

Stochastic Forecasts Achieve High Throughput and Low Delay over Cellular Networks

Sprout is an end-to-end transport protocol for interactive applications that desire high throughput and low delay. Sprout works well over cellular wireless networks, where link speeds change dramatically with time, and current protocols build up multi-second queues in network gateways. Sprout does not use TCP-style reactive congestion control; instead the receiver observes the packet arrival times to infer the uncertain dynamics of the network path. This inference is used to forecast how many bytes may be sent by the sender, while bounding the risk that packets will be delayed inside the network for too long. In evaluations on traces from four commercial LTE and 3G networks, Sprout, compared with Skype, reduced self-inflicted end-to-end delay by a factor of 7.9 and achieved 2.2 the transmitted bit rate on average. Compared with Google’s Hangout, Sprout reduced delay by a factor of 7.2 while achieving 4.4 the bit rate, and compared with Apple’s Facetime, Sprout reduced delay by a factor of 8.7 with 1.9 the bit rate. Although it is end-to-end, Sprout matched or outperformed TCP Cubic running over the CoDel active queue management algorithm, which requires changes to cellular carrier equipment to deploy. We also tested Sprout as a tunnel to carry competing interactive and bulk traffic (Skype and TCP Cubic), and found that Sprout was able to isolate client application flows from one another.National Science Foundation (U.S.) (NSF Grant 1040072

Design and optimization of QoS-based medium access control protocols for next-generation wireless LANs

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In recent years, there have been tremendous advances in wireless & mobile communications, including wireless radio techniques, networking protocols, and mobile devices. It is expected that different broadband wireless access technologies, e.g., WiFi (IEEE 802.11) and WiMAX (IEEE 802.16) will coexist in the future. In the meantime, multimedia applications have experienced an explosive growth with increasing user demands. Nowadays, people expect to receive high-speed video, audio, voice and web services even when being mobile. The key question that needs to be answered, then, is how do we ensure that users always have the "best" network performance with the "lowest" costs in such complicated situations? The latest IEEE 802.11n standards attains rates of more than 100 Mbps by introducing innovative enhancements at the PHY and MAC layer, e.g. MIMO and Frame Aggregation, respectively. However, in this thesis we demonstrate that frame aggregation's performance adheres due to the EDCA scheduler's priority mechanism and consequently resulting in the network's poor overall performance. Short waiting times for high priority flows into the aggregation queue resolves to poor channel utilization. A Delayed Channel Access algorithm was designed to intentionally postpone the channel access procedure so that the number of packets in a formed frame can be increased and so will the network's overall performance. However, in some cases, the DCA algorithm has a negative impact on the applications that utilize the TCP protocol, especially the when small TCP window sizes are engaged. So, the TCP process starts to refrain from sending data due to delayed acknowledgements and the overall throughput drops. In this thesis, we address the above issues by firstly demonstrating the potential performance benefits of frame aggregation over the next generation wireless networks. The efficiency and behaviour of frame aggregation within a single queue, are mathematically analysed with the aid of a M=G[a;b]=1=K model. Results show that a trade-off choice has to be taken into account over minimizing the waiting time or maximizing utilization. We also point out that there isn't an optimum batch collection rule which can be assumed as generally valid but individual cases have to be considered separately. Secondly, we demonstrate through extensive simulations that by introducing a method, the DCA algorithm, which dynamically determines and adapts batch collections based upon the traffic's characteristics, QoS requirements and server's maximum capacity, also improves e ciency. Thirdly, it is important to understand the behaviour of the TCP ows over the WLAN and the influence that DCA has over the degrading performance of the TCP protocol. We investigate the cause of the problem and provide the foundations of designing and implementing possible solutions. Fourthly, we introduce two innovative proposals, one amendment and one extension to the original DCA algorithm, called Adaptive DCA and Selective DCA, respectively. Both solutions have been implemented in OPNET and extensive simulation runs over a wide set of scenarios show their effectiveness over the network's overall performance, each in its own way.This study was supported by the Engineering and Physical Sciences Research Council (EPSRC)

PERFORMANCE EVALUATION OF WiFi WITH AND WITHOUT QoS

Wireless local area networks (WLANs) have been around for a long time but only recently have they become popular. Despite the fact that Wireless LANs have achieved a tremendous amount of growth in recent years, the performance is very poor. Hence, multimedia wireless network QoS support has become one of the most important researches. In order to improve the poor performance of existing system, QoS features and MAC enhancements are needed in the upcoming 802.1 le standard. This project aims to evaluate the performance of Wi-Fi systems with and without QoS, and quantify how well the new enhancement can support applications that require certain QoS guarantees. A thorough research on the IEEE802.11 standards is necessary to the success ofthis project, as well as an immaculate and extensive study on the QoS performance ofthe network. All the studies and evaluation is being done with a simulation using OMNeT++. The project requires knowledge of the WiFi architecture, C++ programming language, setting up simulation of a network in OMNeT++, andthen evaluating theQoS performance

An Efficient Framework of Congestion Control for Next-Generation Networks

The success of the Internet can partly be attributed to the congestion control algorithm in the Transmission Control Protocol (TCP). However, with the tremendous increase in the diversity of networked systems and applications, TCP performance limitations are becoming increasingly problematic and the need for new transport protocol designs has become increasingly important.Prior research has focused on the design of either end-to-end protocols (e.g., CUBIC) that rely on implicit congestion signals such as loss and/or delay or network-based protocols (e.g., XCP) that use precise per-flow feedback from the network. While the former category of schemes haveperformance limitations, the latter are hard to deploy, can introduce high per-packet overhead, and open up new security challenges. This dissertation explores the middle ground between these designs and makes four contributions. First, we study the interplay between performance and feedback in congestion control protocols. We argue that congestion feedback in the form of aggregate load can provide the richness needed to meet the challenges of next-generation networks and applications. Second, we present the design, analysis, and evaluation of an efficient framework for congestion control called Binary Marking Congestion Control (BMCC). BMCC uses aggregate load feedback to achieve efficient and fair bandwidth allocations on high bandwidth-delaynetworks while minimizing packet loss rates and average queue length. BMCC reduces flow completiontimes by up to 4x over TCP and uses only the existing Explicit Congestion Notification bits.Next, we consider the incremental deployment of BMCC. We study the bandwidth sharing properties of BMCC and TCP over different partial deployment scenarios. We then present algorithms for ensuring safe co-existence of BMCC and TCP on the Internet. Finally, we consider the performance of BMCC over Wireless LANs. We show that the time-varying nature of the capacity of a WLAN can lead to significant performance issues for protocols that require capacity estimates for feedback computation. Using a simple model we characterize the capacity of a WLAN and propose the usage of the average service rate experienced by network layer packets as an estimate for capacity. Through extensive evaluation, we show that the resulting estimates provide good performance

Transport Architectures for an Evolving Internet

In the Internet architecture, transport protocols are the glue between an application’s needs and the network’s abilities. But as the Internet has evolved over the last 30 years, the implicit assumptions of these protocols have held less and less well. This can cause poor performance on newer networks—cellular networks, datacenters—and makes it challenging to roll out networking technologies that break markedly with the past. Working with collaborators at MIT, I have built two systems that explore an objective-driven, computer-generated approach to protocol design. My thesis is that making protocols a function of stated assumptions and objectives can improve application performance and free network technologies to evolve. Sprout, a transport protocol designed for videoconferencing over cellular networks, uses probabilistic inference to forecast network congestion in advance. On commercial cellular networks, Sprout gives 2-to-4 times the throughput and 7-to-9 times less delay than Skype, Apple Facetime, and Google Hangouts. This work led to Remy, a tool that programmatically generates protocols for an uncertain multi-agent network. Remy’s computer-generated algorithms can achieve higher performance and greater fairness than some sophisticated human-designed schemes, including ones that put intelligence inside the network. The Remy tool can then be used to probe the difficulty of the congestion control problem itself—how easy is it to “learn” a network protocol to achieve desired goals, given a necessarily imperfect model of the networks where it ultimately will be deployed? We found weak evidence of a tradeoff between the breadth of the operating range of a computer-generated protocol and its performance, but also that a single computer-generated protocol was able to outperform existing schemes over a thousand-fold range of link rates

A hybrid packet loss recovery technique in wireless ad hoc networks

TCP utilization in wireless networks poses certain problems due to its inability to distinguish packet losses caused by congestion from those caused by frequent wireless errors, leading to degraded network performance. To avoid these problems and to minimize the effect of intensive channel contention in wireless networks, this work presents a new Hybrid ARQ technique for reliable and efficient packets transfer in static wireless ad hoc network. It is a combination of recent FEC based Raptor coding technique with ARQ based selective retransmission method, which outperforms purely ARQ based method. In contrast to most Hybrid ARQ techniques, which usually employ a byte level FEC, we mostly use packet level FEC in our simulations for the data transfer, on top of less frequent ARQ to recover the residual errors. Existing packet level FEC methods are mostly based on simple parity check codes or Reed Solomon codes with erasure decoding; in this work we use the recent raptor codes. We also introduce the notion of adaptive redundancy which helps to achieve better average network performance and to further improve the redundancy efficiency

Treatment-Based Classi?cation in Residential Wireless Access Points

IEEE 802.11 wireless access points (APs) act as the central communication hub inside homes, connecting all networked devices to the Internet. Home users run a variety of network applications with diverse Quality-of-Service requirements (QoS) through their APs. However, wireless APs are often the bottleneck in residential networks as broadband connection speeds keep increasing. Because of the lack of QoS support and complicated configuration procedures in most off-the-shelf APs, users can experience QoS degradation with their wireless networks, especially when multiple applications are running concurrently. This dissertation presents CATNAP, Classification And Treatment iN an AP , to provide better QoS support for various applications over residential wireless networks, especially timely delivery for real-time applications and high throughput for download-based applications. CATNAP consists of three major components: supporting functions, classifiers, and treatment modules. The supporting functions collect necessary flow level statistics and feed it into the CATNAP classifiers. Then, the CATNAP classifiers categorize flows along three-dimensions: response-based/non-response-based, interactive/non-interactive, and greedy/non-greedy. Each CATNAP traffic category can be directly mapped to one of the following treatments: push/delay, limited advertised window size/drop, and reserve bandwidth. Based on the classification results, the CATNAP treatment module automatically applies the treatment policy to provide better QoS support. CATNAP is implemented with the NS network simulator, and evaluated against DropTail and Strict Priority Queue (SPQ) under various network and traffic conditions. In most simulation cases, CATNAP provides better QoS supports than DropTail: it lowers queuing delay for multimedia applications such as VoIP, games and video, fairly treats FTP flows with various round trip times, and is even functional when misbehaving UDP traffic is present. Unlike current QoS methods, CATNAP is a plug-and-play solution, automatically classifying and treating flows without any user configuration, or any modification to end hosts or applications

Contributions to QoS and energy efficiency in wi-fi networks

The Wi-Fi technology has been in the recent years fostering the proliferation of attractive mobile computing devices with broadband capabilities. Current Wi-Fi radios though severely impact the battery duration of these devices thus limiting their potential applications. In this thesis we present a set of contributions that address the challenge of increasing energy efficiency in Wi-Fi networks. In particular, we consider the problem of how to optimize the trade-off between performance and energy effciency in a wide variety of use cases and applications. In this context, we introduce novel energy effcient algorithms for real-time and data applications, for distributed and centralized Wi-Fi QoS and power saving protocols and for Wi-Fi stations and Access Points. In addition, the di¿erent algorithms presented in this thesis adhere to the following design guidelines: i) they are implemented entirely at layer two, and can hence be easily re-used in any device with a Wi-Fi interface, ii) they do not require modi¿cations to current 802.11 standards, and can hence be readily deployed in existing Wi-Fi devices, and iii) whenever possible they favor client side solutions, and hence mobile computing devices implementing them can benefit from an increased energy efficiency regardless of the Access Point they connect to. Each of our proposed algorithms is thoroughly evaluated by means of both theoretical analysis and packet level simulations. Thus, the contributions presented in this thesis provide a realistic set of tools to improve energy efficiency in current Wi-Fi networks