Comparison and Optimization of Energy Efficient Algorithm for Component Base Distributed Computing in 5G Networks
Kamlesh Kumar Verma *
Department of Mathematical Sciences & Computer Applications, Bundelkhand University, Kanpur Road, Jhansi, UP, India.
Rajesh Kumar Saini
Department of Mathematical Sciences & Computer Applications, Bundelkhand University, Kanpur Road, Jhansi, UP, India.
*Author to whom correspondence should be addressed.
Abstract
In the present scenario, the wired network or wireless networks is an application across the world. So the wire networks used in various software industries, educational institutions, and various enterprises used such as distributed data centers. The data transmission works like a flow of electricity in a linear way. So in this process during the data transmission exhibits from one stage to another the energy consumption in carbon footprint (i.e. CO2). The data transmission is two types of methods (1) Communication-Based (2) Component-Based. Here this paper concludes the compared study of component-based energy consumption using the Bellman-Ford Algorithm and Dijkstra's Algorithm. The results and finding measurement as discussed in this paper.
Keywords: Energy optimization, Bellman-Ford algorithm, distributed computing networks, Bellman-Ford time complexity, energy consumption, Dijkstra's algorithm time complexity