BGP Routing Research Articles

BGP Design for the Separation of the Local Big Data Traffic in Data Center

As the service for big data increases, the number of analysis servers for big data grows rapidly. For example, the scale of analysis servers for the big data from Large Hadron Collier in Swiss CERN is generally beyond tens of thousands of servers. Therefore, tasks for the selection of the appropriate local routing protocol and the efficient configuration of the routing protocol for those servers are getting more important portion in the local network administration in big data center. In this paper, we introduce BGP as a routing protocol for the local network of big data center even though it is developed for WAN. The concept we introduced in this paper for the separation of big data traffic in local data center network is created based on the concept of the partition of the conference room in convention center. The main conference room can be partitioned by multiple small meeting rooms according to users’ requests. Each small room can be protected from the noise of the neighbor meeting rooms by partition walls. In the same way, the huge number of servers can be grouped into various server farms and then each of server farms can be identified Autonomous System number that is used for the BGP routing domain for network administrator. Using the techniques of AS numbering we can control the big data traffic more efficiently than ever in data center. We introduced new application method of AS number for a service to recognize certain traffic. Therefore, we can separate and control big data traffic more in detail. We tried to prove that BGP is superior to IGP and overlay networking with respect to the routing control in big data center.

Analysis of BGP Multihomed Link Utilization Effect on Internet Services (http, ftp and email)

internet services and network performance represented in end-to-end delay and jitter are studied with respect to different link utilization. Internet users will access the internet services through simulated internet network contains number of BGP routers and Multihomed links. Both link utilization effect on the different internet services and the inability of BGP to automatically redistribute the traffic over available Multihomed Links will be highlighted.This paper also introduce a simple network design which is very close to the real internet environment and covers internet users section , ISPs section and enterprise section which represents offered internet services hoping that this model give a hand in the BGP and internet services researches. KeywordsMultihomed; HTTP; FTP; Email; OPNET.

See How ISPs Care

The Resource Public Key Infrastructure (RPKI) allows BGP routers to verify the origin AS of an IP prefix. In this demo, we present a software extension which performs prefix origin validation in the web browser of end users. The browser extension shows the RPKI validation outcome of the web server infrastructure for the requested web domain. It follows the common plug-in concepts and does not require special modifications of the browser software. It operates on live data and helps end users as well as operators to gain better insight into the Internet security landscape.

하둡과 하이브를 이용한 BGP 아카이브 데이터의 포렌직 분석 툴

A large volume of continuously growing BGP data files can raise two technical challenges regarding scalability and manageability. Due to the recent development of the open-source distributed computing infrastructure, Hadoop, it becomes feasible to handle a large amount of data in a scalable manner. In this paper, we present a new Hadoop-based BGP tool (BGPdoop) that provides the scale-out performance as well as the extensible and agile analysis capability. In particular, BGPdoop realizes a query-based BGP record exploration function using Hive on the partitioned BGP data structure, which enables flexible and versatile analytics of BGP archive files. From the experiments for the scalability with a Hadoop cluster of 20 nodes, we demonstrate that BGPdoop achieves 5 times higher performance and the user-defined analysis capability by expressing diverse BGP routing analytics in Hive queries.

English

PASTRY andOverlie routing is a very attractive scheme that allows improving certain properties of the routing (such as delay or TCP throughput) without the need to change the standards of the current underlying routing. PASTRY is an implementation of a Distributed Hash Table(DHT) algorithm for P2P routing overlay using the PASTRY implementation the silent features to achieve the reliability,fully centralized and high fault tolerant . However, deploying overlie routing requires the placement and maintenance of overlie infrastructure. This gives rise to the optimization,reliability,high fault tolerant and highly distributed problem which we overcome in this project using . PASTRY distributed algorithm and non-trivial approximation algorithm. The current BGP routing in the Internet , where from a single source to all autonomous systems (ASs), that a small number of less than 100 relay servers is sufficient to enable routing over shortest paths reducing the average path length.

On iBGP Routing Policies

