Abstract

In this study, we propose an optimal cluster expansion-based intrusion-tolerant system (ITS) that can maintain quality of service (QoS) under a massive denial of service (DoS) attack. Our proposed scheme conserves resources while maintaining good QoS by optimally increasing and decreasing cluster size. To evaluate the performance of the proposed scheme, we use a CloudSim simulator and compare our proposed scheme with an existing conventional adaptive cluster transformation (ACT) scheme. Our simulation results show that the proposed scheme outperforms the conventional ACT scheme in terms of better QoS and lower resource consumption.

Highlights

  • Internet access and mobile communication technologies have developed very rapidly, and have enabled users to access useful services

  • When the service response time is longer than 770 ms, central processing unit (CPU) usage is higher than 80%, and queue length is higher than 50%, the robust cluster controller (RCC) proceeds with an optimal cluster expansion process by considering incoming packet numbers and virtual machine (VM) packet processing capabilities

  • The RCC performs a cluster reduction process when the service response time is shorter than 770 ms, CPU usage is under 50%, and queue length is under 30%

Read more

Summary

Introduction

Internet access and mobile communication technologies have developed very rapidly, and have enabled users to access useful services. This accessibility provides convenience to the users, but simultaneously makes users vulnerable to malicious attacks. Many security countermeasures have been introduced, such as firewalls, intrusion detection systems (IDSs), and intrusion prevention systems (IPSs) [1,2]. These systems are still vulnerable to evolving malicious attacks, such as zero-day attacks that can target publicly known but unpatched vulnerabilities. The goal of ITS is to provide reliability and survivability by maintaining quality of service even while under attack [3]

Objectives
Findings
Discussion
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.