A Review on Fog Computing, Resource Allocation Strategies and its Applications
DOI:
https://doi.org/10.61841/4ms9dr80Keywords:
A Review on Fog Computing, Resource Allocation Strategies and its ApplicationsAbstract
-- Fog computing is a paradigm that provides services to user requests at the edge networks. As the definition suggests, the fog computing platform lies between the cloud servers and the users. In a fog-enabled environment, the devices at the fog layer usually perform operations related to networking such as routers, gateways, bridges, and hubs. Researchers envision these devices to be capable of performing both computational and networking operations, simultaneously. Although these devices are resource-constrained compared to the cloud servers, the geological spread and the decentralized nature help in offering reliable services with coverage over a wide area. Further, with fog computing, manufacturers and service providers offer their services at affordable rates. Another advantage of fog computing is the physical location of the devices, which are much closer to the users than the cloud servers. Such placement of the devices reduces operational latency significantly. In particular, Fog Computing refers to a distributed computing infrastructure confined on a limited geographical area within which some Internet of Things (IoT) applications/services run directly at the network edge on smart devices having computing, storage, and network connectivity, named Fog Nodes, with the goal of improving efficiency and reducing the amount of data that needs to be sent to the Cloud for massive data processing, analysis and storage. This paper proposes an efficient strategy on resource allocations and also defines and specifies the applications of fog computing.
Downloads
References
1. D. Puthal, X. Wu, S. Nepal, R. Ranjan, and J. Chen,” SEEN: A Selective Encryption Method to Ensure Confidentiality for Big Sensing Data Streams.” IEEE Transactions on Big Data (In Press), 2017.
2. R. Deng, R. Lu, C. Lai, T. H. Luan, and H. Liang, “Optimal workload allocation in fog-cloud computing toward balanced delay and power consumption,” IEEE Internet of Things Journal, 3(6), pp. 1171-1181,2016.
3. J. Kang, R. Yu, X. Huang, and Y. Zhang,“Privacy-Preserved Pseudonym Scheme for Fog Computing Supported Internet of Vehicles,” IEEE Transactions on Intelligent Transportation Systems, 2017.
4. G. S. Aujla, N. Kumar, A. Y. Zomaya, and R. Rajan, “Optimal Decision Making for Big Data Processing at Edge-Cloud Environment: An SDN Perspective,” IEEE Transactions on Industrial Informatics, 2017.
5. A. Bouchentouf, “Commodities for dummies,” John Wiley & Sons, 2011.
6. Y. M. Al-Saleh, G. Vidican, L. Natarajan, and V. V. Theeyattuparampil, “Carbon capture, utilisation and storage scenarios for the Gulf Cooperation Council region: A Delphi-based foresight study,” Futures, 44(1), pp. 105-115, 2012.
7. M. D. Dikaiakos, D. Katsaros, P. Mehre, G. Pallis, A. Vakali, “Cloud computing: Distributed internet computing for it and scientific research,” Internet Computing, IEEE, 13(5), pp. 10-13, 2009.
8. S. K. Mishra, D. Puthal, B. Sahoo, P. Jayaraman, S. Jun, A. Y.Zomaya, R. Ranjan. ”Energy-Efficient VM-Placement in Cloud Data Center.” Sustainable Computing: Informatics and Systems (SUSCOM), (Accepted), 2018.
9. S. K. Mishra, D. Puthal, B. Sahoo, S. K. Jena, and M. S. Obaidat, An adaptive task allocation technique for green cloud computing. The Journal of Supercomputing, pp. 1-16, 2017.
10. L. Guo, S. Zhao, S. Shen, C. Jiang, “Task scheduling optimization in cloud computing based on heuristic algorithm,” Journal of Networks, 7(3), pp. 547-553, 2012.
11. D. A. Chekired, and L. Khoukhi, “Smart Grid Solution for Charging and Discharging Services Based on Cloud Computing Scheduling,” IEEE Transactions on Industrial Informatics, 2017.
12. T. Kaur, I. Chana, “Energy efficiency techniques in cloud computing: A survey and taxonomy,” ACM Computing Surveys (CSUR), 48(2), pp.22, 2015.
13. L. Zuo, L. Shu, S. Dong, C. Zhu, and T. Hara, A Multi-ObjectiveOptimization Scheduling Method Based on the Ant Colony Algorithmin Cloud Computing, IEEE Access, 3, pp. 2687-2699, 2015.
14. L. Zuo, L. Shu, S. Dong, C. Zhu, and G. Han, A Multi-queue Interlacing Peak Scheduling Method Based on Tasks Classification in Cloud Computing, IEEE Systems Journal, 2016.
15. NRDC.https://www.nrdc.org/experts/pierre-delforge/new-study-americas-data-centers-consuming-and-
wasting-growing-amounts-energy. 2013.
16. V. B. Souza, X. Masip-Bruin, E. Marin-Tordera, W. Ramirez, andS. Sanchez, “Towards Distributed Service Allocation in Fog-to-Cloud (F2C) Scenarios,” In Global Communications Conference (GLOBECOM), IEEE, pp. 1-6, 2016.
17. N. Bergmann, Y. Y. Chung, X. Yang, “Using swarm intelligence tooptimize the energy consumption for distributed systems’, Modern Applied Science, 7(6), pp. 59-66, 2013.
18. C. W. Tsai, J. J. Rodrigues, “Metaheuristic scheduling for cloud: A survey,” Systems Journal, IEEE, 8(1),
pp. 279-291, 2014.
19. Z. H. Zhan, X. F. Liu, Y. J. Gong, J. Zhang, H. S. H. Chung, and Y. Li, “Cloud computing resource scheduling and a survey of its evolutionary approaches,” ACM Computing Surveys (CSUR), 47(4), pp. 63, 2015.
20. INFRARATI. https://infrarati.wordpress.com/2014/03/25/data-center-co2-emissions/. 25 March 2014.
21. M. Maheswaran, S. Ali, H. J. Siegel, D. Hensgen, and R. F. Freund, Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of parallel and distributed computing, 59(2), pp. 107-131, 1999.
22. A. M. Sampaio, J. G. Barbosa, R. Prodan, “Piasa: A power and interference aware resource management strategy for heterogeneous work-loads in cloud data centers,” Simulation Modelling Practice and Theory, 57, pp. 142-160, 2015.
23. L. Zuo, L. Shu, S. Dong, C. Zhu, and Z. Zhou, Dynamic Weighted Load Evaluation Model Based on Self-adaptive Threshold in Cloud Computing, Mobile Networks and Applications, 22(1), pp. 4-18, 2017.
24. T. Shi, M. Yang, X. Li, Q. Lei, and Y. Jiang, “An energy-efficient scheduling scheme for time-constrained tasks in local mobile clouds,” Pervasive and Mobile Computing, Elsevier, Vol-27, pp. 90-105, 2016.
25. M. R. Garey, D. S. Johnson, “Computers and intractability: a guide to the theory of np-completeness,” WH Freemann, New York, San Francisco,1979.
26. D. Klusacek, H. Rudova, “A metaheuristic for optimizing the performance and the fairness in job scheduling systems,” Artificial Intelligence Applications in Information and Communication Technologies, Springer, pp. 3-29, 2015.
27. X. Dai, J. M. Wang, B. Bensaou, “Energy-efficient virtual machines scheduling in multi-tenant data centers,” pp. 210-221, 2016.
28. Z. Wang, K. Shuang, L. Yang, and F. Yang, “Energy-aware and revenue enhancing Combinatorial Scheduling in Virtualized of Cloud Datacenter,” Journal of Convergence Information Technology, 7(1),
pp. 62-70,2012.
29. S. Raghavan, P. Sarwesh, C. Marimuthu, and K. Chandrasekaran, “Bat algorithm for scheduling workflow applications in cloud,” In IEEE International Conference on Electronic Design, Computer Networks & Automated Verification (EDCAV), pp. 139-144, 2015.
30. T. S. Somasundaram, K. Govindarajan,“CLOUDRB: A framework for scheduling and managing High-Performance Computing (HPC) applications in science cloud,” Future Generation Computer Systems, 34, pp.47-65, 2014.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
