Understanding Edge Connectivity in the Internet through Core Decomposition

Today the Internet is very large network that one routing protocol cannot handle the task update the routing table of all routers. This make the Internet divided into Autonomous System (AS) is consist of many networks and many routers under the authority of a single administration. Routing inside AS is called Interior Routing Protocol. Routing between AS is called Exterior Routing Protocol. The Border Gateway Protocol version 4 (BGP4) is the Exterior Routing Protocol used in the Internet today. In this paper, five AS’s interconnection practising use a virtualized environment, that is Oracle VM Virtual Box. Ten routers uses Mikrotik RouterOS 5.25 on Virtual Box to interconnect five AS’s using the BGP, OSPF and RIP. Keywords: Exterior Routing Protocol, Interior Routing Protocol, BGP4, Oracle VM VirtualBox, Mikrotik RouterOS

The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) . They all rely on the Internet Protocol (IP) for transport of packets across the network. And most of them use shortest path routing protocols , such as OSPF or IS-IS, to control the routing of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing configuration of an AS. It turns out that this task leads to very difficult mathematical optimization problems. In this chapter, we discuss and describe exact integer programming models and solution approaches as well as practically efficient smart heuristics for such shortest path routing problems .Keywordstelecommunication networksshortest path routingthe InternetOSPFECMPinteger linear programmingheuristics

Open Shortest Path First (OSPF) is one of the most widely deployed interior gateway routing protocols on the Internet. It allows routers to calculate their routing tables within a cluster of networks - an autonomous system (AS). An attacker that leverages OSPF to attack an AS may have a catastrophic effect on it. A single malicious router within an AS can poison the routing tables of all other routers of that AS by sending false routing messages, thereby subverting the entire routing process. Finding attacks on the routing protocol is a demanding task as the exact nature of the attack may be unknown. In this work we present a machine learning-based attack detection scheme that is based on topology-agnostic features. The topology-agnostic features allow the trained algorithm to find attacks on a broad range of topologies, as well as networks with dynamic topologies. We validate the algorithm both on synthetic AS topologies and on real-world ISP topology and traffic. We show that the presented algorithm achieves high detection accuracy within a very short detection time, while false error rate remains low.

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.

Data is critical for scientific research and engineering systems. However, data collection procedures are often subject to high cost or heavy loss rate. It is challenging to accurately estimate missing or unobserved data points through the available ones. To cope with this challenge, data interpolation methods have been utilized to approximate the missing data with lower price. In this thesis, we study three specific problems on missing data interpolation in computer networking. They are 1) Autonomous System (AS) level path inference problem, 2) environment reconstruction problem in Wireless Sensor Networks (WSNs) and 3) rating of network paths inference problem. For the first problem, we bring a new angle to the AS path inference by exploiting the metrical tree-likeness or the low hyperbolicity of the Internet, part of the complex network properties of the Internet. We show that such property can generate a new constraint that narrows down the searching space of possible AS paths to a much smaller size. Based on this observation, we propose two new algorithms, namely HyperPath and Valley-free HyperPath. With intensive evaluations on AS paths from real-world BGP Routing Information Bases, we show that the proposed algorithms can achieve better performance. We demonstrate that our algorithms can significantly reduce inter-AS traffic for P2P applications with an improved AS path prediction accuracy. For the second problem, we propose a new approach, namely Probabilistic Model Enhanced Spatio-Temporal Compressive Sensing (PMEST-CS), to boost the performance of CS-based methods for environment reconstruction in WSNs. During algorithm design, we consider two new perspectives, which are exploiting the sparsity in spatio-temporal difference in environment and using probabilistic model and inference to enrich the available dataset. Experimental results utilizing the two real-world datasets show that significant performance gains, in terms of reconstruction quality, can be obtained in comparison with the state of the art CS-based methods. For the third problem, we investigate the rating of network paths, which is not only informative but also cheap to obtain. We firstly address the scalable acquisition of path ratings by statistical inference. By observing similarities to recommender systems, we examine the applicability of solutions to recommender system and show that our inference problem can be solved by a class of matrix factorization techniques. Then, we investigate the usability of rating-based network measurement and inference in applications. A case study is performed on whether locality awareness can be achieved for overlay networks of Pastry and BitTorrent using inferred ratings. We show that such coarse-grained knowledge can improve the performance of peer selection and that finer granularities do not always lead to larger improvements.

Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain routing system enables each AS to express policy using rankings that determine how each router inthe AS chooses among different routes to a destination, and filters that determine which routes are hidden from each neighboring AS. Because the Internet is composed of many independent, competing networks, the interdomain routing system should provide autonomy, allowing network operators to set their rankings independently, and to have no constraints on allowed filters. This paper studies routing protocol stability under these conditions. We first demonstrate that certain rankings that are commonly used in practice may not ensure routing stability. We then prove that, when providers can set rankings and filters autonomously, guaranteeing that the routing system will converge to a stable path assignment essentially requires ASes to rank routes based on AS-path lengths. We discuss the implications of these results for the future of interdomain routing.

