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… 
Path Provisioning for Fibbing Controlled Load Balanced IP Networks
TLDR
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.
Increased network routing efficiency through coordinated Fibbing
TLDR
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
  • A. Basuki, M. Sidiq, D. Syamsi
  • Computer Science
    2018 International Conference on Information Technology Systems and Innovation (ICITSI)
  • 2018
TLDR
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
TLDR
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
TLDR
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
TLDR
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
TLDR
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
TLDR
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
TLDR
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.
Routing Stability in Hybrid Software-Defined Networks
TLDR
This paper first defines stability for hybrid SDNs and then establishes a per-priority stabilizing framework to obtain stable routing patterns, and discusses three approaches to reach hybrid SDN stability: global optimization, greedy, and local search.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 49 REFERENCES
Central Control Over Distributed Routing ( Extended Version ) http : / / fibbing . net
TLDR
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
TLDR
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
TLDR
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
TLDR
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
TLDR
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
TLDR
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
TLDR
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
  • B. Fortz, M. Thorup
  • Computer Science
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
TLDR
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
TLDR
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
TLDR
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.
...
1
2
3
4
5
...