CAIR: Using Formal Languages to Study Routing, Leaking, and Interception in BGP

The Internet routing protocol BGP expresses topological reachability and policy-based decisions simultaneously in path vectors. A complete view on the Internet backbone routing is given by the collection of all valid routes, which is infeasible to obtain due to information hiding of BGP, the lack of omnipresent collection points, and data complexity. Commonly, graph-based data models are used to represent the Internet topology from a given set of BGP routing tables but fall short of explaining policy contexts. As a consequence, routing anomalies such as route leaks and interception attacks cannot be explained with graphs. In this paper, we use formal languages to represent the global routing system in a rigorous model. Our CAIR framework translates BGP announcements into a finite route language that allows for the incremental construction of minimal route automata. CAIR preserves route diversity, is highly efficient, and well-suited to monitor BGP path changes in real-time. We formally derive implementable search patterns for route leaks and interception attacks. In contrast to the state-of-the-art, we can detect these incidents. In practical experiments, we analyze public BGP data over the last seven years

Delay Tolerant Networking over the Metropolitan Public Transportation

We discuss MDTN: a delay tolerant application platform built on top of the Public Transportation System (PTS) and able to provide service access while exploiting opportunistic connectivity. Our solution adopts a carrier-based approach where buses act as data collectors for user requests requiring Internet access. Simulations based on real maps and PTS routes with state-of-the-art routing protocols demonstrate that MDTN represents a viable solution for elastic nonreal-time service delivery. Nevertheless, performance indexes of the considered routing policies show that there is no golden rule for optimal performance and a tailored routing strategy is required for each specific case

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol (Technical Report)

We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a space of concise dimensionality, which enables greedy routing based only on local knowledge. PIE is a general routing scheme, meaning that it works on any graph. We focus however on the Internet, where routing scalability is an urgent concern. We show analytically and by using simulation that the scheme scales extremely well on Internet-like graphs. In addition, its geometric nature allows it to react efficiently to topological changes or failures by finding new paths in the network at no cost, yielding better delivery ratios than standard algorithms. The proposed routing scheme needs an amount of memory polylogarithmic in the size of the network and requires only local communication between the nodes. Although each node constructs its coordinates and routes packets locally, the path stretch remains extremely low, even lower than for centralized or less scalable state-of-the-art algorithms: PIE always finds short paths and often enough finds the shortest paths.Comment: This work has been previously published in IEEE ICNP'11. The present document contains an additional optional mechanism, presented in Section III-D, to further improve performance by using route asymmetry. It also contains new simulation result

Hierarchical routing protocols for wireless sensor network: a compressive survey

Wireless Sensor Networks (WSNs) are one of the key enabling technologies for the Internet of Things (IoT). WSNs play a major role in data communications in applications such as home, health care, environmental monitoring, smart grids, and transportation. WSNs are used in IoT applications and should be secured and energy efficient in order to provide highly reliable data communications. Because of the constraints of energy, memory and computational power of the WSN nodes, clustering algorithms are considered as energy efficient approaches for resource-constrained WSNs. In this paper, we present a survey of the state-of-the-art routing techniques in WSNs. We first present the most relevant previous work in routing protocols surveys then highlight our contribution. Next, we outline the background, robustness criteria, and constraints of WSNs. This is followed by a survey of different WSN routing techniques. Routing techniques are generally classified as flat, hierarchical, and location-based routing. This survey focuses on the deep analysis of WSN hierarchical routing protocols. We further classify hierarchical protocols based on their routing techniques. We carefully choose the most relevant state-of-the-art protocols in order to compare and highlight the advantages, disadvantage and performance issues of each routing technique. Finally, we conclude this survey by presenting a comprehensive survey of the recent improvements of Low-Energy Adaptive Clustering Hierarchy (LEACH) routing protocols and a comparison of the different versions presented in the literature

Scalable Downward Routing for Wireless Sensor Networks and Internet of Things Actuation

