# Online Load Balancing for Network Functions Virtualization

**Authors:** Tuan-Minh Pham, Thi-Thuy-Lien Nguyen, Serge Fdida (UPMC), Huynh Thi, Thanh Binh

arXiv: 1702.07219 · 2017-02-24

## TL;DR

This paper presents ORBIT, an online load balancing algorithm for NFV that optimizes network performance by dynamically distributing traffic across multiple paths, with proven performance guarantees and strong results on real datasets.

## Contribution

The paper introduces ORBIT, a novel online load balancing algorithm for NFV that efficiently manages dynamic user demands with theoretical guarantees.

## Key findings

- ORBIT effectively balances traffic without future demand knowledge.
- It outperforms baseline methods under high-load conditions.
- Theoretical analysis confirms near-optimal performance.

## Abstract

Network Functions Virtualization (NFV) aims to support service providers to deploy various services in a more agile and cost-effective way. However, the softwarization and cloudification of network functions can result in severe congestion and low network performance. In this paper, we propose a solution to address this issue. We analyze and solve the online load balancing problem using multipath routing in NFV to optimize network performance in response to the dynamic changes of user demands. In particular, we first formulate the optimization problem of load balancing as a mixed integer linear program for achieving the optimal solution. We then develop the ORBIT algorithm that solves the online load balancing problem. The performance guarantee of ORBIT is analytically proved in comparison with the optimal offline solution. The experiment results on real-world datasets show that ORBIT performs very well for distributing traffic of each service demand across multipaths without knowledge of future demands, especially under high-load conditions.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1702.07219/full.md

## Figures

25 figures with captions in the complete paper: https://tomesphere.com/paper/1702.07219/full.md

## References

23 references — full list in the complete paper: https://tomesphere.com/paper/1702.07219/full.md

---
Source: https://tomesphere.com/paper/1702.07219