Admitting New Requests in Fog Networks According to Erlang B Distribution

Abstract

Emerging phenomenon that is taken to be the next path to large and big computing is fog networking. In order to approach a big number of devices on the Internet of things (IoT) and big data volumes in real time, all analytics, resource utilization, denial of services in large Fog networks, Fog is seen emphasizing on proximity basing on user's objectives. The main goal of this study is to holistically analyze the functionality of Erlang B and exponential distribution within Fog networks, the probabilities of possible different assumptions like strictly increasing functionality for any constant value. Fog computation is mainly considered to be in the large cloud system and big data structuring having control and data planes. The study depicts that there is still a need to harmonize the Internet of thing devices for better communication, surveys has been done with an accuracy of fog communication services like the Fog networking concept supports the security, Internet of things (IoTs) where these devices are used often by the end user and connected daily like on phones on each other.