Advantages of a PCE-based control plane for LISP

The Locator/Identifier Separation Protocol (LISP) is one of the candidate solutions to address the scalability issues in inter-domain routing. The current proposals for its control plane (e.g., ALT, CONS, NERD) have various shortcomings, including the potential dropping of packets at LISP routers during the resolution of the EID-to-RLOC mapping. In this paper, we introduce a new Control Plane (CP) for LISP supported by an architecture that borrows concepts from both the Path Computation Element (PCE) and Intelligent Route Control (IRC). Our CP is able to tackle three different problems simultaneously: (i) packets sourced from end-hosts are neither dropped nor queued during the mapping resolution; (ii) the EID-to-RLOC mapping can be obtained and configured approximately within the DNS resolution time needed to fetch the destination EID address; and (iii) our approach can blend IRC with the PCE capabilities, to perform upstream/ downstream Traffic Engineering (TE) through the dynamic management of the mappings. In particular, our CP supports the utilization of different LISP ingress and egress local routers for the same flow sourced from a domain.Peer ReviewedPostprint (author’s final draft

Managing Interdomain Traffic in Latin America: A New Perspective based on LISP

The characteristics of Latin American network infrastructures have global consequences, particularly in the area of interdomain traffic engineering. As an example, Latin America shows the largest de-aggregation factor of IP prefixes among all regional Internet registries, being proportionally the largest contributor to the growth and dynamics of the global BGP routing table. In this article we analyze the peculiarities of LA interdomain routing architecture, and provide up-to-date data about the combined effects of the multihoming and TE practices in the region. We observe that the Internet Research Task Force initiative on the separation of the address space into locators and identifiers can not only alleviate the growth and dynamics of the global routing table, but can also offer appealing TE opportunities for LA. We outline one of the solutions under discussion at the IRTF, the Locator/Identifier Separation Protocol, and examine its potential in terms of interdomain traffic management in the context of LA. The key advantage of LISP is its nondisruptive nature, but the existing proposals for its control plane have some problems that may hinder its possible deployment. In light of this, we introduce a promising control plane for LISP that can solve these issues, and at the same time has the potential to bridge the gap between intradomain and interdomain traffic management.Peer ReviewedPostprint (published version

Experimentation Environments for Data Center Routing Protocols: A Comprehensive Review

The Internet architecture has been undergoing a significant refactoring, where the past preeminence of transit providers has been replaced by content providers, which have a ubiquitous presence throughout the world, seeking to improve the user experience, bringing content closer to its final recipients. This restructuring is materialized in the emergence of Massive Scale Data Centers (MSDC) worldwide, which allows the implementation of the Cloud Computing concept. MSDC usually deploy Fat-Tree topologies, with constant bisection bandwidth among servers and multi-path routing. To take full advantage of such characteristics, specific routing protocols are needed. Multi-path routing also calls for revision of transport protocols and forwarding policies, also affected by specific MSDC applications’ traffic characteristics. Experimenting over these infrastructures is prohibitively expensive, and therefore, scalable and realistic experimentation environments are needed to research and test solutions for MSDC. In this paper, we review several environments, both single-host and distributed, which permit analyzing the pros and cons of different solutions

Understanding IPv4 prefix de-aggregation: challenges for routing scalability

The Internet has become a vast and complex infrastructure. One of the aspects of deeper concern in the community is routing scalability, which involves both the size and dynamics of the global Internet routing table. Many Future Internet initiatives stand for “clean slate” or disruptive approaches to overcome this issue; nevertheless, network operators need evolutionary solutions. In this paper we put forward a characterization of the IP prefix de-aggregation factor focussing on the Latin American region, where we found that a significant contribution to the growth of the routing table could be prevented by improving BGP configuration. In the context of our participation in the LISP+ALT testbed (an evolutionary Future Internet initiative), we identify initial management requirements for its deployment, according to our findings regarding the size and dynamics of the routing table.Peer Reviewe

Stochastic techniques for time series with applications to materials accountancy

SIGLEAvailable from British Library Document Supply Centre- DSC:D66799/86 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Managing Interdomain Traffic in Latin America: A New Perspective based on LISP

The characteristics of Latin American network infrastructures have global consequences, particularly in the area of interdomain traffic engineering. As an example, Latin America shows the largest de-aggregation factor of IP prefixes among all regional Internet registries, being proportionally the largest contributor to the growth and dynamics of the global BGP routing table. In this article we analyze the peculiarities of LA interdomain routing architecture, and provide up-to-date data about the combined effects of the multihoming and TE practices in the region. We observe that the Internet Research Task Force initiative on the separation of the address space into locators and identifiers can not only alleviate the growth and dynamics of the global routing table, but can also offer appealing TE opportunities for LA. We outline one of the solutions under discussion at the IRTF, the Locator/Identifier Separation Protocol, and examine its potential in terms of interdomain traffic management in the context of LA. The key advantage of LISP is its nondisruptive nature, but the existing proposals for its control plane have some problems that may hinder its possible deployment. In light of this, we introduce a promising control plane for LISP that can solve these issues, and at the same time has the potential to bridge the gap between intradomain and interdomain traffic management.Peer Reviewe

Advantages of a PCE-based control plane for LISP

The Locator/Identifier Separation Protocol (LISP) is one of the candidate solutions to address the scalability issues in inter-domain routing. The current proposals for its control plane (e.g., ALT, CONS, NERD) have various shortcomings, including the potential dropping of packets at LISP routers during the resolution of the EID-to-RLOC mapping. In this paper, we introduce a new Control Plane (CP) for LISP supported by an architecture that borrows concepts from both the Path Computation Element (PCE) and Intelligent Route Control (IRC). Our CP is able to tackle three different problems simultaneously: (i) packets sourced from end-hosts are neither dropped nor queued during the mapping resolution; (ii) the EID-to-RLOC mapping can be obtained and configured approximately within the DNS resolution time needed to fetch the destination EID address; and (iii) our approach can blend IRC with the PCE capabilities, to perform upstream/ downstream Traffic Engineering (TE) through the dynamic management of the mappings. In particular, our CP supports the utilization of different LISP ingress and egress local routers for the same flow sourced from a domain.Peer Reviewe

Review of the worldwide status of coal preparation technology

DTI/Pub URN 00/1205SIGLEAvailable from British Library Document Supply Centre-DSC:7463.750(199) / BLDSC - British Library Document Supply CentreGBUnited Kingdo

The Minimum Coincidence Routing Approach in Wavelength-Routed Optical WDM Networks

Management is a critical issue in optical networks. Highly impacting in management, routing in optical networks, is often decoupled into both the path selection and the wavelength assignment problems. In the former, shortest path based approaches are often applied to compute paths. Although such approaches offer advantages in terms of network loading, they are restricted by the fact, that routes are selected without taking into account parameters pertaining to any explicit and desired service guarantees. Thus, the wavelength assignment process may assign a non-optimal wavelength with respect to incoming traffic requirements and any associated quality of service specifications. This paper addresses the lightpath selection problem by proposing a novel route selection scheme where routes are determined based upon the twin criteria of minimizing the number of hops and balancing the network load, resulting in a reduction in both network congestion and blocking probability