Anna Brunstrom

Towards Systems Beyond 3G Based on Adaptive OFDMA Transmission

High data rates, high spectral efficiency, flexibility, and low delays over the air interface will be important features in next-generation wireless systems. The overall challenge will be packet scheduling and adaptive radio transmission for multiple users, via multiple antennas and over frequency-selective wideband channels. This problem needs to be structured to obtain feasible solutions. The basic simplifying assumptions used here are clustering of antennas into cells, orthogonal transmission by use of cyclic-prefix orthogonal frequency-division multiplexing (OFDM) and a time-scale separation view of the total link adaptation, scheduling and intercell coordination problem. Based on these assumptions, we survey techniques that adapt the transmission to the temporal, frequency, and spatial channel properties. We provide a systematic overview of the design problems, such as the dimensioning of the allocated time-frequency resources, the influence of duplexing schemes, adaptation control issues for downlinks and uplinks, timing issues, and their relation to the required performance of channel predictors. Specific design choices are illustrated by recent research within the Swedish Wireless IP program and the EU IST-WINNER project. The presented results indicate that high-performance adaptive OFDM transmission systems are indeed feasible, also for challenging scenarios that involve vehicular velocities, high carrier frequencies, and high bandwidths.

Reducing Internet Latency: A Survey of Techniques and Their Merits

Latency is increasingly becoming a performance bottleneck for Internet Protocol (IP) networks, but historically, networks have been designed with aims of maximizing throughput and utilization. This paper offers a broad survey of techniques aimed at tackling latency in the literature up to August 2014, as well as their merits. A goal of this work is to be able to quantify and compare the merits of the different Internet latency reducing techniques, contrasting their gains in delay reduction versus the pain required to implement and deploy them. We found that classifying techniques according to the sources of delay they alleviate provided the best insight into the following issues: 1) The structural arrangement of a network, such as placement of servers and suboptimal routes, can contribute significantly to latency; 2) each interaction between communicating endpoints adds a Round Trip Time (RTT) to latency, particularly significant for short flows; 3) in addition to base propagation delay, several sources of delay accumulate along transmission paths, today intermittently dominated by queuing delays; 4) it takes time to sense and use available capacity, with overuse inflicting latency on other flows sharing the capacity; and 5) within end systems, delay sources include operating system buffering, head-of-line blocking, and hardware interaction. No single source of delay dominates in all cases, and many of these sources are spasmodic and highly variable. Solutions addressing these sources often both reduce the overall latency and make it more predictable.

Towards transport-layer mobility: Evolution of SCTP multihoming

Recently, growing availability of emerging wireless technologies has pushed the demand to integrate different wireless-network technologies such as: wireless local-area networks, cellular networks, and personal and short-range networks. The inter-working of heterogeneous radio access networks poses many technical challenges, with mobility management being one of the most important. In this paper we survey the existing proposals and show that transport-layer mobility is a viable candidate for implementing seamless handover in heterogeneous wireless access networks. Since the mobile Stream Control Transmission Protocol (mSCTP) is at the core of most relevant transport-layer mobility schemes being currently studied, we identify the key scenarios where the protocol can effectively leverage the multihoming feature to enhance handover support. Moreover, to provide the reader with a complete overview of the mSCTPs application area, we also survey the situations where the use of mSCTP-based schemes is not possible or has some limitations. Then, in one of the identified key scenarios, we investigate several challenging open issues related to path management and path-transition optimization by considering bandwidth-estimation schemes and link-layer support. Finally, we consider introducing concurrent multipath transfer (CMT) into mSCTP-based mobility schemes, as a future research direction.

KauNet: improving reproducibility for wireless and mobile research

This paper presents the KauNet emulation system that provides pattern-based emulation. KauNet enables bit precise placement of bit-errors, exact and repeatable packet losses, delays and bandwidth variations. The design and performance of KauNet is discussed. An example is also provided of how it can be integrated in a specific emulation framework to enhance emulation for mobile and wireless systems.

Fairness measures for best effort traffic in wireless networks

This paper proposes that fairness in wireless networks should be measured using one of the following new measures: the deterministic unfairness bound called the wireless absolute fairness bound (WAFB) or the statistical unfairness bound called the 99-percentile wireless absolute fairness bound (WAFB/sub 99/). Compared with previous fairness definitions, the new fairness measures are better suited for measuring fairness of scheduling disciplines that exploit multiuser diversity. A new scheduling discipline called opportunistic proportional fair scheduling is defined. Numerical results show that the new scheduling discipline has slightly higher throughput and slightly better fairness than proportional fair scheduling.

