Dissertation · 2020 · Open access

Reinforcement Learning Frameworks for Server Placement in Multi-Access Edge Computing

Anahita Mazloomi

Spectrum Research Repository (Concordia University) · Published 21 December 2020

Open PDFCite this paper

In brief

“Reinforcement Learning Frameworks for Server Placement in Multi-Access Edge Computing” is a 2020 dissertation by Anahita Mazloomi, published in Spectrum Research Repository (Concordia University). OpenAlex counts 0 citations as of 19 November 2026. It is open access: the full text is free to read at Spectrum Research Repository (Concordia University).

Citations
0
References
51
Authors
1

Abstract

In the IoT era and with the advent of 5G networks, an enormous amount of data is generated, and new applications require more and more computation power and real-time response. Although cloud computing is a reliable solution to provide computation power, the real-time response is not guaranteed. Thus, the multi-access edge computing (MEC), which consists of distributing the edge servers in the proximity of end-users to have low latency besides the higher processing power, is increasingly becoming a vital factor for the success of modern applications. \nEdge server placement and task offloading play a crucial role in the efficient design of MEC architecture. There is a finite discrete set of possible solutions, and finding the optimal one is known to be an NP-hard combinatorial optimization problem. Heuristics, mixed-integer programming, and clustering algorithms are among the most widely used approaches to solve this problem. \nRecently, researchers have investigated reinforcement learning (RL) to solve combinatorial optimization problems, which has shown promising results. In this thesis, we propose novel RL-frameworks for solving the joint problem of edge server placement and base station allocation. There are a few studies that have used RL in placement optimization. In our investigation, the focus is on the modeling part to make the Q-learning applicable for a large scale real-world problem. \nTherefore, in this research, Q-learning is examined and applied in the edge server placement while considering two significant and striking perspectives. The first one is about minimizing the cost of network design by reducing the delay and the number of edge servers. The second perspective is the placement of K-edge servers to create K-fair-balanced clusters with minimum network delay. \nDespite the impressive results of RL, its application in real-world scenarios is highly challenging. Throughout our modeling, the faced issues are explained, and our solutions are provided. Besides, the impact of state representation, action space, and penalty function on the convergence is discussed. Extensive experiments using a real-world dataset from Shanghai demonstrate that in the light of efficient penalty function, the agent is able to find the actions that are the source of higher delayed rewards, and our proposed algorithms outperform the other benchmarks by creating a trade-off among multiple objectives.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Mazloomi, A. (2020). Reinforcement Learning Frameworks for Server Placement in Multi-Access Edge Computing. Spectrum Research Repository (Concordia University). https://spectrum.library.concordia.ca/987784/1/Mazloomi_MASc_S2021.pdf

MLA 9

Mazloomi, Anahita. “Reinforcement Learning Frameworks for Server Placement in Multi-Access Edge Computing.” Spectrum Research Repository (Concordia University), 2020. https://spectrum.library.concordia.ca/987784/1/Mazloomi_MASc_S2021.pdf.

Chicago

Mazloomi, Anahita. 2020. “Reinforcement Learning Frameworks for Server Placement in Multi-Access Edge Computing.” Spectrum Research Repository (Concordia University). https://spectrum.library.concordia.ca/987784/1/Mazloomi_MASc_S2021.pdf.

Harvard

Mazloomi, A. (2020) ‘Reinforcement Learning Frameworks for Server Placement in Multi-Access Edge Computing’, Spectrum Research Repository (Concordia University). Available at: https://spectrum.library.concordia.ca/987784/1/Mazloomi_MASc_S2021.pdf.

IEEE

A. Mazloomi, “Reinforcement Learning Frameworks for Server Placement in Multi-Access Edge Computing,” Spectrum Research Repository (Concordia University), 2020.

BibTeX

@phdthesis{mazloomi2020reinforcement,
  title     = {{Reinforcement Learning Frameworks for Server Placement in Multi-Access Edge Computing}},
  author    = {Mazloomi, Anahita},
  year      = {2020},
  url       = {https://spectrum.library.concordia.ca/987784/1/Mazloomi_MASc_S2021.pdf}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing

  • edge server placement
  • mobile edge computing
  • Q-learning
  • task offloading
  • combinatorial optimization
  • state representation
  • action space
  • multi-objective optimization

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Mazloomi, A. (2020). Reinforcement Learning Frameworks for Server Placement in Multi-Access Edge Computing. Spectrum Research Repository (Concordia University). https://spectrum.library.concordia.ca/987784/1/Mazloomi_MASc_S2021.pdf

How many times has this paper been cited?

0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Spectrum Research Repository (Concordia University): sign in and open the PDF from this page.

Who wrote this paper?

Anahita Mazloomi.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.