2018
DOI: 10.1109/twc.2018.2876823
|View full text |Cite
|
Sign up to set email alerts
|

Spatio–Temporal Edge Service Placement: A Bandit Learning Approach

Abstract: Shared edge computing platforms deployed at the radio access network are expected to significantly improve quality of service delivered by Application Service Providers (ASPs) in a flexible and economic way. However, placing edge service in every possible edge site by an ASP is practically infeasible due to the ASP's prohibitive budget requirement. In this paper, we investigate the edge service placement problem of an ASP under a limited budget, where the ASP dynamically rents computing/storage resources in ed… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
55
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 87 publications
(55 citation statements)
references
References 36 publications
0
55
0
Order By: Relevance
“…Chen et al 38 proposed new efficient learning algorithm to answer the service placement problem for application service providers (ASP) in edge computing. The algorithm is called spatial‐temporal edge service placement (SEEN).…”
Section: Service Placement Approachesmentioning
confidence: 99%
“…Chen et al 38 proposed new efficient learning algorithm to answer the service placement problem for application service providers (ASP) in edge computing. The algorithm is called spatial‐temporal edge service placement (SEEN).…”
Section: Service Placement Approachesmentioning
confidence: 99%
“…Each time an option is selected, a reward is obtained as feedback, and the action selection is repeated to focus the action on the best arm to maximize the expected total reward in a period of time. To cope with the unknown service requirements in the changing user groups, reference [60] proposed a combined context bandit learning problem. A spatiotemporal edge service placement algorithm is used to solve the problem.…”
Section: ) Multi Armed Banditmentioning
confidence: 99%
“…Furthermore, according to [11], the popularity of a single content per time period is consistent with the Zipf distribution. For content fine-grained characteristics, we use real data sets [23]. Thus, we can obtain the content popularity of all requests for a time slot.…”
Section: Simulation Setup and Comparison Algorithmmentioning
confidence: 99%