Intra-domain routing convergence with centralized control

Fu, Jing; Sjödin, Peter; Karlsson, Gunnar

doi:10.1016/j.comnet.2009.07.008

Cited by 17 publications

(7 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The separation of the network control from the data plane and the consequent logical centralization of routing control promises to drastically simplify routing management within an AS [13,16], and provide faster intra-domain routing convergence [41]. Operators can centrally express [42], enforce and check routing policies using the global view that the NOS provides; these policies can be dynamically compiled and deployed [43].…”

Section: Centralizing Routing Within An Asmentioning

confidence: 99%

Routing centralization across domains via SDN: A model and emulation framework for BGP evolution

2015

View full text Add to dashboard Cite

The Border Gateway Protocol (BGP) was designed almost three decades ago and has many limitations relating to its fully distributed nature, policy enforcement capabilities, scalability, security and complexity. For example, the control plane can take several minutes to converge after a routing change; this may be unacceptable for real-time network services. Despite many research proposals for incremental improvements and clean-slate redesigns of how inter-domain routing should work, BGP is likely one of the most ossified protocols of the Internet architecture and it has not retrofitted the proposed ideas. In this work, we propose a radical, incrementally deployable Internet routing paradigm in which the control plane of multiple networks is logically centralized. This follows the Software Defined Networking (SDN) paradigm, although at the inter-domain level involving multiple Autonomous Systems (AS). Multi-domain SDN centralization can be realized by outsourcing routing functions to an external contractor, which provides inter-domain routing services facilitated through a multi-AS network controller. The proposed model promises to become a vehicle for evolving BGP and uses the bird's eye view over several networks to benefit aspects of interdomain routing, such as convergence properties, policy conflict resolution, inter-domain troubleshooting, and collaborative security. In addition to the proposed paradigm, we introduce a publicly available emulation platform built on top of Mininet and the Quagga routing software, for experimenting on hybrid BGP-SDN AS-level networks. As a proof of concept, we focus specifically on exploiting multi-domain centralization to improve BGP's slow convergence. We build and make publicly available a first multi-AS controller tailored to this use case and demonstrate experimentally that SDN centralization helps to linearly reduce BGP convergence times and churn rates with expanding SDN deployments.

show abstract

Section: Centralizing Routing Within An Asmentioning

confidence: 99%

Routing centralization across domains via SDN: A model and emulation framework for BGP evolution

2015

View full text Add to dashboard Cite

show abstract

“…Other studies on centralized routing schemes [5] have shown encouraging results about faster network convergence. Having a comparable convergence time, a well designed routing architecture could be an alternative to link-state protocols.…”

Section: Contributionmentioning

confidence: 86%

Rethinking iBGP routing

Oprescu

Meulle

Uhlig

et al. 2010

Proceedings of the ACM SIGCOMM 2010 Conference

View full text Add to dashboard Cite

The Internet is organized as a collection of administrative domains, known as Autonomous Systems (ASes). These ASes interact through the Border Gateway Protocol (BGP) that allows them to share reachability information. Adjacent routers in distinct ASes use external BGP (eBGP), whereas in a given AS routes are propagated over internal BGP (iBGP) sessions between any pair of routers. In large ASes where a logical full-mesh is not possible, confederations or route reflectors (RRs) are used. However, these somewhat scalable alternatives have introduced their own set of unpredictable effects (persistent routing oscillations and forwarding loops causing an increase of the convergence time) addressed in the literature [1].The solution we propose to these issues consists of a structured routing overlay holding a comprehensive view of the routes. We describe the design of a distributed entity that performs BGP route pre-computation for its clients inside a large backbone network and propagates the paths to the routers. Compared to the current iBGP routing, the advantage of the overlay approach is the separation between the responsibility of the control plane (route storage and best path computation) and the forwarding of the packets.One of the major improvements we bring is the divided routing table tackling the scalability concerns and allowing for parallel computation of paths.

show abstract

“…It can be argued that SDNs are primarily deployed in small networks (like data centers), and are not suitable for use on the Internet. However, SDNs have been shown to scale to an entire AS [17,28,40], and practical ISPscale SDN has been demonstrated by Rexford et al [30]. Moreover, there is a recent research that suggests how ISPs can (and should) migrate to SDNs [48].…”

Section: Sdns and Siegebreakermentioning

confidence: 99%

SiegeBreaker: An SDN Based Practical Decoy Routing System

Sharma

Gosain

Sagar

et al. 2020

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

Decoy Routing (DR), a promising approach to censorship circumvention, uses routers (rather than end hosts) as proxy servers. Users of censored networks, who wish to use DR, send specially crafted packets, nominally addressed to an uncensored website. Once safely out of the censored network, the packets encounter a special router (the Decoy Router) which identifies them using a secret handshake, and proxies them to their true destination (a censored site). However, DR has implementation problems: it is infeasible to reprogram routers for the complex operations required. Existing DR solutions fall back on using commodity servers as a Decoy Router. But as servers are not efficient at routing, most web applications show poor performance when accessed over DR. A further concern is that the Decoy Router has to inspect all flows in order to identify the ones that need DR. This may itself be a breach of privacy for other users (who neither require DR nor want to be monitored). In this paper, we present a novel DR system, Siege- Breaker (SB), which solves the aforementioned problems using an SDN-based architecture. Previous proposals involve a single unit which performs all major operations (inspecting all flows, identifying the DR requests and proxying them). In contrast, SB distributes the tasks for DR among three independent modules. (1) The SDN controller identifies DR requests via a covert, privacy preserving scheme, and does not need to inspect all flows. (2) The reconfigurable SDN switch intercepts packets, and forwards them to a secret proxy efficiently. (3) The secret proxy server proxies the client’s traffic to the censored site. Our modular, lightweight design achieves performance comparable to direct TCP downloads, for both in-lab setups, and Internet based tests involving commercial SDN switches.

show abstract

Intra-domain routing convergence with centralized control

Cited by 17 publications

References 20 publications

Routing centralization across domains via SDN: A model and emulation framework for BGP evolution

Routing centralization across domains via SDN: A model and emulation framework for BGP evolution

Rethinking iBGP routing

SiegeBreaker: An SDN Based Practical Decoy Routing System

Contact Info

Product

Resources

About