Border Gateway Routing Protocol Convergence Time Analysis with Minimum Route Advertisement Information

Border Gateway Protocol (BGP) is a widely used routing protocol in the new era for the inter-communication between the multiple autonomous systems and it has been largely on the internet in all categories of the scalable network. In the event of failure, the BGP as an inter-domain routing protocol shows slow convergence, which results in high considerable delay in several internet/web applications. The minimum route advertisement interval (MRAI) timers are mostly used by network operators to reduce the issues occurring at the time of increasing convergence time. Many researchers have been working on variation in MRAI timer and effect of it on scalability and network convergence. The increasing size of a network leads to an increase in the value of MRAI timers. Hence, keeping the value of MRAI timers optimum results in reducing the issue of slow convergence for the scalable network. The proposed system (FAPSO) reduces the problem of convergence time by incorporating fuzzy logic into Particle Swarm Optimization (PSO) algorithm for the scalable network. In comparison with the static value of MRAI timer i.e., 30 s, FAPSO is a suitable algorithm that gives the optimal value of convergence time for the scalable network.

The Border Gateway Protocol (BGP) is the single routing protocol that glues the Internet together. Its performance, especially the convergence speed after path changes, is key to global efficiency, also in light of the fact that the number of Autonomous Systems (ASes) and Subnets has reached a level that makes path changes a frequent event. This work presents a testbed-based experimental analysis of BGP convergence time under different hypothesis of Minimum Route Advertisement Interval (MRAI) setting and a proposal to improve it by setting MRAI based on the topological position of the ASes. MRAI is a timer that regulates the frequency of successive UPDATE messages sent by a BGPs router for a given route and destination. The work is based on the modifications of the BIRD BGP daemon and shows that it is possible to execute experiments on testbeds with topologies that have Internet-like characteristics scaling up to thousands of ASes.

Objectives: Nowadays the Internet has become vital to each and every one. It is sensitive to link failures and node failures due to many reasons in the network connectivity. Any change in the node or link may change the routing table of many nodes. Due to this change, the routing table of many nodes may be unstable. These failures lead to increase the convergence time of network. The paper focused on reducing the convergence time of network. Methods -In this research paper, we have proposed a novel approach that keeps the value of Minimum Route Advertisement Interval (MRAI) timer fickle. In this approach, depending on the position of receiver, the value of the MRAI timer is varying. In this research, if more than one route is available to reach the destination then we have used the soft computing approach so that the load is balanced over all the paths that are reaching to the destination to avoid the congestion. Result: The approach used in this paper focuses on fast network convergence and maximum link utilization. The Fickle MRAI used in the network for reducing the convergence time up to 5 second, also the use of load balancing approach to improve link utilization of the network. Conclusion: The proposed work improves fast network convergence and utilization of bandwidth as the traffic flows from the entire shortest paths in the network.

Future military networks will use satellite nodes in conjunction with terrestrial ad-hoc networks in a packet and IP based framework. These long-range networks have a unique combination of characteristics and requirements that have caused network architects to consider the border gateway protocol (BGP) as the routing protocol. In this paper we analyze the performance of BGP in various scenarios relevant to the network under consideration based on both an analysis of protocol behavior as well as detailed simulations and traces of BGP. More specifically, we study the interaction of various BGP and TCP timers amidst node mobility and intermittent links and analyze their impact on routing and convergence times. Finally, through our simulations and analyses, we propose ways to address the routing and convergence time problems associated with link dynamics and BGP, which in essence include guidance/insights to judicious setting of timer values, modifications to BGP configuration, and its control via configuration management

With the advent of the internet and growing complexity in the networking environment, old protocols like Routing Information Protocol (RIP) or Enhanced Interior Gateway Routing Protocol (EIGRP) pose significant bottlenecks for modern businesses and service providers. This paper provides an overview on the evolution of RIP and EIGRP, its limitations as Interior Gateway Protocols (IGPs), the benefits of moving to newer and more powerful protocols such as Open Shortest path First (OSPF), Intermediate System to Intermediate System (IS-IS) and Border Gateway Protocol (BGP). The paper further dives deep into migration strategies from legacy protocols to OSPF or ISIS. OSPF and IS-IS are considered the best enterprise routing solutions and service provider routing solutions respectively due to their scalability, performance and flexibility. In addition, it highlights the importance of BGP as an external gateway protocol to control routing across autonomous systems. The findings aims to aid network engineers in making educated decisions on protocol implementation and migration efforts. Keywords— RIP, OSPF, IS-IS, BGP, Migration Strategies, Convergence time, Scalability.

