Recursive SDN for carrier networks

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

Research output: Contribution to journalArticle

Abstract

Control planes for global carrier networks should be programmable and scalable. Neither traditional control planes nor new SDN-based control planes meet both of these goals. Here we propose a framework for recursive routing computations that combines the best of SDN (programmability through centralized controllers) 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 unicast routing and traffic engineering solutions, while incorporating a fast failure recovery mechanism based on network virtualization.

Original languageEnglish (US)
Pages (from-to)1-7
Number of pages7
JournalComputer Communication Review
Volume46
Issue number4
DOIs
StatePublished - Oct 1 2016

Fingerprint

Scalability
Recovery
Controllers
Software defined networking
Virtualization

Keywords

  • Carrier networks
  • Hierarchical networks
  • Network routing
  • SDN
  • Software defined networking

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Cite this

McCauley, J., Liu, Z., Panda, A., Koponen, T., Raghavan, B., Rexford, J., & Shenker, S. (2016). Recursive SDN for carrier networks. Computer Communication Review, 46(4), 1-7. https://doi.org/10.1145/3027947.3027948

Recursive SDN for carrier networks. / McCauley, James; Liu, Zhi; Panda, Aurojit; Koponen, Teemu; Raghavan, Barath; Rexford, Jennifer; Shenker, Scott.

In: Computer Communication Review, Vol. 46, No. 4, 01.10.2016, p. 1-7.

Research output: Contribution to journalArticle

McCauley, J, Liu, Z, Panda, A, Koponen, T, Raghavan, B, Rexford, J & Shenker, S 2016, 'Recursive SDN for carrier networks', Computer Communication Review, vol. 46, no. 4, pp. 1-7. https://doi.org/10.1145/3027947.3027948
McCauley J, Liu Z, Panda A, Koponen T, Raghavan B, Rexford J et al. Recursive SDN for carrier networks. Computer Communication Review. 2016 Oct 1;46(4):1-7. https://doi.org/10.1145/3027947.3027948
McCauley, James ; Liu, Zhi ; Panda, Aurojit ; Koponen, Teemu ; Raghavan, Barath ; Rexford, Jennifer ; Shenker, Scott. / Recursive SDN for carrier networks. In: Computer Communication Review. 2016 ; Vol. 46, No. 4. pp. 1-7.
@article{28d29d2a7ac948eb9a1b6392a2bef93e,
title = "Recursive SDN for carrier networks",
abstract = "Control planes for global carrier networks should be programmable and scalable. Neither traditional control planes nor new SDN-based control planes meet both of these goals. Here we propose a framework for recursive routing computations that combines the best of SDN (programmability through centralized controllers) 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 unicast routing and traffic engineering solutions, while incorporating a fast failure recovery mechanism based on network virtualization.",
keywords = "Carrier networks, Hierarchical networks, Network routing, SDN, Software defined networking",
author = "James McCauley and Zhi Liu and Aurojit Panda and Teemu Koponen and Barath Raghavan and Jennifer Rexford and Scott Shenker",
year = "2016",
month = "10",
day = "1",
doi = "10.1145/3027947.3027948",
language = "English (US)",
volume = "46",
pages = "1--7",
journal = "Computer Communication Review",
issn = "0146-4833",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

TY - JOUR

T1 - Recursive SDN for carrier networks

AU - McCauley, James

AU - Liu, Zhi

AU - Panda, Aurojit

AU - Koponen, Teemu

AU - Raghavan, Barath

AU - Rexford, Jennifer

AU - Shenker, Scott

PY - 2016/10/1

Y1 - 2016/10/1

N2 - Control planes for global carrier networks should be programmable and scalable. Neither traditional control planes nor new SDN-based control planes meet both of these goals. Here we propose a framework for recursive routing computations that combines the best of SDN (programmability through centralized controllers) 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 unicast routing and traffic engineering solutions, while incorporating a fast failure recovery mechanism based on network virtualization.

AB - Control planes for global carrier networks should be programmable and scalable. Neither traditional control planes nor new SDN-based control planes meet both of these goals. Here we propose a framework for recursive routing computations that combines the best of SDN (programmability through centralized controllers) 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 unicast routing and traffic engineering solutions, while incorporating a fast failure recovery mechanism based on network virtualization.

KW - Carrier networks

KW - Hierarchical networks

KW - Network routing

KW - SDN

KW - Software defined networking

UR - http://www.scopus.com/inward/record.url?scp=85008698680&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85008698680&partnerID=8YFLogxK

U2 - 10.1145/3027947.3027948

DO - 10.1145/3027947.3027948

M3 - Article

AN - SCOPUS:85008698680

VL - 46

SP - 1

EP - 7

JO - Computer Communication Review

JF - Computer Communication Review

SN - 0146-4833

IS - 4

ER -