DOCSLIB.ORG

A Proportional Share Resource Allocation Algorithm for Real-Time

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Proportional Share Resource Allocation Algorithm for Real-Time A Prop ortional Share Resource Allo cation Algorithm for Real-Time, Time-Shared Systems y z x Ion Stoica Hussein Ab del-Wahab Kevin Je ay Sanjoy K. Baruah { k Johannes E. Gehrke C. Greg Plaxton time quantum. In addition, the algorithm provides sup- Abstract port for dynamic operations, such as processes joining or leaving the competition, and for both fractional and We propose and analyze a proportional sharere- non-uniform time quanta. Asaproof of concept we sourceallocation algorithm for realizing real-time per- have implementeda prototype of a CPU scheduler un- formance in time-sharedoperating systems. Processes der FreeBSD. The experimental results shows that our are assigned a weight which determines a shareper- implementation performs within the theoretical bounds centage of the resource they aretoreceive. The re- and hence supports real-time execution in a general source is then al located in discrete-sized time quanta purpose operating system. in such a manner that each process makes progress at aprecise, uniform rate. Proportional shareallocation algorithms are of interest because 1 they provide a 1 Intro duction natural means of seamlessly integrating real- and non- real-time processing, 2 they areeasy to implement, Currently there is great interest in providing real- 3 they provide a simple and e ective means of pre- time execution and communication supp ort in general cisely control ling the real-time performanceofa pro- purp ose op erating systems. Indeed, applications such cess, and 4 they provide a natural mean of policing as desktop video conferencing, distributed shared vir- so that processes that use moreofa resource than they tual environments, and collab oration-supp ort systems request have no il l-e ect on wel l-behavedprocesses. require real-time computation and communication ser- We analyze our algorithm in the context of an ideal- vices to b e e ective. At present the dominant approach ized system in which a resource is assumedtobegranted to providing real-time supp ort in a general purp ose op- in arbitrarily smal l intervals of time and show that our erating system is to emb ed a p erio dic thread or pro cess algorithm guarantees that the di erencebetween the mo del into an existing op erating system kernel and service time that a process should receive in the ide- to use a real-time scheduling algorithm such as rate- alized system and the service time it actual ly receives monotonic scheduling to schedule the pro cesses. In in the real system is optimal ly bounded by the size of a such as system, ap erio dic and non-real-time activities are typically scheduled either as background pro cesses Supp orted by GAANN fellowship. Dept. of CS, Old Domin- ion Univ., Norfolk, VA 23529-0162 [email protected]. or through the use of a second-level scheduler that is y Supp orted by NSF grant CCR 95{9313857. Dept. executed quasi-p erio dically as a server pro cess by the of CS, Old Dominion Univ., Norfolk, VA 23529-0162 real-time scheduler. [email protected]. z In general, this framework can b e quite e ective Supp orted by grant from the IBM & Intel corps and NSF grant CCR 95{10156. Dpt. of CS, Univ. of North Carolina at at integrating real-time and non-real-time computing. Chap el Hill, Chap el Hill, NC 27599-3175, [email protected]. However, we observe that this approach has yet to b e x Supp orted by NSF under Research Initiation Award CCR{ embraced by the larger op erating systems community. 9596282. Dept. of CS, Univ. of Vermont, Burlignton, VT 05405, We b elieve that this is due in part to the rigid distinc- [email protected]. { tions made b etween real-time and non-real-time. Real- Dpt. of CS, Univ. of Wisconsin-Madison, Madison, WI 53706-1685 [email protected]. time activities are programmed di erently than non- k Supp orted by NSF grant CCR{9504145, and the Texas Ad- real-time ones e.g., as p erio dic tasks and real-time vanced Research Program under grant No. ARP{93{00365{461. activities receive hard and fast guarantees of resp onse Dpt. of CS, Univ. of Texas at Austin, Austin, TX 78712-1188 [email protected]. time if admission control is p erformed. Non-real-time 1 activities are subservient to real-time ones and receive di ers from traditional metho ds of integrating real- and no p erformance guarantees. While this state of a airs non-real-time pro cesses in that here all pro cesses, real- is entirely acceptable for many mixes of real-time and and non-real-time, are treated identically. In a prop or- non-real-time activities, for many it is not. Consider tional share system, real-time and non-real-time pro- the problem of supp orting real-time video conferencing cesses can b e implemented very much like traditional on the desktop. This is clearly a real-time application, pro cesses in a time-shared op erating system. Thus in however, it is not one for which hard and fast guaran- terms of the pro cess mo del, no \sp ecial" supp ort is re- tees of real-time p erformance are required. For exam- quired to supp ort real-time computing | there is only ple, it is easy to imagine situations in which one would one typ e of pro cess. Moreover, like manyscheduling like to explicitly degrade the p erformance of the video- algorithms used in time-shared systems, our algorithm conference e.g., degrade the rate at which the video allo cates resources in discrete units or quanta which is displayed so that other activities, such as search- makes it easier to implement than traditional real-time ing a large mail database for a particular message, can p olicies which are typically event-driven and require complete quicker. Ideally, a general purp ose op erating the ability to preempt pro cesses at p otentially arbi- system that supp orts real-time execution should not a trary p oints. In addition, b ecause resources are allo- priori restrict the basic tenor of p erformance guaran- cated in discrete quanta in a prop ortional share system, tees that any pro cess is capable of obtaining. one can b etter control and account for the overhead of the scheduling mechanism as well as tune the sys- To address this issue weinvestigate an alternate tem to trade-o ne-grain, real-time control for low approach to realizing real-time p erformance in time scheduling and system overhead. Finally, prop ortional shared op erating systems, namely the use of propor- share algorithms provide a natural means of uniformly tional shareresourceallocation algorithms for pro ces- degrading system p erformance in overload situations. sor scheduling. In a prop ortional share allo cation sys- In this pap er we present a prop ortional share tem, every pro cess in the system is guaranteed to make scheduling algorithm and demonstrate that it can b e progress at a well-de ned, uniform rate. Sp eci cally, used to ensure predictable real-time resp onse to all each pro cess is assigned a share of the pro cessor | a pro cesses. Section 2 presents our pro cess mo del and p ercentage of the pro cessor's total capacity. If a pro- formally intro duces the concepts of a share and the cess's share of the pro cessor is s then in anyinterval of requirement for predictable execution with resp ect to length t, the pro cess is guaranteed to receives t a share. Section 3 discusses related work in schedul- units of pro cessor time where 0 , for some con- ing. Section 4 presents a deadline-based, virtual-time stant . In a prop ortional share system, resource al- scheduling algorithm that is used to ensure pro cesses lo cation is exible and the share received by a pro cess receive their requested share of the pro cessor. Section can b e changed dynamically. In this manner a pro cess's 5intro duces a key technical problem to b e solved in real-time rate of progress can b e explicitly controlled. the course of applying our algorithm, namely that of Prop ortional share resource allo cation algorithms dealing with the dynamic creation and destruction of lie b etween traditional general purp ose and real-time pro cesses. Section 6 outlines the pro of of correctness scheduling algorithms. On the one hand, prop ortional of our algorithm and Section 7 presents some exp eri- share resource allo cation is a variant of the pureproces- mental results using our prop ortional share system in sor sharing scheduling discipline, in which during each the FreeBSD op erating system, and demonstrates how time unit each pro cess receives 1=n of the pro cessor's \traditional" real-time pro cesses such as p erio dic tasks capacity, where n is the numb er of active pro cesses. can b e realized in a prop ortional share system. Thus each pro cess app ears as it is making uniform progress on a virtual pro cessor that has 1=n of the ca- pacity of the physical pro cessor. On the other hand, traditional real-time scheduling disciplines for p erio dic 2 The Mo del tasks can b e viewed as coarse approximations of pro- p ortional share allo cation. For example, if a p erio dic We consider an op erating system to consist of a set task requires c units of pro cessor time every p time of pro cesses real-time and non-real-time that com- units, then a rate-monotonic scheduler guarantees that p ete for a time shared resource such as a CPU or a for all k 0, in eachinterval [kp; k +1p], the p erio dic communications channel.
Load more

Recommended publications
  • Isolation, Resource Management, and Sharing in Java
    Processes in KaffeOS: Isolation, Resource Management, and Sharing in Java Godmar Back, Wilson C. Hsieh, Jay Lepreau School of Computing University of Utah Abstract many environments for executing untrusted code: for example, applets, servlets, active packets [41], database Single-language runtime systems, in the form of Java queries [15], and kernel extensions [6]. Current systems virtual machines, are widely deployed platforms for ex- (such as Java) provide memory protection through the ecuting untrusted mobile code. These runtimes pro- enforcement of type safety and secure system services vide some of the features that operating systems pro- through a number of mechanisms, including namespace vide: inter-application memory protection and basic sys- and access control. Unfortunately, malicious or buggy tem services. They do not, however, provide the ability applications can deny service to other applications. For to isolate applications from each other, or limit their re- example, a Java applet can generate excessive amounts source consumption. This paper describes KaffeOS, a of garbage and cause a Web browser to spend all of its Java runtime system that provides these features. The time collecting it. KaffeOS architecture takes many lessons from operating To support the execution of untrusted code, type-safe system design, such as the use of a user/kernel bound- language runtimes need to provide a mechanism to iso- ary, and employs garbage collection techniques, such as late and manage the resources of applications, analogous write barriers. to that provided by operating systems. Although other re- The KaffeOS architecture supports the OS abstraction source management abstractions exist [4], the classic OS of a process in a Java virtual machine.
    [Show full text]
  • Libresource - Getting System Resource Information with Standard Apis Tuesday, 13 November 2018 14:55 (15 Minutes)
    Linux Plumbers Conference 2018 Contribution ID: 255 Type: not specified libresource - Getting system resource information with standard APIs Tuesday, 13 November 2018 14:55 (15 minutes) System resource information, like memory, network and device statistics, are crucial for system administrators to understand the inner workings of their systems, and are increasingly being used by applications to fine tune performance in different environments. Getting system resource information on Linux is not a straightforward affair. The best way is tocollectthe information from procfs or sysfs, but getting such information from procfs or sysfs presents many challenges. Each time an application wants to get a system resource information, it has to open a file, read the content and then parse the content to get actual information. If application is running in a container then even reading from procfs directly may give information about resources on whole system instead of just the container. Libresource tries to fix few of these problems by providing a standard library with set of APIs through which we can get system resource information e.g. memory, CPU, stat, networking, security related information. Libresource provides/may provide following benefits: • Virtualization: In cases where application is running in a virtualized environment using cgroup or namespaces, reading from /proc and /sys file-systems might not give correct information as these are not cgroup aware. Library API will take care of this e.g. if a process is running in a cgroup then library should provide information which is local to that cgroup. • Ease of use: Currently applications needs to read this info mostly from /proc and /sys file-systems.
    [Show full text]
  • Introduction to Performance Management
    C HAPTER 1 Introduction to Performance Management Application developers and system administrators face similar challenges in managing the performance of a computer system. Performance manage- ment starts with application design and development and migrates to administration and tuning of the deployed production system or systems. It is necessary to keep performance in mind at all stages in the development and deployment of a system and application. There is a definite over- lap in the responsibilities of the developer and administrator. Sometimes determining where one ends and the other begins is more difficult when a single person or small group develops, admin- isters and uses the application. This chapter will look at: • Application developer’s perspective • System administrator’s perspective • Total system resource perspective • Rules of performance tuning 1.1 Application Developer’s Perspective The tasks of the application developer include: • Defining the application • Determining the specifications • Designing application components • Developing the application codes • Testing, tuning, and debugging • Deploying the system and application • Maintaining the system and application 3 4 Chapter 1 • Introduction to Performance Management 1.1.1 Defining the Application The first step is to determine what the application is going to be. Initially, management may need to define the priorities of the development group. Surveys of user organizations may also be carried out. 1.1.2 Determining Application Specifications Defining what the application will accomplish is necessary before any code is written. The users and developers should agree, in advance, on the particular features and/or functionality that the application will provide. Often, performance specifications are agreed upon at this time, and these are typically expressed in terms of user response time or system throughput measures.
    [Show full text]
  • Linux® Resource Administration Guide
    Linux® Resource Administration Guide 007–4413–004 CONTRIBUTORS Written by Terry Schultz Illustrated by Chris Wengelski Production by Karen Jacobson Engineering contributions by Jeremy Brown, Marlys Kohnke, Paul Jackson, John Hesterberg, Robin Holt, Kevin McMahon, Troy Miller, Dennis Parker, Sam Watters, and Todd Wyman COPYRIGHT © 2002–2004 Silicon Graphics, Inc. All rights reserved; provided portions may be copyright in third parties, as indicated elsewhere herein. No permission is granted to copy, distribute, or create derivative works from the contents of this electronic documentation in any manner, in whole or in part, without the prior written permission of Silicon Graphics, Inc. LIMITED RIGHTS LEGEND The electronic (software) version of this document was developed at private expense; if acquired under an agreement with the USA government or any contractor thereto, it is acquired as "commercial computer software" subject to the provisions of its applicable license agreement, as specified in (a) 48 CFR 12.212 of the FAR; or, if acquired for Department of Defense units, (b) 48 CFR 227-7202 of the DoD FAR Supplement; or sections succeeding thereto. Contractor/manufacturer is Silicon Graphics, Inc., 1600 Amphitheatre Pkwy 2E, Mountain View, CA 94043-1351. TRADEMARKS AND ATTRIBUTIONS Silicon Graphics, SGI, the SGI logo, and IRIX are registered trademarks and SGI Linux and SGI ProPack for Linux are trademarks of Silicon Graphics, Inc., in the United States and/or other countries worldwide. SGI Advanced Linux Environment 2.1 is based on Red Hat Linux Advanced Server 2.1 for the Itanium Processor, but is not sponsored by or endorsed by Red Hat, Inc.
    [Show full text]
  • SUSE Linux Enterprise Server 11 SP4 System Analysis and Tuning Guide System Analysis and Tuning Guide SUSE Linux Enterprise Server 11 SP4
    SUSE Linux Enterprise Server 11 SP4 System Analysis and Tuning Guide System Analysis and Tuning Guide SUSE Linux Enterprise Server 11 SP4 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. A trademark symbol (®, ™ etc.) denotes a SUSE or Novell trademark; an asterisk (*) denotes a third party trademark. All information found in this book has been compiled with utmost attention to detail. However, this does not guarantee complete accuracy. Neither SUSE LLC, its aliates, the authors nor the translators shall be held liable for possible errors or the consequences thereof. Contents About This Guide xi 1 Available Documentation xii 2 Feedback xiv 3 Documentation Conventions xv I BASICS 1 1 General Notes on System Tuning 2 1.1 Be Sure What Problem to Solve 2 1.2 Rule Out Common Problems 3 1.3 Finding the Bottleneck 3 1.4 Step-by-step Tuning 4 II SYSTEM MONITORING 5 2 System Monitoring Utilities 6 2.1 Multi-Purpose Tools 6 vmstat 7
    [Show full text]
  • IBM Power Systems Virtualization Operation Management for SAP Applications
    Front cover IBM Power Systems Virtualization Operation Management for SAP Applications Dino Quintero Enrico Joedecke Katharina Probst Andreas Schauberer Redpaper IBM Redbooks IBM Power Systems Virtualization Operation Management for SAP Applications March 2020 REDP-5579-00 Note: Before using this information and the product it supports, read the information in “Notices” on page v. First Edition (March 2020) This edition applies to the following products: Red Hat Enterprise Linux 7.6 Red Hat Virtualization 4.2 SUSE Linux SLES 12 SP3 HMC V9 R1.920.0 Novalink 1.0.0.10 ipmitool V1.8.18 © Copyright International Business Machines Corporation 2020. All rights reserved. Note to U.S. Government Users Restricted Rights -- Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. Contents Notices . .v Trademarks . vi Preface . vii Authors. vii Now you can become a published author, too! . viii Comments welcome. viii Stay connected to IBM Redbooks . ix Chapter 1. Introduction. 1 1.1 Preface . 2 Chapter 2. Server virtualization . 3 2.1 Introduction . 4 2.2 Server and hypervisor options . 4 2.2.1 Power Systems models that support PowerVM versus KVM . 4 2.2.2 Overview of POWER8 and POWER9 processor-based hardware models. 4 2.2.3 Comparison of PowerVM and KVM / RHV . 7 2.3 Hypervisors . 8 2.3.1 Introducing IBM PowerVM . 8 2.3.2 Kernel-based virtual machine introduction . 15 2.3.3 Resource overcommitment . 16 2.3.4 Red Hat Virtualization . 17 Chapter 3. IBM PowerVM management and operations . 19 3.1 Shared processor logical partitions . 20 3.1.1 Configuring a shared processor LPAR .
    [Show full text]
  • REST API Specifications
    IBM Hyper-Scale Manager Version 5.5.1 REST API Specifications IBM IBM Confidential SC27-6440-06 IBM Confidential Note Before using this information and the product it supports, read the information in “Notices” on page 73. Edition Notice Publication number: SC27-6440-06. This edition applies to IBM® Hyper-Scale Manager version 5.5.1 and to all subsequent releases and modifications, until otherwise indicated in a newer publication. © Copyright International Business Machines Corporation 2014, 2019. US Government Users Restricted Rights – Use, duplication or disclosure restricted by GSA ADP Schedule Contract with IBM Corp. IBM Confidential Contents List of Tables........................................................................................................vii About this guide................................................................................................... ix Who should use this guide.......................................................................................................................... ix Conventions used in this guide................................................................................................................... ix Related information and publications.........................................................................................................ix Getting information, help, and service.........................................................................................................x IBM Publications Center.............................................................................................................................
    [Show full text]
  • (RTOS) Is an Operating System (OS) Intended to Serve Real-Time Application Requests
    Page 1 of 7 Real-time operating systems 6.1 Introduction: A real-time operating system (RTOS) is an operating system (OS) intended to serve real-time application requests. It must be able to process data as it comes in, typically without buffering delays. Processing time requirements (including any OS delay) are measured in tenths of seconds or shorter. A key characteristic of an RTOS is the level of its consistency concerning the amount of time it takes to accept and complete an application's task; the variability is jitter. A hard real-time operating system has less jitter than a soft real-time operating system. The chief design goal is not high throughput, but rather a guarantee of a soft or hard performance category. An RTOS that can usually or generally meet a deadline is a soft real-time OS, but if it can meet a deadline deterministically it is a hard real-time OS. An RTOS has an advanced algorithm for scheduling. Scheduler flexibility enables a wider, computer-system orchestration of process priorities, but a real-time OS is more frequently dedicated to a narrow set of applications. Key factors in a real- time OS are minimal interrupt latency and minimal thread switching latency; a real-time OS is valued more for how quickly or how predictably it can respond than for the amount of work it can perform in a given period of time. 6.2 Design philosophies The most common designs are: Event-driven which switches tasks only when an event of higher priority needs servicing, called preemptive priority, or priority scheduling.
    [Show full text]
  • Common Information Model
    DISTRIBUTED MANAGEMENT TASK FORCE Technical Note August 2015 Copyright © 2015 Distributed Management Task Force, Inc. (DMTF). All rights reserved. Redfish – Simple, Modern and a new standard management interface. First, the Secure Management for Multi- market is shifting from traditional data center environments to scale-out solutions. With Vendor Cloud and Web-Based massive quantities of simple servers brought Infrastructures together to perform a set of tasks in a distributed fashion (as opposed to centrally located), the usage model is different from Introduction traditional enterprise environments. This set of In today’s cloud- and web-based data center customers demands a standards-based infrastructures, scalability is often achieved through management interface that is consistent in large quantities of simple servers. This hyperscale heterogeneous, multi-vendor environments. usage model is drastically different than that of traditional enterprise platforms, and requires a new However, functionality and homogeneous approach to management. interfaces are lacking in scale-out management. IPMI, an older standard for out-of-band As an open industry standard that meets scalability management, is limited to a “least common requirements in multi-vendor deployments, Redfish denominator” set of commands (e.g. Power integrates easily with commonly used tools by On/Off/Reboot, temperature value, text console, specifying a RESTful interface and utilizing JSON etc.). As a result, customers have been forced to and OData. use a reduced set of functionality because vendor extensions are not common across all platforms. This set of new customers is Why a new interface? increasingly developing their own tools for tight A variety of influences have resulted in the need for integration, often having to rely on in-band management software.
    [Show full text]
  • Processor Hardware Counter Statistics As a First-Class System Resource
    ∗ Processor Hardware Counter Statistics As A First-Class System Resource XiaoZhang SandhyaDwarkadas GirtsFolkmanis KaiShen Department of Computer Science, University of Rochester Abstract which hides the differences and details of each hardware platform from the user. Today's processors provide a rich source of statis- In this paper, we argue that processor hardware coun- tical information on program execution characteristics ters are a first-class resource, warranting general OS uti- through hardware counters. However, traditionally, op- lization and requiring direct OS management. Our dis- erating system (OS) support for and utilization of the cussion is within the context of the increasing ubiquity hardware counter statistics has been limited and ad hoc. and variety of hardware resource-sharing multiproces- In this paper, we make the case for direct OS manage- sors. Examples are memory bus-sharing symmetric mul- ment of hardware counter statistics. First, we show the tiprocessors (SMPs), L2 cache-sharing chip multiproces- utility of processor counter statistics in CPU scheduling sors (CMPs), and simultaneous multithreading (SMTs), (for improved performance and fairness) and in online where many hardware resources including even the pro- workload modeling, both of which require online contin- cessor counter registers are shared. uous statistics (as opposed to ad hoc infrequent uses). Processor metrics can identify hardware resource con- Second, we show that simultaneous system and user use tention on resource-sharing multiprocessors in addition of hardware counters is possible via time-division multi- to providing useful information on application execution plexing. Finally, we highlight potential counter misuses behavior. We reinforce existing results to demonstrate to indicate that the OS should address potential security multiple uses of counter statistics in an online continu- issues in utilizing processor counter statistics.
    [Show full text]
  • Lenovo Xclarity Controller REST API Guide Note: Before Using This Information, Read the General Information in “Notices” on Page Ccxciii
    Lenovo XClarity Controller REST API Guide Note: Before using this information, read the general information in “Notices” on page ccxciii. Sixth Edition (Mar 2021) © Copyright Lenovo 2017, 2021. LIMITED AND RESTRICTED RIGHTS NOTICE: If data or software is delivered pursuant to a General Services Administration (GSA) contract, use, reproduction, or disclosure is subject to restrictions set forth in Contract No. GS-35F-05925. Contents Chapter 1. Introduction . 1 GET – Collection of Network adapters . 49 Authentication Methods . 1 GET – Network adapter properties. 50 Lenovo Extended Registries . 2 Resource NetworkPort . 53 Tools for Redfish . 2 GET – Collection of network ports . 53 GET – Network port properties . 54 Chapter 2. Service Root . 5 Resource NetworkDeviceFunction . 55 Resource ServiceRoot . 5 GET – Collection of Network device GET – Service root properties . 5 function . 56 GET – Network device PCIe functions . 57 Chapter 3. Session Management . 9 PATCH – Update network device PCIe Resource SessionService . 9 functions resource . 60 GET – Session management properties. 9 Resource Session . 10 Chapter 7. Power, thermal and GET – Session properties . 10 redundancy . 63 POST– Create a session. 11 Resource Power . 63 DELETE– Delete a session . 12 GET – Power management properties . 63 PATCH – Update power management Chapter 4. Account Management . 15 properties . 77 Resource AccountService . 15 Resource Power (Flex System Enterprise Chassis or Lenovo D2 Enclosure) . 79 GET – Account management properties . 15 GET – Power management properties . 79 PATCH – Update global account lockout properites and ldap properties . 18 Resource Thermal . 80 Resource ManagerAccount . 21 GET – Thermal management properties. 80 GET – Account properties . 21 Chapter 8. BMC Management. 85 POST – Create an account. 23 Resource Manager . 85 PATCH – Update userid/password/role/ PasswordChangeRequired .
    [Show full text]
  • Dos Attack Prevention Using Rule-Based Sniffing Technique and Firewall in Cloud Computing
    125 E3S W eb of C onferences , 21004 (2019) https://doi.org/10.1051/e3sconf/201912521004 ICENIS 2019 DoS Attack Prevention Using Rule-Based Sniffing Technique and Firewall in Cloud Computing Kagiraneza Alexis Fidele1,2*, and Agus Hartanto2 1 Data Entry and Update Taxpayer’s Registry in Rwanda Revenue Authority (RRA) Kigali-Rwanda 2 Master of Information System, School of Postgraduate Studies Diponegoro University, Semarang – Indonesia Abstract. Nowadays, we are entering an era where the internet has become a necessary infrastructure and support that can be applied as a means of regular communication and data service. In these services, cloud- based on servers has an essential role as it can serve numerous types of devices that are interconnected with several protocols. Unfortunately, internet cloud servers become the main target of attacks such as Denial of Service (DoS), Distributed Denial of Service (DDoS). These attacks have illegal access that could interfere in service functions. Sniffing techniques are typically practiced by hackers and crackers to tap data that passes through the internet network. In this paper, sniffing technique aims to identify packets that are moving across the network. This technique will distinguish packet on the routers or bridges through a sniffer tool known as snort connected to a database containing the attack pattern. If the sniffing system encounters strange patterns and recognizes them as attacks, it will notify to the firewall to separate the attacker's original Internet Protocol (IP) address. Then, communication from the attacker's host to the target will be discontinued. Consequently, the identified attack activity will stop working, and the service will proceed to run.
    [Show full text]