Ipv6 for Ipv4 Experts

Total Page:16

File Type:pdf, Size:1020Kb

Ipv6 for Ipv4 Experts IPv6 for IPv4 Experts Yar Tikhiy December 31, 2013 DRAFT License cbnd This draft is licensed under the Creative Commons Attribution-NonCommercial- NoDerivs license. DRAFT 1 Contents Preface 9 1 Defining the Problem 11 2 IPv6 Address 19 2.1 TheIPv6AddressLengthIssue . 19 2.2 TextRepresentationofanIPv6Address . 29 2.3 IPv6AddressTypes ....................... 38 2.4 IPv6AddressScopeandZone . 42 2.5 Well-known Applications of IPv6 Link-local Addresses . 59 2.6 IPv6UnicastAddressStructure . 61 2.7 IPv6InterfaceIDsandEUI-64. 66 2.8 IPv6MulticastAddressStructure . 72 2.9 IPv6 Multicast Addressing Extensions Based on Unicast Ad- dresses . 78 2.10 Site-Local Address Problem and Its Solution . 85 2.11 IPv6AddressesinDNS. 89 3IPv6Packet 92 3.1 IPv6 Packet Layout . 92 3.2 IPv6Header............................ 96 3.3 ExtensionHeaders ........................ 104 3.3.1 A Header That Isn’t There: No Next Header . 104 3.3.2 IPv6DRAFT Options . 105 3.3.3 RoutingHeader ..................... 111 3.3.4 Fragment Header. IPv6 Fragmentation and Reassembly 119 3.3.5 IPSecurityHeaders. 134 3.3.6 ExtensionHeaderOrdering . 142 3.3.7 UnsupportedHeaderHandling. 144 2 CONTENTS 3 4 IPv6 in the Protocol Stack 147 4.1 Link-Level Encapsulation . 147 4.1.1 Ethernet . 148 4.1.2 PPP . 151 4.2 InteractionwithUpper-LayerProtocols . 158 4.3 Control . 162 5 Neighbor Discovery Protocol 172 5.1 Neighbor Discovery and IPv6 Address Resolution . 172 5.2 TheHost,theLink,andtheSubnetinIPv6 . 207 5.3 IPv6AddressingModesRevised. Anycast . 239 5.4 IPv6Autoconfiguration. 247 5.4.1 Interface ID Selection and Duplicate Address Detection 247 5.4.2 Prefix and Router Discovery . 255 6 Advanced IPv6 277 6.1 AnycastingtotheRoutersoftheSubnet . 277 6.2 PrivacyExtensionsforSLAAC . 279 6.3 SecuringNeighborDiscovery . 284 6.4 Managing IPv6 Multicast . 294 6.5 ToFragmentorNottoFragment?. 356 6.6 Handling Multiple Local Addresses and Default Address Se- lection ............................... 361 6.7 NameResolutioninIPv6Environment . 376 6.8 Multihoming and Multipathing with IPv6 . 379 Conclusion 389 BibliographyDRAFT 391 List of Figures 1.1 Version-agnostic IP header format . 17 2.1 Generic format of IPv6 address . 28 2.2 Yoyodyne corporate network (imaginary) . 43 2.3 Resolving address A’s ambiguity by link index extension . 44 2.4 Zone names can be as unconventional as runes or hieroglyphs because they have only local significance . 47 2.5 IPv6 interface belongs to a zone of each possible scope . 50 2.6 A complex zone topology. Valid and invalid site-local paths in it 52 2.7 Packet exchange using addresses from di↵erent zones . 53 2.8 Initial node configuration assuming a one-to-one correspon- dence between interfaces and zones . 56 2.9 Resolving the zone ambiguity of two interfaces connected to the same link . 57 2.10 IPv4 route aggregation in the Internet . 62 2.11 Generalized structure of an IPv6 global unicast address . 64 2.12 ActualformatofanIPv6unicastaddress . 65 2.13 IPv6 link-local address format . 67 2.14 OUI format and mapping between EUI types. 69 2.15 IPv6 multicast address flags field . 73 2.16 IPv6 multicast address format . 76 2.17 Unicast-prefix-based IPv6 multicast address format . 81 2.18 IPv6 source-specific-multicastDRAFT address format . 84 2.19 Unique local IPv6 unicast address format . 88 3.1 Our first approximation to the IPv6 packet structure looks rather traditional . 92 3.2 The composite header of an IPv6 packet . 94 3.3 The type of a header is to be looked up in the preceding header. 94 3.4 How the composite header is linked with payload . 95 4 LIST OF FIGURES 5 3.5 The final structure of the IPv6 packet (the number of extension headersisvariable) ........................ 96 3.6 The IPv6 header . 103 3.7 NoNextHeader.......................... 105 3.8 Options header common format . 107 3.9 IPv6 option format . 107 3.10 Encoding option properties in its type . 109 3.11 Pad1 option . 110 3.12 PadN option . 110 3.13 RoutingHeadercommonformat . 115 3.14HowRH2works.......................... 118 3.15 IPv6 packet layout for fragmentation purposes . 123 3.16 Making raw fragments from an IPv6 packet . 124 3.17 Encapsulated IPv6 fragment . 124 3.18 How IPv6 Fragment O↵setisdetermined . 129 3.19 FragmentHeaderformat . 131 3.20AHformat............................. 137 3.21 ESPencapsulationformat . 140 4.1 IPV6CP: concurrent negotiation without conflict . 156 4.2 IPV6CP: consecutive negotiation without conflict . 156 4.3 IPV6CP: concurrent negotiation with conflict resolution . 157 4.4 IPV6CP: consecutive negotiation with conflict resolution . 157 4.5 IPv6 encapsulation examples . 159 4.6 IPv6 pseudo-header for checksumming purposes . 160 4.7 Basic ICMPv6 message format . 163 4.8 Generic ICMPv6 error message . 169 5.1 Neighbor nodes on a broadcast link (left) and on a point-to- pointlink(right) ......................... 173 5.2 Automatic neighbor discovery: the concept . 175 5.3 IPv6 node data structures and relations between them . 186 5.4 Deorbiting an outdated Neighbor Cache entry: the timeline . 191 5.5 AsimplifiedNDstatediagram.DRAFT . 193 5.6 NDproxy:thebasicidea. 195 5.7 NDproxy-assistedmobility. 196 5.8 NaiveNDproxycausingmobilityfault . 197 5.9 ND state diagram providing for the O-bit and link-layer (L2) address change . 199 5.10 NeighborSolicitationformat . 202 5.11 NDoptionformat......................... 202 LIST OF FIGURES 6 5.12 SLLA (Type =1)andTLLA(Type =2)options:generic format . 203 5.13 SLLA (Type =1)andTLLA(Type =2)optionsforEthernet 203 5.14 NeighborAdvertisementformat . 205 5.15 NBMAstaranditstopologygraph . 210 5.16 NBMA “butterfly” with a star subgraph in it . 213 5.17 Using the default router to access both the NBMA link and the Internet . 214 5.18 One link, one router, two subnets . 221 5.19 IPv6 Redirect at work . 222 5.20 RedirectedHeaderoptionformat . 223 5.21 Redirectmessageformat . 224 5.22 Top half of the conceptual sending algorithm: Next hop selection233 5.23 Conceptual IPv6 host data structures and links between them 234 5.24 RemotesubprefixinIPv4 . 238 5.25 RemotesubprefixinIPv6 . 239 5.26 AnycastDNS:therawidea. 241 5.27 Anycastmustbereproducible . 241 5.28 Thepathtoananycastdestination . 242 5.29 Anycast: the last hop handled through routing . 243 5.30 The source host speaks to a specific anycast node depending on its connection point . 244 5.31 Same-link anycast using Neighbor Discovery . 244 5.32 Real-world anycast using routing and ND. 246 5.33 Two routers on link, owning di↵erent prefixes . 259 5.34 IPv6 unicast address lifecycle . 263 5.35 Router Solicitation format . 264 5.36 RouterAdvertisementformat . 266 5.37 PrefixInformationOption(PIO) . 267 5.38 MTU Option . 267 5.39 Preventing a lifetime-based DoS attack . 275 6.1 SubnetRouterAnycastAddressformatDRAFT . 277 6.2 The lifecycle of an IPv6 temporary address . 283 6.3 CGAParametersdatastructureformat . 289 6.4 To a multicast source, routers look the same as hosts . 299 6.5 RouterAlertoptionformat. 308 6.6 MLDv1 message format . 312 6.7 MLDv2 Report format . 314 6.8 MulticastAddressRecordformat . 319 6.9 Conceptual data structures of an MLDv2-capable router . 323 LIST OF FIGURES 7 6.10 MLDv2 Query format . 324 6.11 Floating-point code for Maximum Response Code (MRC) and QQIC ............................349 6.12 Selecting source address by scope: initial scheme . 367 6.13 Selecting source address by scope: intermediate scheme . 368 6.14 Selecting source address by scope: final scheme. 369 6.15 Careless publication of a site-local address in the public DNS . 378 6.16 Multihoming with di↵erent links . 382 6.17 Multihoming with one link . 382 6.18 Engineers B. Baker, K. Watanabe, and J. Fowler demonstrate the structural principles of the cantilever bridge [227]. Their designs can be relied upon! . 390 DRAFT List of Tables 2.1 Expanding IPv6 prefix notation to raw hex . 37 2.2 How scoped ping looks like in di↵erent OS types . 57 2.3 Rules for mapping EUI-48 and MAC-48 to EUI-64 . 67 2.4 IPv6 multicast address scope codes [21, Section 2.7] . 75 2.5 mDNSv6 multicast addresses of di↵erent scope . 76 2.6 The most important IPv6 multicast groups [21, Section 2.7.1] . 77 2.7 40-bit site ID conflict probability . 87 3.1 The meaning of the high bits in an IPv6 option type . 108 3.2 Mutability of IPv6 header fields . 138 4.1 IPV6CP interface ID negotiation messages . 153 4.2 Multi-version IP-IP encapsulation . 162 4.3 Essential ICMPv6 message types . 165 5.1 Star neighborship matrix—see Fig. 5.15 for topology . 212 5.2 Broadcastlinkneighborshipmatrix . 212 5.3 “Butterfly” neighborship matrix—see Fig. 5.16 for topology . 215 6.1 AddressesclaimedbyNDmessagetypes . 291 6.2 “MLDv0” and MLDv1 feature chart . 313 6.3 MLDv2 listener reporting rules . 320 6.4 ConceptualmodesofanMLDv2routerfilter . 325 6.5 MLDv2DRAFT Query variants . 332 6.6 MLDv2 report processing rules . 333 6.7 Listener compatibility chart . 350 6.8 Multicast router compatibility chart . 350 6.9 MLD message upgrade chart . 351 6.10 Listener“cross-pollination”chart . 352 6.11 MLD compatibility chart: Messages of which version to send . 353 6.12 MLDv1 and MLDv2 feature table . 353 6.13 Fragmentation and PMTUD related socket options . 360 8 Preface Verbum sat sapienti est. (A word to the wise is enough.) Latin proverb Although IPv6 has been around for quite a while now, many network engineers are still hesitant about embracing it, their valid excuse being a mere lack of time to study the new architecture. Granted, everyone knows of the legendary 128-bit IPv6 address but, unfortunately, that’s about it. The irony is, now that the IPv4 address space has been exhausted and everyone seems raring to go IPv6, the rush of a forced and hurried transition.
Recommended publications
  • Remote Collaborative Real-Time Multimedia Experience Over The
    Remote C ollaborative Real-Time Multimedia Experience over the Future Internet ROMEO Grant Agreement Number: 287896 D4.2 Report on streaming/broadcast techniques for 3D multi-view video and spatial audio ROMEO WP4 Page 1/50 Document description Name of document Report on streaming/broadcast techniques for 3D multi-view video and spatial audio Abstract This document provides a detailed description of the packetization schemes in ROMEO and specifies high level syntax elements of the media formats in order to perform efficient transport and synchronization of the 3D audio and multiview video streams. Adaptation mechanisms and error concealment methods are also proposed in the context of degraded network conditions. Document identifier D4.2 Document class Deliverable Version 1.0 Author(s) N.Tizon, D. Nicholson (VITEC) H. Weigold, H. Ibl, J. Lauterjung (R&S) K. Birkos, A. Kordelas, A. Lykourgiotis, I. Politis (UPAT) Xiyu Shi (MulSys) M.Laabs (IRT) E. Ekmekcioglu (UNIS) A. Akman, S. O. Pelvan, S. Çiftçi, E. Çimen Öztürk (TTA) QAT team D. Doyen (TEC) F. Pascual Blanco (TID) H. Marques (IT) Date of creation 24-Jul-2012 Date of last modification 21-Dec-2012 Status Final Destination European Commission WP number WP4 Dissemination Level Public Deliverable Nature Report ROMEO WP4 Page 2/50 TABLE OF CONTENTS TABLE OF CONTENTS ............................................................................................................. 3 LIST OF FIGURES.....................................................................................................................
    [Show full text]
  • The Internet in Transition: the State of the Transition to Ipv6 in Today's
    Please cite this paper as: OECD (2014-04-03), “The Internet in Transition: The State of the Transition to IPv6 in Today's Internet and Measures to Support the Continued Use of IPv4”, OECD Digital Economy Papers, No. 234, OECD Publishing, Paris. http://dx.doi.org/10.1787/5jz5sq5d7cq2-en OECD Digital Economy Papers No. 234 The Internet in Transition: The State of the Transition to IPv6 in Today's Internet and Measures to Support the Continued Use of IPv4 OECD FOREWORD This report was presented to the OECD Working Party on Communication, Infrastructures and Services Policy (CISP) in June 2013. The Committee for Information, Computer and Communications Policy (ICCP) approved this report in December 2013 and recommended that it be made available to the general public. It was prepared by Geoff Huston, Chief Scientist at the Asia Pacific Network Information Centre (APNIC). The report is published on the responsibility of the Secretary-General of the OECD. Note to Delegations: This document is also available on OLIS under reference code: DSTI/ICCP/CISP(2012)8/FINAL © OECD 2014 THE INTERNET IN TRANSITION: THE STATE OF THE TRANSITION TO IPV6 IN TODAY'S INTERNET AND MEASURES TO SUPPORT THE CONTINUED USE OF IPV4 TABLE OF CONTENTS FOREWORD ................................................................................................................................................... 2 THE INTERNET IN TRANSITION: THE STATE OF THE TRANSITION TO IPV6 IN TODAY'S INTERNET AND MEASURES TO SUPPORT THE CONTINUED USE OF IPV4 .......................... 4
    [Show full text]
  • Army Packet Radio Network Protocol Study
    FTD-RL29 742 ARMY PACKET RAHDIO NETWORK PROTOCOL STUDY(U) SRI / I INTERNATIONAL MENLO PARK CA D E RUBIN NOY 77 I SRI-TR-2325-i43-i DRHCi5-73-C-8i87 p UCLASSIFIED F/G 07/2. 1 L '44 .25I MICROCOPY RESOLUTION TFST CHART NAT ONAL BUREAU Cf STINDRES 1% l A I " S2 5 0 0 S _S S S ARMY PACKET RADIO NETWORK PROTOCOL STUDY CA Technical Report 2325-143-1 e November1977 By: Darryl E. Rubin Prepared for: U,S. Army Electronics Command Fort Monmouth, New Jersey 07703 Attn: Mi. Charles Graff, DRDCO-COM-RF-4 Contract DAHC 1 5-73-C-01 87 SRI Project 2325 * 0. The views and conclusions contained in this document are those of author and should not be Interpreted as necessarily representing th Cofficial policies, either expressed or implied, of the U.S. Army or the .LJ United States Government. -. *m 333 Ravenswood Ave. * Menlo Park, California 94025 0 (415) 326-6200 eCable: STANRES, Menlo Park * TWX: 910-373-1246 83 06 '03 . 4qUNCLASSIFIED SECURITY CLASSIFICATION OF THIS PAGE (When Data Entered) READ INSTRUCTIONS REPORT DOCUMENTATION PAGE BEFORE COMPLETING FORM 1 REPORT NUMBER 2. GOVT ACCESSION NO 3 RECIPIENT'S CATALOG NUMBER [" 2~~1325-143-1 / )r -. : i'/ - 4. TITLE Subtitle) 5-.and TYPE OF REPORT & PERIOD COVERED Army Packet Radio Network Protocol Study Technical Report 6. PERFORMING ORG. REPORT NUMBER 7 AUTHOR(s) A 8 CONTRACT OR GRANT NUMBER(s) Darrvl E. Rubin DAHCI5-73C-0187 9. PERFORMING ORGANIZATION NAME AND ADDRESS 10. PROGRAM ELEMENT, PROJECT. TASK AREA & WORK UNIT NUMBERS SRI International Program Code N.
    [Show full text]
  • Configurable Routing in Ad-Hoc Networks
    Configurable Routing in Ad-Hoc Networks Nadine Shillingford and Christian Poellabauer Department of Computer Science and Engineering University of Notre Dame Notre Dame, IN 46556 fnshillin, [email protected] Abstract— The actual use of a wireless ad-hoc network or run across the network, will be unknown a-priori. Further, ad- its operational parameters may be unknown before deployment hoc networks may be accessed by varying numbers of clients or they may change during the life time of a network. This (users), with different applications and differing expectations requires that an ad-hoc network be configurable to the unique needs of a client and that multiple clients can configure the on QoS. Therefore, it will be essential to make configurability network simultaneously. The QoS metric(s) used in the selection and customizability of future ad-hoc networks a key design of routes in an ad-hoc routing protocol can strongly affect the feature. network’s performance. Unfortunately, the majority of existing Toward this end, this work introduces the CMR (Con- routing protocols support only one or two fixed metrics in route figurable Mesh Routing) toolkit which provides an easy-to- selection. We conducted a survey of over 40 routing protocols published from 1994-2007 which indicated that 90% of the use API for ad-hoc networks, allowing applications or users protocols use one or two metrics and only 10% use three to to implement their own routing protocols and QoS metrics. four metrics in route selection. Toward this end, we propose a While our prototype implementation supports four of the most modular routing toolkit for ad-hoc networks, where users and popular QoS metrics, it is easily extensible and we expect that applications can initiate route discoveries that best suit their QoS future versions will cover a large variety of QoS metrics.
    [Show full text]
  • Network Layer
    Network Layer Rick Graziani Thanks to Brad Smith for his contributions Spring 2018 Next week in CE 151 • Sign up for Piazza (piazza.com) • Sunday - First lab due. - First lab section is half of the lab grade. - 85 points for the lab - 85 points for attending first lab section - VM Problems • Tuesday - Link layer lecture • Thursday - Read “End-to-End Argument” paper - IPv4/layer exercise - IPv4 quiz… review orange slides Today • Too many slides, but will go fast over some and slower on others • Evolution of TCP/IP - Overview Evoluon of TCP/IP (Overview) Internet Background • The ARPAnet was the first packet-switched network (1969) • It’s success led to the Internet • The ARPAnet architecture - Homogeneous (same) switches • Interface Message Processors (IMPs) – Honeywell 316/516 minicomputers (maps to "physical, data link and network layers") - Heterogeneous (different) hosts - The Network Control Protocol or Program (NCP) implemented conservative error, flow, and congestion control (early TCP) • Stop and wait • Hop by hop Evoluon of TCP/IP (Overview) • NCP provided the transport layer: - ARPANet Host-to-Host Protocol (AHHP) - Initial Connection Protocol (ICP) • Move from smart network to smart hosts … “End-to-end Principle” (Work done by Paul Baran and Donald Davies in the 1960s) • Reliable delivery a host-host issue • TCP split into TCP/IP (Early 1980s) - Internet Protocol (IP) • Best-effort routing • Internet level addressing - Transmission Control Protocol (TCP) • New, end-to-end error, flow, and congestion control Internet Background
    [Show full text]
  • Openswitch OPX Configuration Guide Release 3.0.0 2018 - 9
    OpenSwitch OPX Configuration Guide Release 3.0.0 2018 - 9 Rev. A02 Contents 1 Network configuration....................................................................................................................................4 2 Interfaces...................................................................................................................................................... 5 Physical ports..................................................................................................................................................................... 5 Fan-out interfaces..............................................................................................................................................................6 Port-channel and bond interfaces....................................................................................................................................7 VLAN interfaces................................................................................................................................................................. 7 Port profiles.........................................................................................................................................................................8 3 Layer 2 bridging............................................................................................................................................10 VLAN bridging...................................................................................................................................................................10
    [Show full text]
  • Data Communications & Networks Session 1
    Data Communications & Networks Session 1 – Main Theme Introduction and Overview Dr. Jean-Claude Franchitti New York University Computer Science Department Courant Institute of Mathematical Sciences Adapted from course textbook resources Computer Networking: A Top-Down Approach, 5/E Copyright 1996-2009 J.F. Kurose and K.W. Ross, All Rights Reserved 1 Agenda 11 InstructorInstructor andand CourseCourse IntroductionIntroduction 22 IntroductionIntroduction andand OverviewOverview 33 SummarySummary andand ConclusionConclusion 2 Who am I? - Profile - 27 years of experience in the Information Technology Industry, including twelve years of experience working for leading IT consulting firms such as Computer Sciences Corporation PhD in Computer Science from University of Colorado at Boulder Past CEO and CTO Held senior management and technical leadership roles in many large IT Strategy and Modernization projects for fortune 500 corporations in the insurance, banking, investment banking, pharmaceutical, retail, and information management industries Contributed to several high-profile ARPA and NSF research projects Played an active role as a member of the OMG, ODMG, and X3H2 standards committees and as a Professor of Computer Science at Columbia initially and New York University since 1997 Proven record of delivering business solutions on time and on budget Original designer and developer of jcrew.com and the suite of products now known as IBM InfoSphere DataStage Creator of the Enterprise Architecture Management Framework (EAMF) and main
    [Show full text]
  • Introduction to RAW-Sockets Jens Heuschkel, Tobias Hofmann, Thorsten Hollstein, Joel Kuepper
    Introduction to RAW-sockets Jens Heuschkel, Tobias Hofmann, Thorsten Hollstein, Joel Kuepper 16.05.2017 Technical Report No. TUD-CS-2017-0111 Technische Universität Darmstadt Telecooperation Report No. TR-19, The Technical Reports Series of the TK Research Division, TU Darmstadt ISSN 1864-0516 http://www.tk.informatik.tu-darmstadt.de/de/publications/ Introduction to RAW-sockets by Heuschkel, Jens Hofmann, Tobias Hollstein, Thorsten Kuepper, Joel May 17, 2017 Abstract This document is intended to give an introduction into the programming with RAW-sockets and the related PACKET-sockets. RAW-sockets are an additional type of Internet socket available in addition to the well known DATAGRAM- and STREAM-sockets. They do allow the user to see and manipulate the information used for transmitting the data instead of hiding these details, like it is the case with the usually used STREAM- or DATAGRAM sockets. To give the reader an introduction into the subject we will first give an overview about the different APIs provided by Windows, Linux and Unix (FreeBSD, Mac OS X) and additional libraries that can be used OS-independent. In the next section we show general problems that have to be addressed by the programmer when working with RAW-sockets. We will then provide an introduction into the steps necessary to use the APIs or libraries, which functionality the different concepts provide to the programmer and what they provide to simplify using RAW and PACKET-sockets. This section includes examples of how to use the different functions provided by the APIs. Finally in the additional material we will give some complete examples that show the concepts and can be used as a basis to write own programs.
    [Show full text]
  • QEMU Version 4.2.0 User Documentation I
    QEMU version 4.2.0 User Documentation i Table of Contents 1 Introduction ::::::::::::::::::::::::::::::::::::: 1 1.1 Features :::::::::::::::::::::::::::::::::::::::::::::::::::::::: 1 2 QEMU PC System emulator ::::::::::::::::::: 2 2.1 Introduction :::::::::::::::::::::::::::::::::::::::::::::::::::: 2 2.2 Quick Start::::::::::::::::::::::::::::::::::::::::::::::::::::: 2 2.3 Invocation :::::::::::::::::::::::::::::::::::::::::::::::::::::: 3 2.3.1 Standard options :::::::::::::::::::::::::::::::::::::::::: 3 2.3.2 Block device options :::::::::::::::::::::::::::::::::::::: 12 2.3.3 USB options:::::::::::::::::::::::::::::::::::::::::::::: 23 2.3.4 Display options ::::::::::::::::::::::::::::::::::::::::::: 23 2.3.5 i386 target only::::::::::::::::::::::::::::::::::::::::::: 30 2.3.6 Network options :::::::::::::::::::::::::::::::::::::::::: 31 2.3.7 Character device options:::::::::::::::::::::::::::::::::: 38 2.3.8 Bluetooth(R) options ::::::::::::::::::::::::::::::::::::: 42 2.3.9 TPM device options :::::::::::::::::::::::::::::::::::::: 43 2.3.10 Linux/Multiboot boot specific ::::::::::::::::::::::::::: 44 2.3.11 Debug/Expert options ::::::::::::::::::::::::::::::::::: 45 2.3.12 Generic object creation :::::::::::::::::::::::::::::::::: 54 2.3.13 Device URL Syntax ::::::::::::::::::::::::::::::::::::: 66 2.4 Keys in the graphical frontends :::::::::::::::::::::::::::::::: 69 2.5 Keys in the character backend multiplexer ::::::::::::::::::::: 69 2.6 QEMU Monitor ::::::::::::::::::::::::::::::::::::::::::::::: 70 2.6.1 Commands :::::::::::::::::::::::::::::::::::::::::::::::
    [Show full text]
  • Programmer's Guide
    Programmer’s Guide Release 18.02.2 June 15, 2018 CONTENTS 1 Introduction 1 1.1 Documentation Roadmap...............................1 1.2 Related Publications..................................2 2 Overview 3 2.1 Development Environment..............................3 2.2 Environment Abstraction Layer............................4 2.3 Core Components...................................4 2.4 Ethernet* Poll Mode Driver Architecture.......................6 2.5 Packet Forwarding Algorithm Support........................6 2.6 librte_net........................................6 3 Environment Abstraction Layer7 3.1 EAL in a Linux-userland Execution Environment..................7 3.2 Memory Segments and Memory Zones (memzone)................ 11 3.3 Multiple pthread.................................... 12 3.4 Malloc.......................................... 14 4 Service Cores 19 4.1 Service Core Initialization............................... 19 4.2 Enabling Services on Cores............................. 19 4.3 Service Core Statistics................................ 20 5 Ring Library 21 5.1 References for Ring Implementation in FreeBSD*................. 22 5.2 Lockless Ring Buffer in Linux*............................ 22 5.3 Additional Features.................................. 22 5.4 Use Cases....................................... 22 5.5 Anatomy of a Ring Buffer............................... 22 5.6 References....................................... 31 6 Mempool Library 33 6.1 Cookies......................................... 33 6.2 Stats.........................................
    [Show full text]
  • Babel Routing Protocol for Omnet++ More Than Just a New Simulation Module for INET Framework
    Babel Routing Protocol for OMNeT++ More than just a new simulation module for INET framework Vladimír Veselý, Vít Rek, Ondřej Ryšavý Department of Information Systems, Faculty of Information Technology Brno University of Technology Brno, Czech Republic {ivesely, rysavy}@fit.vutbr.cz; [email protected] Abstract—Routing and switching capabilities of computer Device discovery protocols such as Cisco Discovery networks seem as the closed environment containing a limited set Protocol (CDP) and Link Layer Discovery Protocol of deployed protocols, which nobody dares to change. The (LLDP), which verify data-link layer operation. majority of wired network designs are stuck with OSPF (guaranteeing dynamic routing exchange on network layer) and In this paper, we only focus on a Babel simulation model. RSTP (securing loop-free data-link layer topology). Recently, Babel is increasingly more popular seen as the open-source more use-case specific routing protocols, such as Babel, have alternative to Cisco’s Enhanced Interior Gateway Routing appeared. These technologies claim to have better characteristic Protocol (EIGRP). Babel is also considered a better routing than current industry standards. Babel is a fresh contribution to protocol for mobile networks comparing to Destination- the family of distance-vector routing protocols, which is gaining its Sequenced Distance-Vector (DSDV) or Ad hoc On-Demand momentum for small double-stack (IPv6 and IPv4) networks. This Distance-Vector (AODV) routing protocols. Babel is a hybrid paper briefly describes Babel behavior and provides details on its distance vector routing protocol. Although it stems from a implementation in OMNeT++ discrete event simulator. classical distributed Bellman-Ford algorithm, it also adopts certain features from link-state protocols, such as proactive Keywords—Babel, OMNeT++, INET, Routing, Protocols, IPv6, neighbor discovery.
    [Show full text]
  • Session 5: Data Link Control
    Data Communications & Networks Session 4 – Main Theme Data Link Control Dr. Jean-Claude Franchitti New York University Computer Science Department Courant Institute of Mathematical Sciences Adapted from course textbook resources Computer Networking: A Top-Down Approach, 6/E Copyright 1996-2013 J.F. Kurose and K.W. Ross, All Rights Reserved 1 Agenda 1 Session Overview 2 Data Link Control 3 Summary and Conclusion 2 What is the class about? .Course description and syllabus: »http://www.nyu.edu/classes/jcf/csci-ga.2262-001/ »http://cs.nyu.edu/courses/Fall13/CSCI-GA.2262- 001/index.html .Textbooks: » Computer Networking: A Top-Down Approach (6th Edition) James F. Kurose, Keith W. Ross Addison Wesley ISBN-10: 0132856204, ISBN-13: 978-0132856201, 6th Edition (02/24/12) 3 Course Overview . Computer Networks and the Internet . Application Layer . Fundamental Data Structures: queues, ring buffers, finite state machines . Data Encoding and Transmission . Local Area Networks and Data Link Control . Wireless Communications . Packet Switching . OSI and Internet Protocol Architecture . Congestion Control and Flow Control Methods . Internet Protocols (IP, ARP, UDP, TCP) . Network (packet) Routing Algorithms (OSPF, Distance Vector) . IP Multicast . Sockets 4 Course Approach . Introduction to Basic Networking Concepts (Network Stack) . Origins of Naming, Addressing, and Routing (TCP, IP, DNS) . Physical Communication Layer . MAC Layer (Ethernet, Bridging) . Routing Protocols (Link State, Distance Vector) . Internet Routing (BGP, OSPF, Programmable Routers) . TCP Basics (Reliable/Unreliable) . Congestion Control . QoS, Fair Queuing, and Queuing Theory . Network Services – Multicast and Unicast . Extensions to Internet Architecture (NATs, IPv6, Proxies) . Network Hardware and Software (How to Build Networks, Routers) . Overlay Networks and Services (How to Implement Network Services) .
    [Show full text]