IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i5d10.1007_s10878-022-00894-7.html
   My bibliography  Save this article

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

Author

Listed:
  • Rui Mao

    (Harbin Institute of Technology (Shenzhen)
    Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies)

  • Hongwei Du

    (Harbin Institute of Technology (Shenzhen)
    Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies)

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.

Suggested Citation

  • Rui Mao & Hongwei Du, 2022. "DPMA: a distributed profit-based placement scheme for multi-sp mobile edge computing," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3294-3309, December.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00894-7
    DOI: 10.1007/s10878-022-00894-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-022-00894-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-022-00894-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00894-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.