Blockchain based Inter-domain Latency Aware Routing Proposal in Software Defined Network

For long, software-defined network (SDN) has been the new trend in the field of networking. Despite being way better than the traditional networking approach, security issues related to SDN are a major concern for technologists all over the globe. It has drawn great attention and is still a highly interesting field of study for network administrators. Among the various means suggested to overcome these security issues, working with securing Border Gateway Protocol (BGP) seems to be a feasible solution to securing SDN. BGP deals with transferring data between two autonomous systems by exchanging routing information between the systems. In this paper, we propose an efficient way to secure data transfer, through BGP, between two autonomous systems in SDN. This is achieved by encrypting data using Advanced Encryption Standard (AES) Encryption Algorithm. In order to prove its feasibility, AES data encryption algorithm is implemented on two hosts in SDN and data transfer is traced on Wireshark. Furthermore, we extend our study to conclude that SDN can be secured by encrypting data over BGP and then transferring it safely to the destination.

Border Gateway Protocol (BGP) is a path-vector routing protocol used to exchange routing and reachability information between autonomous system (AS) that offers flexibility and scalability. BGP is capable of handling scalability issues using classless inter-domain routing and is more efficient than alternatives. However, BGP related challenges have been encountered, including growing routing tables, load balancing issues, hijacking, and AS transit delays, leading to increased convergence delay. Convergence delay is the time gap between the commencement of the best-path selection process and when the router is updated. Convergence delay has become a significant issue for larger networks because frequent routing path updates can lead to network instability. Network instability causes packet loss, delayed packet delivery and occasional loss of network connectivity. The research aims to incorporate Software Defined Networking (SDN) technology with gateway operation to reduce the BGP convergence time.

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.

In traditional IP networks, border gateway protocol (BGP) serves as the dominant protocol for inter-domain routing information exchange. In a hybrid network with both traditional network domains and software-defined networking (SDN) domains, the simultaneous inter-domain routing information exchange requires collaboration among different autonomous systems (ASes). However, the rigid routing policies of the conventional BGP are sometimes inadequate to meet the demand of applications with low-latency requirements like augmented reality (AR). In this paper, we propose a Latency Reduction Software-Defined BGP (LRSD-BGP) framework to reduce the latency in inter-domain initial link setup. Furthermore, a controller-to-controller (C2C) communication module is designed to accelerate the routing link establishment procedure of inter-domain traffic by pre-allocating and installing routing paths for the AS in the next hop. LRSD-BGP is evaluated in terms of BGP convergence time and first round-trip time (RTT). Experimental results demonstrated that LRSD-BGP can outperform SD-BGP in terms of first RTT even in highly loaded cases.

Border Gateway Protocol (BGP) is the defacto inter-domain routing protocol in the Internet. It was designed without an inherent security mechanism and hence is prone to a number of vulnerabilities which can cause large scale disruption in the Internet. Route leak is one such inter-domain routing security problem which has the potential to cause wide-scale Internet service failure. Route leaks occur when Autonomous systems violate export policies while exporting routes. As BGP security has been an active research area for over a decade now, several security strategies were proposed, some of which either advocated complete replacement of the BGP or addition of new features in BGP, but they failed to achieve global acceptance. Even the most recent effort in this regard, lead by the Secure Inter-Domain Routing (SIDR) working group (WG) of IETF fails to counter all the BGP anomalies, especially route leaks. In this paper we look at the efforts in countering the policy related BGP problems and provide an analytical insights into why they are ineffective. We contend a new direction for future research in managing the broader security issues in the inter-domain routing. In that light, we propose a naive approach for countering the route leak problem by analyzing the information available at hand, such as the RIB of the router. The main purpose of this paper was to position and highlight the autonomous smart analytical approach for tackling policy related BGP security issues.

Examining the Jurisdictions of Internet Routes to Prevent Data Exfiltration

The Internet consists of rapidly increasing number of hosts interconnected by constantly evolving networks of links and routers. Interdomain routing in the Internet is coordinated by the Border Gateway Protocol (BGP). The BGP allows each autonomous system (AS) to choose its own administrative policy in selecting routes and propagating reachability information to others. These routing policies are constrained by the contractual commercial agreements between administrative domains. For example, an AS sets its policy so that it does not provide transit services between its providers. Such policies imply that AS relationships are an important aspect of the Internet structure. We propose an augmented AS graph representation that classifies AS relationships into customer-provider, peering, and sibling relationships. We classify the types of routes that can appear in BGP routing tables based on the relationships between the ASs in the path and present heuristic algorithms that infer AS relationships from BGP routing tables. The algorithms are tested on publicly available BGP routing tables. We verify our inference results with AT&T internal information on its relationship with neighboring ASs. As much as 99.1% of our inference results are confirmed by the AT&T internal information. We also verify our inferred sibling relationships with the information acquired from the WHOIS lookup service. More than half of our inferred sibling-to-sibling relationships are confirmed by the WHOIS lookup service. To the best of our knowledge, there has been no publicly available information about AS relationships and this is the first attempt in understanding and inferring AS relationships in the Internet. We show evidence that some routing table entries stem from router misconfigurations.

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.

The security of the Border Gateway Protocol (BGP), the standard routing protocol for inter-domain routing in the Internet, has been an increasingly intent focus of concern for many years. In the last few years, the IETF (Internet Engineering Task Force) has undertaken several efforts to specify security solutions for BGP. The IETF has chartered work to analyze BGP vulnerabilities, to investigate threat models for routing protocols in general, and to specify requirements for BGP security. Most recently, the IETF has begun work on securing the origination of prefix advertisements. Unauthorized origination of prefix advertisements has been the most frequent root cause of publicly noted routing incidents for the history of the Internet. Also, authorization of origination of prefix advertisements is the common basis to almost all suggested security solutions. Because the Global Information Grid (GIG) uses BGP for inter-domain routing and VPN provisioning just as the commercial Internet, the GIG is subject to the same BGP vulnerabilities. Security solutions to the vulnerabilities of BGP should be deployed and used in the GIG, in order to protect the GIG routing system internally and at interconnection points to the Internet. It is important that the GIG be aware of standards based security solutions and be involved in the development of new standards. This paper discusses the current status of BGP security standards, how they are evolving, and how the security of BGP relates to the GIG.

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.

Currently, the architecture of network device is closed. This is detrimental to the network inno vation. Software defined networking (SDN) [1] decouples the vertically coupled architecture, and reconstructs the Internet as a modular structure. The idea of SDN is widely accepted by both of the academic and industry researchers, and is considered as a promising way to re-architect the Internet. OpenFlow as a typical instance of the SDN has been deployed by many universities and research institutions all over the world. However, the research and technologies on transitioning the existing networks to SDN are not mature. So this paper takes the instance OpenFlow for example and proposes a simple and practical BGP (Border Gateway Protocol) based transition solution named BTSDN. BTSDN fully explores the characteristics of OpenFlow network, proposes to continue using the current BGP protocol, and retains the legacy BGP border routers to connect the OpenFlow network with the rest of Internet. The experiment at the end of this paper preliminary verifies the feasibility of BTSDN.

In this paper, we investigate the issues related to the use of a BGP (Border Gateway Protocol) backbone to provide connectivity between mobile nodes, with a specific focus on nodes within an airborne network domain. Research efforts have developed multiple MANET (Mobile Ad hoc Network) protocols to provide routing for mobile nodes. In an airborne network environment, however, there may not be a dense enough concentration of nodes within radio range to provide the connectivity needed for effective use of a MANET protocol. In addition, aircraft within radio range of other nodes will experience intermittent and varying quality radio signals due to banking, interference, or Doppler effects. BGP is the de facto standard in use today to provide terrestrial internetworking routing among Autonomous Systems (AS) despite well known problems. BGP configuration can be complex and has convergence issues but the BGP capability to handle large numbers of routes makes it invaluable. In addition to its use in terrestrial internetworking, BGP has been identified as the routing protocol for the Transformational Satellite Communications System (TSAT) Network. Given the BGP networks in a satellite network above and a terrestrial network below an airborne network, it is important to understand the issues of connecting via BGP for airborne nodes. This paper summarizes the results of lab experiments evaluating use of a BGP network for an alternate routing path between aircraft when there is no other connectivity within their airborne routing domain.

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.

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.

BGP (Border Gateway Protocol) is one of the core internet backbone protocols, which were designed to address the large-scale routing among the ASes (Autonomous System) in order to ensure the reachability among them. However, an attacker can inject update messages into the BGP communication from the peering BGP routers and those routing information will be propagated across the global BGP routers. This could cause disruptions in the normal routing behavior. Specially crafted BGP messages can reroute the traffic path from a source ASN to a specific destination ASN via another path and this attack is termed as AS Path Hijacking. This research work is focused on the detection of suspicious deviation in the AS path between a source and destination ASNs, by analyzing the BGP update messages that are collected by passive peering to the BGP routers. The research mainly focuses on identifying the AS Path Hijacking by quantifying: (1). How far the deviation occurred for a given AS Path and (2). How much credible is the deviated AS path. We propose a novel approach to calculate the deviation occurred by employing weighted edit distance algorithm. A probability score using n-gram frequency is used to determine credibility of the path. Both the scores are correlated together to determine whether a given AS Path is suspicious or not. The experimental results show that our approach is capable of identifying AS path hijacks with low false positives.