Designed for disseminating information in a fog computing network, Professor Sim's KM-gossip algorithm is both computationally efficient and scalable.
The KM-gossip algorithm is computationally efficient because mathematical evidence validates it has logarithmic time complexity and the number of cycles needed to disseminate information to all nodes in a fog computing network is logarithmic in the number of nodes in the network.
The KM-gossip algorithm is scalable because with growing numbers of fog nodes and IoT devices, more broker agents can be added to facilitate larger-scale information dissemination.
Since fog nodes are both lightweight and abundant, computational efficiency and scalability are crucial properties of information dissemination algorithms for fog computing.