The Value of Cooperation: Minimizing User Costs in Multi-Broker Mobile Cloud Computing Networks

被引:18
|
作者
Guan, Zhangyu [1 ]
Melodia, Tommaso [1 ]
机构
[1] Northeastern Univ, Dept Elect & Comp Engn, Boston, MA 02115 USA
基金
美国国家科学基金会;
关键词
Mobile cloud computing; heterogeneous cloud architecture; resource allocation; game theory; RESOURCE-ALLOCATION; OPTIMIZATION; MODEL;
D O I
10.1109/TCC.2015.2440257
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We study the problem of user cost minimization in mobile cloud computing (MCC) networks. We consider a MCC model where multiple brokers assign cloud resources to mobile users. The model is characterized by an heterogeneous cloud architecture (which includes a public cloud and a cloudlet) and by the heterogeneous pricing strategies of cloud service providers. In this setting, we investigate two classes of cloud reservation strategies, i.e., a competitive strategy, and a compete-then-cooperate strategy as a performance bound. We first study a purely competitive scenario where brokers compete to reserve computing resources from remote public clouds (which are affected by long delays) and from local cloudlets (which have limited computational resources but short delays). We provide theoretical results demonstrating the existence of disagreement points (i.e., the equilibrium reservation strategy that no broker has incentive to deviate unilaterally from) and convergence of the best-response strategies of the brokers to disagreement points. We then consider the scenario in which brokers agree to cooperate in exchange for a lower average cost of resources. We formulate a cooperative problem where the objective is to minimize the total average price of all brokers, under the constraint that no broker should pay a price higher than the disagreement price (i.e., the competitive price). We design new globally optimal solution algorithm to solve the resulting non-convex cooperative problem, based on a combination of the branch and bound framework and of advanced convex relaxation techniques. The resulting optimal solution provides a lower bound on the achievable user cost without complete collusion among brokers. Compared with pure competition, we found that (i) noticeable cooperative gains can be achieved over pure competition in markets with a few brokers only, and (ii) the cooperative gain is only marginal in crowded markets, i.e., with a high number of brokers, hence there is no clear incentive for brokers to cooperate.
引用
收藏
页码:780 / 791
页数:12
相关论文
共 50 条
  • [41] Distributed protocols for user cooperation in multi-user wireless networks
    Hunter, TE
    Nosratinia, A
    [J]. GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2004, : 3788 - 3792
  • [42] User cooperation mechanism for temporal traffic smoothing in mobile networks
    Tanaka, Yusuke
    Shinkuma, Ryoichi
    Takahashi, Eiji
    Onishi, Takeo
    [J]. 2016 17TH INTERNATIONAL TELECOMMUNICATIONS NETWORK STRATEGY AND PLANNING SYMPOSIUM (NETWORKS), 2016, : 227 - 232
  • [43] A pointer forwarding scheme for minimizing signaling costs in nested mobile networks
    Yi, Myung-Kyu
    Choi, Jin-Woo
    Yang, Young-Kyu
    [J]. 2007 15TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS, 2007, : 386 - 390
  • [44] Location Area Design Algorithms for Minimizing Signalling Costs in Mobile Networks
    Simon, Vilmos
    Imre, Sandor
    [J]. INTERNATIONAL JOURNAL OF BUSINESS DATA COMMUNICATIONS AND NETWORKING, 2007, 3 (02) : 36 - 50
  • [45] Efficient and Secure Multi-User Multi-Task Computation Offloading for Mobile-Edge Computing in Mobile IoT Networks
    Elgendy, Ibrahim A.
    Zhang, Wei-Zhe
    Zeng, Yiming
    He, Hui
    Tian, Yu-Chu
    Yang, Yuanyuan
    [J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2020, 17 (04): : 2410 - 2422
  • [46] Scheduling Policies for Minimizing Job Migration and Server Running Costs for Cloud Computing Platforms
    Haritha, K.
    Singh, Chandramani
    [J]. 2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2019, : 855 - 862
  • [47] Mobile Cloud Computing Service Models: A User-Centric Approach
    Huang, Dijiang
    Xing, Tianyi
    Wu, Huijun
    [J]. IEEE NETWORK, 2013, 27 (05): : 6 - 11
  • [48] Efficient handover authentication with user anonymity and untraceability for Mobile Cloud Computing
    Yang, Xu
    Huang, Xinyi
    Liu, Joseph K.
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2016, 62 : 190 - 195
  • [49] An Enhanced Secure Authentication Scheme with User Anonymity in Mobile Cloud Computing
    Madhusudhan, R.
    Suvidha, K. S.
    [J]. 2017 INTERNATIONAL CONFERENCE ON PUBLIC KEY INFRASTRUCTURE AND ITS APPLICATIONS (PKIA 2017), 2017, : 17 - 22
  • [50] User Preference-Driven Offloading Scheme for Mobile Cloud Computing
    Setia, Gaurav
    Kumari, Raj
    Mangat, Veenu
    [J]. 2017 4TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND INTEGRATED NETWORKS (SPIN), 2017, : 524 - 529