BGP Speaker Research Articles

OPTIMALISASI ROUTING MENGGUNAKAN SATU AUTONOMOUS SYSTEM NUMBER (ASN) BORDER GATEWAY PROTOCOL (BGP)

Network routing that still uses two as numbers on the border gateway protocol, which allows the second as number to be a backup, which can be said to be ineffective. Moreover, the admin cannot know the backhoul network interference before monitoring a mass disturbance, so routing is switched manually. A Border Gateway Protocol is a path vector routing protocol that coordinates the routing of packets through multiple administrative domains by computing routes between every IP address the packet passes. Certain routers, called BGP speakers, are assigned to run the protocol. BGP speakers across different Autonomous Systems (AS) are interconnected in order to exchange routing information. BGP supports a feature called multihoming, which means connecting to multiple ISPs from different routers or points in the network. by using BGP one As Number, routing can choose the best or shortest path.

High Availability Aspects of SDN-IP Reactive Routing

SDN (Software-Defined Network) is a new paradigm in the world of networks that separates the control plane from the data plane. Over the past few years, SDN network deployment has been difficult because it was isolated from the current IP network. SDN-IP is an ONOS (Open Network Operating System) application used to connect SDN networks to external networks using the standard Border Gateway Protocol. The SDN device will create a path with OpenFlow after receiving a route from an external peering network with BGP speakers on the SDN network. SDN-IP Reactive Routing will calculate and create paths for traffic when receiving ipv4 or ipv6 packets. Therefore, with SDN-IP Reactive, Routing can make host communication between two SDN Network or SDN Network with the internet network. As a core network that connects autonomous systems to internet network, SDN-IP networks need to pay attention to aspects of redundancy. In this research, SDN-IP Architecture use many OpenFlow Switches that are connected to an external BGP are not sufficiently controlled by one controller because if the controller is down, the forwarding plane will be lost. Multiple controllers and multiple links are required to ensure the system continues to run when the controller or link is broken. The purpose of this research is to analyze the High Availability aspects of SDN-IP Reactive Routing. This is done by making multiple onos controllers in one onos cluster system. The testing process is carried out on aspects of BGP speakers, ONOS controller and links between components.

BGP route reflection revisited

The original BGP design requires that all BGP speakers within an autonomous system be directly connected with each other to create a full mesh, and BGP update messages be propagated to directly connected neighbors only. This requirement leads to BGP session scalability problems in networks with large numbers of BGP routers. Route reflection was proposed as a quick fix to address this BGP session scalability problem and has been widely deployed in the operational Internet without a thorough analysis of its pros and cons. In this article, we first provide an overview of the route reflection design, summarize the discoveries from published literature, and discuss the trade-offs in using route reflection as compared to using a fully connected i-BGP mesh. Then we show that well engineered route reflector placement can overcome certain drawbacks, and that a few issues remain open for future study.

Rate Limiting in an Event-Driven BGP Speaker

Implementing BGP route processing in an event-driven manner appears to be advantageous in terms of scalability. However, the inter-domain routing system as a whole would be overwhelmed without some type of rate limiting on BGP update streams. At first glace, an event-driven, pipelined route processing model does not seem to fit well with the traditional timer-based way of implementing BGP rate-limiting. In this paper we present a lazy event-driven BGP route processing pipeline that easily accommodates rate limiting.

A Technique for Reducing BGP Update Announcements through Path Exploration Damping

This paper defines and evaluates Path Exploration Damping (PED) - a router-level mechanism for reducing the volume of propagation of likely transient update messages within a BGP network and decreasing average time to restore reachability compared to current BGP Update damping practices. PED selectively delays and suppresses the propagation of BGP updates that either lengthen an existing AS Path or vary an existing AS Path without shortening its length. We show how PED impacts on convergence time compared to currently deployed mechanisms like Route Flap Damping (RFD), Minimum Route Advertisement Interval (MRAI) and Withdrawal Rate Limiting (WRATE). We replay Internet BGP update traffic captured at two Autonomous Systems to observe that a PED-enabled BGP speaker can reduce the total number of BGP announcements by up to 32% and reduce Path Exploration by 77% compared to conventional use of MRAI. We also describe how PED can be incrementally deployed in the Internet, as it interacts well with prevailing MRAI deployment, and enables restoration of reachability more quickly than MRAI.

Supporting multiple metrics in QoS-aware BGP

Being an important and yet a challenging problem, the QoS-based routing in the converging Internet has received significant attention from the research community. However, most of the QoS-based routing research is conducted in the context of intra-domain routing, leaving QoS-based inter-domain routing relatively open. In this paper, we focus on QoS-based inter-domain routing and specifically investigate how to enhance the current inter-domain routing protocol (BGP) with QoS extensions. To support multiple QoS metrics, BGP speakers have to advertise multiple routes for each destination. However, this will increase the routing message overhead and make QoS-aware BGP unscalable. To provide scalability without significantly sacrificing the performance, we propose path reduction algorithms called contribution based reduction (CBR) algorithms. Extensive simulations show that the proposed schemes achieve high performance in finding feasible paths with low complexity in terms of message overhead and computation, making the QoS extension to BGP scalable.

Preventing persistent oscillations and loops in IBGP configuration with route reflection

Internal Border Gateway Protocol (IBGP) is responsible for distributing external reachability information, obtained via External-BGP (EBGP) sessions, within an autonomous system (AS). To avoid a full mesh of IBGP sessions between all the BGP speakers of an AS, scaling schemes such as route reflection and AS confederations have been proposed. But it has been observed that employing these schemes may result in problems such as routing oscillations and forwarding loops due to Multi-Exit Discriminator (MED) attribute and path asymmetry in IBGP. In this paper we study the pathologies observed in IBGP when route reflection is used. We model the AS using the Interior Gateway Protocol (IGP) connectivity graph GI and IBGP peering graph GL. Then we state some simple conditions on GI and GL and prove that these conditions guarantee the absence of any persistent routing oscillations and forwarding loops due to MED attribute and IBGP path asymmetry. We consider the problem of constructing an IBGP configuration given the IGP connectivity such that there are no persistent oscillations and loops, and apply the conditions developed in the paper on this problem. We prove that solving the problem while minimizing some appropriate cost function is NP hard. We then give an Integer Linear Program (ILP) to construct a forwarding loop and persistent routing oscillation free IBGP configuration, for an AS with given IGP connectivity graph. which minimizes some appropriate cost while satisfying the resource constraints on all the BGP speaking nodes.