Border Gateway Protocol (BGP) is an inter-domain routing protocol that allows an autonomous system (AS) to apply local policies for selecting the best route and decide whether the route information is propagated to other ASes or not. But since the last few years, the research community has shown an increasing interest in the subject of inter-domain routing in optical networks, so there will be need to modify existing BGP with optical counterparts. However, in past few years it is widely accepted now that a multi-domain routing model mostly centered on the exchange of reachability information. So the protocol like the one we have today or the one provided by Optical Border Gateway Protocol (OBGP) is not going to be enough in the future. So routing domains must be able to exchange both, reachability, as well as aggregated Path State Information (PSI). Understanding that there is a missing piece in the routing models provided by BGP and OBGP, but contributing with solutions capable of highly improving the performance of these routing protocols without increasing the number and frequency of the routing messages exchanged between domains is a challenging task. So introduction to the Extended Optical Border Gateway Protocol(OBGP+) was proposed to overcome shortcomings. But when it comes to the case of failure scenario, it is known to us that during convergence BGP withdraws the failed path and selects immediately an alternate path for backup routing. The time required for this convergence should be minimum as possible otherwise the data loss will be enormous. In this paper, Convergence time had been studied for Optical Border Gateway Protocol (OBGP) and Extended Optical Border Gateway Protocol (OBGP+). Extensive simulation of the experiments reveals that OBGP+ is performing better than OBGP in the failure scenarios.

Examining the Jurisdictions of Internet Routes to Prevent Data Exfiltration

Inter-domain routing protocol routes network reachability information between autonomous systems (ASs) in the network. Network reachability information contains the details about the neighbors of the ASs and it contains messages used to maintain the connection between ASs. On one hand, given the size and the rapid growth of the Internet, any inter-domain routing protocol should satisfy basic desirable algorithmic properties, such as scalability, robustness and rapid convergence by Griffin, T., and Wilford, G. 1999. On the other hand, for economic reasons inter-domain routing should support policy routing, where Internet service providers (ISPs) have the flexibility to implement a wide variety of private routing policies that ISPs choose not to reveal. Moreover, the routing protocol should provide sufficient information to enable ISPs to make informed policy decisions. Border gateway protocol (BGP) by Goodell, G. et al. (2003) is the inter-domain routing protocol that is currently being used. BGP has a number of problems which includes scalability and large convergence time by Labovitz, C et al. (2000). This paper explains in detail the alternative to BGP which is the hybrid optimized link-state path-vector routing protocol (HLP) [1] and gives a comparison based on the simulation of these protocols. The comparison shows us that HLP overcomes some of the important problems faced in BGP.

Border Gateway Protocol is a path vector protocol. BGP is commonly used by Internet Service Providers. This protocol is considered as exterior protocol. BGP connects different Autonomous System via the internet. As the global internet traffic is rising with the increase in web applications. Most of these applications impact by delay. One of the delay sources over the internet which caused by the BGP routing protocol. BGP delay comes from the convergence time. This paper demonstrates an analysis of BGP convergence time and BGP timers or intervals. This paper analysis BGP convergence based on keepalive and hold timers. In addition, the paper considers the most important interval of route advertisement and update delay. Moreover, the paper takes into account link events such as failover and link failure mechanisms. The simulation result shows that the keepalive should be greater than 10 seconds. Furthermore, the optimum value of route advertisement should be between 30 to 60 seconds. Finally, paper results show that the delay of link failure detection based on the keepalive of BGP increases the convergence delay of the BGP system.

The Minimal Route Advertisement Interval (MRAI) plays a prominent role in convergence of the Border Gateway Protocol (BGP). Previous studies have suggested using adaptive MRAI and reusable timers to reduce the BGP convergence time. The adaptive MRAI timers perform well under the normal load of BGP updates. However, a large number of BGP updates may flood Internet routers. We propose a new algorithm, MRAI with Flexible Load Dispersing (FLD-MRAI), which reduces the router's overhead by dispersing the load in case of a large number of BGP updates. We also examine the MRAI timers under the normal load of BGP updates. Since BGP routing policies play a significant role in preserving the Internet routing stability, we evaluate their impact on BGP convergence time and Route Flap Damping (RFD) algorithms. The proposed algorithms are evaluated using the ns-BGP network simulator.

