Skip to main content

Central Control Over Distributed Routing

Author(s): Vissicchio, Stefano; Tilmans, Olivier; Vanbever, Laurent; Rexford, Jennifer

To refer to this page use:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVissicchio, Stefano-
dc.contributor.authorTilmans, Olivier-
dc.contributor.authorVanbever, Laurent-
dc.contributor.authorRexford, Jennifer-
dc.identifier.citationVissicchio, Stefano, Olivier Tilmans, Laurent Vanbever, and Jennifer Rexford. "Central control over distributed routing." In Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication (2015): pp. 43-56. doi:10.1145/2785956.2787497en_US
dc.description.abstractCentralizing routing decisions offers tremendous flexibility, but sacrifices the robustness of distributed protocols. In this paper, we present Fibbing, an architecture that achieves both flexibility and robustness through central control over distributed routing. Fibbing introduces fake nodes and links into an underlying link-state routing protocol, so that routers compute their own forwarding tables based on the augmented topology. Fibbing is expressive, and readily supports flexible load balancing, traffic engineering, and backup routes. Based on high-level forwarding requirements, the Fibbing controller computes a compact augmented topology and injects the fake components through standard routing-protocol messages. Fibbing works with any unmodified routers speaking OSPF. Our experiments also show that it can scale to large networks with many forwarding requirements, introduces minimal overhead, and quickly reacts to network and controller failures.en_US
dc.format.extent43 - 56en_US
dc.relation.ispartofProceedings of the 2015 ACM Conference on Special Interest Group on Data Communicationen_US
dc.rightsAuthor's manuscripten_US
dc.titleCentral Control Over Distributed Routingen_US
dc.typeConference Articleen_US

Files in This Item:
File Description SizeFormat 
CentralControlDistributedRouting.pdf1.29 MBAdobe PDFView/Download

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.