Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Cost-Effective and Robust Service Provisioning in Multi-Access Edge Computing
Hangzhou City University, China; Shanghai Jiao Tong University, China.
Zhejiang University, China.
Hangzhou Dianzi University, China.
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). Queens University, UK.ORCID iD: 0000-0001-9194-010X
Show others and affiliations
2024 (English)In: IEEE Transactions on Parallel and Distributed Systems, ISSN 1045-9219, E-ISSN 1558-2183, Vol. 35, no 10, p. 1765-1779Article in journal (Refereed) Published
Abstract [en]

With the development of multiaccess edge computing (MEC) technology, an increasing number of researchers and developers are deploying their computation-intensive and IO-intensive services (especially AI services) on edge devices. These devices, being close to end users, provide better performance in mobile environments. By constructing a service provisioning system at the network edge, latency is significantly reduced due to short-distance communication with edge servers. However, since the MEC-based service provisioning system is resource-sensitive and the network may be unstable, careful resource allocation and traffic scheduling strategies are essential. This paper investigates and quantifies the cost-effectiveness and robustness of the MEC-based service provisioning system with the applied resource allocation and traffic scheduling strategies. Based on this analysis, a cost-effective and robust service provisioning algorithm, termed CERA, is proposed to minimize deployment costs while maintaining system robustness. Extensive experiments are conducted to compare the proposed approach with well-known baseline algorithms and evaluate factors impacting the results. The findings demonstrate that CERA achieves at least 15.9% better performance than other baseline algorithms across various instances.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2024. Vol. 35, no 10, p. 1765-1779
Keywords [en]
Servers, Resource management, Costs, Robustness, Artificial intelligence, Power system protection, Power system faults, Edge computing, resource allocation, service computing, traffic scheduling
National Category
Computer and Information Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-101622DOI: 10.1109/TPDS.2024.3435929ISI: 001291895800002Scopus ID: 2-s2.0-85200245270OAI: oai:DiVA.org:kau-101622DiVA, id: diva2:1897607
Funder
Knowledge FoundationAvailable from: 2024-09-13 Created: 2024-09-13 Last updated: 2026-02-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Taheri, Javid

Search in DiVA

By author/editor
Taheri, Javid
By organisation
Department of Mathematics and Computer Science (from 2013)
In the same journal
IEEE Transactions on Parallel and Distributed Systems
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 131 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf