Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds

Vajiheh Farhadi, Fidan Mehmeti, Ting He, Tom La Porta, Hana Khamfroush, Shiqiang Wang, Kevin S. Chan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Mobile edge computing allows wireless users to exploit the power of cloud computing without the large communication delay. To serve data-intensive applications (e.g., augmented reality, video analytics) from the edge, we need, in addition to CPU cycles and memory for computation, storage resource for storing server data and network bandwidth for receiving user-provided data. Moreover, the data placement needs to be adapted over time to serve time-varying demands, while considering system stability and operation cost. We address this problem by proposing a two-time-scale framework that jointly optimizes service (data code) placement and request scheduling, under storage, communication, computation, and budget constraints. We fully characterize the complexity of our problem by analyzing the hardness of various cases. By casting our problem as a set function optimization, we develop a polynomial-time algorithm that achieves a constant-factor approximation under certain conditions. Extensive synthetic and trace-driven simulations show that the proposed algorithm achieves 90% of the optimal performance.

Original languageEnglish (US)
Title of host publicationINFOCOM 2019 - IEEE Conference on Computer Communications
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1279-1287
Number of pages9
ISBN (Electronic)9781728105154
DOIs
StatePublished - Apr 2019
Event2019 IEEE Conference on Computer Communications, INFOCOM 2019 - Paris, France
Duration: Apr 29 2019May 2 2019

Publication series

NameProceedings - IEEE INFOCOM
Volume2019-April
ISSN (Print)0743-166X

Conference

Conference2019 IEEE Conference on Computer Communications, INFOCOM 2019
CountryFrance
CityParis
Period4/29/195/2/19

Fingerprint

Scheduling
Mobile computing
Augmented reality
Communication
Cloud computing
Set theory
System stability
Program processors
Casting
Servers
Hardness
Polynomials
Bandwidth
Data storage equipment
Costs

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Farhadi, V., Mehmeti, F., He, T., Porta, T. L., Khamfroush, H., Wang, S., & Chan, K. S. (2019). Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds. In INFOCOM 2019 - IEEE Conference on Computer Communications (pp. 1279-1287). [8737368] (Proceedings - IEEE INFOCOM; Vol. 2019-April). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/INFOCOM.2019.8737368
Farhadi, Vajiheh ; Mehmeti, Fidan ; He, Ting ; Porta, Tom La ; Khamfroush, Hana ; Wang, Shiqiang ; Chan, Kevin S. / Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds. INFOCOM 2019 - IEEE Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 1279-1287 (Proceedings - IEEE INFOCOM).
@inproceedings{0fe85d27172d4389a5b17399e573456e,
title = "Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds",
abstract = "Mobile edge computing allows wireless users to exploit the power of cloud computing without the large communication delay. To serve data-intensive applications (e.g., augmented reality, video analytics) from the edge, we need, in addition to CPU cycles and memory for computation, storage resource for storing server data and network bandwidth for receiving user-provided data. Moreover, the data placement needs to be adapted over time to serve time-varying demands, while considering system stability and operation cost. We address this problem by proposing a two-time-scale framework that jointly optimizes service (data code) placement and request scheduling, under storage, communication, computation, and budget constraints. We fully characterize the complexity of our problem by analyzing the hardness of various cases. By casting our problem as a set function optimization, we develop a polynomial-time algorithm that achieves a constant-factor approximation under certain conditions. Extensive synthetic and trace-driven simulations show that the proposed algorithm achieves 90{\%} of the optimal performance.",
author = "Vajiheh Farhadi and Fidan Mehmeti and Ting He and Porta, {Tom La} and Hana Khamfroush and Shiqiang Wang and Chan, {Kevin S.}",
year = "2019",
month = "4",
doi = "10.1109/INFOCOM.2019.8737368",
language = "English (US)",
series = "Proceedings - IEEE INFOCOM",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1279--1287",
booktitle = "INFOCOM 2019 - IEEE Conference on Computer Communications",
address = "United States",

}

Farhadi, V, Mehmeti, F, He, T, Porta, TL, Khamfroush, H, Wang, S & Chan, KS 2019, Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds. in INFOCOM 2019 - IEEE Conference on Computer Communications., 8737368, Proceedings - IEEE INFOCOM, vol. 2019-April, Institute of Electrical and Electronics Engineers Inc., pp. 1279-1287, 2019 IEEE Conference on Computer Communications, INFOCOM 2019, Paris, France, 4/29/19. https://doi.org/10.1109/INFOCOM.2019.8737368

Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds. / Farhadi, Vajiheh; Mehmeti, Fidan; He, Ting; Porta, Tom La; Khamfroush, Hana; Wang, Shiqiang; Chan, Kevin S.

INFOCOM 2019 - IEEE Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc., 2019. p. 1279-1287 8737368 (Proceedings - IEEE INFOCOM; Vol. 2019-April).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds

AU - Farhadi, Vajiheh

AU - Mehmeti, Fidan

AU - He, Ting

AU - Porta, Tom La

AU - Khamfroush, Hana

AU - Wang, Shiqiang

AU - Chan, Kevin S.

PY - 2019/4

Y1 - 2019/4

N2 - Mobile edge computing allows wireless users to exploit the power of cloud computing without the large communication delay. To serve data-intensive applications (e.g., augmented reality, video analytics) from the edge, we need, in addition to CPU cycles and memory for computation, storage resource for storing server data and network bandwidth for receiving user-provided data. Moreover, the data placement needs to be adapted over time to serve time-varying demands, while considering system stability and operation cost. We address this problem by proposing a two-time-scale framework that jointly optimizes service (data code) placement and request scheduling, under storage, communication, computation, and budget constraints. We fully characterize the complexity of our problem by analyzing the hardness of various cases. By casting our problem as a set function optimization, we develop a polynomial-time algorithm that achieves a constant-factor approximation under certain conditions. Extensive synthetic and trace-driven simulations show that the proposed algorithm achieves 90% of the optimal performance.

AB - Mobile edge computing allows wireless users to exploit the power of cloud computing without the large communication delay. To serve data-intensive applications (e.g., augmented reality, video analytics) from the edge, we need, in addition to CPU cycles and memory for computation, storage resource for storing server data and network bandwidth for receiving user-provided data. Moreover, the data placement needs to be adapted over time to serve time-varying demands, while considering system stability and operation cost. We address this problem by proposing a two-time-scale framework that jointly optimizes service (data code) placement and request scheduling, under storage, communication, computation, and budget constraints. We fully characterize the complexity of our problem by analyzing the hardness of various cases. By casting our problem as a set function optimization, we develop a polynomial-time algorithm that achieves a constant-factor approximation under certain conditions. Extensive synthetic and trace-driven simulations show that the proposed algorithm achieves 90% of the optimal performance.

UR - http://www.scopus.com/inward/record.url?scp=85068214325&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068214325&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM.2019.8737368

DO - 10.1109/INFOCOM.2019.8737368

M3 - Conference contribution

AN - SCOPUS:85068214325

T3 - Proceedings - IEEE INFOCOM

SP - 1279

EP - 1287

BT - INFOCOM 2019 - IEEE Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Farhadi V, Mehmeti F, He T, Porta TL, Khamfroush H, Wang S et al. Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds. In INFOCOM 2019 - IEEE Conference on Computer Communications. Institute of Electrical and Electronics Engineers Inc. 2019. p. 1279-1287. 8737368. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFOCOM.2019.8737368