Concurrency and Computation-Practice & Experience最新文献

{"title":"RyuGuard—Combining Ryu and machine learning for proactive DDoS defense in software-defined networks","authors":"D. Sendil Vadivu,&nbsp;Narendran Rajagopalan","doi":"10.1002/cpe.8289","DOIUrl":"https://doi.org/10.1002/cpe.8289","url":null,"abstract":"<div>\u0000 \u0000 <p>Software defined network (SDN) is an experimental network design utilized by software companies, academia, and healthcare systems to provide adequate resource utilization, data management, superior network control, and administration. However, these networks face substantial risks, especially from distributed denial of service (DDoS) attacks, requiring robust cybersecurity measures. This article proposes RyuGuard, an intrusion detection and prevention system (IDPS) enhanced with machine learning (ML) capabilities, specifically designed to protect SDNs from DDoS attacks. A DDoS-specific dataset was collected in the SDN environment through feature extraction from normal and malicious traffic. The evaluation of the dataset with the ML classifiers demonstrates that the decision tree (DT) was the most effective model, with a low false alarm rate (FAR), achieving an accuracy of 99.9%, and rapid execution time, which ensures timely detection and response, suitable for real-time implementation. RyuGuard, with DT deployment and utilizing the programmability feature of SDN, is designed to predict and prevent the DDoS attack from the ongoing traffic of SDN. Compared with the other existing models, the presented IDPS, RyuGuard, enables early attack prediction, preventing the full impact of DDoS within the network while maintaining sustained throughput and performance with low CPU utilization.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142724221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Extreme learning with projection relational algebraic secured data transmission for big cloud data","authors":"G. Sakthivel,&nbsp;P. Madhubala","doi":"10.1002/cpe.8273","DOIUrl":"https://doi.org/10.1002/cpe.8273","url":null,"abstract":"<div>\u0000 \u0000 <p>Cloud Computing (CC) and big data are growing technology in the business. Big data is demonstrated in terms of volume, variety, and velocity. CC is employed for storing, processing, and accessing data. Many cryptographic techniques have been developed to enhance big data security in cloud computing. However, security and privacy are the primary concerns in protecting data, as it is highly sensitive. Yet, it faces the major problems of inefficient performance, increased time consumption, and lack of data confidentiality and integrity. To address this issue, proposed Extreme Learning with Projection Relational Algebraic Secured Data Transmission (ELPRA-SDT) is introduced to secure data transactions from cloud users to cloud servers with enhanced data confidentiality and reduced time consumption for big cloud data. The proposed ELPRA-SDT consists of two major processes namely registration and key generation. At first, the user's IP address is registered employing a transitive advanced set relation theory graph model in a cloud server (CS) for retrieving the numerous services. The CS generates private and public keys for each registered user's IP address using the Transitive Operational and Time Synchronized Random Winternitz Key generation model. After, the user sends a request to the CS for acquiring data. The CS validates the requested user based on security policy attributes. Second, the Projection Relational Algebraic Signcryption and Unsigncryption algorithm performs signature verification to ensure secure data access for protecting the data. Results of experiments carried out by using Coburg Intrusion Detection Data Sets-001 dataset in Java. ELPRA-SDT method is more efficient and more suitable for providing security and privacy to network traces in the Cloud. The result shows maximum performance with data confidentiality by 10% and data integrity by 13%. In addition, delay is reduced by 32%, and data delivery time and communication complexity is decreased by 28% and 24% to other existing methods.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142674119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A competent CCHFMO with AMDH for QoS improvisation and efficient route protection in MANET","authors":"Gajendra Kumar Ahirwar,&nbsp;Ratish Agarwal,&nbsp;Anjana Pandey","doi":"10.1002/cpe.8272","DOIUrl":"https://doi.org/10.1002/cpe.8272","url":null,"abstract":"<div>\u0000 \u0000 <p>The ability of mobile ad hoc networks (MANET) to be used as communication tools in a variety of industries, including healthcare, the military, smart traffic, and smart cities, has drawn special consideration. Traditional Manet's multicast routing methods seem to be inappropriate to massive with Adaptive systems because the problem is NP-complete, resulting in an enchanting QoS restrictions. In order to conquer that the paper proficiently introduces the Conglomerate Crumb Horde Formicary Meta-Heuristic (CCHFMO) with Asymmetrical Meander Diffie-Hellman (AMDH) to tackle the major obstacles are multicast routing problems and lack of data protection. Initially, the fusion of crumb horde optimization (CHO) and formicary optimization (FO) is exploited to strengthen QoS limitations and reduce QoS data loss. However, the massive and dynamic nature of the network with the combination of more QoS restrictions, deficient security has become extremely difficult. Therefore, the research work establishes the asymmetrical meander Diffie-Hellman (AMDH) to significantly improve performance and concealment while ensuring channel security during data transfer. Finally, the results demonstrated that by employing the novel optimization approaches, the MANET can increase data protection while still achieving high transmission rates and sophistication of communication. As a consequence, it adequately explicates the article to improve QoS performances.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142674209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ASCL: Accelerating semi-supervised learning via contrastive learning","authors":"Haixiong Liu,&nbsp;Zuoyong Li,&nbsp;Jiawei Wu,&nbsp;Kun Zeng,&nbsp;Rong Hu,&nbsp;Wei Zeng","doi":"10.1002/cpe.8293","DOIUrl":"https://doi.org/10.1002/cpe.8293","url":null,"abstract":"<div>\u0000 \u0000 <p>SSL (semi-supervised learning) is widely used in machine learning, which leverages labeled and unlabeled data to improve model performance. SSL aims to optimize class mutual information, but noisy pseudo-labels introduce false class information due to the scarcity of labels. Therefore, these algorithms often need significant training time to refine pseudo-labels for performance improvement iteratively. To tackle this challenge, we propose a novel plug-and-play method named Accelerating semi-supervised learning via contrastive learning (ASCL). This method combines contrastive learning with uncertainty-based selection for performance improvement and accelerates the convergence of SSL algorithms. Contrastive learning initially emphasizes the mutual information between samples as a means to decrease dependence on pseudo-labels. Subsequently, it gradually turns to maximizing the mutual information between classes, aligning with the objective of semi-supervised learning. Uncertainty-based selection provides a robust mechanism for acquiring pseudo-labels. The combination of the contrastive learning module and the uncertainty-based selection module forms a virtuous cycle to improve the performance of the proposed model. Extensive experiments demonstrate that ASCL outperforms state-of-the-art methods in terms of both convergence efficiency and performance. In the experimental scenario where only one label is assigned per class in the CIFAR-10 dataset, the application of ASCL to Pseudo-label, UDA (unsupervised data augmentation for consistency training), and Fixmatch benefits substantial improvements in classification accuracy. Specifically, the results demonstrate notable improvements in respect of 16.32%, 6.9%, and 24.43% when compared to the original outcomes. Moreover, the required training time is reduced by almost 50%.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142737500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A novel controllability method on complex temporal networks based on temporal motifs","authors":"Yan Jin,&nbsp;Peyman Arebi","doi":"10.1002/cpe.8278","DOIUrl":"https://doi.org/10.1002/cpe.8278","url":null,"abstract":"<div>\u0000 \u0000 <p>Complex temporal networks have become instrumental in modeling dynamic systems across various disciplines, presenting unique challenges and opportunities in understanding and influencing their behavior. Controllability, a fundamental aspect of network dynamics, plays a pivotal role in manipulating these systems towards desired states. Temporal motifs are important patterns in temporal complex networks that have many applications in solving problems related to this type of networks. In this paper, a novel method for controlling temporal complex networks using temporal motifs is proposed. First, the most important effective temporal motifs in the controllability processes of complex networks have been identified and it has been shown that the network can be fully controlled using these temporal motifs. Then, an algorithm for extracting temporal motifs is proposed. This algorithm has been proposed to identify effective temporal motifs in network controllability to optimally identify control nodes. To increase the efficiency of extracting temporal motifs, a method for predicting the temporal motif-based link has been proposed, which predicts temporal motifs. The results of the simulation of the proposed method based on temporal motifs and its implementation on real-world temporal complex networks demonstrates that its performance was better than the conventional controllability methods.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142674008","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Assessment of reliability and availability of wireless sensor networks in industrial applications by considering permanent faults","authors":"Arash Heidari,&nbsp;Zahra Amiri,&nbsp;Mohammad Ali Jabraeil Jamali,&nbsp;Nima Jafari","doi":"10.1002/cpe.8252","DOIUrl":"https://doi.org/10.1002/cpe.8252","url":null,"abstract":"<p>Wireless Sensor Networks (WSNs) are critical for communication within a mile radius and industrial applications. These networks are very prone to failure due to their enormous number of nodes and their unique hardware and software restrictions. To make sure network performance, a lot of study needs to be done to improve failure tolerance and stability. This study looks at how to judge the availability and dependability of WSNs that have long-term issues. The suggested method checks how well a network works in various failure cases by using fault trees and Markov chain analysis. Such methods help us find and study possible failure scenarios and how they might impact the network's dependability in a planned way. The results show that WSNs have major flaws and give useful suggestions for making the systems work better. The findings show that using these evaluation methods may greatly enhance the ability to handle faults, lower the risk of damage, and allow developers of WSNs to make smart choices.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.8252","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142674156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Secure device authentication and key agreement mechanism for LoRaWAN based IoT networks","authors":"Devishree Naidu,&nbsp;Niranjan K. Ray","doi":"10.1002/cpe.8283","DOIUrl":"https://doi.org/10.1002/cpe.8283","url":null,"abstract":"<div>\u0000 \u0000 <p>The proposed work introduces two schemes for secure device authentication and key agreement (SDA &amp; KA) mechanisms. Initially, an efficient implicit certificate approach based on the Elliptic curve Qu–Vanstone (EIC-EcQuV) scheme is developed in the first stage to instantly concur on the session key. The proposed scheme implicitly performs quick authentication of the public key. Also, this scheme prevents the attacker from creating fake key combinations. Through EIC-EcQuV, the implicit certificate (IC) is distributed which helps to implicitly authenticate the user. This work also proposes ithe developed Public Key Certificateless Cryptosystem (PKCIC) scheme in the second stage, whch was also for the SDA &amp; KA mechanism. In the EIC-EcQuV scheme, efficient authentication is enabled, but public key theft is possible. However, in the PKCIC scheme, authentication is performed through partial keys, and the public key is secured via the Schnorr signature. The efficiency of the proposed schemes is proved by comparing the attained results with previous schemes. The proposed method obtains the computational cost of 0.0583 s for end-to-end devices, 0.06111 for network servers, and 0.00071 s for the gateway, with an execution time of 78.624 for 1000 devices. The attained key agreement of the proposed EIC-EcQuV is 0.953 s, and PKCIC is 0.9988 s.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142674152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A novel superposition coding scheme based on polar code for multi-user detection in underwater acoustic OFDM communication system","authors":"Wen Meiqi,&nbsp;Xing Siyu,&nbsp;Wei Bo,&nbsp;Yu Yanting","doi":"10.1002/cpe.8296","DOIUrl":"https://doi.org/10.1002/cpe.8296","url":null,"abstract":"<div>\u0000 \u0000 <p>Superposition coding (SC) is a non-orthogonal multiple access (NOMA) scheme for the downlink communication system, which allows signals of different users to be stacked and forwarded simultaneously in the same frequency band. The codeword for each user is assigned a different weight at the transmitter to avoid signal conflicts and interference after stacking, and successive interference cancellation (SIC) is adopted to decode. A novel SC scheme based on polar code, suitable for the downlink multi-user underwater acoustic (UWA) communication system using orthogonal frequency division multiplexing (OFDM), is proposed in this paper. Polar code is utilized to create a nested code structure that is divided into several subsets. We exploit this feature of the polar codes and assign each subset to the corresponding user in the channel coding process. The information bits are placed on the independent subset for each user, and the random bits are placed on the subset of other users while all the users share the same set of frozen bits. Then, the codewords are stacked with different weights. The selection range of power factors can be expanded through the double superposition of the coding and the power domains, and higher system throughput and fairness can be achieved. The simulation and tank experiment results significantly verify the effectiveness of the proposed scheme, making it most suitable for the downlink UWA multi-user communication systems.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142737468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Energy efficient dynamic scheduling of dependent tasks for multi-core real-time systems using delay techniques","authors":"Kalyan Baital,&nbsp;Amlan Chakrabarti","doi":"10.1002/cpe.8267","DOIUrl":"https://doi.org/10.1002/cpe.8267","url":null,"abstract":"<div>\u0000 \u0000 <p>Optimizing energy consumption and maximizing throughput in multi-core real-time architectures through dynamic task scheduling is a critical design challenge. While significant attention has been devoted to addressing this challenge in the domain of real-time multi-core scheduling, the focus has primarily centered on considering periodic tasks as independent. However, the existing literature notably lacks comprehensive study of scheduling methodologies on multi-core systems that consider dependent tasks, though typical real-time systems execute tasks that share resources. Earlier studies have predominantly examined scenarios involving random new tasks and task instances (jobs), which are executed in different power levels. Each task (and job) has distinct execution time corresponding to each power level. By considering these parameters (power levels and execution times of jobs), various combinations of energy signatures have been found to attain an optimum system state. Building upon this prior research, our paper extends the scope to encompass task scheduling in multi-core systems with task dependencies. We introduce a novel approach that categorizes dependent tasks into ASAP (as soon as possible) and ALAP (as late as possible) groups, prioritizing task execution based on task mobility—defined as the disparity between the last cycle the task can be scheduled in and the current cycle. Furthermore, our model demonstrates an approach for efficient scheduling of sporadic and aperiodic tasks within this framework. Through experimental validation using randomized task sets, our results indicate that the proposed model achieves a minimum of 5% reduction in normalized total energy consumption compared to existing methodologies.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142674195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"EBWO-GE: An innovative approach to dynamic VM consolidation for cloud data centers","authors":"Sahul Goyal,&nbsp;Lalit Kumar Awasthi","doi":"10.1002/cpe.8295","DOIUrl":"https://doi.org/10.1002/cpe.8295","url":null,"abstract":"<div>\u0000 \u0000 <p>Cloud data centers (CDCs) have revolutionized global computing by offering extensive storage and processing capabilities. Nevertheless, the environmental impact of these processes, including their substantial energy consumption and carbon emissions, calls for implementing more efficient techniques. Efficient virtual machine (VM) consolidation is crucial in optimizing resource utilization and reducing energy consumption. Current methods for enhancing energy efficiency often lead to issues such as service level agreements (SLAs) violations and quality of services (QoS) degradation. This study presents a novel approach to host selection using a grey-extreme (GE) machine learning model, which accurately predicts over and underutilized hosts. In addition, a VM placement technique called enhanced black widow optimization (EBWO) utilizes black widow optimization heuristic techniques and a differential evolutionary approach to optimize VM placement. The proposed dynamic VM consolidation technique optimizes energy utilization while meeting strict SLA requirements and enhancing QoS metrics in CDCs. Extensive analyses were conducted using the Cloudsim toolkit to validate the approach's effectiveness. These analyses encompassed conditions such as random workloads in heterogeneous environments. The simulation results showed that GE-EBWO outperforms other techniques and improves energy efficiency by 12%–15%. In addition, it significantly decreases VM migrations by 11%–14% compared to other advanced methods. The study validates the practicality of the proposed technique in moving towards environmentally friendly CDCs.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142737616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}