Artificial intelligence is being utilized in multipath industrial networks to enhance service supporting ability. However, existing obstacles in controlling receive buffer restrict throughput even when higher bandwidth is available. Therefore, in this article, we propose a smart collaborative automation (SCA) scheme to improve resource usage and overcome buffer limitations. First, a mathematical model is established to describe primary system operations with considerations of chunk loss. The inf-supremum methodology and probability theory are adopted to track congestion window variations. Second, differences in disordered chunk expectations are analyzed to locate the critical condition of round numbers. Specific algorithm details are provided via simplifying comparison to achieve comprehensive policy selections. Third, evaluation topologies and environments are created with reasonable parameter settings. Validation results demonstrate that model-driven SCA can reduce unexpected occupations at the receiver-side. Comparing to intuition-driven schemes, overall performances, in terms of the sender's transmission capacity and receiver's buffer utilization, are improved under different experimental configurations.

Smart Collaborative Automation for Receive Buffer Control in Multipath Industrial Networks

Light fidelity (LiFi) is a relatively new wireless communication technology that exploits the optical spectrum Compared to wireless fidelity (WiFi), LiFi is densely deployed with each access point (AP) covering an area only a few meters in diameter Also, LiFi users are susceptible to intermittent light-path blockages Meanwhile, the user is served by a single AP in conventional LiFi systems This would cause frequent handovers for LiFi users, resulting in a degradation in quality of service In this paper, parallel transmission is investigated for LiFi, which is named PT-LiFi With a delicate design of the transmitter and the receiver, PT-LiFi enables multiple LiFi APs to serve the user simultaneously Particularly, data transmission continues without interruption when the user is losing connectivity to some of the connected APs Resource allocation is studied for the PT-LiFi system, and a novel load balancing method is proposed to jointly allocate resource across the APs Results show PT-LiFi can make efficient use of the densely deployed LiFi APs and provide a flexible way of load balancing Compared with a conventional LiFi system, the proposed method can increase user throughput by up to 150% and improve user fairness by up to 15%

/pdf/parallel-transmission-lifi-4x49rjqvfj.pdf

Parallel Transmission LiFi

Multipath TCP (MPTCP) is a promising solution that can provide high end-to-end throughput in fifth generation (5G) mobile networks. Many next-generation applications will require high throughput and low latency simultaneously, but the current MPTCP congestion control algorithms cannot reliably satisfy this requirement. In this paper, a novel MPTCP congestion control scheme named delay-equalized FAST (DEFT) is proposed to achieve high throughput and low end-to-end (E2E) delay in 5G networks. First, in order to achieve high throughput, DEFT includes a novel window control algorithm that shows fast responsiveness when the state of the millimeter-wave (mmWave) link changes from line-of-sight (LOS) to non-LOS (NLOS) and vice versa. Second, in order to achieve low E2E delay, DEFT includes a delay-equalizing algorithm which minimizes additional reordering delay in the receive buffer. The performance of DEFT was evaluated based on ns-3 simulation and was compared with wVegas, Balia, and delay-adapted LIA. Simulation results show that DEFT can provide a significant goodput gain and application-level E2E delay reduction for the range of interest.

DEFT: Multipath TCP for High Speed Low Latency Communications in 5G Networks

Interpath contention is a phenomenon experienced in a MultiPath TCP (MPTCP) connection when its subflows dispute resources of shared bottlenecks in end-to-end paths. Although solutions have been proposed to improve MPTCP performance in different applications, the impact of interpath contention on the multipath performance is little understood. In this paper, we evaluated such phenomenon experimentally in disjoint paths–an ordinary multipath scenario where subflows dispute bottlenecks of paths physically disjointed in a connection. Under several path conditions determined from emulations of capacity, loss, and delay of bottlenecks, we analyzed the influence of MPTCP mechanisms such as packet scheduling, congestion control, and subflow management. Differently from other studies, we observed that the very first influence was caused by the current subflow manager, full-mesh , with dichotomous impact on the multipath performance when establishing several subflows per disjoint path. Experimental results showed that contention among subflows can lead to positive (goodput improvement) or negative (goodput degradation) impacts according to the bottleneck conditions. In certain conditions, simply establishing subflows in single-mesh , with at most one subflow per disjoint path, could avoid interpath contention while improving goodput significantly, by doubling the performance of full-mesh under different conservative congestion controls.

/pdf/interpath-contention-in-multipath-tcp-disjoint-paths-25pzhfh2ub.pdf

Interpath Contention in MultiPath TCP Disjoint Paths

Quite a few algorithms have been proposed to optimize the transmission performance of Multipath TCP (MPTCP). However, existing MPTCP protocols are still far from satisfactory in lossy and ever-changing networks because of their loss-based congestion control and the difficulty of managing multiple subflows. Recently, a congestion-based congestion control, BBR, is proposed to promote TCP transmission performance through better use of bandwidth. Due to the superior performance of BBR, we try to boost MPTCP with it. For this propose, coupled congestion control should be redesigned for MPTCP, and a functional scheduler able to effectively make use of the characteristics of BBR must also be developed for better performance. In this paper, we first propose Coupled BBR as a coupled congestion control algorithm for MPTCP to achieve high throughput and stable sending rate in lossy network scenarios with guaranteed fairness with TCP BBR flows and balanced congestion. Then, to further improve the performance, we propose an Adaptively Redundant and Packet-by-Packet (AR\&P) scheduler, which includes two scheduling methods to improve adaptability in highly dynamic network scenarios and keep in-order packet delivery in asymmetric networks. Based on Linux kernel implementation and experiments in both testbed and real network scenarios, we show that the proposed scheme not only provides higher throughput, but also improves robustness and reduces out-of-order packets in some harsh circumstances.

