{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T04:29:53Z","timestamp":1772166593610,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST108- 2221-E-005-021-MY3"],"award-info":[{"award-number":["MOST108- 2221-E-005-021-MY3"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Fog computing aims to mitigate data communication delay by deploying fog nodes to provide servers in the proximity of users and offload resource-hungry tasks that would otherwise be sent to distant cloud servers. In this paper, we propose an effective fog device deployment algorithm based on a new metaheuristic algorithm\u2013search economics\u2013to solve the optimization problem for the deployment of fog computing systems. The term \u201ceffective\u201d in this paper refers to that the developed algorithm can achieve better performance in terms of metrics such as lower latency and less resource usage. Compared with conventional metaheuristic algorithms, the proposed algorithm is unique in that it first divides the solution space into a set of regions to increase search diversity of the search and then allocates different computational resources to each region according to its potential. To verify the effectiveness of the proposed algorithm, we compare it with several classical fog computing deployment algorithms. The simulation results indicate that the proposed algorithm provides lower network latency and higher quality of service than the other deployment algorithms evaluated in this study.<\/jats:p>","DOI":"10.1186\/s13677-023-00475-x","type":"journal-article","created":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T04:02:13Z","timestamp":1689393733000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["SEFSD: an effective deployment algorithm for fog computing systems"],"prefix":"10.1186","volume":"12","author":[{"given":"Huan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Yan","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tai-Lin","family":"Chiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Chao","family":"Chiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0128-4052","authenticated-orcid":false,"given":"Chun-Wei","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,15]]},"reference":[{"key":"475_CR1","doi-asserted-by":"crossref","unstructured":"Bonomi F, Milito R, Zhu J, Addepalli S (2012) Fog computing and its role in the internet of things. In: Proceedings of Mobile Cloud Computing Workshop.\u00a0ACM, pp 13\u201316","DOI":"10.1145\/2342509.2342513"},{"key":"475_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jnca.2017.09.002","volume":"98","author":"P Hu","year":"2017","unstructured":"Hu P, Dhelim S, Ning H, Qiu T (2017) Survey on fog computing: Architecture, key technologies, applications and open issues. J Netw Comput Appl 98:27\u201342","journal-title":"J Netw Comput Appl"},{"key":"475_CR3","unstructured":"Luan TH, Gao L, Li Z, Xiang Y, Sun L (2015) Fog computing: Focusing on mobile users at the edge. arXiv 1\u201311. http:\/\/arxiv.org\/abs\/1502.01815"},{"issue":"5","key":"475_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3326066","volume":"52","author":"CH Hong","year":"2019","unstructured":"Hong CH, Varghese B (2019) Resource management in fog\/edge computing: A survey on architectures, infrastructure, and algorithms. ACM Comput Surv 52(5):1\u201337","journal-title":"ACM Comput Surv"},{"key":"475_CR5","doi-asserted-by":"crossref","unstructured":"Aditya S, Figueiredo JR (2017) Frugal: Building degree-constrained overlay topology from social graphs. In: Proceedings of IEEE International Conference on Fog and Edge Computing.\u00a0\u00a0IEEE, pp 11\u201320","DOI":"10.1109\/ICFEC.2017.19"},{"issue":"4","key":"475_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","volume":"7","author":"SC Narula","year":"1980","unstructured":"Narula SC, Ho CA (1980) Degree-constrained minimum spanning tree. Comput OR 7(4):239\u2013249","journal-title":"Comput OR"},{"issue":"4","key":"475_CR7","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.pnsc.2007.11.014","volume":"18","author":"A Ning","year":"2008","unstructured":"Ning A, Ma L, Xiong X (2008) A new algorithm for degree-constrained minimum spanning tree based on the reduction technique. Prog Nat Sci 18(4):495\u2013499","journal-title":"Prog Nat Sci"},{"issue":"1","key":"475_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(01)00255-4","volume":"118","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro CC, Souza MC (2002) Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discret Appl Math 118(1):43\u201354","journal-title":"Discret Appl Math"},{"issue":"1","key":"475_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.ejor.2019.01.002","volume":"276","author":"K Singh","year":"2019","unstructured":"Singh K, Sundar S (2019) A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem. Eur J Oper Res 276(1):88\u2013105","journal-title":"Eur J Oper Res"},{"issue":"1","key":"475_CR10","doi-asserted-by":"publisher","first-page":"2169","DOI":"10.1007\/s00500-019-04051-x","volume":"24","author":"K Singh","year":"2020","unstructured":"Singh K, Sundar S (2020) A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem. Soft Comput 24(1):2169\u20132186","journal-title":"Soft Comput"},{"issue":"6","key":"475_CR11","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1023\/A:1011977126230","volume":"7","author":"M Krishnamoorthy","year":"2001","unstructured":"Krishnamoorthy M, Ernst AT, Sharaiha YM (2001) Comparison of algorithms for the degree constrained minimum spanning tree. J Heuristics 7(6):587\u2013611","journal-title":"J Heuristics"},{"key":"475_CR12","doi-asserted-by":"crossref","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. MIT press, Cambridge","DOI":"10.7551\/mitpress\/1090.001.0001"},{"issue":"4598","key":"475_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"475_CR14","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of International Conference on Neural Networks, vol 4.\u00a0IEEE, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"475_CR15","doi-asserted-by":"crossref","unstructured":"Tsai CW (2015) Search economics: A solution space and computing resource aware search method. In: Proceedings of IEEE International Conference on Systems, Man, and Cybernetics, Kowloon, China.\u00a0IEEE; pp 2555\u20132560","DOI":"10.1109\/SMC.2015.447"},{"issue":"5","key":"475_CR16","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1109\/TC.2015.2435781","volume":"65","author":"L Yang","year":"2015","unstructured":"Yang L, Cao J, Liang G, Han X (2015) Cost aware service placement and load dispatching in mobile cloud systems. IEEE Trans Comput 65(5):1440\u20131452","journal-title":"IEEE Trans Comput"},{"key":"475_CR17","doi-asserted-by":"crossref","unstructured":"Lin CC, Yang JW (2018) Cost-efficient deployment of fog computing systems at logistics centers in industry 4.0. IEEE Trans Ind Inform 14(10):4603\u20134611","DOI":"10.1109\/TII.2018.2827920"},{"issue":"3","key":"475_CR18","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput Surv 35(3):268\u2013308","journal-title":"ACM Comput Surv"},{"key":"475_CR19","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.comnet.2016.01.005","volume":"101","author":"C-W Tsai","year":"2016","unstructured":"Tsai C-W (2016) An effective WSN deployment algorithm via search economics. Comput Netw 101:178\u2013191","journal-title":"Comput Netw"},{"issue":"3","key":"475_CR20","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/JIOT.2018.2796310","volume":"5","author":"C-W Tsai","year":"2018","unstructured":"Tsai C-W, Liu S-J (2018) An effective iot service-to-interface assignment algorithm via search economics. IEEE Internet Things J 5(3):1708\u20131718","journal-title":"IEEE Internet Things J"},{"key":"475_CR21","doi-asserted-by":"publisher","first-page":"2251","DOI":"10.1007\/s12652-019-01353-8","volume":"11","author":"C-W Tsai","year":"2020","unstructured":"Tsai C-W, Liu S-J (2020) An effective hyper-dense deployment algorithm via search economics. J Ambient Intell Humanized Comput 11:2251\u20132262","journal-title":"J Ambient Intell Humanized Comput"},{"issue":"2","key":"475_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3410156","volume":"21","author":"C-W Tsai","year":"2021","unstructured":"Tsai C-W, Fang Z-Y (2021) An effective hyperparameter optimization algorithm for dnn to predict passengers at a metro station. ACM Trans Internet Technol 21(2):1\u201324","journal-title":"ACM Trans Internet Technol"},{"key":"475_CR23","doi-asserted-by":"crossref","unstructured":"Tsai K-H, Tsai C-W, Chiang M-C (2022) An effective metaheuristic-based pruning method for convolutional neural network. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion.\u00a0ACM, pp 679\u2013682","DOI":"10.1145\/3520304.3528935"},{"issue":"1","key":"475_CR24","first-page":"69","volume":"1","author":"DE Goldberg","year":"1991","unstructured":"Goldberg DE, Deb K (1991) A comparative analysis of selection schemes used in genetic algorithms. Found Genet Algorithm 1(1):69\u201393","journal-title":"Found Genet Algorithm"},{"key":"475_CR25","doi-asserted-by":"crossref","unstructured":"Li Y, Wang S (2018) An energy-aware edge server placement algorithm in mobile edge computing. In: Proceedings of IEEE International Conference on Edge Computing.\u00a0IEEE, pp 66\u201373","DOI":"10.1109\/EDGE.2018.00016"},{"issue":"10","key":"475_CR26","doi-asserted-by":"publisher","first-page":"4497","DOI":"10.1109\/TII.2018.2791619","volume":"14","author":"SK Mishra","year":"2018","unstructured":"Mishra SK, Puthal D, Rodrigues JJ, Sahoo B, Dutkiewicz E (2018) Sustainable service allocation using a metaheuristic technique in a fog server for industrial applications. IEEE Trans Ind Inform 14(10):4497\u20134506","journal-title":"IEEE Trans Ind Inform"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00475-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-023-00475-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00475-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T04:07:03Z","timestamp":1689394023000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-023-00475-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":26,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["475"],"URL":"https:\/\/doi.org\/10.1186\/s13677-023-00475-x","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1111557\/v1","asserted-by":"object"}]},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"25 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare the following:\n                      \n                      The work described has not been submitted elsewhere for publication, and all the authors listed have approved the manuscript that is enclosed.\n                      \n                      We have read and abided by the statement of ethical standards for manuscripts submitted to Journal of Cloud Computing.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"105"}}