Recursive SDN for Carrier Networks

TL;DR

This paper introduces a recursive SDN framework for carrier networks that combines programmability and scalability, enabling efficient routing, traffic engineering, and fast failure recovery in large-scale, geographically distributed networks.

Contribution

It proposes a novel recursive routing computation framework that merges SDN programmability with hierarchical scalability, addressing limitations of existing control planes.

Findings

Supports routing and traffic engineering in large networks

Enables fast failure recovery mechanisms

Scalable to networks with up to 10,000 nodes

Abstract

Control planes for global carrier networks should be programmable (so that new functionality can be easily introduced) and scalable (so they can handle the numerical scale and geographic scope of these networks). Neither traditional control planes nor new SDN-based control planes meet both of these goals. In this paper, we propose a framework for recursive routing computations that combines the best of SDN (programmability) and traditional networks (scalability through hierarchy) to achieve these two desired properties. Through simulation on graphs of up to 10,000 nodes, we evaluate our design's ability to support a variety of routing and traffic engineering solutions, while incorporating a fast failure recovery mechanism.