Trickle: a Userland Bandwidth Shaper for Unix-Like Systems

Total Page:16

File Type:pdf, Size:1020Kb

Trickle: a Userland Bandwidth Shaper for Unix-Like Systems Trickle: A Userland Bandwidth Shaper for Unix-like Systems Marius A. Eriksen∗ Google, Inc. [email protected] Abstract traffic management. More likely, the need for band- width shaping is largely ad-hoc, to be employed when As with any finite resource, it is often necessary to ap- and where it is needed. For example, ply policies to the shared usage of network resources. Existing solutions typically implement this by employ- • bulk transfers may adversely impact an interactive ing traffic management in edge routers. However, users session and the two should receive differentiated of smaller networks regularly find themselves in need services, or of nothing more than ad-hoc rate limiting. Such net- works are typically unmanaged, with no network admin- • bulk transfers may need to be prioritized. istrator(s) to manage complicated traffic management Furthermore, such users may not have administrative ac- schemes. Trickle bridges this gap by providing a simple cess to their operating system(s) or network infrastruc- and portable solution to rate limit the TCP connections ture in order to apply traditional bandwidth shaping tech- of a given process or group of processes. niques. Trickle takes advantage of the Unix dynamic loader’s Some operating systems provide the ability to shape preloading functionality to interposition itself in front of traffic of local origin (these are usually extensions to the the BSD socket API provided by the system’s libc. Run- router functionality provided by the OS). This function- ning entirely in user space, shapes network traffic by de- ality is usually embedded directly in the network stack laying and truncating socket I/Os without requiring ad- and resides in the operating system kernel. Network traf- ministrator privileges. Instances of Trickle can coop- fic is not associated with the local processes responsible erate, even across networks allowing for the specifica- for generating the traffic. Rather, other criteria such as tion of global rate limiting policies. Due to the preva- IP, TCP or UDP protocols and destination IP addresses lence of BSD sockets and dynamic loaders, Trickle enjoys are used in classifying network traffic for shaping. These the benefit of portability accross a multitude of Unix-like policies are typically global to the host (thus applying to platforms. all users on it). Since these policies are mandatory and global, it is the task of the system administrator to man- 1 Introduction age the traffic policies. These are the many burdens that become evident if one Bandwidth shaping is traditionally employed monolith- would like to employ bandwidth shaping in an ad-hoc ically as part of network infrastructure or in the local manner. While there have been a few attempts to add operating system kernel which works well for provid- voluntary bandwidth shaping capabilities to the afore- ing traffic management to large networks. Such solutions mentioned in-kernel shapers[25], there is still a lack of typically require dedicated administration and privileged a viable implementation and there is no use of collabo- access levels to network routers or the local operating ration between multiple hosts. These solutions are also system. non-portable and there is a lack of any standard applica- Unmanaged network environments without any set tion or user interfaces. bandwidth usage policies (for example home and small We would like to be able to empower any unprivi- office networks) typically do not necessitate mandatory leged user to employ rate limiting on a case-by-case ba- sis, without the need for special kernel support. Trickle ∗Work done by the author while at the University of Michigan. addresses precisely this scenario: Voluntary ad-hoc rate USENIX Association FREENIX Track: 2005 USENIX Annual Technical Conference 61 limiting without the use of a network wide policy. the link editor maps the specified libraries into memory Trickle is a portable solution to rate limiting and it runs and resolves all external symbols. The existence of any entirely in user space. Instances of Trickle may col- unresolved symbols at this stage results in a run time er- laborate with each other to enforce a network wide rate ror. limiting policy, or they may run independently. Trickle To load load its middleware into memory, Trickle only works properly with applications utilizing the BSD uses a feature of link editors in Unix-like systems called socket layer with TCP connections. We do not feel this preloading. Preloading allows the user to specify a list of is a serious restriction: Recent measurements attribute shared objects that are to be loaded together the shared li- TCP to be responsible for over 90% of the volume of braries. The link editor will first try to resolve symbols to traffic in one major provider’s backbone[16]. The major- the preload objects (in order), thus selectively bypassing ity of non-TCP traffic is DNS (UDP) – which is rarely symbols provided by the shared libraries specified by the desirable to shape anyway. program. Trickle uses preloading to provide an alterna- We strive to maintain a few sensible design criteria for tive version of the BSD socket API, and thus socket calls Trickle: are now handled by Trickle. This feature has been used chiefly for program and systems diagnostics; for exam- • Semantic transparency: Trickle should never ple, to match malloc to free calls, one would provide change the behavior or correctness of the process an alternative of these functions via a preload library that it is shaping (Other than the data transfer rates). has the additional matching functionality. In practice, this feature is used by listing the libraries • Portability: Trickle should be extraordinarily portable, working with any Unix-like operating sys- to preload in an environment variable. Preloading does tem that has shared library and preloading support. not work for set-UID or set-GID binaries for security rea- sons: A user could perform privilege elevation or arbi- • Simplicity: No need for excessively expressive poli- trary code execution by specifying a preload object that cies that confuse users. Don’t add features that will defines some functionality that is known to be used by be used by only 1 in 20 users. No setup cost, a user the target application. should be able to immediately make use of Trickle We are interested in interpositioning Trickle in be- after examining just the command line options (and tween the shaped process and the socket implementa- there should be very few command line options). tion provided by the system. Another way to look at it, is that Trickle acts as a proxy between the two. We The remainder of this paper is organized as follows: need some way to call the procedures Trickle is proxy- Section 2 describes the linking and preloading features ing. The link editor provides this functionality through of modern Unix-like systems. Section 3 provides a high- an API that allows a program to load an arbitrary shared level overview of Trickle. Section 4 discusses the details object to resolve any symbol contained therein. The API of Trickle’s scheduler. In section 5 we discuss related is very simple: Given a string representation of the sym- work. Finally, section 9 concludes. bol to resolve, a pointer to the location of that symbol is returned. A common use of this feature is to provide 2 Linking and (Pre)Loading plug-in functionality wherein plugins are shared objects and may be loaded and unloaded dynamically. Dynamic linking and loading have been widely used in Figure 1 illustrates Trickle’s interpositioning. Unix-like environments for more than a decade. Dy- namic linking and loading allow an application to refer to an external symbol which does not need to be resolved 3 How Trickle Works to an address in memory until the runtime of the particu- lar binary. The canonical use of this capability has been We describe a generic rate limiting scheme defining a to implement shared libraries. Shared libraries allow an black-box scheduler. We then look at the practical as- operating system to share one copy of commonly used pects of how Trickle interpositions its middleware in or- code among any number of processes. We refer to re- der to intercept socket calls. Finally we discuss how mul- solving these references to external objects as link edit- tiple instances of Trickle collaborate to limit their aggre- ing, and to unresolved external symbols simply as exter- gate bandwidth usage. nal symbols. After compilation, at link time, the linker specifies a 3.1 A Simple Rate Limiting Scheme list of libraries that are needed to resolve all external symbols. This list is then embedded in the final exe- A process utilizing BSD sockets may perform its own cutable file. At load time (before program execution), rate limiting. For upstream limiting, the application can 62 FREENIX Track: 2005 USENIX Annual Technical Conference USENIX Association do this by simply limiting the rate of data that is writ- application ten to a socket. Similarly, for downstream limiting, an recv() send() ioctl() printf() application may limit the rate of data it reads from a libtrickle.so socket. However, the reason why this works is not imme- delaysmooth() diately obvious. When the application neglects to read libc.so write() some data from a socket, its socket receive buffers fill up. This in turn will cause the receiving TCP to advertise a OS kernel smaller receiver window (rwnd), creating back pressure sys_send() sys_ioctl() on the underlying TCP connection thus limiting its data sys_recv() sys_write() flow. Eventually this “trickle-down” effect achieves end- to-end rate limiting. Depending on buffering in all layers Figure 1: libtrickle.so is preloaded in the of the network stack, this effect may take some time to application’s address space, calls to recv() and propagate.
Recommended publications
  • Programmer's Guide
    Programmer’s Guide Release 2.2.0 January 16, 2016 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 Ring Library 19 4.1 References for Ring Implementation in FreeBSD*................. 20 4.2 Lockless Ring Buffer in Linux*............................ 20 4.3 Additional Features.................................. 20 4.4 Use Cases....................................... 21 4.5 Anatomy of a Ring Buffer............................... 21 4.6 References....................................... 28 5 Mempool Library 31 5.1 Cookies......................................... 31 5.2 Stats.......................................... 31 5.3 Memory Alignment Constraints............................ 31 5.4 Local Cache...................................... 32 5.5 Use Cases....................................... 33 6
    [Show full text]
  • The Qosbox: Quantitative Service Differentiation in BSD Routers∗
    The QoSbox: Quantitative Service Differentiation in BSD Routers∗ Nicolas Christin Jorg¨ Liebeherr Information Networking Institute and The Edward S. Rogers Sr. Department of CyLab Japan Electrical and Computer Engineering Carnegie Mellon University University of Toronto 1-3-3-17 Higashikawasaki-cho 10 King’s College Road Chuo-ku, Kobe 650-0044, Japan Toronto, ON M5S 3G4, Canada [email protected] [email protected] Abstract We describe the design and implementation of the QoSbox, a configurable IP router that provides per-hop service differentiation on loss, delays and throughput to classes of traffic. The novel aspects of the QoSbox are that (1) the QoSbox does not rely on any external component (e.g., no traffic shaping and no admission control) to provide the desired service differentiation, but instead, (2) dynamically adapts packet forwarding and dropping decisions as a function of the instantaneous traffic arrivals and allows for temporary relaxation of some service objectives; also, (3) the QoSbox can enforce both absolute and proportional service differentiation on queuing delays, loss rates, and throughput at the same time. We focus on a publicly available implementation of the QoSbox in BSD-based PC-routers. We evaluate our implementation in a testbed of BSD routers over a FastEthernet network, and we sketch how the QoSbox can be implemented in high speed architectures. Keywords: Quality-of-Service Implementations, Service Differentiation, PC-Routers, BSD, High-Speed Networks. ∗Most of this work was done while both authors were with the University of Virginia. This work was supported in part by the National Science Foundation through grants ANI-9730103 and ANI-0085955.
    [Show full text]
  • Pf3e Index.Pdf
    INDEX Note: Pages numbers followed by f, n, priority-based queues, 136–145 or t indicate figures, notes, and tables, match rule for queue assignment, respectively. 137–138 overview, 134–135 Symbols performance improvement, 136–137 # (hash mark), 13, 15 queuing for servers in DMZ, ! (logical NOT) operator, 42 142–144 setting up, 135–136 A on FreeBSD, 135–136 on NetBSD, 136 Acar, Can Erkin, 173 on OpenBSD, 135 ACK (acknowledgment) packets transitioning to priority and class-based bandwidth allocation, queuing system, 131–133 139–140 anchors, 35–36 HFSC algorithm, 124, 126, 142 authpf program, 61, 63 priority queues, 132, 137–138 listing current contents of, 92 two-priority configuration, loading rules into, 92 120–121, 120n1 manipulating contents, 92 adaptive.end value, 188 relayd daemon, 74 adaptive firewalls, 97–99 restructuring rule set with, 91–94 adaptive.start value, 188 tagging to help policy routing, 93 advbase parameter, 153–154 ancontrol command, 46n1 advskew parameter, 153–154, 158–159 antispoof tool, 27, 193–195, 194f aggressive value, 192 ARP balancing, 151, 157–158 ALTQ (alternate queuing) framework, atomic rule set load, 21 9, 133–145, 133n2 authpf program, 59–63, 60 basic concepts, 134 basic authenticating gateways, class-based bandwidth allocation, 60–62 139–140 public networks, 62–63 overview, 135 queue definition, 139–140 tying queues into rule set, 140 B handling unwanted traffic, 144–145 bandwidth operating system-based queue actual available, 142–143 assignments, 145 class-based allocation of, 139–140 overloading to
    [Show full text]
  • Freebsd Handbook
    FreeBSD Handbook http://www.freebsd.org/doc/en_US.ISO8859-1/books/han... FreeBSD Handbook The FreeBSD Documentation Project Copyright © 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013 The FreeBSD Documentation Project Welcome to FreeBSD! This handbook covers the installation and day to day use of FreeBSD 8.3-RELEASE and FreeBSD 9.1-RELEASE. This manual is a work in progress and is the work of many individuals. As such, some sections may become dated and require updating. If you are interested in helping out with this project, send email to the FreeBSD documentation project mailing list. The latest version of this document is always available from the FreeBSD web site (previous versions of this handbook can be obtained from http://docs.FreeBSD.org/doc/). It may also be downloaded in a variety of formats and compression options from the FreeBSD FTP server or one of the numerous mirror sites. If you would prefer to have a hard copy of the handbook, you can purchase one at the FreeBSD Mall. You may also want to search the handbook. REDISTRIBUTION AND USE IN SOURCE (XML DOCBOOK) AND 'COMPILED' FORMS (XML, HTML, PDF, POSTSCRIPT, RTF AND SO FORTH) WITH OR WITHOUT MODIFICATION, ARE PERMITTED PROVIDED THAT THE FOLLOWING CONDITIONS ARE MET: 1. REDISTRIBUTIONS OF SOURCE CODE (XML DOCBOOK) MUST RETAIN THE ABOVE COPYRIGHT NOTICE, THIS LIST OF CONDITIONS AND THE FOLLOWING DISCLAIMER AS THE FIRST LINES OF THIS FILE UNMODIFIED. 2. REDISTRIBUTIONS IN COMPILED FORM (TRANSFORMED TO OTHER DTDS, CONVERTED TO PDF, POSTSCRIPT, RTF AND OTHER FORMATS) MUST REPRODUCE THE ABOVE COPYRIGHT NOTICE, THIS LIST OF CONDITIONS AND THE FOLLOWING DISCLAIMER IN THE DOCUMENTATION AND/OR OTHER MATERIALS PROVIDED WITH THE DISTRIBUTION.
    [Show full text]
  • An Overview of Security in the Freebsd Kernel 131 Dr
    AsiaBSDCon 2014 Proceedings March 13-16, 2014 Tokyo, Japan Copyright c 2014 BSD Research. All rights reserved. Unauthorized republication is prohibited. Published in Japan, March 2014 INDEX P1A: Bold, fast optimizing linker for BSD — Luba Tang P1B: Visualizing Unix: Graphing bhyve, ZFS and PF with Graphite 007 Michael Dexter P2A: LLVM in the FreeBSD Toolchain 013 David Chisnall P2B: NPF - progress and perspective 021 Mindaugas Rasiukevicius K1: OpenZFS: a Community of Open Source ZFS Developers 027 Matthew Ahrens K2: Bambi Meets Godzilla: They Elope 033 Eric Allman P3A: Snapshots, Replication, and Boot-Environments—How new ZFS utilities are changing FreeBSD & PC-BSD 045 Kris Moore P3B: Netmap as a core networking technology 055 Luigi Rizzo, Giuseppe Lettieri, and Michio Honda P4A: ZFS for the Masses: Management Tools Provided by the PC-BSD and FreeNAS Projects 065 Dru Lavigne P4B: OpenBGPD turns 10 years - Design, Implementation, Lessons learned 077 Henning Brauer P5A: Introduction to FreeNAS development 083 John Hixson P5B: VXLAN and Cloud-based networking with OpenBSD 091 Reyk Floeter INDEX P6A: Nested Paging in bhyve 097 Neel Natu and Peter Grehan P6B: Developing CPE Routers based on NetBSD: Fifteen Years of SEIL 107 Masanobu SAITOH and Hiroki SUENAGA P7A: Deploying FreeBSD systems with Foreman and mfsBSD 115 Martin Matuška P7B: Implementation and Modification for CPE Routers: Filter Rule Optimization, IPsec Interface and Ethernet Switch 119 Masanobu SAITOH and Hiroki SUENAGA K3: Modifying the FreeBSD kernel Netflix streaming servers — Scott Long K4: An Overview of Security in the FreeBSD Kernel 131 Dr. Marshall Kirk McKusick P8A: Transparent Superpages for FreeBSD on ARM 151 Zbigniew Bodek P8B: Carve your NetBSD 165 Pierre Pronchery and Guillaume Lasmayous P9A: How FreeBSD Boots: a soft-core MIPS perspective 179 Brooks Davis, Robert Norton, Jonathan Woodruff, and Robert N.
    [Show full text]
  • Managing Traffic with ALTQ
    THE ADVANCED COMPUTING SYSTEMS ASSOCIATION The following paper was originally published in the Proceedings of the FREENIX Track: 1999 USENIX Annual Technical Conference Monterey, California, USA, June 6–11, 1999 Managing Traffic with ALTQ Kenjiro Cho Sony Computer Science Laboratories, Inc., Tokyo © 1999 by The USENIX Association All Rights Reserved Rights to individual papers remain with the author or the author's employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright notice must be included in the reproduced paper. USENIX acknowledges all trademarks herein. For more information about the USENIX Association: Phone: 1 510 528 8649 FAX: 1 510 548 5738 Email: [email protected] WWW: http://www.usenix.org Managing Traffic with ALTQ Kenjiro Cho Sony Computer Science Laboratories, Inc. Tokyo, Japan 1410022 [email protected] Abstract Meters Traffic meters measure the properties of a traf- fic stream (e.g., bandwidth, packet counts). The ALTQ is a package for traffic management. ALTQ measured characteristics are stored as flow state and includes a queueing framework and several advanced used by other functions. queueing disciplines such as CBQ, RED, WFQ and RIO. ALTQ also supports RSVP and diffserv. ALTQ can be Markers Packet markers set a particular value to some configured in a variety of ways for both research and op- portion of the packet header. The written values eration. However, it requires understanding of the tech- could be a priority, congestion information, an ap- nologies to set up things correctly. In this paper, I sum- plication type, or other types of information.
    [Show full text]
  • The Click Modular Router
    The Click Modular Router EDDIE KOHLER, ROBERT MORRIS, BENJIE CHEN, JOHN JANNOTTI, and M. FRANS KAASHOEK Laboratory for Computer Science, MIT Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement sim- ple router functions like packet classification, queueing, scheduling, and interfacing with network devices. A router configuration is a directed graph with elements at the vertices; packets flow along the edges of the graph. Several features make individual elements more powerful and com- plex configurations easier to write, including pull connections, which model packet flow driven by transmitting hardware devices, and flow-based router context, which helps an element locate other interesting elements. Click configurations are modular and easy to extend. A standards-compliant Click IP router has sixteen elements on its forwarding path; some of its elements are also useful in Ethernet switches and IP tunneling configurations. Extending the IP router to support dropping policies, fairness among flows, or Differentiated Services simply requires adding a couple elements at the right place. On conventional PC hardware, the Click IP router achieves a maximum loss-free forwarding rate of 333,000 64-byte packets per second, demonstrating that Click's modular and flexible architecture is compatible with good performance. Categories and Subject Descriptors: C.2.1 [Computer-Communication Networks]: Network Architecture and Design|Packet-switching networks; C.2.6 [Computer-Communication Net- works]: Internetworking|Routers; D.2.11 [Software Engineering]: Software Architectures| Domain-specific architectures General Terms: Design, Management, Performance Additional Key Words and Phrases: Routers, component systems, software router performance An article describing a previous version of this system was published in Operating Systems Review 34(5) (Proceedings of the 17th Symposium on Operating Systems Principles), pp 217{231, December 1999.
    [Show full text]
  • Software Defined Networking with Openflow Switches & BCN
    International Journal of Recent Technology and Engineering (IJRTE) ISSN: 2277-3878, Volume-8 Issue-5, January 2020 SDNOFS: Software Defined Networking with OpenFlow Switches & BCN-ECN with ALTQ for Congestion Avoidance Vamshi Krishna Sabbi, Azad Shrivastava, Sunil J. Wagh, T. V. Prasad Abstract: High-performance computing cluster in a cloud that will enable to prevent congestion with primary environment. High-performance computing (HPC) helps advantages of centralized method provisioning, lower scientists and researchers to solve complex problems involving operation cost, guaranteed content delivery [1]. Recent SDN multiple computational capabilities. The main reason for using a studies show that single point of failure in typical networks message passing model is to promote application development, porting, and execution on the variety of parallel computers that is not able to meet the growing demand-based security can support the paradigm. Since congestion avoidance is critical issues of all components in the network, creating a complex for the efficient use of different applications, an efficient method structure that is difficult to manage. [2] That's right. the for congestion management in software-defined networks based generic Open Flow network comprises with three on Open Flow protocol has been presented. This paper proposed components: the Open Flow controller, the Open Flow two methods; initially, to avoid the congestion problem used by switch and the hosts. Each of the switches Hot spot traffic Software Defined Networks (SDN) with open flow switches, this method was originally defined as a communication protocol in patterns, network business, defective area routing and SDN environments which allows the SDN controller to interact frequency / voltage connection scaling (lower connection directly with the forwarding plane of network devices such as speed to save power) both can make a significant switches and routers, both physical and virtual (hypervisor- contribution to congestion.[3].
    [Show full text]
  • 1999 USENIX Annual Technical Conference
    CONFERENCE WEB SITE: http://www.usenix.org/events/usenix99/ May 3,1999. Pre-registration savings deadline 19991999 USENIXUSENIX AnnualAnnual TechnicalTechnical ConferenceConference JUNEJUNE 6–11,6–11, 1999 1999 MONTEREYMONTEREY CONFERENCECONFERENCE CENTERCENTER MONTEREY,MONTEREY, CALIFORNIA, CALIFORNIA, USA USA "USENIX has always been a great event offering high-quality sessions, broken up into tutorials, an exhibition and a technical conference, that tends to draw a very seriously technical crowd" Phil Hughes, Linux Journal TalkTalk toto youryour peerspeers andand leading-edgeleading-edge developers,sharedevelopers,share problemsproblems andand theirtheir solutions,andsolutions,and bringbring homehome ideas,techniquesideas,techniques andand technologiestechnologies you'llyou'll applyapply immediately.immediately. SponsoredSponsored byby TheThe USENIXUSENIX AssociationAssociation USENIX Conference Office Non-Profit 22672 Lambert Street, Suite 613 Organization Lake Forest, CA 92630 US Postage PAID Phone: 1.949.588.8649 USENIX Fax: 1.949.588.9706 Association Email: [email protected] Office hours: 8:30 am–5:00 pm Pacific Time Please pass the brochure along to a colleague! y er b egist .R 1999. ve ents/usenix99 a ay 3, v S M g/e 19991999 USENIXUSENIX .usenix.or www AAnnnnuauall TTeecchhnniiccaall CCoonnffeerreennccee JUNEJUNE 6–11,6–11, 19991999 MONTEREMONTEREYY CCONFERENCEONFERENCE CENTERCENTER MONTEREMONTEREYY,, CCALIFORNIA,ALIFORNIA, USAUSA A renowned conference by and for programmers,, developers,,and system administrators workinging inin adadvvanced systems and software.. Refereed papers track—at the heart of our reputation for cutting-edge technical excellence—this year’s highly current interest research reports cover resource management, file systems, virtual memory systems, security, Web server performance, storage systems, O/S performance, and more. The FREENIX track—top-quality technical presentations on the latest developments in the world of freely redistributable software, including the business side of developing open source software.
    [Show full text]
  • Certreq-BSDA-2012.Pdf
    BSDA Certification Requirements Document November 15, 2012 Version 1.1 Copyright © 2012 BSD Certification Group All Rights Reserved. All trademarks are owned by their respective companies. This work is protected by a Creative Commons License which requires Attribution and prevents Commercial and Derivative works. The human friendly version of the license can be viewed at http://creativecommons.org/licenses/by/3.0/ which also provides a hyperlink to the legal code. These conditions can only be waived by written permission from the BSD Certification Group. See the website for contact details. Cover design by Jenny Rosenberg BSDA Certification Requirements Document November 15, 2012 PREFACE Welcome! This document introduces the BSD Associate (BSDA) examination and describes in considerable detail the objectives covered by the exam. The exam covers material across all four major projects of BSD Unix - NetBSD, FreeBSD, OpenBSD and DragonFly BSD. While the testing candidate is expected to know concepts and practical details from all four main projects, it is not necessary to know all the details of each one. A thorough reading of this document is recommended to understand which concepts and practical details are expected to be mastered. Throughout this document, a clear distinction is placed on 'recognizing' and 'understanding', versus 'demonstrating' and 'performing'. Certain objectives call for the mere understanding of certain topics, while others call for the ability to demonstrate performance level knowledge of the topic. The difference is an important one, and should be remembered. Successful mastery of the BSDA examination will, in most cases, require study and practice. The requirements for the exam encompass more background in BSD than is common among casual users or those new to BSD.
    [Show full text]
  • Dfly Usenix2005 Bsd.Pdf
    WWW.DRAGONFLYBSD.ORG What Is DragonFly? ●Forked off of FreeBSD-4.x ~2 years ago. ●A ground-up reworking of traditional BSD programming models to achieve our goals. ●A new approach to SMP scaleability in the BSD world. ●Designing for long-term code maintainability and robustness. ●Designing for long-term forwards and backwards compatibility. ●Uber Goal is transparent, natively-supported, fully cache coherent single-system-image clustering, with all the trimmings. ●A parallel effort is being undertaken to improve userland. DragonFly Kernel Side Programming Methodologies ●A Threaded, cpu-localized approach to parallelism ●Very little differentiation between UP and SMP coding practices. ●Minimal UP vs SMP tradeoffs. ●Concept of natural ownership of data structures (either by a cpu or by a thread) for which no synchronization is necessary to access. ●Focus on greatly simplifying the programming model. ●But the best algorithms are not always quite that simple. ●Synchronous cross-cpu data access more expensive, but there are plenty of ways to remove the issue from the critical path and the APIs can be very simple. DragonFly User side system methodologies ●Target mainstream installs, assume that large scale customization will use a different installation and upgrade mechanism. ●Make a clear distinction between files owned by the installation, and files that can be adjusted by the system operator to simplify the upgrade regimen and reduce confusion. ●Ultimate goal is to provide production-level support by emphasizing forwards and backwards compatibility. ●Biggest single problem is the package management system. ●Second biggest problem is kernel data structure visibility in userland. ●Third biggest problem is kernel syscall compatibility over time.
    [Show full text]
  • Firewalling with Openbsd's PF Packet Filter
    Firewalling with OpenBSD’s PF packet filter Peter N. M. Hansteen [email protected] Copyright © 2005 - 2012 Peter N. M. Hansteen This document is © Copyright 2005 - 2012, Peter N. M. Hansteen. All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS DOCUMENTATION IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. The document is a ’work in progress’, based on a manuscript prepared for a lecture at the BLUG (see http://www.blug.linux.no/) meeting of January 27th, 2005. Along the way it has spawned several conference tutorials as well as The Book of PF (http://nostarch.com/pf2.htm) (second edition, No Starch Press November 2010), which expands on all topics mentioned in this document presents several topics that are only hinted at here.
    [Show full text]