RRO: A Regularized Routing Optimization Algorithm for Enhanced Throughput and Low Latency with Efficient Complexity

TL;DR

This paper addresses the challenge of achieving higher network throughput with low latency in interference-laden wireless networks while keeping routing complexity on par with OSPF. It introduces Regularized Routing Optimization (RRO), a Dijkstra-like routing algorithm that computes a regularized path cost using an interference-aware, SINR-based link-rate model and a simple congestion metric derived from link weights. RRO supports both distributed (per-flow) and centralized implementations, with proven convergence to the regularized most efficient path and a complexity of $O(N|\mathcal{E}| + N|\mathcal{V}|\log|\mathcal{V}|)$, matching OSPF. Extensive simulations on NSFNET, GEANT2, and large-scale random networks show that RRO consistently outperforms competing approaches in throughput, delay, and fairness, while requiring no significant protocol changes for 5G and beyond deployments.

Abstract

In the rapidly evolving landscape of wireless networks, achieving enhanced throughput with low latency for data transmission is crucial for future communication systems. While low complexity OSPF-type solutions have shown effectiveness in lightly-loaded networks, they often falter in the face of increasing congestion. Recent approaches have suggested utilizing backpressure and deep learning techniques for route optimization. However, these approaches face challenges due to their high implementation and computational complexity, surpassing the capabilities of networks with limited hardware devices. A key challenge is developing algorithms that improve throughput and reduce latency while keeping complexity levels compatible with OSPF. In this collaborative research between Ben-Gurion University and Ceragon Networks Ltd., we address this challenge by developing a novel approach, dubbed Regularized Routing Optimization (RRO). The RRO algorithm offers both distributed and centralized implementations with low complexity, making it suitable for integration into 5G and beyond technologies, where no significant changes to the existing protocols are needed. It increases throughput while ensuring latency remains sufficiently low through regularized optimization. We analyze the computational complexity of RRO and prove that it converges with a level of complexity comparable to OSPF. Extensive simulation results across diverse network topologies demonstrate that RRO significantly outperforms existing methods.

Figures (3)

• Figure 1: Performance Evaluation of the Algorithms in the NSFNET Network.
• Figure 2: Performance evaluation of the algorithms in the GEANT2 network
• Figure 3: Performance evaluation of the algorithms in large-scale random network.

Theorems & Definitions (3)

• Remark 1
• Theorem 1
• Theorem 2