A Resource Management Model for Distributed Multi-Task Applications in Fog Computing Networks

dc.contributor.authorHosseinpour Farhoud
dc.contributor.authorNaebi Ahmad
dc.contributor.authorVirtanen Seppo
dc.contributor.authorPahikkala Tapio
dc.contributor.authorTenhunen Hannu
dc.contributor.authorPlosila Juha
dc.contributor.organizationfi=data-analytiikka|en=Data-analytiikka|
dc.contributor.organizationfi=kyberturvallisuusteknologia|en=Cyber Security Engineering|
dc.contributor.organizationfi=robotiikka ja autonomiset järjestelmät|en=Robotics and Autonomous Systems|
dc.contributor.organizationfi=tietotekniikan laitos|en=Department of Computing|
dc.contributor.organization-code1.2.246.10.2458963.20.28753843706
dc.contributor.organization-code1.2.246.10.2458963.20.68940835793
dc.contributor.organization-code1.2.246.10.2458963.20.72785230805
dc.contributor.organization-code2610300
dc.converis.publication-id67672534
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/67672534
dc.date.accessioned2022-10-27T12:25:36Z
dc.date.available2022-10-27T12:25:36Z
dc.description.abstract<p>While the effectiveness of fog computing in Internet of Things (IoT) applications has been widely investigated in various studies, there is still a lack of techniques to efficiently utilize the computing resources in a fog platform to maximize Quality of Service (QoS) and Quality of Experience (QoE). This paper presents a resource management model for service placement of distributed multitasking applications in fog computing through mathematical modeling of such a platform. Our main design goal is to reduce communication between the candidate nodes hosting different task modules of an application by selecting a group of nodes near each other and as close to the source of the data as possible. We propose a method based on a greedy principle that demonstrates a highly scalable and near-optimal performance for resource mapping problems for multitasking applications in fog computing networks. Compared with the commercial Gurobi optimizer, our proposed algorithm provides a mapping solution that obtains 93% of the performance, attributed to a higher communication cost, while outperforming the reference method in terms of the computing speed, cutting the mapping execution time to less than 1% of that of the Gurobi optimizer.<br></p>
dc.identifier.eissn2169-3536
dc.identifier.jour-issn2169-3536
dc.identifier.olddbid175424
dc.identifier.oldhandle10024/158518
dc.identifier.urihttps://www.utupub.fi/handle/11111/29839
dc.identifier.urnURN:NBN:fi-fe2021120158370
dc.language.isoen
dc.okm.affiliatedauthorHosseinpour, Farhoud
dc.okm.affiliatedauthorVirtanen, Seppo
dc.okm.affiliatedauthorPahikkala, Tapio
dc.okm.affiliatedauthorTenhunen, Hannu
dc.okm.affiliatedauthorPlosila, Juha
dc.okm.discipline113 Computer and information sciencesen_GB
dc.okm.discipline213 Electronic, automation and communications engineering, electronicsen_GB
dc.okm.discipline113 Tietojenkäsittely ja informaatiotieteetfi_FI
dc.okm.discipline213 Sähkö-, automaatio- ja tietoliikennetekniikka, elektroniikkafi_FI
dc.okm.internationalcopublicationinternational co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherInstitute of Electrical and Electronics Engineers
dc.publisher.countryUnited Statesen_GB
dc.publisher.countryYhdysvallat (USA)fi_FI
dc.publisher.country-codeUS
dc.relation.doi10.1109/ACCESS.2021.3127355
dc.relation.ispartofjournalIEEE Access
dc.source.identifierhttps://www.utupub.fi/handle/10024/158518
dc.titleA Resource Management Model for Distributed Multi-Task Applications in Fog Computing Networks
dc.year.issued2021

Tiedostot

Näytetään 1 - 1 / 1
Ladataan...
Name:
A_Resource_Management_Model_for_Distributed_Multi-Task_Applications_in_Fog_Computing_Networks.pdf
Size:
7.49 MB
Format:
Adobe Portable Document Format
Description:
Publisher's PDF