Leveraging Coupled BBR and Adaptive Packet Scheduling to Boost MPTCP

Multipath TCP (MPTCP) enables a client to exploit multiple wireless paths simultaneously for improved throughput and mobility resilience. However, MPTCP clients in WiFi networks may easily lower the achievable throughput of the network due to excessively created connections over access points (APs), particularly those that own a weak link quality. This is caused by the fact that the maximal achievable throughput of a WiFi AP can be easily affected by the number of connections accessing it and the link qualities of those connections. In this paper, we first verify such effects through extensive experiments and analysis. We then propose a novel scheme, denoted MPWiFi, to solve this issue while keeping the benefits of MPTCP based multipath access in WiFi networks. Our scheme allows a MPTCP client to obtain resources on its best WiFi path freely and suppresses its subflows in additional paths when congestion happens. As a result, the degrading to the WiFi AP's achievable throughput is greatly prevented with acceptable influences on the benefits of MPTCP clients (i.e., their multipath access is intervened only on congested non-best APs). The fairness to MPTCP clients is also guaranteed through their best WiFi connection. The proposed solution is implemented along with the Linux Kernel MPTCP implementation. Extensive real-world deployment based experiments and NS3 simulation show that the proposed scheme can effectively alleviate the adverse impact of MPTCP based multipath access in WiFi networks while keeping its benefits.

MPWiFi: Synergizing MPTCP Based Simultaneous Multipath Access and WiFi Network Performance

Multipath TCP (MPTCP) enables mobile devices to aggregate bandwidth from multiple wireless connections and own better mobility resilience but incurs additional energy consumption. Such a fact drives the research to find the energy-efficient access manner under MPTCP-based multipath access in wireless networks. However, existing work largely focuses on energy efficiency only and is agnostic to the bandwidth need of mobile devices. Therefore, in this paper, we propose to handle this gap by integrating the improvement of energy efficiency into the process of satisfying the bandwidth need. First, our approach keeps using a single connection if the bandwidth need is satisfied. A novel method is proposed based on TCP throughput modeling for monitoring bandwidth shortage when the client uses only a single connection. Second, when more bandwidth is needed, our approach does not turn to multipath access blindly but chooses the additional connection that has a potential in improving both energy efficiency and throughput. Third, when multipath is used, our approach keeps evaluating the necessity of switching back to using a single path based on the bandwidth need and energy efficiency. The three steps form a loop to continually assist mobile devices to balance bandwidth need and energy efficiency. Intensive experiments show that compared with using MPTCP on mobile devices directly, this method greatly improves energy efficiency while keeping bandwidth needs satisfied.

Bandwidth-Need Driven Energy Efficiency Improvement of MPTCP Users in Wireless Networks

In this paper, we report the spectrum occupancy measurement for cognitive radio purpose in Dhaka city for a period of 16 hours of the frequency bands in 0–3 GHz. We provide visual representation of the relations between frequency and corresponding power level as well as we compute duty cycle. The duty cycle from the measured data is obtained as 19%. This is the first of these kind of measurements done and reported in Bangladesh and findings from this measurement are important to provide insight on the spectrum usage and hence can be a milestone for future feasibility analysis for implementing cognitive radio network here.

0–3 GHz spectrum occupancy measurement in Bangladesh for cognitive radio purpose

We propose CoRE, a 360° video streaming approach that reduces bandwidth requirements compared to transferring the entire 360° video. CoRE uses non-linear sampling in both the spatial and temporal domains to achieve robustness to view direction prediction error and to transient wireless network bandwidth fluctuation. Each CoRE frame samples the environment in all directions, with full resolution over the predicted field of view and gradually decreasing resolution at the periphery, so that missing pixels are avoided, irrespective of the view prediction error magnitude. A CoRE video chunk has a main part at full frame rate, and an extension part at a gradually decreasing frame rate, which avoids stalls while waiting for a delayed transfer. We evaluate a prototype implementation of CoRE through trace-based experiments and a user study, and find that, compared to tiling with low-resolution padding, CoRE reduces data transfer amounts, stalls, and H.264 decoding overhead, increases frame rates, and eliminates missing pixels.

Robust 360° Video Streaming via Non-Linear Sampling

Correlating the congestion control (CC) of parallel subflows of multipath TCP (MPTCP) has shown the advantage of making it fair and friendly to legacy TCP. But the correlation also leads to some new drawbacks. In this paper, we first analyze major correlated MPTCP CC algorithms through the perspective of bandwidth competition. Based on the modeling, we verify, discover, and explain three shortages of correlated CC, namely 1) limit fairness semantic; 2) render new attack surfaces; and 3) interplay with network sharing policies. We further find that decoupling the CC of subflows is more promising in solving the above issues. However, directly applying legacy TCP CC to each subflow independently would lose the benefits of correlated CC. This motivates the design of an algorithm that decouples the CC of subflows as much as possible while still making MPTCP fair and friendly. To attain this goal, we translate the goals of correlated CC into an approximation principle under the decoupled semantic. We then propose a self-Constrained And Decoupled Increase Algorithm (CADIA) that achieves the principle by adaptively detecting and constraining non-best subflows. This makes CADIA share the benefits of correlated CC algorithms, while owning no direct correlation among the CC of subflows. Extensive analysis and experiments are conducted to demonstrate the effectiveness of CADIA.

Mijanur Rahaman Palash

Papers

MPWiFi: Synergizing MPTCP Based Simultaneous Multipath Access and WiFi Network Performance

Bandwidth-Need Driven Energy Efficiency Improvement of MPTCP Users in Wireless Networks

0–3 GHz spectrum occupancy measurement in Bangladesh for cognitive radio purpose

Robust 360° Video Streaming via Non-Linear Sampling

CADIA: Towards Decoupling the Congestion Control for Multipath TCP