Internet service providers (ISPs) run the internal Border Gateway Protocol (iBGP) to distribute interdomain routing information among their BGP routers. Previous research consistently assumed that iBGP is always configured as a mere dispatcher of interdomain routes. However, router configuration languages offer operators the flexibility of fine-tuning iBGP. In this paper, we study the impact of deploying routing policies in iBGP. First, we devise a provably correct inference technique to pinpoint iBGP policies from public BGP data. We show that the majority of large transit providers and many small transit providers do apply policies in iBGP. Then, we discuss how iBGP policies can help achieve traffic engineering and routing objectives. We prove that, unfortunately, the presence of iBGP policies exacerbates the iBGP convergence problem and invalidates fundamental assumptions for previous results, affecting their applicability. Hence, we propose provably correct configuration guidelines to achieve traffic engineering goals with iBGP policies, without sacrificing BGP convergence guarantees. Finally, for the cases in which our guidelines are not applicable, we propose a novel technique to verify the correctness of an iBGP configuration with iBGP policies. We implement a prototype tool and show the feasibility of offline analyses of arbitrary policies on both real-world and in vitro configurations.

Source-Directed Path Diversity in the Interdomain Routing

The Internet has abundant path redundancy, especially in the interdomain routing. However, current routing system can not exploit the Internet path diversity and utilize the disjoint end-to-end paths efficiently. The unawareness of sources to the path selection and the best paths advertisement mechanism in the interdomain routing make it difficult to use disjoint end-to-end paths. In this paper, we present the Source-Directed Path Diversity (SDPD), leveraging which sources can specify the alternate paths to forward the traffic besides the default path. In SDPD, the packets carry the Source-Directed Tag (SDT) in the packet headers to hint the BGP routers the preference of the sources on the path selection, while the BGP routers forward the packets independently based on the sources' indication. Moreover, we propose the multipath advertisement of the BGP route reflectors in SDPD to reduce the filtration of the redundant paths in the interdomain routing. We evaluate the SDPD through simulations over a synthetic Internet-like topology. The simulation results show that the SDPD can exploit alternate paths with low similarity and stretch efficiently

A Multi-Index Hybrid Trie for Lookup and Updates

\begin{abstract} High-performance routers require high-speed IP address lookup to achieve wire-speed packet forwarding. This study proposes a new data structure, the Multi-Index Hybrid Trie (MIHT), for dynamic router table designs. This data structure was constructed by combining the useful characteristics of the ${\rm B}^{+}$ tree and priority trie. IP lookup operations can be performed efficiently by associating each prefix with a key value in the MIHT. Furthermore, because the required tree height and number of prefixes were reduced, dynamic router table operations were performed efficiently using the MIHT. To reduce the memory requirement, each prefix stored its corresponding suffix in a node of the MIHT, rather than storing a full prefix. Experiments using IPv4 and IPv6 routing databases indicated that the proposed data structure has efficient memory usage and performs well for lookup, insertion, and deletion operations. This study reports the results of the experiments performed to compare the proposed data structure with other structures using the benchmark IPv4 and IPv6 prefix databases AS1221, AS4637, AS6447, AS65000, AS1221*, and AS6447* with 407,067, 219,581, 417,995, 406,973 , 12,155, and 12,278 prefixes, respectively, where AS1221* and AS6447* are IPv6 BGP routing tables. \end{abstract} \begin{IEEEkeywords} Classless inter domain routing (CIDR), dynamic router tables, IP address lookup, longest matching prefix, multi-index hybrid trie. \end{IEEEkeywords}

Evaluating the effect of centralization on routing convergence on a hybrid BGP-SDN emulation framework

No abstract available.

Study on Migration from IPv4 to IPv6 of a Large Scale Network

This work mainly addresses the design a large scale network using dual stack mechanisms. We concentrated on the most imperative theoretical notions of the IPv6 protocol, such as IP addressing, address allocation, routing with the OSPF and BGP protocols and routing protocols performance in dual stack network using GNS3 simulations and Wireshark Network protocol analyzer. It is evaluate a real large-scale network environment utilizing accessible end-to-end estimation methods that focuses on a large-scale IPv4 and IPv6 backbone and made performance the IPv4 and IPv6 network. In this paper, we compiled IPv6 address planning in a large scale network, performance metrics of each network in terms of time sequence graph, round trip time, TCP throughput, TCP connection time and the number of TCP connections per second that a client can establish with a remote server. It is found that, a minor degradation in the throughput of the TCP, TCP response time and a lower packet loss rate are arise in a real large scale dual stack network. We also showed a concise case study on relationship between RTT and network topology, which is cooperative to develop the performance of IPv6 networks. The result shows the proposed scheme for network migration from IPv4 to IPv6 is more reliable than other existing schemes.

Cost-Effective Resource Allocation of Overlay Routing Relay Nodes

