DOCSLIB.ORG

Implementing Openlisp with LISP+ALT

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Implementing Openlisp with LISP+ALT Implementing OpenLISP with LISP+ALT Attilla de Groot [email protected] [email protected] April 14, 2009 Abstract Due to the exponential growth of the BGP routing table in the “default-free-zone” the Locator ID Separation Protocol (LISP) is being developed. OpenLISP is one of the implementations of this protocol, however it does not have the function to route locator and endpoint id addresses. This document describes how a lisp daemon should in- teract with OpenLISP, GRE and Quagga to use LISP+ALT as a control plane. 1 Implementing OpenLISP with LISP+ALT Contents 1 Introduction3 2 Scalability of Internet Routing4 2.1 BGP and the Default-Free-Zone.................4 2.2 Splitting location and ID.....................5 3 Locator ID Separation Protocol7 3.1 Encapsulation...........................7 3.2 Mapping information.......................8 3.2.1 Life of a Packet in the LISP Protocol.......... 10 3.3 Mapping system.......................... 11 3.3.1 LISP+ALT......................... 11 3.3.2 Routing in LISP+ALT.................. 12 3.3.3 LISP4............................ 13 4 OpenLISP 14 4.1 Packet encapsulation....................... 14 4.1.1 Incoming packets..................... 14 4.1.2 Outgoing packets..................... 14 4.1.3 MTU Management.................... 15 4.2 Mappingtable implementation................. 16 4.2.1 Command line tools................... 16 4.2.2 API............................. 17 5 Implementing OpenLISP with LISP+ALT 19 5.1 Gre................................. 19 5.2 Bgp................................. 20 5.3 Encapsulation........................... 21 5.4 Mapping Information....................... 21 5.4.1 Requirements....................... 22 5.4.2 Functional Design.................... 22 6 Conclusion 24 6.1 Further research.......................... 24 2 Implementing OpenLISP with LISP+ALT 1 Introduction Over the last ten years the Internet has grown exponentially. Not only the number of connected hosts has increased, but also the number of routable prefixes. This has lead to the discussion of creating a more scalable solu- tion to reduce the routing table size in the “default-free-zone” (DFZ). The growth of the routing table and a possible solution are explained in Section 2. There have been several protocols suggested in the Routing Research Group that provide a locator id split; the Locator ID Separation Protocol [1] (LISP) is one of them. The locator ID Separation protocol is a mapping and encapsulation implementation of the locator id split. To realise a locator id split a table with mappings between locator and end points is needed. The LISP+ALT system [2] is an overlay network based on already available protocols that provides a mapping system. In Section3 the LISP protocol and the LISP+ALT system is explained. At the time of writing there are two implementations of the lisp proto- col. One is a propriatary implementation on the Cisco NX-OS [3] operating system. The other implementation is OpenLISP [4] developed by the Bel- gium university of Louvain. The implementation of OpenLISP is explained in section4. There is currently no integration between a LISP+ALT network and the OpenLISP implementation. Since the system is based on already available protocols this lead to the following research question: Is it possible to let the OpenLISP implementation interoperate with a LISP+ALT network by using existing open source software? In the next sections the practical deployment of OpenLISP in the LISP+ALT network is studied. Some current impediments with the OpenLISP imple- mentation are identified and recommendations for further research are pre- sented. 3 Implementing OpenLISP with LISP+ALT 2 Scalability of Internet Routing The growth of the routing table in the “default-free-zone” (DFZ) has lead to discussions in the Routing Research Group [5] on a more scalable routing system. It is commonly agreed upon that splitting the routing and iden- tification space (IP-adresses) into a locator and endpoint IDs is the way to provide scalability. In the Internet Research Task Force [5] several drafts have been submitted with protocols to provide such a locator ID split. The LISP protocol provides this through a map and encapsulation solution. 2.1 BGP and the Default-Free-Zone Currently, the BGP [6] protocol is used for inter-domain routing. Every do- main can be seen in BGP terms as an autonomous system (AS). Every AS has one or more IP subnets which are announced between BGP speakers that have a peering relationship. A simplified representation can be seen in Figure1. AS100 AS200 1.1.0.0/16 2.2.0.0/16 Internet AS300 AS400 3.3.0.0/16 4.4.0.0/16 Figure 1: BGP Routing Assuming that every AS has one BGP speaker and AS400 has a peering with AS200 and AS300 the routing table of the AS400 BGP router would look like table ??. Over the last 15 years the Internet has grown to over 30.000 autonomous systems and the use of classless inter-domain routing [7] has lead to a rout- ing table with almost 300.000 entries as can be seen in figure2. This is 4 Implementing OpenLISP with LISP+ALT Network Next Hop Path 3.3.0.0/16 3.3.0.1 400 300 2.2.0.0/16 2.2.0.1 400 200 1.1.0.0/16 3.3.0.1 400 300 100 2.2.0.1 400 200 100 Table 1: BGP FIB for AS400 Figure 2: Growth of the BGP Table - 1994 to Present [8] caused by more provider independent address space that has been given out over the last few years and less provider aggregation. Another factor of table growth is multihoming, where two providers announce the same subnet. BGP was not ment to be used for traffic engineering. However routing updates are abused to control traffic flows in the network. This causes a more dynamic routing table and more entries if subnets are separately an- nounced and thus more growth of the Forwarding Information Base (FIB). The FIB is finally loaded into high speed memory, because for every IP packet a lookup has to be done. This kind of memory is costly in design and manufacturing. Having a large FIB increases the operational cost of having a router in de DFZ. 2.2 Splitting location and ID In current (inter)network routing an IP-address is used as the location and identifier. Discussions in the RRG have lead to the conlusion that split- 5 Implementing OpenLISP with LISP+ALT ting location and identifier is a commonly accepted solution to limit the growth of the routing table. If such a system is used in Internet routing this will lead to a situation where every AS has one or a few locators that represent multiple subnets. The routing table will then only contain locator addresses. The ids for the endpoints will be stored in a seperate mapping table. As result of a locator ID split we will have a more stable DFZ, because no routing updates are needed if an endpoint prefix is moved, fragmentation of the identity space is not an issue because of the RLOC to end ID mapping, and in a multihoming situation only one mapping for the endpoint prefix is needed. To implement a location/ID split addressing, headers, and protocols need to be adjusted. Several proposals have been made for this implemen- tation [9, 10]. The Locator ID separation protocol is a map and encapsula- tion implementation of the location/ID split approach. 6 Implementing OpenLISP with LISP+ALT 3 Locator ID Separation Protocol The Locator ID Separation Protocol (LISP) is an implementation of the en- capsulation solution for the locator id split. The development of the LISP protocol continued at the IETF after the Internet Architecture Board [11] routing and adressing workshop in 2006 [12]. At the time of writing an IETF workgroup is being setup for further development of the protocol. Although the size of the routing table is one of the main problems LISP should solve, it also adresses traffic engineering. By using priority and weight from the authoritative side you can control your ingress traffic and load balance your traffic over multiple LISP devices. The LISP protocol can be devided into two sections: packet encapsula- tion and mapping. The data plane takes care of the encapsulation proces and problems that may occur in this process. As is explained in Section 2.2 a seperate mapping table is needed. The protocol provides for mechanisms to fill and update the mapping table. 3.1 Encapsulation To reduce the routing table an original IP packet is encapsulated with two new headers as seen in Figure3. The LISP header includes the locator reach- ability information and a nonce. This header is then encapsulated with another ip header that is used to route the packet. This is send to the well- known LISP UDP port 4341. Since the encapsulation process uses standard IP headers, nothing in the protocol excludes the use of IPV6 either as locator IDs or as endpoint IDs. To prepend a LISP header and outer ip header two new devices are in- troduced into the network. • An Ingress Tunnel Router (ITR) that adds a LISP header, encapsulates it with another IP-header and sends it to the destination router. • An Egress Tunnel Router (ETR) that removes the extra headers and sends the packet to the final destination. Both functions can be combined in one device and is named an XTR. As with every encapsulation protocol the MTU might be a problem. Since lisp adds additional headers the packet becomes larger and could exceed the maximum MTU in the path. According to the draft most traffic paths can accommodate a path MTU of at least 4470 bytes. It has to be de- termined in a deployment pilot if and what problems are caused by adding the extra headers.
Load more

