Providing an improved greedy approach to increasing the number of users served on cloud-edge networks

The most critical challenge in edge computing is to increase the number of users of the service provided without changing the complexity of the problem and imposing further delays for servicing the cloud-edge network. First, every user will request the service from their edge server, which edges provide it. If there is no service in the edge cloud, the inquiry is made from the adjacent edge server based on the distance. The nearest edge clouds that can connect to it wirelessly provide the desired service. If it fails to receive the service from them, the service request enters the backhaul link and searches for the requested service on other edge servers. Finally, if it still fails to receive the service, it will receive the service from the cloud. Due to the complexity examined, the strategy presented in the paper provides the conditions to increase the number of service users without changing the service delay. The average improvement for users served to all users in the proposed algorithm. However, 0.4% relative to the greedy and 1.1% relative to the maximum flow, the proposed method shows a 20% and 22% improvement over the maximum flow and greedy algorithm in users' scheduling, respectively.