Analytical and Comprehensive Study of Various Assignment Problems for Sustainable Management of Resources in Cloud Computing Environment

Nowadays, cloud computation demands resources that play a vital role in the resource administration process for cloud environment and IOT devices, as well as providing a sustainable solution for better performance. Monitoring and arranging resources are essential for resource allocation to the IOT devices through which to get the results towards the optimization issue regarding cloud computing and communication technologies also. Several earlier techniques for assigning the resources are monitored and compared to find the shortest (optimal) execution time, which leads to less energy consumption. This research paper comprehensively studies the various implicative and assignment mechanisms such as Travelling Salesman Problem (TSP), Hungarian and Branch and Bound (B & B). Apply these techniques on the same data sets and get the results with the use of Python language in terms of the execution time of TSP-1750.41, Hungarian-1584.80 and B & B-1581.65 per unit time. After analyzing the results, the finding is that the B & B mechanism provides a better make span regarding execution time, i. e. 1581.65, which helps the IoT device to increase sustainability and save energy, which helps to increase the revenue of stakeholders.