To optimize the multi accesses download time using scheduling approach in fog computing. (2021)

• Record Type: Journal Article
• Authors: Keerthika, M.; Sankar Ram, N.; Rajkumar, M.; Manivannan, M.V.; Monish, S.
• Is Part Of: Materials today. Volume 37(2021)Supplement Part 2
• Page Start: 1475
• Page End: 1479
• Publication Date: 2021
• Subjects: Fog computing -- Time reduction -- Round robin -- Double clash chart -- Load balancing -- Energy consumption; Materials science -- Congresses -- Periodicals; 620.1
• DOI: 10.1016/j.matpr.2020.07.104
• Languages: English
• ISSNs: 2214-7853

Abstract

Abstract: The coding chart will abuse the speed up of downloading process skillfully. The customer can set up a single server at once, the server arrangement of different customers needs to be disconnected to ensure the download time is reduced. To achieve disjoint in download systems, a double clash coding chart is proposed. The immovability of the ideal long-haul arrangement, an online calculation using structured double clash charts is being proposed by a system. For example, one record demand for each customer is determined both asymptotic lower and upper limits of the proposed strife free calculation. Recreation results show this proposed calculation displays closer to ideal execution contrasted with the ideal arrangement, and decrease download time when contrasted with the single-server coding plan. In addition, situations relating to input conditions are investigated. A most extreme probabilistic approach is utilized at the server to evaluate the system state, which is then consolidated in our proposed calculation to decrease the download time in hard situations.