EconPapers    
Economics at your fingertips  
 

DPMA: a distributed profit-based placement scheme for multi-sp mobile edge computing

Rui Mao and Hongwei Du ()
Additional contact information
Rui Mao: Harbin Institute of Technology (Shenzhen)
Hongwei Du: Harbin Institute of Technology (Shenzhen)

Journal of Combinatorial Optimization, 2022, vol. 44, issue 5, No 6, 3294-3309

Abstract: Abstract With the development over the past decades, mobile edge computing has been widely used in many fields. Benefit from the low latency brought by the proximity of mobile edge computing to the user side and the relief of bandwidth pressure, mobile edge computing can play a significant role in services with large backhaul traffic such as live video streaming. However, the edge server does not have the same powerful hardware as the cloud server, and the limited resources on the edge server make the deployment of services need to be carefully considered. Small-sized service providers in edge networks may not have their own edge servers and need to rent the edge servers of edge server providers to deploy their own services. In this paper, we present a service provider profit maximization problem under the service scenario of large backhaul traffic. Considering the needs of server providers and service providers, we design a novel method, Distributed Profit-based Matching Algorithm (DPMA), to solve this problem according to the idea of Deferred Acceptance algorithm. The experimental results show that the proposed method is superior to the existing profit maximization methods in mobile edge computing.

Keywords: Mobile edge computing; Service placement; Profit maximization; Backhaul flow (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00894-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00894-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-022-00894-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00894-7