Recommended publications
  • Introduction to Programming in Lisp
    Introduction to Programming in Lisp Supplementary handout for 4th Year AI lectures · D W Murray · Hilary 1991 1 Background There are two widely used languages for AI, viz. Lisp and Prolog. The latter is the language for Logic Programming, but much of the remainder of the work is programmed in Lisp. Lisp is the general language for AI because it allows us to manipulate symbols and ideas in a commonsense manner. Lisp is an acronym for List Processing, a reference to the basic syntax of the language and aim of the language. The earliest list processing language was in fact IPL developed in the mid 1950’s by Simon, Newell and Shaw. Lisp itself was conceived by John McCarthy and students in the late 1950’s for use in the newly-named field of artificial intelligence. It caught on quickly in MIT’s AI Project, was implemented on the IBM 704 and by 1962 to spread through other AI groups. AI is still the largest application area for the language, but the removal of many of the flaws of early versions of the language have resulted in its gaining somewhat wider acceptance. One snag with Lisp is that although it started out as a very pure language based on mathematic logic, practical pressures mean that it has grown. There were many dialects which threaten the unity of the language, but recently there was a concerted effort to develop a more standard Lisp, viz. Common Lisp. Other Lisps you may hear of are FranzLisp, MacLisp, InterLisp, Cambridge Lisp, Le Lisp, ... Some good things about Lisp are: • Lisp is an early example of an interpreted language (though it can be compiled).
    [Show full text]
  • LISP Working Group S. Barkai Internet-Draft B
    LISP Working Group S. Barkai Internet-Draft B. Fernandez-Ruiz Intended status: Experimental S. ZionB Expires: March 10, 2020 R. Tamir Nexar Inc. A. Rodriguez-Natal F. Maino Cisco Systems A. Cabellos-Aparicio J. Paillissé Vilanova Technical University of Catalonia D. Farinacci lispers.net October 10, 2019 Network-Hexagons: H3-LISP Based Mobility Network draft-barkai-lisp-nexagon-11 Abstract This document specifies combined use of H3 and LISP for mobility-networks: - Enabling real-time tile by tile indexed annotation of public roads - For sharing: hazards, blockages, conditions, maintenance, furniture.. - Between MobilityClients producing-consuming road geo-state information - Using addressable grid of channels of physical world state representation Status of This Memo This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet- Drafts is at https://datatracker.ietf.org/drafts/current/. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." This Internet-Draft will expire on October 4, 2019. Copyright Notice Copyright (c) 2019 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust’s Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document.
    [Show full text]
  • PUB DAM Oct 67 CONTRACT N00014-83-6-0148; N00014-83-K-0655 NOTE 63P
    DOCUMENT RESUME ED 290 438 IR 012 986 AUTHOR Cunningham, Robert E.; And Others TITLE Chips: A Tool for Developing Software Interfaces Interactively. INSTITUTION Pittsburgh Univ., Pa. Learning Research and Development Center. SPANS AGENCY Office of Naval Research, Arlington, Va. REPORT NO TR-LEP-4 PUB DAM Oct 67 CONTRACT N00014-83-6-0148; N00014-83-K-0655 NOTE 63p. PUB TYPE Reports - Research/Technical (143) EDRS PRICE MF01/PC03 Plus Postage. DESCRIPTORS *Computer Graphics; *Man Machine Systems; Menu Driven Software; Programing; *Programing Languages IDENTIF7ERS Direct Manipulation Interface' Interface Design Theory; *Learning Research and Development Center; LISP Programing Language; Object Oriented Programing ABSTRACT This report provides a detailed description of Chips, an interactive tool for developing software employing graphical/computer interfaces on Xerox Lisp machines. It is noted that Chips, which is implemented as a collection of customizable classes, provides the programmer with a rich graphical interface for the creation of rich graphical interfaces, and the end-user with classes for modeling the graphical relationships of objects on the screen and maintaining constraints between them. This description of the system is divided into five main sections: () the introduction, which provides background material and a general description of the system; (2) a brief overview of the report; (3) detailed explanations of the major features of Chips;(4) an in-depth discussion of the interactive aspects of the Chips development environment; and (5) an example session using Chips to develop and modify a small portion of an interface. Appended materials include descriptions of four programming techniques that have been sound useful in the development of Chips; descriptions of several systems developed at the Learning Research and Development Centel tsing Chips; and a glossary of key terms used in the report.
    [Show full text]
  • Allegro CL User Guide
    Allegro CL User Guide Volume 1 (of 2) version 4.3 March, 1996 Copyright and other notices: This is revision 6 of this manual. This manual has Franz Inc. document number D-U-00-000-01-60320-1-6. Copyright 1985-1996 by Franz Inc. All rights reserved. No part of this pub- lication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means electronic, mechanical, by photocopying or recording, or otherwise, without the prior and explicit written permission of Franz incorpo- rated. Restricted rights legend: Use, duplication, and disclosure by the United States Government are subject to Restricted Rights for Commercial Software devel- oped at private expense as specified in DOD FAR 52.227-7013 (c) (1) (ii). Allegro CL and Allegro Composer are registered trademarks of Franz Inc. Allegro Common Windows, Allegro Presto, Allegro Runtime, and Allegro Matrix are trademarks of Franz inc. Unix is a trademark of AT&T. The Allegro CL software as provided may contain material copyright Xerox Corp. and the Open Systems Foundation. All such material is used and distrib- uted with permission. Other, uncopyrighted material originally developed at MIT and at CMU is also included. Appendix B is a reproduction of chapters 5 and 6 of The Art of the Metaobject Protocol by G. Kiczales, J. des Rivieres, and D. Bobrow. All this material is used with permission and we thank the authors and their publishers for letting us reproduce their material. Contents Volume 1 Preface 1 Introduction 1.1 The language 1-1 1.2 History 1-1 1.3 Format
    [Show full text]
  • ITC - Loc/ID Separation SIG Report 2014
    ITC - Loc/ID Separation SIG Report 2014 In the framework of ITC Special Interest Groups activities, the Locator/ID Separation SIG has been created in 2012, aiming at gathering and disseminating activities about the Locator/ Identifier Separation paradigm. The paradigm is instantiated in LISP (Locator/Identifier Separation Protocol) and the highlights of 2013/2014 activities concern the advances in the IETF LISP WG, the evolution of the OpenLISP implementation, and the growth of the LISP Beta Network. The LISP WG at the IETF, in the last year, has worked in order to complete the milestones in its charter. The WG gave priority to the document aiming at describing the overall LISP architecture to newbies (draft-ietf-lisp-introduction). The document was lingering without real progress, until mid-2014, when new editors have been assigned to carry on the work. As of November 2014, the document just went over Working Group Last Call, which makes it ready to be forwarded to the IESG (Internet Engineering Steering Group) for evaluation and publication. Another main work item has been the request to IANA (Internet Assigned Numbers Authority) of an IPv6 address space reserved for LISP. Such work has been split in two documents, a first one - draft-ietf-lisp-eid-block - just simply requesting to IANA to reserve the addressing space for experimental purposes for at least 3 years; a second one - draft-ietf-lisp-eid-block-mgmnt - providing policy guidelines on how such dressing space has to be administered. The first document already went through Working Group Last Call and is now waiting the second document in order to move together forward to the IESG.
    [Show full text]
  • Interdomain Traffic Engineering in a Locator/Identifier Separation Context
    1 Interdomain Traffic Engineering in a Locator/Identifier Separation Context Damien Saucez, Benoit Donnet, Luigi Iannone, Olivier Bonaventure Universite´ catholique de Louvain, Belgium Abstract— The Routing Research Group (RRG) of the Internet In this paper, we propose a service helping an ISP, using Research Task Force (IRTF) is currently discussing several archi- identifier/locator separation, to deploy a traffic engineering tectural solutions to build an interdomain routing architecture service controlling both incoming and outgoing packet flows. that scales better than the existing one. The solutions family currently being discussed concerns the addresses separation This service is contacted by clients (i.e., LISP routers in this into locators and identifiers, LISP being one of them. Such a paper) for ranking paths between locators of the source and separation provides opportunities in terms of traffic engineering. the destination. The service performs the ranking using cost In this paper, we propose an open and flexible solution that functions that return a value characterizing a path according allows an ISP using identifier/locator separation to engineer its to one or more metrics. One of the main advantages of the interdomain traffic. Our solution relies on the utilization of a service that transparently ranks paths using cost functions. We cost functions is that they can be combined in order to form implement a prototype server and demonstrate its benefits in a a more complex function. Clients receive the list of ranked LISP testbed. paths so that the first path in the list is the most preferable while the last one is the least desirable. We implement our path selection mechanism in a tool I.
    [Show full text]
  • S Allegro Common Lisp Foreign Function Interface
    Please do not remove this page Extensions to the Franz, Inc.'s Allegro Common Lisp foreign function interface Keane, John https://scholarship.libraries.rutgers.edu/discovery/delivery/01RUT_INST:ResearchRepository/12643408560004646?l#13643533500004646 Keane, J. (1996). Extensions to the Franz, Inc.’s Allegro Common Lisp foreign function interface. Rutgers University. https://doi.org/10.7282/t3-pqns-7h57 This work is protected by copyright. You are free to use this resource, with proper attribution, for research and educational purposes. Other uses, such as reproduction or publication, may require the permission of the copyright holder. Downloaded On 2021/09/29 22:58:32 -0400 Extensions to the Franz Incs Allegro Common Lisp Foreign Function Interface John Keane Department of Computer Science Rutgers University New Brunswick NJ keanecsrutgersedu January Abstract As provided by Franz Inc the foreign function interface of Allegro Com mon Lisp has a number of limitations This pap er describ es extensions to the interface that facilitate the inclusion of C and Fortran co de into Common Lisp systems In particular these extensions make it easy to utilize libraries of numerical subroutines such as those from Numerical Recip es in C from within ACL including those routines that take functions as arguments A mechanism for creating Lisplike dynamic runtime closures for C routines is also describ ed Acknowledgments The research presented in this do cument is supp orted in part by NASA grants NCC and NAG This research is also part of the Rutgers based
    [Show full text]
  • LISP-EC: Enhancing LISP with Egress Control
    LISP-EC: Enhancing LISP with Egress Control Ho Dac Duy Nguyen, Stefano Secci Sorbonne Universités, UPMC Univ Paris 06, UMR 7606, LIP6. Email: {ho-dac-duy.nguyen, stefano.secci}@upmc.fr Abstract—The Locator/Identifier Separation Protocol (LISP) indeed, LISP allows to associate to each prefix (announced was specified a few years ago by the Internet Engineering Task via BGP) a preferred routing locator, among many possible Force (IETF) to enhance the Internet architecture with novel ones, by means of a mapping system (independent of BGP). inbound control capabilities. Such capabilities are particularly needed for multihomed networks that dispose of multiple public In this way, a multihomed network can perform egress traffic IP routing locators for their IP networks, and that are willing engineering using BGP, while using LISP for ingress traffic to exploit them in a better way than what possible with the engineering. However, to dispose of both ingress and egress legacy Border Gateway Protocol (BGP) [8]. In this work, we traffic engineering for a given multihomed network, the two specify how to enhance the LISP routing system to perform protocols are supposed to inter-work, which is not specified in egress control too. Our goal is to give the highest possible routing optimization degree to LISP networks, so that ingress and egress the standard. More precisely, it is not explicitly specified how traffic engineering strategies can be jointly performed, without LISP and BGP should run in a same node, or how physically requiring coordination between LISP and BGP. We design the separated LISP and BGP routers should be interconnected, etc.
    [Show full text]
  • A Deep Dive Into the LISP Cache and What Isps Should Know About It Juhoon Kim, Luigi Iannone, Anja Feldmann
    A Deep Dive into the LISP Cache and What ISPs Should Know about It Juhoon Kim, Luigi Iannone, Anja Feldmann To cite this version: Juhoon Kim, Luigi Iannone, Anja Feldmann. A Deep Dive into the LISP Cache and What ISPs Should Know about It. 10th IFIP Networking Conference (NETWORKING), May 2011, Valencia, Spain. pp.367-378, 10.1007/978-3-642-20757-0_29. hal-01583403 HAL Id: hal-01583403 https://hal.inria.fr/hal-01583403 Submitted on 7 Sep 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Distributed under a Creative Commons Attribution| 4.0 International License ADeepDiveintotheLISPCache and what ISPs should know about it Juhoon Kim!, Luigi Iannone, and Anja Feldmann Deutsche Telekom Laboratories – Technische Universit¨at Berlin Ernst-Reuter-Platz 7, 10587 Berlin, Germany Abstract. Due to scalability issues that the current Internet is facing, the research community has re-discovered the Locator/ID Split paradigm. As the name suggests, this paradigm is based on the idea of separating the identity from the location of end-systems, in order to increase the scalability of the Internet architecture. One of the most successful pro- posals, currently under discussion at the IETF, is LISP (Locator/ID Separation Protocol).
    [Show full text]
  • A Quick Introduction to Common Lisp
    CSC 244/444 Notes last updated Feb 3, 2020 A Quick Introduction to Common Lisp Lisp is a functional language well-suited to sym- bolic AI, based on the λ-calculus and with list structures as a very flexible basic data type; pro- grams are themselves list structures, and thus can be created and manipulated just like other data. This introduction isn't intended to give you all the details, but just enough to get across the essential ideas, and to let you get under way quickly. The best way to make use of it is in front of a computer, trying out all the things mentioned. Basic characteristics of Lisp and Common Lisp: • Lisp is primarily intended for manipulating symbolic data in the form of list struc- tures, e.g., (THREE (BLIND MICE) SEE (HOW (THEY RUN)) !) • Arithmetic is included, e.g., (SQRT (+ (* 3 3) (* 4 4))) or (sqrt (+ (* 3 3) (* 4 4))) (Common Lisp is case-insensitive, except in strings between quotes " ... ", specially delimited symbols like |Very Unusual Symbol!|, and for characters prefixed with \\"). • Common Lisp (unlike John McCarthy's original \pure" Lisp) has arrays and record structures; this leads to more understandable and efficient code, much as in typed languages, but there is no obligatory typing. • All computation consists of expression evaluation. For instance, typing in the above (SQRT ...) expression and hitting the enter key immediately gives 5. • Lisp is a functional language based on Alonzo Church's λ-calculus (which like Turing machines provides a complete basis for all computable functions). For instance, a function for the square root of the sum of two squares can be expressed as (lambda (x y) (sqrt (+ (* x x) (* y y)))).
    [Show full text]
  • Strategic Path Diversity Management Across Internet Layers
    LABORATOIRE D'INFORMATIQUE DE PARIS 6 STRATEGIC PATH DIVERSITY MANAGEMENT ACROSS INTERNET LAYERS Advisor: Doctoral Dissertation of: Prof. Stefano SECCI Ho Dac Duy NGUYEN 2018 Th`ese Pr´esent´eepour obtenir le grand de docteur de la Sorbonne Universit´e Sp´ecialit´e:Informatique Ho Dac Duy NGUYEN STRATEGIC PATH DIVERSITY MANAGEMENT ACROSS INTERNET LAYERS Soutenue le 22 octobre 2018 devant le jury compos´ede : Rapporteurs: Prof. Fabio MARTIGNON Univ. Bergamo. Prof. Sidi-Mohamed SENOUCI Univ. Bourgogne. Examinateurs: Dr. Geraldine TEXIER Institut Mines-T´el´ecom. Dr. Luigi IANNONE Institut Mines-T´el´ecom. Prof. Maria POTOP BUTUCARU Sorbonne Universit´e. Directeur de th`ese: Prof. Stefano SECCI Cnam. LABORATOIRE D'INFORMATIQUE DE PARIS 6 STRATEGIC PATH DIVERSITY MANAGEMENT ACROSS INTERNET LAYERS Author: Ho Dac Duy NGUYEN. Defended on October 22, 2018, in front of the committee composed of: Referees: Prof. Fabio MARTIGNON Univ. Bergamo. Prof. Sidi-Mohamed SENOUCI Univ. Bourgogne. Examiners: Dr. Geraldine TEXIER Institut Mines-T´el´ecom. Dr. Luigi IANNONE Institut Mines-T´el´ecom. Prof. Maria POTOP BUTUCARU Sorbonne Universit´e. Advisor: Prof. Stefano SECCI Cnam. I To my family! Abstract We present in this thesis novel routing protocols able to take into consideration strategic aspects when deciding which path among many to take, and that at the Internet com- munication network scale. The standpoint adopted in this study is that novel routing architectures are exposing a higher path diversity to networks and applications so that networks and applications can be made capable to more intelligently select their strat- egy when selecting toward which path to forward their traffic, taking into consideration operational costs as well as performance goals.
    [Show full text]
  • Parallel Programming with Lisp for Performance
    Parallel Programming with Lisp for Performance Pascal Costanza, Intel, Belgium European Lisp Symposium 2014, Paris, France The views expressed are my own, and not those of my employer. Legal Notices • Cilk, Intel, the Intel logo are trademarks of Intel Corporation in the U.S. and/or other countries. Other names and brands may be claimed as the property of others. Results have been estimated based on internal Intel analysis and are provided for informational purposes only. Any difference in system hardware or software design or configuration may affect actual performance. Intel does not control or audit the design or implementation of third party benchmark data or Web sites referenced in this document. Intel encourages all of its customers to visit the referenced Web sites or others where similar performance benchmark data are reported and confirm whether the referenced benchmark data are accurate and reflect performance of systems available for purchase. • Optimization Notice: Intel’s compilers may or may not optimize to the same degree for non-Intel microprocessors for optimizations that are not unique to Intel microprocessors. These optimizations include SSE2, SSE3, and SSSE3 instructions sets and other optimizations. Intel does not guarantee the availability, functionality, or effectiveness of any optimization on microprocessors not manufactured by Intel. Microprocessor-dependent optimizations in this product are intended for use with Intel microprocessors. Certain optimizations not specific to Intel microarchitecture are reserved for Intel microprocessors. Please refer to the applicable product User and Reference Guides for more information regarding the specific instruction sets covered by this notice. (Notice revision #20110804) • Copyright © 2014 Intel Corporation.
    [Show full text]