Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Cost aware service selection in a mobile edge marketplace
KTH, Skolan för elektroteknik och datavetenskap (EECS). Ericsson Res, Stockholm, Sweden..
Ericsson Res, Stockholm, Sweden..
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Kommunikationssystem, CoS, Radio Systems Laboratory (RS Lab).ORCID-id: 0000-0001-8517-7996
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Kommunikationssystem, CoS, Radio Systems Laboratory (RS Lab).ORCID-id: 0000-0003-0525-4491
Vise andre og tillknytning
2022 (engelsk)Inngår i: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 205, artikkel-id 108680Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

A marketplace plays an important role that bridges between Mobile Edge Infrastructure Services (EISs) providers and their customers, also manages relations between actors in a mobile edge ecosystem. One of the key services of the marketplace is service selection where not only a list of EISs matching the customers' demands is provided but also enables service selection based on the customers' requirements to fully automate the process. In this paper, we first investigate important attributes of EISs (such as coverage area, latency models, pricing models, etc.), and requirements of edge-based applications (such as latency and reliability) for EIS selection in a marketplace. We then formulate an optimization problem to choose the right set of EISs among available services in the marketplace. We propose two service selection algorithms, i.e., Best Fit (BF) and an Improved version of BF (IBF) to minimize the monetary cost of selected services subject to latency, reliability constraints and customer requirements. The evaluation shows that IBF has 4% improvement in monetary cost as compared to the BF. IBF has only 1% deviation from the optimal solution generated by a brute force algorithm, while it is 189 times faster than the brute force. Accordingly, IBF not only outperforms BF in terms of monetary costs but also achieves the optimal solution as compared to the brute force algorithm in significantly lower execution time. Furthermore, IBM CPLEX Optimizer is also implemented to solve the considered problem to have more concrete evaluation. The results indicate that although CPLEX can also solve the problem with the optimal result, its computing time is still dramatically worse than IBF.

sted, utgiver, år, opplag, sider
Elsevier BV , 2022. Vol. 205, artikkel-id 108680
Emneord [en]
Mobile edge, Marketplace, Service selection, Edge services
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-311638DOI: 10.1016/j.comnet.2021.108680ISI: 000778744900004Scopus ID: 2-s2.0-85122694316OAI: oai:DiVA.org:kth-311638DiVA, id: diva2:1655244
Merknad

QC 20220502

Tilgjengelig fra: 2022-05-02 Laget: 2022-05-02 Sist oppdatert: 2022-06-25bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Li, WenhaoOzger, MustafaCavdar, Cicek

Søk i DiVA

Av forfatter/redaktør
Li, WenhaoOzger, MustafaCavdar, Cicek
Av organisasjonen
I samme tidsskrift
Computer Networks

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 47 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf