4.7 Article

Computing-Aware Base Station Sleeping Mechanism in H-CRAN-Cloud-Edge Networks

期刊

IEEE TRANSACTIONS ON CLOUD COMPUTING
卷 9, 期 3, 页码 958-967

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCC.2019.2893228

关键词

H-CRAN; cloud-edge computing; energy; response time; M/M/k

资金

  1. Natural Sciences and Engineering Research Council of Canada [RGPIN-2016-04049]

向作者/读者索取更多资源

This paper proposes a power minimization problem for heterogeneous cloud radio access networks, considering computing delay constraints. The proposed system allows SBSs serving more computing tasks to stay active, meeting task completion deadlines requested by mobile users and keeping cloud response time within a predefined limit. By selecting active and sleeping SBSs centrally, the proposed scheme aims to save power while considering delay constraints of both cloud and mobile devices.
In this paper, a power minimization problem using base station sleeping is proposed for heterogeneous cloud radio access networks (H-CRANs) taking into account the computing delay constraints. In the proposed system, which is modeled using M/M/k queues, the edge device coexists with the small base station (SBS) to provide computing capabilities beside the central cloud. In general, the SBS sleeping is governed by the availability of resources provided the macro base station (MBS) which is in charge of accommodating offloaded users from sleeping SBSs. However, switching off lightly loaded SBSs can impose significant burdens on cloud servers. Here, the proposed sleeping scheme allows SBSs serving more computing tasks to remain active in order to fulfill the task completion deadlines requested by mobile users and to keep the cloud response time within a predefined limit. In other words, the proposed scheme aims to save power by undertaking a centralized selection of active and sleeping SBSs taking into account the delay constraints of both cloud and mobile devices. First, we consider a disjoint cloud-edge system, where computing services can be provided by either the cloud or the edge device, and aim to minimize the number of active SBSs. The problem is formulated as a 0-1 knapsack problem with SBS utilization considered as the weight while the ratio of computing tasks to all incoming tasks is considered as the value of that SBS. In this problem, which is solved using dynamic programming, SBSs processing less computing tasks are given higher values; and as a result, higher chance to sleep compared to others. Second, a shared computing system is proposed whereby active SBSs (edge devices) contribute to the total computing capability. Here, an exhaustive search approach is used to achieve the optimal power saving. We also proved that the shared computing system performs better in terms of response time compared to the disjoint system depending on the number of active SBSs.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据