English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 13087910      Online Users : 542
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/112929

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/112929

    Title: Resource provisioning towards OPEX optimization in horizontal edge federation
    Authors: Baghb, Hojjat;Baghban, Hojjat;Hu, Ching-Yao;Huang, Ching-Yao;許慶賢;Hsu, Ching-Hsien
    Contributors: 資訊工程學系
    Keywords: Edge computing;Computation task offloading;Horizontal edge federation;Operational cost optimization;Resource provisioning
    Date: 2019-12
    Issue Date: 2020-09-04 13:49:52 (UTC+8)
    Publisher: 亞洲大學
    Abstract: Energy consumption is a key performance metric in multi-access edge computing (MEC) system. Therefore, minimizing consumed energy cost is critically essential. The 5G networks deal with edge computing resources so that the operator would face with power supply limitation. Therefore, it may not be able to provide sufficient resources to ever-increasing user’s requests. One way to compensate such limitation is to form horizontal edge federation (HEF) so that all participant can share the resource capacities as well as request workloads. Energy efficient and ultra-low latency HEF involves the setting of critical factor in each participant: offloading ratios. The decided offloading ratios must provide satisfactory service level to meet latency and physical resource types capacity constraints demanded by requests. Our proposed problem is an energy efficient operational cost (e-OPEX) optimization problem. In this paper, we formulate it as a mixed integer linear program and demonstrate that the problem is NP-hard and proposed a federated multidimensional fractional knapsack based algorithm (FMFK) as our approach. The result shows that the horizontal edge federation based on the FMFK performs better and saves the more e-OPEX as well as serving more input requests compare with the non-federation approach. The experimental results show that our approach save about 40% of e-OPEX specially for high latency sensitive application requests in hotspot zone. It shows around 50% e-OPEX saving in the case of high computation unit cost compare with non-federation approach.
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback