DOCSLIB.ORG

Applying MLS To

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Applying MLS To Applying a Multi-level Security Mechanism to a Network Address Translation Scheduler Arthur McDonald1 and Haklin Kimm1 Haesun Lee2 and Ilhyun Lee2 1Computer Science Department 2Department of Science and Mathematics East Stroudsburg University of Pennsylvania University of Texas of the Permian Basin East Stroudsburg PA 18301 4901 E. University Blvd. Odessa, TX 79762 E-mail: [email protected] E-mail: [email protected] Abstract - In this paper, we consider a scheduling on their security levels. Using the algorithm that we algorithm being applied with multi-level security that present in this paper, information can be kept at allows two or more hierarchical classification levels of several levels of security on separate server machines, information to be processed simultaneously. There are which will only grant access to the data if the security various load scheduling algorithms pre-built into the Linux level of the client machine is identifiable and has Virtual Server system that have been tested and proven effective for distributing the load among the real servers. been given the proper security clearance. The While these algorithms may work effectively, there is no security levels are statically assigned by the security current scheduling algorithm that considers a multi-level administrator of the LVS and as of this writing there security protocol to determine which clients have access is no way to bypass the scheduler. rights among the servers. 1. Introduction 2. Linux Virtual Servers One of the main concepts in a Linux Virtual In the late 1990s, several open source developers Server is the ability for the director to forward data created a software package for Linux to take packets sent by the client to the appropriate real advantage of scalability and cluster computing. The server and vice-versa. There are three ways for the Linux Virtual Server (LVS) project allows many director to perform this task: Network Address machines to be networked together into a highly Translation (NAT), IP-Tunneling and Direct Routing. available, high performance virtual server. While it seemingly appears to be a single server to machines 2.1 Network Address Translation (NAT) outside of the cluster (referred to as clients), the Network Address Translation (NAT) is a way of machine may consist of hundreds of separate servers, manipulating the source and/or the destination handling requests for HTTP, FTP, DNS, TELNET or address of a data packet. As described in [2, 12], others. When a client connects to the cluster of data packets contain both address information, such servers, the connection is processed by the director, as the IP address of the source and destination, as or master node of the virtual server. The director well as data. NAT works on the theory that the sends these connections, referred to as the load, to addressing information is independent from the data. one of the many servers in the cluster based on some Therefore, a machine stationed somewhere along the scheduling algorithm. route between the source machine and the intended As of now, there are several load scheduling destination could change the addressing information algorithms already developed and implemented in (or any other information in the packet header) LVS, including round-robin, least-connection, without affecting the connection [4, 12]. destination hashing and source hashing. While these Traditionally, a machine acting as a Network scheduling algorithms work well in various situations, Address Translator is used to connect an isolated there is no way for the administrator to specify, based range of private IP addresses, such as a Virtual on some protocol, what security level clients can Private Network (VPN), to an external realm of have to access certain servers in the cluster. globally unique IP addresses, such as the Internet. We present the implementation of a multi-level When a private network’s internal IP addresses security load scheduling algorithm for Linux Virtual cannot be used outside of the network because they Servers. A multilevel secure (MLS) system is defined are invalid or for security reasons the addresses must as a system with a mode of operation that allows two be kept within the private network, Network Address or more hierarchical classification levels of Translation is used [7]. information to be processed simultaneously [1,3,10,11,15] . 2.2 IP Tunneling Security administrators can specify which users IP Tunneling, sometimes referred to as IP are authorized to access data and programs depending encapsulation, is a technique to encapsulate an IP packet within IP packets. When a client requests a This algorithm is considered a dynamic scheduling service from the LVS, a packet destined for the algorithm because it needs to count the live virtual IP address is examined by the director, which connections for each server dynamically. chooses the real server using the scheduling algorithm. The director then encapsulates the packet 3.4 Weighted Least Connection within the data section of another IP packet and The weighted least connection scheduling forwards it to the destined real server [17]. When the algorithm is a superset of the least connection encapsulated packet reaches the real server, it algorithm, in which weights can also be assigned to decapsulates the packet and processes the request. real servers. Real servers with a higher weight will However, data sent back to the client from the real receive a larger percentage of the connections. server is not routed back through the director; the real server has the IP address of the client, which was in 3.5 Destination/source Hash Scheduling the header of the encapsulated packet. The real server The destination hash scheduling algorithm uses a sends all results directly to the client address. static hash table to look up the destination IP address of data packets and assign a real server accordingly. 2.3 Direct Routing Source hash scheduling is similar to the destination In a Linux Virtual Server that uses Direct hash algorithm, except that the real server is chosen Routing as the forwarding method, all machines are based on the source IP address of the data packet. configured to accept data to the Virtual IP address of Unfortunately, there is not much documentation on the LVS [8, 16]. When a client requests a service, the destination or the source hash scheduling the director examines the packet and determines if it algorithms as these are still considered experimental. matches a service offered by the LVS. If there is a match, then a real server is chosen using the 4. Scheduling with Multilevel Security scheduling algorithm and the data packet is directly While various load scheduling algorithms may forwarded, without any modification, to the physical work effectively, there is no current scheduling MAC address of the real server [9]. When the real algorithm that considers a multi-level security server receives the forwarded packet, the request is protocol to determine which clients have access processed by the real server and returned directly to rights among the servers. the client, bypassing the director [9]. 4.1 The Kernel 3. Load Scheduling The kernel actually does very little itself, but provides the tools for which services can be built. In One of the most important concepts in a Linux fact, any program running on the computer is forced Virtual Server is the concept of load scheduling. As to interact with the kernel in order to access hardware of this writing, the following six scheduling devices, protecting them from damage [5]. algorithms are implemented in the core LVS Interaction between applications and the kernel distribution [18]. is provided through system calls. User applications 3.1 Round Robin and system programs are said to exist and execute in The round robin algorithm sends incoming user space. All kernel operations are executed in requests to the next server in the server list. This kernel space. algorithm treats all the real servers equally, 4.2 Functions regardless of the number of incoming connections or Our algorithm uses a variety of functions to response time of the server. schedule incoming requests across the Linux Virtual 3.2 Weighted Round Robin Server. Some of these functions are required for This algorithm is similar to the normal round- compatibility with the already existing LVS code and robin method, except each real server is also assigned have only been slightly modified for this project. This a weight. More jobs are given to real servers with a section details those functions that have been used for greater weight. The weight factor is adjusted as the the project. load for the server changes. This scheduling 4.2.1 ip_vs_mls_init_svc algorithm is beneficial when there is a significant This function is used by the LVS code when difference in the load capacity of the real servers. setting up the virtual server to use the multi-level 3.3 Least Connection security scheduling. When an administrator sets up This algorithm distributes requests to the real server the Virtual Server, they must specify what type of with the fewest number of established connections. service (telnet, http, etc…) to set up, along with what scheduling algorithm to use. This function takes a parameter as a pointer to an ip_vs_service data type, the list of destination real servers and assigns the and initializes its scheduling data to the list of destination according to the security level. Finally, it destination real servers. returns a pointer to the destination real server’s IP address to the LVS code, which handles all 4.2.2 ip_vs_mls_done_svc communication from there. This function is called by the LVS code when the service is no longer offered by the Virtual Server. 4.2.7 ip_vs_mls_get_security_level This function simply returns 0 to let the system know This is the function that determines the security that the service is no longer being used.
Load more

Recommended publications
  • Tree-Like Distributed Computation Environment with Shapp Library
    information Article Tree-Like Distributed Computation Environment with Shapp Library Tomasz Gałecki and Wiktor Bohdan Daszczuk * Institute of Computer Science, Warsaw University of Technology, 00-665 Warsaw, Poland; [email protected] * Correspondence: [email protected]; Tel.: +48-22-234-78-12 Received: 30 January 2020; Accepted: 1 March 2020; Published: 3 March 2020 Abstract: Despite the rapidly growing computing power of computers, it is often insufficient to perform mass calculations in a short time, for example, simulation of systems for various sets of parameters, the searching of huge state spaces, optimization using ant or genetic algorithms, machine learning, etc. One can solve the problem of a lack of computing power through workload management systems used in local networks in order to use the free computing power of servers and workstations. This article proposes raising such a system to a higher level of abstraction: The use in the .NET environment of a new Shapp library that allows remote task execution using fork-like operations from Portable Operating System Interface for UNIX (POSIX) systems. The library distributes the task code, sending static data on which task force is working, and individualizing tasks. In addition, a convenient way of communicating distributed tasks running hierarchically in the Shapp library was proposed to better manage the execution of these tasks. Many different task group architectures are possible; we focus on tree-like calculations that are suitable for many problems where the range of possible parallelism increases as the calculations progress. Keywords: workload management; remote fork; distributed computations; task group communication 1.
    [Show full text]
  • Administration Guide Administration Guide SUSE Linux Enterprise High Availability Extension 15 SP1 by Tanja Roth and Thomas Schraitle
    SUSE Linux Enterprise High Availability Extension 15 SP1 Administration Guide Administration Guide SUSE Linux Enterprise High Availability Extension 15 SP1 by Tanja Roth and Thomas Schraitle This guide is intended for administrators who need to set up, congure, and maintain clusters with SUSE® Linux Enterprise High Availability Extension. For quick and ecient conguration and administration, the product includes both a graphical user interface and a command line interface (CLI). For performing key tasks, both approaches are covered in this guide. Thus, you can choose the appropriate tool that matches your needs. Publication Date: September 24, 2021 SUSE LLC 1800 South Novell Place Provo, UT 84606 USA https://documentation.suse.com Copyright © 2006–2021 SUSE LLC and contributors. All rights reserved. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or (at your option) version 1.3; with the Invariant Section being this copyright notice and license. A copy of the license version 1.2 is included in the section entitled “GNU Free Documentation License”. For SUSE trademarks, see http://www.suse.com/company/legal/ . All other third-party trademarks are the property of their respective owners. Trademark symbols (®, ™ etc.) denote trademarks of SUSE and its aliates. Asterisks (*) denote third-party trademarks. All information found in this book has been compiled with utmost attention to detail. However, this does not guarantee complete accuracy. Neither SUSE
    [Show full text]
  • Introduction to Linux Virtual Server and High Availability
    Outlines Introduction to Linux Virtual Server and High Availability Chen Kaiwang [email protected] December 5, 2011 Chen Kaiwang [email protected] LVS-DR and Keepalived Outlines If you don't know the theory, you don't have a way to be rigorous. Robert J. Shiller http://www.econ.yale.edu/~shiller/ Chen Kaiwang [email protected] LVS-DR and Keepalived Outlines Misery stories I Jul 2011 Too many connections at zongheng.com I Aug 2011 Realserver maintenance at 173.com quiescent persistent connections I Nov 2011 Health check at 173.com I Nov 2011 Virtual service configuration at 173.com persistent session data Chen Kaiwang [email protected] LVS-DR and Keepalived Outlines Outline of Part I Introduction to Linux Virtual Server Configuration Overview Netfilter Architecture Job Scheduling Scheduling Basics Scheduling Algorithms Connection Affinity Persistence Template Persistence Granularity Quirks Chen Kaiwang [email protected] LVS-DR and Keepalived Outlines Outline of Part II HA Basics LVS High Avaliablity Realserver Failover Director Failover Solutions Heartbeat Keepalived Chen Kaiwang [email protected] LVS-DR and Keepalived LVS Intro Job Scheduling Connection Affinity Quirks Part I Introduction to Linux Virtual Server Chen Kaiwang [email protected] LVS-DR and Keepalived LVS Intro Job Scheduling Configuration Overview Connection Affinity Netfilter Architecture Quirks Introduction to Linux Virtual Server Configuration Overview Netfilter Architecture Job Scheduling Scheduling Basics Scheduling Algorithms Connection Affinity Persistence Template Persistence Granularity Quirks Chen Kaiwang [email protected] LVS-DR and Keepalived LVS Intro Job Scheduling Configuration Overview Connection Affinity Netfilter Architecture Quirks A Linux Virtual Serverr (LVS) is a group of servers that appear to the client as one large, fast, reliable (highly available) server.
    [Show full text]
  • Keepalived User Guide Release 1.4.3
    Keepalived User Guide Release 1.4.3 Alexandre Cassen and Contributors March 06, 2021 Contents 1 Introduction 1 2 Software Design 3 3 Load Balancing Techniques 11 4 Installing Keepalived 13 5 Keepalived configuration synopsis 17 6 Keepalived programs synopsis 23 7 IPVS Scheduling Algorithms 27 8 IPVS Protocol Support 31 9 Configuring SNMP Support 33 10 Case Study: Healthcheck 37 11 Case Study: Failover using VRRP 43 12 Case Study: Mixing Healthcheck & Failover 47 13 Terminology 51 14 License 53 15 About These Documents 55 16 TODO List 57 Index 59 i ii CHAPTER 1 Introduction Load balancing is a method of distributing IP traffic across a cluster of real servers, providing one or more highly available virtual services. When designing load-balanced topologies, it is important to account for the availability of the load balancer itself as well as the real servers behind it. Keepalived provides frameworks for both load balancing and high availability. The load balancing framework relies on the well-known and widely used Linux Virtual Server (IPVS) kernel module, which provides Layer 4 load balancing. Keepalived implements a set of health checkers to dynamically and adaptively maintain and manage load balanced server pools according to their health. High availability is achieved by the Virtual Redundancy Routing Protocol (VRRP). VRRP is a fundamental brick for router failover. In addition, keepalived implements a set of hooks to the VRRP finite state machine providing low-level and high-speed protocol interactions. Each Keepalived framework can be used independently or together to provide resilient infrastructures. In this context, load balancer may also be referred to as a director or an LVS router.
    [Show full text]
  • Ubuntu Server Guide Basic Installation Preparing to Install
    Ubuntu Server Guide Welcome to the Ubuntu Server Guide! This site includes information on using Ubuntu Server for the latest LTS release, Ubuntu 20.04 LTS (Focal Fossa). For an offline version as well as versions for previous releases see below. Improving the Documentation If you find any errors or have suggestions for improvements to pages, please use the link at thebottomof each topic titled: “Help improve this document in the forum.” This link will take you to the Server Discourse forum for the specific page you are viewing. There you can share your comments or let us know aboutbugs with any page. PDFs and Previous Releases Below are links to the previous Ubuntu Server release server guides as well as an offline copy of the current version of this site: Ubuntu 20.04 LTS (Focal Fossa): PDF Ubuntu 18.04 LTS (Bionic Beaver): Web and PDF Ubuntu 16.04 LTS (Xenial Xerus): Web and PDF Support There are a couple of different ways that the Ubuntu Server edition is supported: commercial support and community support. The main commercial support (and development funding) is available from Canonical, Ltd. They supply reasonably- priced support contracts on a per desktop or per-server basis. For more information see the Ubuntu Advantage page. Community support is also provided by dedicated individuals and companies that wish to make Ubuntu the best distribution possible. Support is provided through multiple mailing lists, IRC channels, forums, blogs, wikis, etc. The large amount of information available can be overwhelming, but a good search engine query can usually provide an answer to your questions.
    [Show full text]
  • HP/ISV Confidential
    Advanced Cluster Software for Meteorology Betty van Houten 1 Frederic Ciesielski / Gavin Brebner / Ghislain de Jacquelot 2 Michael Riedmann 3 Henry Strauss 4 1 HPC Division Richardson 2 HPC Competency Centre Grenoble 3 EPC Boeblingen 4 HPC PreSales Munich ECMWF workshop “Use of HPC in Meteorology” -- Reading/UK, November 2nd, 2006 © 2006 Hewlett-Packard Development Company, L.P. The information contained herein is subject to change without notice 2 Nov 2, 2006 Advanced Cluster Software for Meteorology Outline • requirements in met • HP‘s ways to address those − XC – a cluster environment for real-world applications − HP-MPI – a universal approach − some thoughts on checkpoint/restart and alternatives − future work • LM on HP – status & results • conclusions 3 Nov 2, 2006 Advanced Cluster Software for Meteorology Requirements • both capability and capacity • reliability & turn-around times • data management! • visualization? 4 Nov 2, 2006 Advanced Cluster Software for Meteorology Cluster Implementation Challenges • Manageability • Scalability • Integration of Data Mgmt & Visualization • Interconnect/Network Complexity • Version Control • Application Availability 5 Nov 2, 2006 Advanced Cluster Software for Meteorology XC Cluster: HP’s Linux-Based Production Cluster for HPC • A production computing environment for HPC built on Linux/Industry standard clusters − Industrial-hardened, scalable, supported − Integrates leading technologies from open source and partners • Simple and complete product for real world usage − Turn-key, with single
    [Show full text]
  • Protectv Installation Guide (AWS)
    ProtectV Installation Guide (AWS) Technical Manual Template 1 Release 1.0, PN: 000-000000-000, Rev. A, March 2013, Copyright © 2013 SafeNet, Inc. All rights reserved. Document Information Product Version 1.7 Document Part Number 007-011532-001, Rev R Release Date March 2014 Trademarks All intellectual property is protected by copyright. All trademarks and product names used or referred to are the copyright of their respective owners. No part of this document may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, chemical, photocopy, recording, or otherwise, without the prior written permission of SafeNet, Inc. • Linux® is a registered trademark of Linus Torvalds. Linux Foundation, Linux Standard Base, LSB, LSB Certified, IAccessible2, MeeGo are registered trademarks of the Linux Foundation. Copyright © 2010 Linux Foundation. All rights reserved. • Windows is a registered trademark of Microsoft Corporation in the United States and other countries. • Amazon Web Services™ and AWS™ are registered trademarks of Amazon.com, Inc. or its affiliates in the United States and other countries. • Red Hat® Linux® is a registered trademark of Red Hat, Inc. in the United States and other countries. • Ubuntu™ is a registered trademark of Canonical Ltd. Disclaimer SafeNet makes no representations or warranties with respect to the contents of this document and specifically disclaims any implied warranties of merchantability or fitness for any particular purpose. Furthermore, SafeNet reserves the right to revise this publication and to make changes from time to time in the content hereof without the obligation upon SafeNet to notify any person or organization of any such revisions or changes.
    [Show full text]
  • Virtually Linux Virtualization Techniques in Linux
    Virtually Linux Virtualization Techniques in Linux Chris Wright OSDL [email protected] Abstract ware1 or software [16, 21, 19], may include any subset of a machine’s resources, and has Virtualization provides an abstraction layer a wide variety of applications. Such usages mapping a virtual resource to a real resource. include machine emulation, hardware consol- Such an abstraction allows one machine to be idation, resource isolation, quality of service carved into many virtual machines as well as resource allocation, and transparent resource allowing a cluster of machines to be viewed redirection. Applications of these usage mod- as one. Linux provides a wealth of virtual- els include virtual hosting, security, high avail- ization offerings. The technologies range in ability, high throughput, testing, and ease of the problems they solve, the models they are administration. useful in, and their respective maturity. This It is interesting to note that differing virtual- paper surveys some of the current virtualiza- ization models may have inversely correlated tion techniques available to Linux users, and proportions of virtual to physical resources. it reviews ways to leverage these technologies. For example, the method of carving up a sin- Virtualization can be used to provide things gle machine into multiple machines—useful such as quality of service resource allocation, in hardware consolidation or virtual hosting— resource isolation for security or sandboxing, looks quite different from a single system im- transparent resource redirection for availability age (SSI) [15]—useful in clustering. This pa- and throughput, and simulation environments per primarily focuses on providing multiple for testing and debugging. virtual instances of a single physical resource, however, it does cover some examples of a sin- 1 Introduction gle virtual resource mapping to multiple phys- ical resources.
    [Show full text]
  • Abkürzungs-Liste ABKLEX
    Abkürzungs-Liste ABKLEX (Informatik, Telekommunikation) W. Alex 1. Juli 2021 Karlsruhe Copyright W. Alex, Karlsruhe, 1994 – 2018. Die Liste darf unentgeltlich benutzt und weitergegeben werden. The list may be used or copied free of any charge. Original Point of Distribution: http://www.abklex.de/abklex/ An authorized Czechian version is published on: http://www.sochorek.cz/archiv/slovniky/abklex.htm Author’s Email address: [email protected] 2 Kapitel 1 Abkürzungen Gehen wir von 30 Zeichen aus, aus denen Abkürzungen gebildet werden, und nehmen wir eine größte Länge von 5 Zeichen an, so lassen sich 25.137.930 verschiedene Abkür- zungen bilden (Kombinationen mit Wiederholung und Berücksichtigung der Reihenfol- ge). Es folgt eine Auswahl von rund 16000 Abkürzungen aus den Bereichen Informatik und Telekommunikation. Die Abkürzungen werden hier durchgehend groß geschrieben, Akzente, Bindestriche und dergleichen wurden weggelassen. Einige Abkürzungen sind geschützte Namen; diese sind nicht gekennzeichnet. Die Liste beschreibt nur den Ge- brauch, sie legt nicht eine Definition fest. 100GE 100 GBit/s Ethernet 16CIF 16 times Common Intermediate Format (Picture Format) 16QAM 16-state Quadrature Amplitude Modulation 1GFC 1 Gigabaud Fiber Channel (2, 4, 8, 10, 20GFC) 1GL 1st Generation Language (Maschinencode) 1TBS One True Brace Style (C) 1TR6 (ISDN-Protokoll D-Kanal, national) 247 24/7: 24 hours per day, 7 days per week 2D 2-dimensional 2FA Zwei-Faktor-Authentifizierung 2GL 2nd Generation Language (Assembler) 2L8 Too Late (Slang) 2MS Strukturierte
    [Show full text]
  • Detail of Department Programs Supplement to the 2005-06 Proposed Budget 2005-06
    CITY OF LOS ANGELES Detail of Department Programs Supplement to the 2005-06 Proposed Budget 2005-06 Prepared by the City Administrative Officer - April 2005 TABLE OF CONTENTS INTRODUCTION Page Foreword The Blue Book Summary of Changes in Appropriations SECTION 1 - REGULAR DEPARTMENTAL PROGRAM COSTS Aging............................................................................................................................................ ............1 Animal Services........................................................................................................................... ..........11 Building and Safety...................................................................................................................... ..........25 City Administrative Officer ........................................................................................................... ..........39 City Attorney ................................................................................................................................ ..........53 City Clerk..................................................................................................................................... ..........69 Commission for Children, Youth and Their Families................................................................... ..........81 Commission on the Status of Women ......................................................................................... ..........89 Community Development ...........................................................................................................
    [Show full text]
  • Research Report XEN Based HA Backup Environment
    Research Report XEN based HA backup environment Research Report for RP1 University of Amsterdam MSc in System and Network Engineering Class of 2006-2007 Peter Ruissen, Marju jalloh {pruissen,mjalloh}@os3.nl February 5, 2007 RP1: XEN based HA backup environment Abstract In this paper we will investigate the possibilities for High Availability (HA) failover mecha- nisms using the XEN virtualization technology and the requirements necessary for implementation on technical level. Virtualization technology is becoming increasingly popular in server environ- ments because it adds a layer of transparency and flexibility on top of a hardware layer, reduces recovery time and utilizes hardware resources more efficiently. Back in the 1960s, IBM developed virtualization support on a mainframe. Since then, many virtualization projects have become available for UNIX/Linux and other operating systems. The XEN project offers a novel technique known as paravirtualisation which brings a whole new range of possibilities to the table. Our tests showed that it is possible to use XEN in combination with Hearbeat to provide a HA environment. Even though combining XEN virtualization technology and High Availability software is still in the beginning stages at this moment, our research showed that XEN can be used with Heartbeat to realize a flexible, reliable and efficient HA environment.5.1 2 Contents 1 Project information 5 1.1 Assignment formulation . 5 1.2 Project Description . 5 1.3 Scope .............................................. 5 2 Virtualization technology 7 2.1 Forms of VT . 7 3 High availability concepts 9 3.1 Service availability . 10 3.2 Linux High Availability projects . 10 3.3 High Available Storage .
    [Show full text]
  • Red Hat Enterprise Linux 6 Logical Volume Manager Administration
    Red Hat Enterprise Linux 6 Logical Volume Manager Administration LVM Administrator Guide Logical Volume Manager Administration Red Hat Enterprise Linux 6 Logical Volume Manager Administration LVM Administrator Guide Edition 1 Copyright © 2010 Red Hat Inc.. The text of and illustrations in this document are licensed by Red Hat under a Creative Commons Attribution–Share Alike 3.0 Unported license ("CC-BY-SA"). An explanation of CC-BY-SA is available at http://creativecommons.org/licenses/by-sa/3.0/. In accordance with CC-BY-SA, if you distribute this document or an adaptation of it, you must provide the URL for the original version. Red Hat, as the licensor of this document, waives the right to enforce, and agrees not to assert, Section 4d of CC-BY-SA to the fullest extent permitted by applicable law. Red Hat, Red Hat Enterprise Linux, the Shadowman logo, JBoss, MetaMatrix, Fedora, the Infinity Logo, and RHCE are trademarks of Red Hat, Inc., registered in the United States and other countries. Linux® is the registered trademark of Linus Torvalds in the United States and other countries. Java® is a registered trademark of Oracle and/or its affiliates. XFS® is a trademark of Silicon Graphics International Corp. or its subsidiaries in the United States and/or other countries. MySQL® is a registered trademark of MySQL AB in the United States, the European Union and other countries. All other trademarks are the property of their respective owners. 1801 Varsity Drive Raleigh, NC 27606-2072 USA Phone: +1 919 754 3700 Phone: 888 733 4281 Fax: +1 919 754 3701 This book describes the LVM logical volume manager, including information on running LVM in a clustered environment.
    [Show full text]