Central Control Over Distributed Routing
@article{Vissicchio2015CentralCO, title={Central Control Over Distributed Routing}, author={Stefano Vissicchio and Olivier Tilmans and Laurent Vanbever and Jennifer Rexford}, journal={Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication}, year={2015} }
Centralizing 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…
Figures and Tables from this paper
138 Citations
Path Provisioning for Fibbing Controlled Load Balanced IP Networks
- Computer Science2018 Tenth International Conference on Ubiquitous and Future Networks (ICUFN)
- 2018
This paper proposes a framework to achieve an optimized load balancing solution for a Fibbing controlled network and shows that the average time for file transfer is significantly reduced with the support of the proposed system.
Routing Path Assignment for Joint Load Balancing and Fast Failure Recovery in IP Network
- Computer Science, BusinessApplied Sciences
- 2021
A solution to provision routing paths so a Fibbing network can still apply Loop-Free Alternate in the network and the numerical results reveal that the proposed method can provide 100% survivability against any single node or single link failure.
Increased network routing efficiency through coordinated Fibbing
- Computer ScienceInt. J. Commun. Syst.
- 2018
A coordinated algorithm for Fibbing is proposed to determine a lowest‐cost route that accommodates not only the network topology and the flow request but also the fake nodes and the fake links.
Assuring Segment Routing Distributive-ness on OpenFlow Network with Stateful Data Plane
- Computer Science2018 International Conference on Information Technology Systems and Innovation (ICITSI)
- 2018
The method uses a decentralized, inter-switch communication channel implemented using state keeping ability of stateful data plane to enable a distributed construction and recovery of segment routing forwarding path and can recover the routing path in a distributed fashion within 1-second latency.
A centralized controller to improve fault tolerance in TRILL-based fabric networks
- Computer Science2016 3rd Smart Cloud Networks & Systems (SCNS)
- 2016
This paper proposes a hybrid architecture that achieves the best tradeoff between efficiency of centralized architectures and robustness of distributed ones, based on a centralized controller that ephemerally configures the routing table with alternative paths already computed by the TRILL IS-IS protocol.
Evaluating the Performance of Fibbing Architecture in the Hybrid Software Defined Network
- Computer Science2020 International Conference on Radar, Antenna, Microwave, Electronics, and Telecommunications (ICRAMET)
- 2020
This research analyzes the performance of Fibbing by using the isolation domain in the Hybrid software-defined network (SDN) environment in terms of the network quality based on the latency and throughput when sending information packets from the source to the destination nodes.
SDN Partitioning: A Centralized Control Plane for Distributed Routing Protocols
- Computer ScienceIEEE Transactions on Network and Service Management
- 2016
This paper proposes a new hybrid network architecture, called SDN partitioning (SDNp), which establishes centralized control over the distributed routing protocol by partitioning the topology into sub-domains with SDN-enabled border nodes.
Trading routing diversity for better network performance
- Computer Science, Business2016 IEEE 24th International Conference on Network Protocols (ICNP)
- 2016
FlexCut is introduced, a flexible approach for cutting off wireless links, which essentially limits the candidate forwarder set of each node, and can trade arbitrary amounts of routing diversity for better network performance by exposing to network operators a parameter which quantifies the aggressiveness.
Trading Routing Diversity for Better Network Performance
- Computer ScienceIEEE Transactions on Mobile Computing
- 2019
FlexCut is introduced, a flexible approach for cutting off wireless links, which essentially limits the candidate forwarder set of each node, and can trade arbitrary amounts of routing diversity for better network performance by exposing to network operators a parameter which quantifies the aggressiveness.
D2R: Dataplane-Only Policy-Compliant Routing Under Failures
- Computer ScienceArXiv
- 2019
D2R, the new network architecture, can provide the illusion of a network fabric that is always available and policy-compliant, even under failures, and is implemented in P4 and demonstrated its viability in real world topologies.
References
SHOWING 1-10 OF 49 REFERENCES
Central Control Over Distributed Routing ( Extended Version ) http : / / fibbing . net
- Computer Science
- 2015
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.
Sweet Little Lies: Fake Topologies for Flexible Routing
- Computer ScienceHotNets
- 2014
It is argued that future networks can achieve the benefits of both approaches through central control over the distributed route computation through Fibbing, which is to have the controller trick the routers into seeing a fake topology that is carefully constructed to achieve the desired Forwarding Information Base.
Design and implementation of a routing control platform
- Computer ScienceNSDI
- 2005
It is shown that RCP assigns routes correctly, even when the functionality is replicated and distributed, and that networks using RCP can expect comparable convergence delays to those using today's iBGP architectures.
Traffic engineering with traditional IP routing protocols
- Computer ScienceIEEE Commun. Mag.
- 2002
It is argued that traditional shortest path routing protocols are surprisingly effective for engineering the flow of traffic in large IP networks.
The Segment Routing Architecture
- Computer Science2015 IEEE Global Communications Conference (GLOBECOM)
- 2014
Segment Routing is presented, a new network architecture aimed at filling this gap, driven by use-cases defined by network operators, and its related ongoing standardization efforts are described.
Onix: A Distributed Control Platform for Large-scale Production Networks
- Computer ScienceOSDI
- 2010
Onix provides a general API for control plane implementations, while allowing them to make their own trade-offs among consistency, durability, and scalability.
Achieving high utilization with software-driven WAN
- Computer ScienceSIGCOMM
- 2013
A novel technique is developed that leverages a small amount of scratch capacity on links to apply updates in a provably congestion-free manner, without making any assumptions about the order and timing of updates at individual switches.
Internet traffic engineering by optimizing OSPF weights
- Computer ScienceProceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
- 2000
Surprisingly it turned out that for the proposed AT&T WorldNet backbone, weight settings that performed within a few percent from that of the optimal general routing where the flow for each demand is optimally distributed over all paths between source and destination.
Achieving sub-second IGP convergence in large IP networks
- Computer ScienceCCRV
- 2005
The authors' measurements and simulations indicate that sub-second link-state IGP convergence can be easily met on an ISP network without any compromise on stability.
Measuring ISP topologies with Rocketfuel
- Computer ScienceIEEE/ACM Transactions on Networking
- 2004
New Internet mapping techniques that have enabled us to measure router-level ISP topologies are presented, finding that these maps are substantially more complete than those of earlier Internet mapping efforts.