Skip to content
naulon
Not checkedNot checked for notices yet.

Optimal Pricing and Service Selection in the Mobile Cloud Architectures

Xianwei Li, Cheng Zhang, Bo Gu and 2 more

IEEE Access · 2019

doi:10.1109/access.2019.2908223 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

With offloading the tasks that mobile users (MUs) running in their mobile devices (MDs) to the data centers of remote public clouds, mobile cloud computing (MCC) can greatly improve the computing capacity and prolong the battery life of MDs. However, the data centers of remote public cloud are generally far from the MUs, thus long delay will be caused due to the transmission from the base station to the public clouds over the Internet. Mobile edge computing (MEC) is recognized as a promising technique to augment the computation capabilities of MDs and shorten the transmission delay. Nevertheless, compared with the traditional MCC and MEC generally has a limited number of cloud resources. Therefore, making a choice on offloading task to the MCC or MEC is a challenging issue for each MU. In this paper, we investigate service selection in a mobile cloud architecture, in which MUs select cloud services from two cloud service providers (CSPs), i.e., public cloud service provider (PSP) and an edge cloud service provider (ESP). We use M/M/$\infty $ queue and M/M/1 queue to model PSP and ESP, respectively. We analyze the interaction of the two CSPs and MUs by adopting Stackelberg game, in which PSP and ESP set the prices first, and then the MUs decide to select cloud services based on performances and prices. In particular, we study the relationship between PSP and ESP in the simultaneous-play game (SPG) scenario, in which they compete to set prices of their cloud services simultaneously. Our numerical results show that MUs prefer to select service from the edge cloud if the number of tasks they run is small. In another hand, more tasks will be offloaded to the remote public cloud if the number of tasks they run becomes large.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.