Dissertation · 2022 · Open access

Fair Multi-resource Allocation for Mobile Edge Computing

Erfan Meskar

TSpace (University of Toronto) · Published 1 November 2022

Open PDFView at the publisherCite this paper

In brief

“Fair Multi-resource Allocation for Mobile Edge Computing” is a 2022 dissertation by Erfan Meskar, published in TSpace (University of Toronto). OpenAlex counts 1 citations as of 19 November 2026. It is open access: the full text is free to read at TSpace (University of Toronto).

Citations
1
Most cited in
2026 (1)
References
98
Authors
1

Abstract

The problem of fair and efficient allocation of resources in Mobile Edge Computing (MEC) is of significant importance. Users in MEC, instead of utilizing the servers in the core network, can offload their tasks to the MEC-capable access points (APs) at the network's edge. Each user in MEC requires resources in a customized proportion to execute a task on a MEC server. Furthermore, The task input data and execution results are sent through shared wireless communication links to and from the MEC servers. Hence, MEC is characterized by allocating multiple communication and computation resources. Existing resource allocation rules generally consider Pareto Optimality (PO), Envy-Freeness (EF), Sharing Incentive (SI), and Strategy-Proofness (SP) as the most desirable fairness and efficiency properties. This dissertation proposes fair and efficient resource allocation mechanisms for three different MEC systems. We first consider the single-AP MEC systems, where the users must upload their tasks over a dedicated wireless communication link outside the computing servers. We propose a fair multi-resource allocation mechanism for this environment, termed Task Share Fairness with External Resource (TSF-ER), and prove that it satisfies all desirable fairness and efficiency properties. We then consider the multi-AP MEC systems where no user can establish multiple wireless connections simultaneously to multiple edge servers. Furthermore, each user is a selfish agent that chooses the single server for its job execution that maximizes its utility. We propose the Multi-resource Allocation Game Induced by the Kalai-Smorodinsky bargaining solution (MAGIKS) and prove that under discrete resource demands, it finds a Nash Equilibrium in polynomial time for any fixed server configuration. Furthermore, we prove that MAGIKS satisfies some desirable fairness and efficiency properties. Finally, we consider the multi-AP MEC systems where each user can establish wireless connection simultaneously to multiple edge servers and may experience different levels of wireless channel quality on different APs, so the user's channel bandwidth demand is not fixed. We show that the four fairness and efficiency properties are no longer compatible in this MEC environment. Hence, we propose a resource allocation rule, Maximum Task Product (MTP), that retains PO, EF, and SI.

Cite this paper

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

APA 7

Meskar, E. (2022). Fair Multi-resource Allocation for Mobile Edge Computing. TSpace (University of Toronto). http://hdl.handle.net/1807/125533

MLA 9

Meskar, Erfan. “Fair Multi-resource Allocation for Mobile Edge Computing.” TSpace (University of Toronto), 2022. http://hdl.handle.net/1807/125533.

Chicago

Meskar, Erfan. 2022. “Fair Multi-resource Allocation for Mobile Edge Computing.” TSpace (University of Toronto). http://hdl.handle.net/1807/125533.

Harvard

Meskar, E. (2022) ‘Fair Multi-resource Allocation for Mobile Edge Computing’, TSpace (University of Toronto). Available at: http://hdl.handle.net/1807/125533.

IEEE

E. Meskar, “Fair Multi-resource Allocation for Mobile Edge Computing,” TSpace (University of Toronto), 2022.

BibTeX

@phdthesis{meskar2022fair,
  title     = {{Fair Multi-resource Allocation for Mobile Edge Computing}},
  author    = {Meskar, Erfan},
  year      = {2022},
  url       = {http://hdl.handle.net/1807/125533}
}

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

  • mobile edge computing
  • resource allocation
  • fairness
  • multi-resource allocation
  • task offloading
  • Pareto optimality
  • envy-freeness
  • strategy-proofness

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?

Meskar, E. (2022). Fair Multi-resource Allocation for Mobile Edge Computing. TSpace (University of Toronto). http://hdl.handle.net/1807/125533

How many times has this paper been cited?

1 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 TSpace (University of Toronto): sign in and open the PDF from this page.

Who wrote this paper?

Erfan Meskar.

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.