Nous: Drop-Freeness and Duplicate-Freeness for Consistent Updating in SDN Multicast Routing

Consistent routing updates through Software-Defined Networking (SDN) can be difficult due to the asynchronous and distributed nature of the data plane. Recent studies have achieved consistent unicast routing updates. However, achieving consistent updates with drop-freeness and duplicate-freeness rem...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking Vol. 32; no. 5; pp. 3685 - 3698
Main Authors: Gao, Xiaofeng, Majidi, Akbar, Gao, Yucen, Wu, Guanhao, Jahanbakhsh, Nazila, Kong, Linghe, Chen, Guihai
Format: Journal Article
Language:English
Published: IEEE 01.10.2024
Subjects:
Bandwidth
consistent routing updates
Delays
multicast
Multicast algorithms
Protocols
Routing
Software defined networking
Software-defined networks
Unicast
ISSN:1063-6692, 1558-2566
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Consistent routing updates through Software-Defined Networking (SDN) can be difficult due to the asynchronous and distributed nature of the data plane. Recent studies have achieved consistent unicast routing updates. However, achieving consistent updates with drop-freeness and duplicate-freeness remains a challenge for multicast with fewer known results. This paper proposes a Novel Ordered Update Scheme called Nous, a novel approach that offers a comprehensive solution for consistently updating multicast routing based on SDN. To avoid duplicate entries, Nous configures the inport match field in the forwarding rules. Nous implements a dependency graph to schedule update operations dynamically. It also solves the Replace Operation Tree Migration Problem (ROTMP) using a greedy solution. To compare the greedy solution with the optimal solution, we employ the state-of-the-art mathematical programming solver Gurobi Optimizer 7.5 (for solving the optimization problem), Mininet 2.0, and Floodlight 1.2 (for simulation and comparison) to obtain a near-optimal solution. Simulation results show that using the greedy solution, Nous can usually achieve near-optimal solutions to the ROTMP with an average of fewer than 1.2 rounds and within 10 ms in different scenarios. This makes Nous the first ordered update scheme to guarantee two consistent states simultaneously.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2024.3404967