The border gateway protocol (BGP) is the routing protocol used to maintain connectivity between autonomous systems in the Internet. Empirical measurements have shown that there can be considerable delay in BGP convergence after routing changes. One contributing factor in this delay is a BGP-specific timer used to limit the rate at which routing messages are transmitted. We use the SSFNet simulator to explore the relationship between convergence time and the configuration of this timer. For each simple network topology simulated, we observe that there is an optimal value for the rate-limiting timer that minimizes convergence time.

Border Gateway Protocol (BGP) serves as the primary routing protocol responsible for exchanging routing information between Internet Autonomous Systems (AS). Accurate BGP performance prediction is crucial for maintaining network stability and optimizing routing decisions. With the rapid evolution of the Internet, modern network architectures have become increasingly complex, exhibiting heterogeneous and highly dynamic characteristics. Networks encompass diverse devices, protocols, and inter-AS connections, making it challenging for traditional BGP performance prediction models to adapt to complex network environments. Traditional models often rely on predefined assumptions, such as static AS relationships, which prove inadequate when confronting constantly changing network topologies, fluctuating traffic patterns, and variable BGP routing decisions in realworld networks. Moreover, the heavy dependence of traditional models on specific data structures and network relationships further limits their generalization capabilities in broader applications.To address these challenges, this paper proposes a novel Deep Neural Network (DNN)-based model for predicting BGP convergence time using historical routing data from sources such as RouteViews and RIPE NCC. Our model employs comprehensive feature engineering, Principal Component Analysis (PCA) for dimensionality reduction, and Dropout regularization to effectively capture complex nonlinear relationships in BGP data. Experimental results demonstrate that the DNN model outperforms traditional methods, achieving an Area Under the Curve (AUC) value of 0.83, with accuracy trends and Receiver Operating Characteristic (ROC) curves validating its superior performance. Future research will incorporate temporal dynamics through Recurrent Neural Networks (RNN) to enhance real-time performance prediction capabilities in dynamic network environments.

The border gateway protocol (BGP) is the default inter domain routing protocol used on the internet for exchanging information between autonomous systems. Available literature suggests that BGP is vulnerable to session hijacking attacks. There are a number of proposals aimed at improving BGP security which have not been fully implemented. This paper examines a number of approaches for securing BGP through a comparative study and identifies the reasons why these proposals have not been implemented commercially. This paper analyses the architecture of internet routing and the design of BGP while focusing on the problem of BGP session hijacking attacks. Using Graphical Network Simulator 3 (GNS-3), a session hijack is demonstrated and a solution which involves the implementation of route filtering, policy-maps and route-maps on CISCO routers representing ASes is carried out. In the end, a workable industry standard framework for securing and protecting BGP sessions and border routers from exploitation with little or no modification to the existing routing infrastructure is demonstrated.

Border Gateway Protocol (BGP) is a widely used Internet routing protocol. While several security features have been introduced and implemented to prevent attacks and address routing instabilities, BGP remains vulnerable due to lack of integrity and authentication of BGP messages. BGP operations strongly depend on its security and attacks on BGP adversely influence packet routing. Given the importance of BGP security, several approaches have been developed to enhance security of BGP sessions. The Resource Public Key Infrastructure (RPKI), a specialized Public Key Infrastructure (PKI), was developed to help secure the Internet routing. It uses cryptographically verifiable statements to ensure that Autonomous Systems (ASes), the Internet resource holders, are certifiably linked to the routing information they generate thus resulting in a reliable routing origin. In this paper, we describe a testbed developed for validating route origin and present simulation results.

Border gateway protocol (BGP) version 4 is routing current Internet for more than 20 years. BGP is the only protocol that has proven its routing capability of such size network with continually growing nature. Although BGP is scalable and network layer reachability information it lacks quality of service metrics like latency. BGP routing decision algorithm uses as-path length between autonomous systems (AS) as main factor for most of its best-path calculations. Because of more affordable peering architectures as-path length is generally decreasing in worldwide internet network resulting in less efficient routes for real-time internet protocol traffic. This study proposes future internet architecture consisting of multiple AS which provide latency aware routing in software defined network (SDN). For highest reliability there are bilateral latency measurements between each pair of connected autonomous systems. Latency measurement results are stored in distributed decentralized blockchain network where each AS holds its share. Each AS hosts an SDN instance for interconnection with neighbor SDN controllers over AS border. SDN instances processes latency measurement data from blockchain network, validates data integrity and manages latency aware routing for real-time data flows.