We present the opportunistic Source Routing (OSR), a scalable and reliable downward routing protocol for large-scale and heterogeneous wireless sensor networks (WSNs) and Internet of Things IoT. We devise a novel adaptive Bloom filter mechanism to efficiently encode the downward source route in OSR, which significantly reduces the length of the source route field in the packet header. Moreover, each node in the network stores only the set of its direct children. Thus, OSR is scalable to very large-size WSN/IoT deployments. OSR introduces opportunistic routing into traditional source routing based on the parent set of a node's upward routing in data collection, significantly addressing the drastic link dynamics in low-power and lossy networks (LLNs). Our evaluation of OSR via both simulations and real-world testbed experiments demonstrates its merits in comparison with the state-of-the-art protocols

Design issues in quality of service routing

The range of applications and services which can be successfully deployed in packet-switched networks such as the Internet is limited when the network does nor provide Quality of Service (QoS). This is the typical situation in today's Internet. A key aspect in providing QoS support is the requirement for an optimised and intelligent mapping of customer traffic flows onto a physical network topology. The problem of selecting such paths is the task of QoS routing QoS routing algorithms are intrinsically complex and need careful study before being implemented in real networks. Our aim is to address some of the challenges present m the deployment of QoS routing methods. This thesis considers a number of practical limitations of existing QoS routing algorithms and presents solutions to the problems identified. Many QoS routing algorithms are inherently unstable and induce traffic fluctuations in the network. We describe two new routing algorithms which address this problem The first method - ALCFRA (Adaptive Link Cost Function Routing Algorithm) - can be used in networks with sparse connectivity, while the second algorithm - CAR (Connectivity Aware Routing) - is designed to work well in other network topologies. We also describe how to ensure co-operative interaction of the routing algorithms in multiple domains when hierarchial routing is used and also present a solution to the problems of how to provide QoS support m a network where not all nodes are QoS-aware. Our solutions are supported by extensive simulations over a wide range of network topologies and their performance is compared to existing algorithms. It is shown that our solutions advance the state of the art in QoS routing and facilitate the deployment of QoS support in tomorrow's Internet

Quality of service aware ant colony optimization routing algorithm

The demand for Internet connectivity has grown exponentially in the past few years. Moreover, the advent of new services such as Voice over IP (VoIP), Video on Demand (VOD) and Videoconferencing applications have caused a sever increase in traffic, which makes it extremely hard to ensure an acceptable level of quality. This is mainly attributed to current routing strategies, such as Link State (LS) and Distance Vector (DV), which are not optimal in terms of Quality of Service (QoS). This paper presents a QoS-Aware routing strategy based on the Ant Colony Optimization (ACO) concept, where a set of artificial ants are used to determine the optimal path. The proposed method was compared to other state of the art ACO procedures and traditional routing schemes like LS and DV. Simulation results clearly demonstrate that the proposed scheme outperforms all the methods considered in this paper where throughput gains of 8% and a reduction in delay of 38% for time critical applications were achieved.peer-reviewe

BGP-Multipath Routing in the Internet

BGP-Multipath, or BGP-M, is a routing technique for balancing traffic load in the Internet. It enables a Border Gateway Protocol (BGP) border router to install multiple ‘equally-good’ paths to a destination prefix. While other multipath routing techniques are deployed at internal routers, BGP-M is deployed at border routers where traffic is shared on multiple border links between Autonomous Systems (ASes). Although there are a considerable number of research efforts on multipath routing, there is so far no dedicated measurement or study on BGP-M in the literature. This thesis presents the first systematic study on BGP-M. I proposed a novel approach to inferring the deployment of BGP-M by querying Looking Glass (LG) servers. I conducted a detailed investigation on the deployment of BGP-M in the Internet. I also analysed BGP-M’s routing properties based on traceroute measurements using RIPE Atlas probes. My research has revealed that BGP-M has already been used in the Internet. In particular, Hurricane Electric (AS6939), a Tier-1 network operator, has deployed BGP-M at border routers across its global network to hundreds of its neighbour ASes on both IPv4 and IPv6 Internet. My research has provided the state-of-the-art knowledge and insights in the deployment, configuration and operation of BGP-M. The data, methods and analysis introduced in this thesis can be immensely valuable to researchers, network operators and regulators who are interested in improving the performance and security of Internet routing. This work has raised awareness of BGP-M and may promote more deployment of BGP-M in future because BGP-M not only provides all benefits of multipath routing but also has distinct advantages in terms of flexibility, compatibility and transparency