Overlay routing is a very attractive scheme that allows improving certain properties of the routing (such as delay or TCP throughput) without the need to change the standards of the current underlying routing. However, deploying overlay routing requires the placement and maintenance of overlay infrastructure. This gives rise to the following optimization problem: Find a minimal set of overlay nodes such that the required routing properties are satisfied. In this paper, we rigorously study this optimization problem. We show that it is NP-hard and derive a nontrivial approximation algorithm for it, where the approximation ratio depends on specific properties of the problem at hand. We examine the practical aspects of the scheme by evaluating the gain one can get over several real scenarios. The first one is BGP routing, and we show, using up-to-date data reflecting the current BGP routing policy in the Internet, that a relative small number of less than 100 relay servers is sufficient to enable routing over shortest paths from a single source to all autonomous systems (ASs), reducing the average path length of inflated paths by 40%. We also demonstrate that the scheme is very useful for TCP performance improvement (results in an almost optimal placement of overlay nodes) and for Voice-over-IP (VoIP) applications where a small number of overlay nodes can significantly reduce the maximal peer-to-peer delay.

A Scalable Destination-Oriented MulticastProtocol with Incremental Deployability

In this paper, we develop a scalable destination-oriented multicast (DOM) protocol for computer networks where the routers have enhanced intelligence to process packets. The basic idea of DOM is that each multicast data packet carries explicit destinations information, instead of an implicit group address, to facilitate the data delivery. Based on such destinations information, each router can compute necessary multicast copies and next-hop interfaces. A fundamental issue in DOM is to constrain the bandwidth overhead due to explicit addressing, which is tackled with a Bloom-filter based design. Our design incorporates the reverse path forwarding (RPF) concept and the BGP routing information, so that DOM can work efficiently in practical networking scenarios especially with asymmetric inter-domain routing. A critical issue in Bloom-filter based design is the issue of forwarding loop due to false positives. We propose an accurate tree branch pruning scheme, which equips the DOM the capability to completely and efficiently remove the false-positive forwarding loop. Furthermore, we study how the DOM can be deployed in an incremental manner over a network, in which only a small fraction of the routers have DOM-aware intelligence while others are legacy routers. We present extensive simulation results over a practical topology to demonstrate the performance of DOM, with comparison to the traditional IP multicast and the free riding multicast (FRM) protocols.

On the Migration of a Large Scale Network from IPv4 to IPv6 Environment

This work mainly addresses the design a large scale network using dual stack mechanisms. We focused on the most important theoretical concepts of the IPv6 protocol, such as addressing, address allocation, routing with the OSPF and BGP protocols and routing protocols performance in dual stack network using GNS3 and Wireshark simulators. we have a tendency to measure a perfect model and a true large-scale network atmosphere victimization out there end-to-end activity techniques that focuses on a large-scale IPv4 and IPv6 backbone and created performance the IPv4 and IPv6 network. In this paper, we compiled IPv6 address planning in large scale network, performance statistics of each network in terms of TCP throughput, delay jitters, packet loss rate, and round trip time. It is found that, a minor degradation within the throughput of the TCP, delay jitter, a lower packet loss rate, and a rather longer round trip time are occurred in a real large scale dual stack network.

Study on BGP Security

BGP是互联网的核心路由协议,互联网的域间选路通过BGP路由信息交换来完成.BGP协议设计存在重大的安全漏洞,容易导致前缀劫持、路由泄漏以及针对互联网的拒绝服务攻击.分析BGP路由传播及路由策略等主要特性,揭示BGP协议的设计缺陷;探讨BGP面临的主要安全威胁,并对路由泄漏进行建模分析和界定特征;概括现有的BGP安全防御机制并指出其不足,进而对各种增强BGP安全的技术和方案进行合理分类和详尽研究,比较其利弊、剖析其优劣;最后,对BGP安全的未来研究趋势进行展望.;BGP is a core Internet routing protocol. The Internet inter-domain routing relies on the exchange of BGP routing information. BGP has significant vulnerabilities, which have been found to cause problems such as prefix hijacking, route leak and Internet-targeted denial of service attack. First, by analyzing BGP route propagation and BGP routing policies, the fundamental flaw in the design of the protocol is revealed. The paper then discusses possible threats to BGP and presents a route leak model, which contributes to the description of its characteristics. Second, the existing defense mechanisms for BGP security are generalized, and their shortcomings are exposed. The paper then classifies various BGP security-enhancing technologies and studies them in detail to explore their advantages and disadvantages. Finally, the research trends of BGP security are discussed in this paper.

Improving BGP Protocol to Advertise Multiple Routes for the Same Destination Prefix

