James McCauley, Zhi Liu, Aurojit Panda, Teemu Koponen, Barath Raghavan, Jennifer Rexford and Scott Shenker

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2017-162
November 15, 2017

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2017/EECS-2017-162.pdf

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 response, 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.

Advisor: Scott Shenker

BibTeX citation:

@mastersthesis{McCauley:EECS-2017-162,
    Author = {McCauley, James and Liu, Zhi and Panda, Aurojit and Koponen, Teemu and Raghavan, Barath and Rexford, Jennifer and Shenker, Scott},
    Title = {Recursive SDN for Carrier Networks},
    School = {EECS Department, University of California, Berkeley},
    Year = {2017},
    Month = {Nov},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2017/EECS-2017-162.html},
    Number = {UCB/EECS-2017-162},
    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 response, 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.}
}

EndNote citation:

%0 Thesis
%A McCauley, James
%A Liu, Zhi
%A Panda, Aurojit
%A Koponen, Teemu
%A Raghavan, Barath
%A Rexford, Jennifer
%A Shenker, Scott
%T Recursive SDN for Carrier Networks
%I EECS Department, University of California, Berkeley
%D 2017
%8 November 15
%@ UCB/EECS-2017-162
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2017/EECS-2017-162.html
%F McCauley:EECS-2017-162