Autonomous systems (AS) in the Internet use different protocols for internal and external routing. BGP is the only external protocol. It allows ASes to define their own routing policy independently. Many papers cited in reference deal with a divergence behavior due to this flexibility. In fact, when routing policies are not conflicting, BGP is self-stabilising, which means that whatever the network configuration, BGP converges to a stable solution. Unfortunately, as experienced on the Internet, AS routing policies may be uncoherent, thus generating oscillations. In this paper, we propose a distributed dynamic method for detecting and solving oscillations of BGP. It respects private policy choices and requires only a few low level constraints in order to converge to a stable solution. Essentially, a router has to maintain only local path stateful information to detect instabilities. In this case, it generates and launches a token linked to a route. Each router makes the decision to forward or not the token according to local data and local policy. If the originating router receives back the token, then it marks the route as barred. Nevertheless, routes may furtherly be unmarked. Finally, we express and define what coherence between routing policies means.

Routing protocol based on Floyd-Warshall algorithm which allows maximization of throughput is proposed. The metric function in the proposed routing protocol is throughput including not only send packets but also retransmission packets in order for improving effectiveness and efficiency of the network in concern. Through simulation studies, it is found that the proposed routing protocol is superior to the conventional Open Shortest Path First: OSPF based on Dijkstra algorithm for shortest path determination from the point of view of maximizing throughput. A routing protocol for Virtual Private Network (VPN) in Autonomous System (AS) based on maximizing throughput is proposed. Through a comparison between the proposed protocol and the existing protocols, OSPF (Widely used), it is also found that the required time for transmission of packets from one node to another node of the proposed protocol is 56.54% less than that of the OSPF protocol.

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.

Despite years of research, the Internet still lacks a routing protocol with guaranteed termination. As is well-known, decentralization of routing decisions among the Autonomous Systems (ASes) that comprise the Internet may result in permanent oscillations of the state of its routing protocol — the Border Gateway Protocol (BGP). Some permanent oscillations are made from routing loops — the propagation of routing messages around the cycles of a network — that come back time and again. We discovered that the routing loop detection capability of BGP can be sharpened to predict which routing loops potentially recur and that the import policies can be adjusted to prevent the recurrence. The resulting protocol, named Self-Stable BGP (SS-BGP), is more stable than BGP. For the broad and common class of isotone routing policies, all permament oscillations are made from recurrent routing loops. For this class of routing policies, SS-BGP terminates. Our simulations with realistic Internet topologies and realistic variations of the Gao-Rexford (GR) inter-AS routing policies show that SS-BGP arrives at stable states at the expense of alterations in the import policies of only a handful of ASes.

OSPF (Open Shortest Path First) and EIGRP (Enhanced Interior Gateway Protocol) are routing protocol which is a member of IGP (Interior Gateway Protocol). OSPF and EIGRP will distribute routing information between routers in the same autonomous system. This research will find how routing protocol works and compare those dynamic routing protocols in IPv4 and IPv6 network. This research will simulate some network topology and shows that EIGRP are much better than OSPF in many different topology.

Mobile Ad Hoc network (MANET) is a collection of smart mobile nodes, which form a dynamic and autonomous system. These nodes communicate wirelessly in a self-organized, self-configured and self-administered manner. Routing protocol is the main building block in route establishment and traffic delivery, which must be accomplished anywhere and anytime, between a pair of source and destination. Therefore, research interest in MANETs has been growing, and particularly the design of MANET routing protocols has gained a lot of interest. Furthermore, constantly changing network topology, limited bandwidth and energy issues make the task of routing in MANETs a challenging one. In this paper we provide the taxonomy of routing protocols for MANETs, which constitute the main key behind the design of routing protocols process.

New protocols for Internet inter-domain routing struggle to get widely adopted. Because the Internet consists of more than 50,000 autonomous systems (ASes), deployment of a new routing protocol has to be incremental. In this work, we study such incremental deployment. We first formulate the routing problem in regard to a metric of routing cost. Then, the paper proposes and rigorously defines a statistical notion of protocol ignorance that quantifies the inability of a routing protocol to accurately determine routing prices with respect to the metric of interest. The proposed protocol-ignorance model of a routing protocol is fairly generic and can be applied to routing in both inter-domain and intra-domain settings, as well as to transportation and other types of networks. Our model of protocol deployment makes our study specific to Internet inter-domain routing. Through a combination of mathematical analysis and simulation, we demonstrate that the benefits from adopting a new inter-domain protocol accumulate smoothly during its incremental deployment. In particular, the simulation shows that decreasing the routing price by 25% requires between 43% and 53% of all nodes to adopt the new protocol. Our findings elucidate the deployment struggle of new inter-domain routing protocols and indicate that wide deployment of such a protocol necessitates involving a large number of relevant ASes into a coordinated effort to adopt the new protocol.

Detection and Mitigation of Border Gateway Protocol Spoofing Using Hybrid Bat Optimization Algorithm and Cryptography

With regard to the research on MANET mobile model and routing protocol issues, according to the behaviors of community mobile nodes, a community wireless mobile model based on AOC. Autonomous system was established by making use of AOC-by-prototyping combining with trial-and-Error process. This paper does simulation experiment through NS-2 simulation platform, showing that in this model DSR and AODV routing protocols are relatively stable in the aspect of routing overhead; however in the window size DSR routing protocol is the best.