An Internet autonomous system (AS) uses BGP policies in order to meet its local objectives (e.g. optimal routing within AS) and peering contracts with neighboring ASes (e.g. advertising some specific routes to a neighbor, forwarding traffic over specific paths, etc.) In this paper we propose an enhancement of BGP route selection and advertisement processes, and demonstrate how the enhanced BGP can be used to flexibly implement diverse policies, regardless of the network topology, that were not feasible before.

Improving the reliability of inter-AS economic inferences through a hygiene phase on BGP data

Over the last few years researchers have tried to shed light on the economic features that drive the inter-domain routing of the Internet, by inferring economic inter-AS relationships from raw BGP data collected by research projects such as BGPmon, PCH, RIS and RouteViews. Although this kind of data contains spurious entries mostly caused by router misconfigurations on BGP border routers and showing up during BGP path exploration, none of the methodologies provide an adequate data hygiene phase, thus affecting the accuracy of the inferences drawn. In this paper we outline a new methodology that can purge a large amount of spurious routes from BGP raw data by leveraging on robust statistical concepts rather than on debatable thresholds. To quantify the performance of our methodology we apply an enhanced version of an existing economic tagging algorithm on non-cleaned and cleaned data respectively. We found that 42.01% of different AS paths advertised to BGP route collectors in July 2013 appear only in spurious routes and that, in the absence of an appropriate data hygiene phase, they can affect the accuracy of the economic inferences regarding about 8% of connections found in BGP raw data.

ES-TMP: Inter-Domain Egress Selection Based on Traffic Migration Prediction

Hot-potato routing is commonly used to break tie among multiple equally-good exit points associating with inter-domain BGP routes. However, hot-potato routing only takes the network control plane into consideration, where it provides the routers the possibility of enabling early exit of traffic using barely protocol-related information of IGP distance. In this paper, we argue that egress selection of inter-domain routing should pay more attention to traffic forwarding, because the large traffic migration caused by egress change, although not quite often, can degrade the network performance or even make the network crash. We propose Egress Selection based on Traffic Migration Prediction (ES-TMP). We use traffic demand to predict the traffic migration, which is used as important criteria for egress selection. If the volume of traffic migration is large, ES-TMP keeps the egress unchanged. Otherwise, the small traffic migration enables the routers use the closest egress without apparent influence on network performance. ES-TMP can either be implemented with standard BGP protocol or by dedicated servers to perform global routing optimization.

A comparative study on IP prefixes and their origin ases in BGP and the IRR

The IRR is a set of globally distributed databases with which ASes can register their routing and address-related information. It is often believed that the quality of the IRR data is not reliable since there are few economic incentives for the ASes to register and update their routing information timely. To validate these negative beliefs, we carry out a comprehensive analysis of (IP prefix, its origin AS) pairs in BGP against the corresponding information registered with the IRR, and vice versa. Considering the BGP and IRR practices, we propose a methodology to match the (IP prefix, origin AS) pairs between the IRR and BGP. We observe that the practice of registering IP prefi xes and origin ASes with the IRR is prevalent. However, the quality of the IRR data can vary substantially depending on routing registries, regional Internet registries (to which ASes belong), and AS types. We argue that the IRR can help improve the security level of BGP routing by making BGP routers selectively rely on the corresponding IRR data considering these observations.

Optimization Techniques of Traceroute Measurement Based on BGP Routing Table

Abstract：With the complexity of network structure and the network expanded rapidly, AS-level network macroscopic topology measurements will be more and more important in the network studies. If we can catch a network macroscopic topology which is more close to the actual world, it will help researchers explore the inherent laws of network structure and the relationships between network structure and political, and economic in the real world, it also useful for network providers to prediction of network problems and improve the network environment more accurate and timely. Our paper puts forward method that combined BGP routing table with traceroute measurement and use the given BGP data to predict the result of traceroute measure, and change the sequence of measurement target, so as to improve the accuracy and efficiency of the traceroute measurements result.

Visual discovery of the correlation between BGP routing and round-trip delay active measurements

Inter-domain routing data and Internet active probing measurements are two types of information commonly available in huge datasets and subject to extensive, focused analysis. However, the study of the correlation between these two complementary types of information still remains one of the most challenging problems in today's research in networking. In this paper we describe a metaphor for the visualization of the interplay between the routing information exchanged via BGP and the round-trip delay measurements collected by several geolocated probes. We implemented a prototype based on the above metaphor. Our prototype highlights both the Autonomous System topology and the latency associated with each AS-path over time. Further, it shows how probes are partitioned into clusters associated with each border gateway, based on observed traffic patterns. The resulting visualization allows the user to explore the dynamics of the correlation between the two types of information.