Impact of TCP congestion control on bufferbloat in cellular networks

The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. One important network scenario where bufferbloat may occur is cellular networks. This paper investigates the interaction between TCP congestion control and buffering in cellular networks. Extensive measurements have been performed in commercial 3G, 3.5G and 4G cellular networks, with a mix of long and short TCP flows using the CUBIC, NewReno and Westwood+ congestion control algorithms. The results show that the completion times of short flows increase significantly when concurrent long flow traffic is introduced. This is caused by increased buffer occupancy from the long flows. In addition, for 3G and 3.5G the completion times are shown to depend significantly on the congestion control algorithms used for the background flows, with CUBIC leading to significantly larger completion times.

A taxonomy and survey of SCTP research

The Stream Control Transmission Protocol (SCTP) is a relatively recent general-purpose transport layer protocol for IP networks that has been introduced as a complement to the well-established TCP and UDP transport protocols. Although initially conceived for the transport of PSTN signaling messages over IP networks, the introduction of key features in SCTP, such as multihoming and multistreaming, has spurred considerable research interest surrounding SCTP and its applicability to different networking scenarios. This article aims to provide a detailed survey of one of these new features—multihoming—which, as it is shown, is the subject of evaluation in more than half of all published SCTP-related articles. To this end, the article first summarizes and organizes SCTP-related research conducted so far by developing a four-dimensional taxonomy reflecting the (1) protocol feature examined, (2) application area, (3) network environment, and (4) study approach. Over 430 SCTP-related publications have been analyzed and classified according to the proposed taxonomy. As a result, a clear perspective on this research area in the decade since the first protocol standardization in 2000 is given, covering both current and future research trends. On continuation, a detailed survey of the SCTP multihoming feature is provided, examining possible applications of multihoming, such as robustness, handover support, and loadsharing.

An OFDM Based System Proposal for 4G Downlinks

In this paper we describe an OFDM based 4G downlink for a wide area coverage and high mobility system. User data are multiplexed and OFDM modulated such that the user with the best predicted channel conditions are always using the channel. This user employs the linear modulation scheme that maximizes the spectral efficiency. We show that the system obtains a sector capacity that is significantly better than current 3G systems. Various combinations of OFDM and CDMA are also discussed and it is concluded that it is difficult to motivate the significantly increased complexity of such schemes. Moreover, we also doubt that these combinations can increase spectral efficiency when predicted channel information is utilized at the transmitter.

Checksum-based loss differentiation

In a wireless environment the common transport protocol assumption that all packet losses are due to congestion no longer holds true. If the transport protocols react identically to both congestion and non-congestion related losses, performance will degrade. To avoid this performance problem, transport protocols must be able to differentiate between losses that are due to congestion and losses that are due to wireless link errors. Suitable congestion avoidance behavior can then be applied as appropriate. This paper overviews previous work on loss differentiation, and proposes a checksum-based scheme. The proposed scheme reuses the checksums already available at various layers in the receiver end-host protocol stack. It is an end-to-end solution for the case where the lossy link is the last hop. Header decoding, data integrity and other issues related to the implementation of our checksum-based scheme are also discussed.

SDN/NFV-Based Mobile Packet Core Network Architectures: A Survey

The emergence of two new technologies, namely, software defined networking (SDN) and network function virtualization (NFV), have radically changed the development of network functions and the evolution of network architectures. These two technologies bring to mobile operators the promises of reducing costs, enhancing network flexibility and scalability, and shortening the time-to-market of new applications and services. With the advent of SDN and NFV and their offered benefits, the mobile operators are gradually changing the way how they architect their mobile networks to cope with ever-increasing growth of data traffic, massive number of new devices and network accesses, and to pave the way toward the upcoming fifth generation networking. This survey aims at providing a comprehensive survey of state-of-the-art research work, which leverages SDN and NFV into the most recent mobile packet core network architecture, evolved packet core. The research work is categorized into smaller groups according to a proposed four-dimensional taxonomy reflecting the: 1) architectural approach, 2) technology adoption, 3) functional implementation, and 4) deployment strategy. Thereafter, the research work is exhaustively compared based on the proposed taxonomy and some added attributes and criteria. Finally, this survey identifies and discusses some major challenges and open issues, such as scalability and reliability, optimal resource scheduling and allocation, management and orchestration, and network sharing and slicing that raise from the taxonomy and comparison tables that need to be further investigated and explored.