Transient Analysis of Fog Nodes with Catastrophes

The networking business has recently seen significant transformations. It also necessitates high-speed operations and the ability to solve difficult problems. The Internet-of-Things (IoT) is being presented as a method to manage these changes from a variety of technical perspectives. Handling such large amounts of network data, as well as its privacy and security, as well as QoS requirements and the variety of underlying networking components, are all issues in IoT implementations. Fog computing is a new technology paradigm that instead of executing in the cloud, delivers a set of networking services closer to the user. In terms of minimising latency, scalability of the networking infrastructure, reliability in networking services, and security in networking devices, fog computing outperforms cloud computing. As a result, fog computing has altered the technical mindset by bringing cloud-based networking services closer to the client level in order to give the highest quality of service. There are numerous scenarios in which fog servers fail. We investigate the model with Markovian queue having heterogeneous VMs and fog server catastrophes in this work. Exact formulas for the transient probabilities of system capacity are obtained for queues with discouraged arrival and infinite VMs.