The Access Traffic Steering, Switching, and Splitting (ATSSS) technology, currently under standardization by the 3rd Generation Partnership Project (3GPP), is designed to enhance wireless access through the bundling of both 3GPP and non-3GPP access. One implementation option involves tunneling data through the Multipath QUIC (MP-QUIC) protocol. The decision of which access network each packet is transmitted on can greatly impact the performance of a network flow, and may also impact the performance of other flows. While Active Queue Management (AQM) in the network could normally manage such interactions, such techniques are limited in a shared multipath-tunnel context, since all traffic in the tunnel share a single connection. This paper introduces a multi-flow, multipath tunneling framework using MP-QUIC. It employs four distinct scheduling policies for packet scheduling decisions. We investigate how such scheduling policies interact with each other, and how they may be combined in order to achieve trade-offs in terms of latency, interactivity, and throughput. Through an extensive investigation in both emulated and real-world environments, we show that Quality of Service (QoS) can be significantly improved by smart combinations of scheduling policies.

Bundling of multiple access technologies is currently being standardized by 3GPP in the 5G access traffic steering, switching and splitting (ATSSS) framework, with the goal to increase robustness, resiliency and capacity of wireless access. A key part of an ATSSS framework is the packet scheduler, which decides the access network over which each packet is to be transmitted. As wireless channels are highly dynamic, a challenge for any scheduler is to correctly estimate the capacity of each path, and thereby avoid congesting the paths. In this paper, we further develop a recent packet scheduler that exploits cross-layer information from the congestion control state of individual transport layer tunnels when making scheduling decisions. Our aim is to achieve good path utilization while keeping the congestion delay low. Extensive emulations show that our approach reduces the excess delay at the bottleneck to as little as 34%. We furthermore show that our approach improves the performance of end-to-end applications including WebRTC and YouTube compared to state-of-the art.

5G mobile networks introduce the concept of network slicing, the functionality of creating virtual networks on top of shared physical infrastructure. Such slices can be tailored to various vertical services. A single User Equipment (UE) may be served by multiple network slice instances simultaneously, which opens up the possibility of dynamically steering traffic in response to the specific needs of individual applications – and as a reaction to events inside the network, e.g., network failures.This paper presents the PoLicy-based Architecture for Network Slicing (PLANS). In this policy framework, the network slice management entity in the 5G core and the UE can cooperatively optimize the usage of the available network slices via policy systems installed both inside the network and on the UE. The PLANS architecture has been implemented and evaluated in a 5G testbed. For two different case studies, we show how such a system can be leveraged to provide optimized services and increased robustness against network failures. First, we consider a drone autopilot scenario, and demonstrate how PLANS can reduce network-slice recovery time by more than 90%. Second, we illustrate for a 360°video streaming scenario how PLANS can help prevent video quality degradation when a network slice becomes unavailable.

Cooperative intelligent transport systems (C-ITS) enable information to be shared wirelessly between vehicles and infrastructure in order to improve transport safety and efficiency. Delivering C-ITS services using existing cellular networks offers both financial and technological advantages, not least since these networks already offer many of the features needed by C-ITS, and since many vehicles on our roads are already connected to cellular networks. Still, C-ITS pose stringent requirements in terms of availability and latency on the underlying communication system; requirements that will be hard to meet for currently deployed 3G, LTE, and early-generation 5G systems. Through a series of experiments in the MONROE testbed (a cross-national, mobile broadband testbed), the present study demonstrates how cellular multi-access selection algorithms can provide close to 100 percent availability, and significantly reduce C-ITS transaction times. The study also proposes and evaluates a number of low-complexity, low-overhead single-access selection algorithms, and shows that it is possible to design such solutions so that they offer transaction times and availability levels that rival those of multi-access solutions.