DOCSLIB.ORG

Merlin: a Language for Provisioning Network Resources

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Merlin: a Language for Provisioning Network Resources Merlin: A Language for Provisioning Network Resources Robert Soulé* Shrutarshi Basuy Parisa Jalili Marandi* Fernando Pedone* Robert Kleinbergy Emin Gün Sirery Nate Fostery *University of Lugano yCornell University ABSTRACT As a result, there is widespread interest in academia and indus- This paper presents Merlin, a new framework for managing re- try in higher-level programming languages and “northbound” (i.e., sources in software-defined networks. With Merlin, administra- application-facing) APIs that provide convenient control over the tors express high-level policies using programs in a declarative lan- full set of resources available in a network. guage. The language includes logical predicates to identify sets Unfortunately, despite several notable advances, there is still a of packets, regular expressions to encode forwarding paths, and wide gap between the capabilities of existing SDN APIs and the arithmetic formulas to specify bandwidth constraints. The Merlin realities of network management. Current programming languages compiler maps these policies into a constraint problem that deter- focus mostly on packet forwarding and largely ignore functionality mines bandwidth allocations using parameterizable heuristics. It such as bandwidth and packet-processing functions that can only then generates code that can be executed on the network elements be implemented on middleboxes, end hosts, or with custom hard- to enforce the policies. To allow network tenants to dynamically ware [20, 46, 65,3, 50]. Network orchestration frameworks pro- adapt policies to their needs, Merlin provides mechanisms for del- vide powerful mechanisms that handle a larger set of concerns in- egating control of sub-policies and for verifying that modifications cluding middlebox placement and bandwidth [22, 34, 55, 58], but made to sub-policies do not violate global constraints. Experiments they either fail to provide a programmable API to those mecha- demonstrate the expressiveness and effectiveness of Merlin on real- nisms, or expose APIs that are extremely simple (e.g., sequences world topologies and applications. Overall, Merlin simplifies net- of middleboxes). Overall, the challenges of managing real-world work administration by providing high-level abstractions for spec- networks using existing SDN APIs remain unmet. ifying network policies that provision network resources. This paper presents a new SDN programming language designed to fill this gap. This language, called Merlin, provides a collection of high-level programming constructs for (i) classifying packets; Categories and Subject Descriptors (ii) controlling forwarding paths; (iii) specifying packet-processing C.2.4 [Distributed Systems]: Network operating systems functions; and (iv) provisioning bandwidth in terms of maximum ; D.3.2 [Language Classifications]: Specialized application lan- limits and minimum guarantees. These features go far beyond what guages can be realized just using SDN switches or with existing languages like Frenetic [20], Pyretic [47], and Maple [65]. As a result, imple- menting Merlin is non-trivial because it involves determining allo- Keywords cations of network-wide resources such as bandwidth—the simple Software-defined networking, resource management, delegation, compositional translations used in existing SDN compilers cannot verification, Merlin. be readily extended to handle the new features provided in Merlin. The Merlin compiler uses a variety of techniques to determine forwarding paths, map packet-processing functions to network el- 1. INTRODUCTION ements, and allocate bandwidth. These techniques are based on a Network operators today must deal with a wide range of man- unified logical representation of the network that encodes the con- agement challenges from increasingly complex policies to a prolif- straints of the physical topology as well as the constraints expressed eration of heterogeneous devices to ever-growing traffic demands. by the policy. For traffic with bandwidth constraints, the com- Software-defined networking (SDN) provides tools that could be piler uses a mixed-integer program formulation to solve a variant of used to address these challenges, but existing APIs for SDN pro- the multi-commodity flow optimization problem. For traffic with- gramming are either too low-level or too limited in functionality out bandwidth constraints, Merlin leverages properties of regular to enable effective implementation of rich network-wide policies. expressions and finite automata to efficiently generate forwarding trees that respect the path constraints encoded in the logical topol- Permission to make digital or hard copies of all or part of this work for personal or ogy. Handling these two types of traffic separately allows the com- classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation piler to provide a uniform interface to programmers while reducing on the first page. Copyrights for components of this work owned by others than the the size and number of expensive constraint problems it must solve. author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or The compiler also generates configurations for a variety of network republish, to post on servers or to redistribute to lists, requires prior specific permission elements including switches, middleboxes, and end hosts. and/or a fee. Request permissions from [email protected]. Although the configurations emitted by the Merlin compiler are CoNEXT’14, December 2–5, 2014, Sydney, Australia. static, the system also incorporates mechanisms for handling dy- Copyright is held by the owner/author(s). Publication rights licensed to ACM. ACM 978-1-4503-3279-8/14/12 ...$15.00. namically changing policies. Run-time components called negotia- http://dx.doi.org/10.1145/2674005.2674989. loc 2 Locations program below realizes this specification using a sequence of Mer- t 2 Packet-processing functions lin policy statements, followed by a logical formula. Each state- h 2 Packet headers ment contains a variable that tracks the amount of bandwidth used f 2 Header fields by packets processed with that statement, a predicate on packet v 2 Header field values headers that identifies a set of packets, and a regular expression id 2 Identifiers that describes a set of forwarding paths through the network: n 2 N [ x : (ip.src = 192.168.1.1 and pol ::= [s1; ::: ; sn]; φ Policies ip.dst = 192.168.1.2 and s ::= id : p ! r Statements tcp.dst = 20) -> .* dpi .* ; φ ::= max(e; n) j min(e; n) Presburger Formulas y : (ip.src = 192.168.1.1 and j φ1 and φ2 j φ1 or φ2 j ! φ1 ip.dst = 192.168.1.2 and e ::= n j id j e + e Bandwidth Terms tcp.dst = 21) -> .* ; a ::= : j c j a a j a|a j a∗ j ! a Path Expression [z : (ip.src = 192.168.1.1 and ip.dst = 192.168.1.2 and p ::= p and p j p or p j ! p 1 2 1 2 1 Predicates tcp.dst = 80) -> .* dpi *. nat .* ], j h:f = v j true j false max(x + y,50MB/s) and min(z,100MB/s) c ::= loc j t Path Element The statement on the first line asserts that FTP traffic from the host 192.168.1.1 192.168.1.2 Figure 1: Merlin abstract syntax. at IP address to the host at address must travel along a path that includes a packet-processing function that performs deep-packet inspection (dpi). The next two state- tors communicate among themselves to dynamically adjust band- ments identify and constrain FTP control and HTTP traffic between width allocations and verify that the modifications made by other the same hosts respectively. The statement for FTP control traffic negotiators do not lead to policy violations. Again, the design of does not include any constraints on its forwarding path, while the Merlin’s policy language plays a crucial role. The same core lan- HTTP statement includes both a deep-packet inspection (dpi) and guage constructs used by the compiler for mapping policies into a a network address translation (nat) constraint. The formula on the constraint problem provide a concrete basis for analyzing, process- last line declares a bandwidth cap (max) on the FTP traffic, and a ing, and verifying policies modified dynamically by negotatiors. bandwidth guarantee (min) for the HTTP traffic. We have built a working prototype of Merlin, and used it to im- Note that packet-processing functions may modify packet head- plement a variety of practical policies that demonstrate the expres- ers. In this example policy, the nat function will re-write the packet siveness of the language. These examples demonstrate that Mer- IP addresses. To allow such functions to coexist with predicates on lin supports a wide range of network functionality including sim- packet headers that identify sets of traffic, Merlin uses a tag-based ple forwarding policies, richer packet-processing functions such as routing scheme that will be explained in Section 3.4. The rest of deep-packet inspection that are usually implemented on middle- this section describes the constructs used in this policy in detail. boxes, and policies that include bandwidth constraints. We have 2.1 Syntax and semantics also implemented negotiators that realize max-min fair sharing and additive-increase multiplicative-decrease dynamic adaptation schemes. The syntax of the Merlin policy language is defined by the gram- Our experimental evaluation shows that the Merlin compiler can mar in Figure1. A policy is a set of statements, each of which spec- provision and configure real-world datacenter and enterprise net- ifies the handling of a subset of traffic, together with a logical for- works, and that Merlin can be used to obtain better application per- mula that expresses a global bandwidth constraint. For simplicity, formance for data analytics and replication systems. we require that the statements have disjoint predicates and together Overall, this paper makes the following contributions: match all packets. In our implementation, these requirements are enforced using a simple policy pre-processor.
Load more

