Fog computing providers have started providing services in closer proximity to the users by leasing the unused computational resources of users' devices. The leased devices are increasingly used for many time-sensitive and IoT applications. Despite the advantages of Fog, due to the highly mobile and dynamic nature of Fog devices, the resources or devices may fail at any time or may not always be available for the processing of the applications, which leads to degradation of service quality and an increase in application processing time. Hence, effective selection of the resources in the Fog computing environment by considering mobility, heterogeneity, and failure of devices is a complex task. Traditional resource selection techniques may not be applied directly in Fog computing environments due to their dynamic and unique resource characteristics. Therefore, this article proposes a Markov chain-based resource selection model to improve the quality of service by minimizing disruptions and managing device failures. The effectiveness of the proposed algorithm is evaluated using simulations, which take failure traces, current resource usage, and mobility as input from a dataset archive. Our results demonstrate the effectiveness of the proposed algorithm in terms of average disruption rates, average latency, and average overutilization. Our analysis shows significant improvements in average latency reduction of approximately 11.83%, and an average overutilization improvement by 16.17%.

To address the growing threats of Zero-Day attacks, we propose an advanced intrusion detection system framework that integrates a GAMO model for data balancing and a Double DQN mechanism for dynamic sample selection. Unlike existing methods relying on static thresholds, our framework continuously adjusts its sampling strategies based on changing threat landscapes, thereby enhancing Zero-Day attack detection and improving the recognition of minority classes in imbalanced datasets. We validate the proposed framework using the CICIDS2017 dataset. In binary classification experiments, our approach achieves 99.66% accuracy, outperforming multiple baseline models. The GAMO component enhances the detection rates for minority attack classes.

The time-evolving large graph has received attention due to it's participation in real-world applications such as social networks and PageRank calculation. It is necessary to partition a large-scale dynamic graph in a streaming manner in order to overcome the memory bottleneck while partitioning the computational load. Reducing network communication and balancing the load between the partitions are the criteria for achieving effective run-time performance in graph partitioning. Moreover, an optimal resource allocation is needed to utilise the resources while storing the graph streams into the partitions. A number of existing partitioning algorithms have been proposed to address the above problem. However, these partitioning methods are incapable of scaling the resources and handling the stream of data in real-time. In this study, we propose a dynamic graph partitioning method called Scalable Dynamic Graph Partitioner(SDP) using the streaming partitioning technique. The SDP contributes a novel vertex assigning method, communication-aware balancing method, and a scaling technique in order to produce an efficient dynamic graph partitioner. Experiment results show that the proposed method achieves up to 90% reduction of communication cost and 60%-70% balancing the load dynamically, compared with previous algorithms. Moreover, the proposed algorithm significantly reduces the execution time during partitioning.

Fog computing is an increasingly popular method with which to process the huge amount of data generated by the Internet of Things (IoT) devices and applications at the edge-level, using the heterogeneous autonomous end-devices of the participating users. To meet the requirements of the IoT and time-sensitive applications, a Fog computing platform needs to select appropriate resources, the availability of which can be guaranteed during the execution of the application. For the proper selection of resources, the platform must be able to predict future availability. Hence, a proper resource availability model which provides knowledge about the future availability of resources in the Fog computing environment is required. However, designing an efficient resource availability model, in a highly distributed and mobile environment like the Fog, is a complex task due to the multidimensional characteristics of Fog devices, such as mobility, lack of centralised control, limited resources, and being battery powered. Existing resource availability models did not consider all the characteristics of a real Fog environment. Therefore, this study aims to provide a generic continuous-time Markov chain (CTMC), based resource availability model for Fog computing environments. The applicability of the model is shown by integrating the model input with the nearest-location best fit (NLBF) and Best-Fit resource selection policies.

Summary With the proliferation of Internet of Things (IoT) and edge computing paradigms, billions of IoT devices are being networked to support data‐driven and real‐time decision making across numerous application domains, including smart homes, smart transport, and smart buildings. These ubiquitously distributed IoT devices send the raw data to their respective edge device (eg, IoT gateways) or the cloud directly. The wide spectrum of possible application use cases make the design and networking of IoT and edge computing layers a very tedious process due to the: (i) complexity and heterogeneity of end‐point networks (eg, Wi‐Fi, 4G, and Bluetooth); (ii) heterogeneity of edge and IoT hardware resources and software stack; (iv) mobility of IoT devices; and (iii) the complex interplay between the IoT and edge layers. Unlike cloud computing, where researchers and developers seeking to test capacity planning, resource selection, network configuration, computation placement, and security management strategies had access to public cloud infrastructure (eg, Amazon and Azure), establishing an IoT and edge computing testbed that offers a high degree of verisimilitude is not only complex, costly, and resource‐intensive but also time‐intensive. Moreover, testing in real IoT and edge computing environments is not feasible due to the high cost and diverse domain knowledge required in order to reason about their diversity, scalability, and usability. To support performance testing and validation of IoT and edge computing configurations and algorithms at scale, simulation frameworks should be developed. Hence, this article proposes a novel simulator IoTSim‐Edge, which captures the behavior of heterogeneous IoT and edge computing infrastructure and allows users to test their infrastructure and framework in an easy and configurable manner. IoTSim‐Edge extends the capability of CloudSim to incorporate the different features of edge and IoT devices. The effectiveness of IoTSim‐Edge is described using three test cases. Results show the varying capability of IoTSim‐Edge in terms of application composition, battery‐oriented modeling, heterogeneous protocols modeling, and mobility modeling along with the resources provisioning for IoT applications.

With the increasing number of Internet of Things (IoT) devices, the volume and variety of data being generated by these devices are increasing rapidly. Cloud computing cannot process this data due to its high latency and scalability. In order to process this data in less time, fog computing has evolved as an extension to Cloud computing. In a fog computing environment, a resource monitoring service plays a vital role in providing advanced services, such as scheduling, scaling and migration. Most of the research in fog computing has assumed that a resource monitoring service is already available. Conventional methods proposed for other distributed systems may not be suitable due to the unique features of a fog environment. To improve the overall performance of fog computing and to optimise resource usage, effective resource monitoring techniques are required. Hence, we propose a support and confidence based (SCB) technique which optimises the resource usage in the resource monitoring service. The performance of our proposed system is evaluated by examining a real-time traffic use case in a fog emulator with synthetic data. The experimental results obtained from the fog emulator show that the proposed technique consumes 19 percent lesser resources compared with the existing technique.