Interdomain Routing for Mobile Nodes

Because of its practical relevance, the Border Gateway Protocol (BGP) has been the target of a huge research effort since more than a decade. In particular, many contributions aimed at characterizing the computational complexity of BGP-related problems. In this paper, we answer computational complexity questions by unveiling a fundamental mapping between BGP configurations and logic circuits. Namely, we describe simple networks containing routers with elementary BGP configurations that simulate logic gates, clocks, and flip-flops, and we show how to interconnect them to simulate arbitrary logic circuits. We then investigate the implications of such a mapping on the feasibility of solving BGP fundamental problems, and prove that, under realistic assumptions, BGP has the same computing power as a Turing Machine. We also investigate the impact of restrictions on the expressiveness of BGP policies and route propagation (e.g., route propagation rules in iBGP and Local Transit Policies in eBGP) and the impact of different message timing models. Finally, we show that the mapping is not limited to BGP and can be applied to generic routing protocols that use several metrics.

Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the Mobile Ad Hoc Network (MANET). MANET is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility. There are two types of MANET, homogeneous and heterogeneous MANET. An architecture has been designed in previous work to model these two types of MANET. Three scenarios have been defined from this architecture: scenario I (communication entirely within MANET, homogeneous MANET), scenario II (communication between MANET and wireless LAN, heterogeneous MANET) and scenario III (communication between MANET with wireless LAN and wired LAN, heterogeneous MANET). MANET has its own routing protocols which can compromised with frequent route exchange, dynamic topology, bandwidth constraint and multi-hop routing. Ad hoc On Demand Distance Vector (AODV) is one of the routing protocols in MANET. The aim of this research is to assess the effects of different packet size with the implementation of AODV routing protocols in homogeneous and heterogeneous MANET through the simulation method. The three scenarios above have been developed in the OMNeT++ network simulator. The results achieved from the test have been evaluated using the metrics assigned, throughput and packet delivery ratio (PDR). The tests show that the increase of throughput and PDR performance was parallel with the increase of packet size. From the test also, we can conclude that the performance due to the packet size effect in homogeneous MANET is better than in heterogeneous MANET.

Examining the Jurisdictions of Internet Routes to Prevent Data Exfiltration

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

Mobile Ad Hoc Network (MANET) is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility. Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the heterogeneous MANET. Compared to homogeneous MANET, heterogeneous MANET is more open to other types of network for example wireless LAN, cellular network and fixed network. In MANET, the concern is more to configuration and one of the important elements in configuration is routing. Ad hoc On Demand Distance Vector (AODV) is one of the routing protocols in MANET which can compromise with MANET characteristics. The aim of this research is to assess the performance of AODV in different mobility speed for homogeneous MANET and heterogeneous MANET through the simulation method. The simulation scenarios derived from the HetMAN architecture (as been discussed in previous work) have been developed in the OMNeT++ network simulator. The results achieved from the test have been evaluated using the metrics assigned; throughput and packet delivery ratio (PDR). The tests show that, as the speed increase, the throughput and PDR decrease for both homogeneous and heterogeneous MANET. From the test also, we can conclude that the performance in homogeneous MANET is better than in heterogeneous MANET.

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

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.

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.

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 (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.

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.

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.

While efforts have been made recently to evaluate the performance of multicasting protocols in mobile ad hoc networks (MANET) and to evaluate the capacity of ad hoc networks, very little is understood or known about the traffic characteristics of mobile ad hoc networks and its effect on the performance of the existing multicasting protocols. In this paper, traffic models for multicast protocols in MANET are outlined. A literature survey for multicast protocols in MANET is conducted. Classification for most MANET multicast protocols is presented. A research to evaluate the performance of the existing multicast protocols in MANET using self-similarity traffic model is proposed & justified

Recent advances in wireless networking technologies have made it possible to construct a mobile ad hoc network (MANET) which can be applied in infrastructureless situations. However, due to their inherent characteristics, they are much more vulnerable to malicious attacks than a conventional wired network. In MANET, routing plays an important role in providing connectivity for mobile nodes who are not within the same radio range. Existing routing protocols in MANET assume a trusted and reliable environment. However, in hostile environment mobile nodes are susceptible to various types of routing attacks. This paper identifies a new routing attack, called node isolation attack, against optimized link state routing (OLSR) protocol, one of the four standard routing protocols for MANETs. We analyze in detail and demonstrate the impact of this attack in order to show the necessity for a countermeasure to guard against the attack. As a first step to defend against the attack, we present a simple technique to detect the attack and identify the source of the attack

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.