Over provisioning-centric QoS-routing mechanism for the communication paradigm of future internet 4WARD proposal

The FP7 4WARD clean-slate Project envisions overcoming the limitations of current Internet by redefining it to efficiently support complex value-added sessions and services, such as location-based, health-care, critical-mission, and geo processing. The list of networking innovations from 4WARD’s Future Internet (FI) proposal includes a new connectivity paradigm called Generic Path (GP), a common representation for all communications. From the networking point of view, a GP is mapped to a communication path for data propagation. For that, GP architecture relies on routing mechanism for selecting best communication paths. In order to assure reliable communications, the routing mechanism must efficiently provision QoS-aware multi-party capable paths, with robustness functions, while keeping network performance. Therefore, this paper proposes the QoS-Routing and Resource Control (QoS-RRC) mechanism to deal with the hereinabove requirements by means of an over provisioning-centric (bandwidth and paths) approach. QoS-RRC achieves scalability by avoiding per-flow operations (e.g., signaling, state storage, etc.). Initial QoS-RRC performance evaluation was carried out in Network Simulator v.2 (NS-2), enabling drastic reduction of overall signaling exchanges compared to per-flow solutions

Performance Comparison of Queue Management Algorithms in LTE Networks using NS-3 Simulator

One of the most important issues accepted by researchers in LTE cellular systems is to develop Queue Management Algorithms for RLC (Radio Link Control). The performance of queue-management algorithms depends on parameters such as latency, packet dropping, and bandwidth usage. Simulation software is used to evaluate the queue-management algorithms developed and to test their performance. In the literature, active queue management algorithms have been compared with wired and wireless networks. In contrast to prior works, in this study, we have analyzed active queue management algorithms using the LTE model in the NS-3 network simulator. When the data and the results obtained from the simulations have been evaluated, it is concluded that the RED algorithm using probabilistic methods and the threshold value is more successful than the other algorithms in LTE networks

Sustainable IoT Sensing Applications Development through GraphQL-Based Abstraction Layer

Internet of Things (IoT) networks are mostly comprised of power-constrained devices, therefore the most important consideration in designing IoT applications, based on sensor networks is energy efficiency. Minor improvement in energy conservation methods can lead to a significant increase in the lifetime of IoT devices and overall network. To achieve efficient utilisation of energy, different solutions are proposed such as duty cycling optimization, design changes at the MAC layer, etc. In this paper, we propose a new approach to overcome this challenge in cloud-based IoT sensing applications, based on integration of an abstraction layer with constrained application mechanism. To achieve energy conservation and efficient data management in IoT sensing applications, we incorporate modules of efficient web framework with cloud services, in order to minimize the number of round trips for data delivery and graph-based data representation. Our study is the first attempt in the literature, to the best of our knowledge, which introduces the potential of this integration for achieving the aforementioned objectives in the target applications. We implemented the proposed interfacing of abstraction layer in constrained applications, to develop a testbed using Z1 IoT motes, Contiki OS and GraphQL web framework with Google cloud services. Experimental comparisons against baseline REST architecture approach show that our proposed approach achieved significant reductions in data delivery delay and energy consumption (minimum 51.53% and 52.88%, respectively) in IoT applications involving sensor network.</jats:p

BBRp: Improving TCP BBR Performance over WLAN

This paper shows the inefficiency of TCP BBR in exploiting the Wi-Fi bandwidth. This limitation of BBR has been observed with both IEEE 802.11n and IEEE 802.11ac, where the mechanism of frame aggregation is used to boost the throughput of data transmission. In the last years, many TCP variants have been introduced to limit the bufferbloat phenomena and bound the latency through a reduction of the queue backlog injection rate. However, this mechanism impacts on the Wi-Fi frame aggregation logic, impeding TCP congestion controls to reach the full throughput potential of a Wi-Fi interface. While this problem can be solved with TCP Cubic by allowing the sender node to enqueue more packets, for TCP BBR the fix is not the same, as it has a customized pacing algorithm. With this contribution we propose BBRp, a new BBR version that allows for fine-tuning the congestion control pace, achieving between four and six times more throughput over IEEE 802.11n and IEEE 802.11ac channels, at the cost of an increased latency that is however always less than the latency obtainable with loss-based TCP congestion controls

Future of TCP on Wi-Fi 6

The Linux TCP/IP stack contributions have recently pointed all in the same direction: maximize the available throughput while maintaining low latency. These activities started by mitigating the buffebloat phenomenon at the network bottleneck as much as possible. So far, the deployed solutions have been designed by considering standard models for the bottleneck that could be either wireless or wired. The introduction of Wi-Fi 6 is dislocating the bottleneck of standard home and office WLAN from the radio access point to the 1 Gbps interface, the wired interface that points to the internet service provider; this bottleneck migration leads to a new real-case bottleneck model, which is hybrid. Such an environment embraces new technologies and provides new challenges for the old TCP protocol when applied to hybrid bottlenecks and operating in conjunction with the TCP side-modules, which are now part of the novel Linux kernels. This paper aims to highlight the TCP performance considering the new TCP modules and novel scenarios opened by Wi-Fi 6 with real-case hybrid bottlenecks

Transport Protocol Performance and Impact on QoS while on the Move in Current and Future Low Latency Deployments

Transport protocols and mobile networks have evolved independently leading to a lack of adaptability and quality of service (QoS) degradation while running under the variability circumstances present in cellular access. This chapter evaluates the performance of state-of-the-art transmission control protocol (TCP) implementations in challenging mobility scenarios under 4G latencies and low delays that model the proximity service provisioning of forthcoming 5G networks. The evaluation is focused on selecting the most appropriate TCP flavor for each scenario taking into account two metrics: (1) the goodput-based performance and (2) a balanced performance metric that includes parameters based on goodput, delay and retransmitted packets. The results show that mobility scenarios under 4G latencies require more aggressive TCP solutions in order to overcome the high variability in comparison with low latency conditions. Bottleneck Bandwidth and Round-Trip Time-RTT (BBR) provides better scalability than others and Illinois is more capable of sustaining the goodput with big variability between consecutive samples. Besides, CUBIC performs better in lower available capacity scenarios and regarding the balanced metric. In reduced end-to-end latencies, the most suitable congestion control algorithms (CCAs) to maximize the goodput are NewReno (low available capacity) and CUBIC (high available capacity) when moving with continuous capacity increases. Additionally, BBR shows a balanced and controlled behavior in most of the scenarios