Recommended publications
  • Network Test and Monitoring Tools
    ajgillette.com Technical Note Network Test and Monitoring Tools Author: A.J.Gillette Date: December 6, 2012 Revision: 1.3 Table of Contents Network Test and Monitoring Tools................................................................................................................1 Introduction.............................................................................................................................................................3 Link Characterization ...........................................................................................................................................4 Summary.................................................................................................................................................................12 Appendix A: NUTTCP..........................................................................................................................................13 Installing NUTTCP ..........................................................................................................................................13 Using NUTTCP .................................................................................................................................................13 NUTTCP Examples..........................................................................................................................................14 Appendix B: IPERF................................................................................................................................................17
    [Show full text]
  • Cloudstate: End-To-End WAN Monitoring for Cloud-Based Applications
    CLOUD COMPUTING 2013 : The Fourth International Conference on Cloud Computing, GRIDs, and Virtualization CloudState: End-to-end WAN Monitoring for Cloud-based Applications Aaron McConnell, Gerard Parr, Sally McClean, Philip Morrow, Bryan Scotney School of Computing and Information Engineering University of Ulster Coleraine, Northern Ireland Email: [email protected], [email protected], [email protected], [email protected], [email protected] Abstract—Modern data centres are increasingly moving to- It is therefore necessary to have a periodic, automated wards more sophisticated cloud-based infrastructures, where means of measuring the state of the WAN link between servers are consolidated, backups are simplified and where any two addresses relevant to the successful delivery of an resources can be scaled up, across distributed cloud sites, if necessary. Placing applications and data stores across sites has application to end-users. This measurement should be taken a cost, in terms of the hosting at a given site, a cost in terms of periodically, with the time between polls being short enough the migration of application VMs and content across a network, that sudden changes in the quality of the WAN are observed, and a cost in terms of the quality of the end-to-end network but far enough part so as not to flood the network with link between the application and the end-user. This paper details monitoring traffic. Data collected from polls should also be a solution aimed at monitoring all relevant end-to-end network links between VMs, storage and end-users.
    [Show full text]
  • Measure Wireless Network Performance Using Testing Tool Iperf
    Measure wireless network performance using testing tool iPerf By Lisa Phifer, SearchNetworking.com Many companies are upgrading their wireless networks to 802.11n for better throughput, reach, and reliability, but getting a handle on your wireless LAN's ( WLAN 's) performance is important to ensure sufficient capacity and coverage. Here, we describe how to quantify network performance using iPerf, a simple, readily-available tool that measures TCP /UDP throughput, loss, and delay. Getting started iPerf was developed to simplify TCP performance tuning by making it easy to measure maximum throughput and bandwidth. When used with UDP, iPerf can also measure datagram loss and delay (aka jitter). iPerf can be run over any kind of IP network, including local Ethernet LANs, Internet access links, and Wi-Fi networks. To use iPerf, you must install two components: an iPerf server (which listens for incoming test requests) and an iPerf client (which launches test sessions). iPerf is available as open source or executable binaries for many operating systems, including Win32, Linux, FreeBSD, MacOS X, OpenBSD, and Solaris. A Win32 iPerf installer can be found at NLANR , while a Java GUI version (JPerf) is available from SourceForge . To measure Wi-Fi performance, you probably want to install iPerf on an Ethernet host upstream from the access point ( AP ) under test -- this will be your server. Next, install iPerf on one or more Wi-Fi laptops -- these will be your clients. This is representative of a typical application flow between Wi-Fi client and wired server. If your goal is to measure AP performance, place your iPerf server on the same LAN as the AP, connected by Fast or Gigabit Ethernet.
    [Show full text]
  • Performance Testing Tools Jan Bartoň 30/10/2003
    CESNET technical report number 18/2003 Performance Testing Tools Jan Bartoň 30/10/2003 1 Abstract The report describes properties and abilities of software tools for performance testing. It also shows the tools comparison according to requirements for testing tools described in RFC 2544 (Benchmarking Terminology for Network Intercon- nection Devices). 2 Introduction This report is intended as a basic documentation for auxiliary utilities or pro- grams that have been made for the purposes of evaluating transfer performance between one or more PCs in the role of traffic generators and another one on the receiving side. Section 3 3 describes requirements for software testing tools according to RFC 2544. Available tools for performance testing are catalogued by this document in section 4 4. This section also shows the testing tools com- patibility with RFC 2544 and the evaluation of IPv6 support. The summary of supported requirements for testing tools and IPv6 support can be seen in section 5 5. 3 Requirements for software performance testing tools according to RFC-2544 3.1 User defined frame format Testing tool should be able to use test frame formats defined in RFC 2544 - Appendix C: Test Frame Formats. These exact frame formats should be used for specific protocol/media combination (ex. IP/Ethernet) and for testing other media combinations as a template. The frame size should be variable, so that we can determine a full characterization of the DUT (Device Under Test) performance. It might be useful to know the DUT performance under a number of conditions, so we need to place some special frames into a normal test frames stream (ex.
    [Show full text]
  • How to Generate Realistic Network Traffic? Antoine VARET and Nicolas LARRIEU ENAC (French Civil Aviation University) - Telecom/Resco Laboratory
    How to generate realistic network traffic ? Antoine Varet, Nicolas Larrieu To cite this version: Antoine Varet, Nicolas Larrieu. How to generate realistic network traffic ?. IEEE COMPSAC 2014, 38th Annual International Computers, Software & Applications Conference, Jul 2014, Västerås, Swe- den. pp xxxx. hal-00973913 HAL Id: hal-00973913 https://hal-enac.archives-ouvertes.fr/hal-00973913 Submitted on 4 Oct 2014 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. How to generate realistic network traffic? Antoine VARET and Nicolas LARRIEU ENAC (French Civil Aviation University) - Telecom/Resco Laboratory ABSTRACT instance, an Internet Service Provider (ISP) providing access for Network engineers and designers need additional tools to generate software engineering companies manage a different profile of data network traffic in order to test and evaluate, for instance, communications than an ISP for private individuals [2]. However, application performances or network provisioning. In such a there are some common characteristics between both profiles. The context, traffic characteristics are the most important part of the goal of the tool we have developed is to handle most of Internet work. Indeed, it is quite easy to generate traffic, but it is more traffic profiles and to generate traffic flows by following these difficult to produce traffic which can exhibit real characteristics different Internet traffic properties.
    [Show full text]
  • Openss7 IPERF Utility Installation and Reference Manual Version 2.0 Edition 8 Updated 2008-10-31 Package Iperf-2.0.8
    OpenSS7 IPERF Utility Installation and Reference Manual Version 2.0 Edition 8 Updated 2008-10-31 Package iperf-2.0.8 Brian Bidulock <[email protected]> for The OpenSS7 Project <http://www.openss7.org/> Copyright c 2001-2006 OpenSS7 Corporation <http://www.openss7.com/> Copyright c 1997-2000 Brian F. G. Bidulock <[email protected]> All Rights Reserved. Published by OpenSS7 Corporation 1469 Jefferys Crescent Edmonton, Alberta T6L 6T1 Canada This is texinfo edition 8 of the OpenSS7 IPERF Utility documentation, and is consistent with Iperf 2.0. This manual was developed under the OpenSS7 Project and was funded in part by OpenSS7 Corporation. Permission is granted to make and distribute verbatim copies of this manual provided the copyright notice and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this manual under the con- ditions for verbatim copying, provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this manual into another lan- guage, under the same conditions as for modified versions. i Short Contents Preface ::::::::::::::::::::::::::::::::::::::::::::::::: 1 Quick Start Guide :::::::::::::::::::::::::::::::::::::::: 9 1 Introduction :::::::::::::::::::::::::::::::::::::::: 15 2 Objective ::::::::::::::::::::::::::::::::::::::::::: 17 3 Reference ::::::::::::::::::::::::::::::::::::::::::: 19 4 Conformance ::::::::::::::::::::::::::::::::::::::::
    [Show full text]
  • Realistic Network Traffic Profile Generation: Theory and Practice
    Realistic Network Traffic Profile Generation : Theory and Practice Antoine Varet, Nicolas Larrieu To cite this version: Antoine Varet, Nicolas Larrieu. Realistic Network Traffic Profile Generation : Theory and Practice. Computer and Information Science, Canadian Center of Science and Education, 2014, 7 (2), pp 1-16. 10.5539/cis.v7n2p1. hal-00955420 HAL Id: hal-00955420 https://hal-enac.archives-ouvertes.fr/hal-00955420 Submitted on 4 Mar 2014 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. Realistic network traffic profile generation: theory and practice Antoine Varet1 & Nicolas Larrieu1 1 ENAC Telecom/Resco Laboratory, Toulouse, France Correspondence: Nicolas Larrieu, ENAC, E-mail: [email protected] Abstract Network engineers and designers need additional tools to generate network traffic in order to test and evaluate application performances or network provisioning for instance. In such a context, traffic characteristics are the very important part of the work. Indeed, it is quite easy to generate traffic but it is more difficult to produce traffic which can exhibit real characteristics such as the ones you can observe in the Internet. With the lack of adequate tools to generate data flows with “realistic behaviors” at the network or transport level, we needed to develop our tool entitled “SourcesOnOff”.
    [Show full text]
  • A Tool for Evaluating Network Protocols
    XIOPerf : A Tool For Evaluating Network Protocols John Bresnahan, Rajkumar Kettimuthu and Ian Foster Mathematics and Computer Science Division Argonne National Laboratory Argonne, Illinois 60439 Email: {bresnaha,kettimut,foster}@mcs.anl.gov Abstract— The nature of Grid and distributed computing user typically has one simple question. What protocol is best implies network communication between heterogeneous systems for my needs? over a wide and ever-changing variety of network environments. Answering that question on paper can be a difficult task. Often times large amounts of data is stored in remote locations and must be transmitted in bulk. It is desirable to have the bulk Many factors must be identified and considered. Every proto- data transfers be as fast as possible, however due to the dynamic col has its strengths and could be a potential candidate. There networks involved it is often hard to predict what protocol will is no single fastest protocol for every situation. The best choice provide the fastest service for a given situation. In this paper most often depends on the environment in which the users we present XIOPerf, a network protocol testing and evaluation application exists. The user must consider at a minimum the tool. XIOPerf is a command line program written on top of GlobusXIO with a simple and well defined interface to many following parameters: different protocol implementations. XIOPerf was created to give Network type: Is it a dedicated link, or does some users a way to quickly and easily experiment with an open quality of service guarantee that a portion of the ended set of protocols over real networks to determine which will bandwidth is dedicated to the user? best suit their needs.
    [Show full text]
  • EXPERIMENTS on VIDEO STREAMING OVER COMPUTER NETWORKS Steven Becker University of Nebraska-Lincoln
    University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln CSE Technical reports Computer Science and Engineering, Department of 2012 EXPERIMENTS ON VIDEO STREAMING OVER COMPUTER NETWORKS Steven Becker University of Nebraska-Lincoln Follow this and additional works at: http://digitalcommons.unl.edu/csetechreports Becker, Steven, "EXPERIMENTS ON VIDEO STREAMING OVER COMPUTER NETWORKS" (2012). CSE Technical reports. 156. http://digitalcommons.unl.edu/csetechreports/156 This Article is brought to you for free and open access by the Computer Science and Engineering, Department of at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in CSE Technical reports by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. EXPERIMENTS ON VIDEO STREAMING OVER COMPUTER NETWORKS by Steven Becker A PROJECT REPORT Presented to the Faculty of The Graduate College at the University of Nebraska In Partial Fulfillment of Requirements For the Degree of Master of Science Major: Computer Science Under the Supervision of Dr. Byrav Ramamurthy Lincoln, Nebraska December, 2012 EXPERIMENTS ON VIDEO STREAMING OVER COMPUTER NETWORKS Steven Becker, M.S. University of Nebraska, 2012 Adviser: Dr. Byrav Ramamurthy Video traffic (including streaming video service) is dominating the Internet traffic today. Video can be streamed using a dedicated server, a content delivery network (CDN), or peer-to-peer (P2P) overlays across a network. Video can be transmitted in multiple formats and at different resolutions. Video is also being distributed to a variety of devices (fixed and mobile). In this project, we investigate the evolution of streaming video standards over time and the corresponding effects on the Internet that have occurred as a direct result of increasing video traffic.
    [Show full text]
  • Vysoke´Ucˇenítechnicke´V Brneˇ
    VYSOKE´ UCˇ ENI´ TECHNICKE´ V BRNEˇ BRNO UNIVERSITY OF TECHNOLOGY FAKULTA INFORMACˇ NI´CH TECHNOLOGII´ U´ STAV INFORMACˇ NI´CH SYSTE´ MU˚ FACULTY OF INFORMATION TECHNOLOGY DEPARTMENT OF INFORMATION SYSTEMS NA´ STROJE PRO TESTOVA´ NI´ PROPUSTNOSTI SI´TEˇ BAKALA´ Rˇ SKA´ PRA´ CE BACHELOR’S THESIS AUTOR PRA´ CE PAVOL LOFFAY AUTHOR BRNO 2013 VYSOKE´ UCˇ ENI´ TECHNICKE´ V BRNEˇ BRNO UNIVERSITY OF TECHNOLOGY FAKULTA INFORMACˇ NI´CH TECHNOLOGII´ U´ STAV INFORMACˇ NI´CH SYSTE´ MU˚ FACULTY OF INFORMATION TECHNOLOGY DEPARTMENT OF INFORMATION SYSTEMS NA´ STROJE PRO TESTOVA´ NI´ PROPUSTNOSTI SI´TEˇ COMPARISON OF OPEN-SOURCE SOFTWARE TOOLS FOR NETWORK DIAGNOSTICS BAKALA´ Rˇ SKA´ PRA´ CE BACHELOR’S THESIS AUTOR PRA´ CE PAVOL LOFFAY AUTHOR VEDOUCI´ PRA´ CE Ing. PETR MATOUSˇ EK, Ph.D. SUPERVISOR BRNO 2013 Abstrakt Cílem této práce je vytvoøit re¹er¹i existujících open source nástrojù, které jsou zaměřeny na diagnostiku síťového provozu pomocí měření propustnosti a dalších základních para- metrù. Práce se věnuje vytvoření metodiky pro testování a vzájemné porovnání nástrojù. Výsledkem práce je doporučení pro běžného uživatele spočívající v doporučení správného nástroje pro měření příslušného parametru síťového provozu. Abstract The aim of this work is to make a research of existing open source tools, which are concerned with the diagnosis of the network transmission in the form of measuring of throughput and other basic parameters. The work is devoted to the construction of methodics for testing and comparing devices between themselves. The result of the
    [Show full text]
  • Lab 2: Network Traffic Monitoring and Performance Measurement
    Lab 2: Network Traffic Monitoring and Performance Measurement Instructor: Ning Weng, Office EGRE 119, Office hour: MW 2:15-3:45pm Lab Assistant: Fahad A. Alduraibi; Office EGRE 112, Office hour Tu: 11:00am-12:00pm; Fri: 10:00-11:00am Lab due: Sep. 26, Wed. in class The goal of this lab is to use basic network tools to capture network ² record: what is the average, minimum and maximum delay packets and measure network performance (delay and throughput). It between your test machine with target machine? is recommended that you follow the steps. Be sure to record and save B. Case 2: traceroute what your observed, which will be part of your lab report. To perform this lab, you need one machine (either linux, unix or ² Open page http://network-tools.com/ windows with cygwin) with Internet access. In case that your system ² Change the destination IP address to 206.166.70.78 and hit enter. doesn’t have the tools, you can download them from the following ² Record: links: 1. Copy the traceroute output. 2. How many routers are there between 206.166.70.78 and ² wireshark: http://www.wireshark.org http://network-tools.com/? ² iperf: http://dast.nlanr.net/projects/Iperf/#download 3. What is the average, minimum and maximum delay between I. NETWORK PACKETS CAPTURE 206.166.70.78 and http://network-tools.com/? 4. Explain the mechanisms that traceroute generates delays to A. Case 1: ping different hops. Should the delay incrementally increase with ² Launch wireshark. the hop increasing? ² Click “start” from the “capture” menu.
    [Show full text]
  • DPDK Vhost/Virtio Performance Report Release 17.02
    DPDK Vhost/Virtio Performance Report Release 17.02 Test Date: Mar 1st 2017 Author: Intel DPDK Validation team DPDK Performance Report Release 17.02 Revision History Date Revision Comment Mar 1st, 2017 1.0 Initial document for release 2 DPDK Performance Report Release 17.02 Contents Audience and Purpose ................................................................................................. 4 Test setup: ................................................................................................................ 4 Intel® Xeon® Processor E5-2680 v2 (25M Cache, 2.80 GHz) .......................................... 7 Hardware & Software Ingredients ............................................................................ 7 Test Case 1 – DPDK PVP RFC2544 zero packet loss test ............................................. 9 Test Case 2 – DPDK VM2VM iperf performance test ................................................. 10 3 DPDK Performance Report Release 17.02 Audience and Purpose The primary audience for this test report are architects and engineers implementing the Data Plane Development Kit (DPDK). This report provides information on packet processing performance testing for the specified DPDK release on Intel® architecture. The initial report may be viewed as the baseline for future releases and provides system configuration and test cases based on DPDK examples. The purpose of reporting these tests is not to imply a single “correct” approach, but rather to provide a baseline of well-tested configurations and procedures
    [Show full text]