Dynamic application placement in the Mobile Cloud Network

https://doi.org/10.1016/j.future.2016.06.021Get rights and content

Highlights

  • Proposes a holistic cost-optimal management approach for the forthcoming Mobile Cloud Network.

  • The proposed method shows significant improvements in aggregate system cost and resource utilisation skewness, and proves to be very capable at accommodating user mobility.

  • The evaluations reveal that high cost of user mobility and the amount of coordinated effort is required to accommodate it.

  • The proposed method provides an upper bound to which we can contrast more tractable distributed solutions.

Abstract

To meet the challenges of consistent performance, low communication latency, and a high degree of user mobility, cloud and Telecom infrastructure vendors and operators foresee a Mobile Cloud Network that incorporates public cloud infrastructures with cloud augmented Telecom nodes in forthcoming mobile access networks. A Mobile Cloud Network is composed of distributed cost- and capacity-heterogeneous resources that host applications that in turn are subject to a spatially and quantitatively rapidly changing demand. Such an infrastructure requires a holistic management approach that ensures that the resident applications’ performance requirements are met while sustainably supported by the underlying infrastructure. The contribution of this paper is three-fold. Firstly, this paper contributes with a model that captures the cost- and capacity-heterogeneity of a Mobile Cloud Network infrastructure. The model bridges the Mobile Edge Computing and Distributed Cloud paradigms by modelling multiple tiers of resources across the network and serves not just mobile devices but any client beyond and within the network. A set of resource management challenges is presented based on this model. Secondly, an algorithm that holistically and optimally solves these challenges is proposed. The algorithm is formulated as an application placement method that incorporates aspects of network link capacity, desired user latency and user mobility, as well as data centre resource utilisation and server provisioning costs. Thirdly, to address scalability, a tractable locally optimal algorithm is presented. The evaluation demonstrates that the placement algorithm significantly improves latency, resource utilisation skewness while minimising the operational cost of the system. Additionally, the proposed model and evaluation method demonstrate the viability of dynamic resource management of the Mobile Cloud Network and the need for accommodating rapidly mobile demand in a holistic manner.

Introduction

Contemporary cloud services are predominantly hosted by a handful of Data Centres (DCs) on each continent  [1], with no specific regard to their subscribers’ whereabouts.

Furthermore, cloud services are at an increasing rate accessed from Mobile Devices (MDs)  [2] and employed to orchestrate the infrastructure and devices that constitute the Internet of Everything (IoE)  [3]. Collectively, they produce and consume an increasing amount of content, consuming a larger portion of network traffic. Due to intermittent cloud service availability and heterogeneous latency between an MD and a DC, MDs often resort to executing applications locally, as opposed to in the cloud  [4].

The current, centralised infrastructure paradigm, geographically separates users and infrastructure, and thus does not accommodate mission critical, latency sensitive application, and incurs a significant load on the network. The Mobile Cloud Network (MCN)  [5] has been proposed to mitigate these performance inhibitors. In the MCN paradigm, DCs of heterogeneous scale and cost are dispersing throughout the core- and access-networks as a compliment to the existing, centralised, public cloud DCs  [6], see Fig. 1. The proposed infrastructure will span across entire national networks, encompass thousands of subscribers, nodes, and applications. The compute capacity, or DCs, will proposedly reside with a varying degree of proximity to the end-user, from Radio Base Stations (RBSs) to regional hubs. Such an infrastructure will be both cost- and capacity-heterogeneous as a function of depth. Furthermore, the proposed use case of the MCN ranges from hosting virtualised Telecom service  [7], offloading mobile application  [8], mobile edge computing  [9], [10], to orchestrating and enabling Internet of Things (IoT) services  [11], [12].

With increased proximity between end-users and cloud infrastructure, application developers and device manufacturers are now able to realise MD offloading and large Wireless Sensor Network (WSN). As a consequence, they are for example faced with the challenge of determining when and what to offload  [13], given capacity and energy objectives  [14], and how to design their sensor infrastructure  [15], [16], [17], [18].

Furthermore, regardless of how application owners and developers take advantage of the MCN, to realise an MCN, the operator of an MCN shall attempt to meet all resident applications’ performance goals and to manage the operational expenditure of its infrastructure. In such a large, distributed, cost-, proximity-, and capacity-heterogeneous infrastructure, with large set of highly mobile users, the placement of the resident applications and services is an MCN operator’s foremost degree of freedom. The operator of an MCN thus pursues its objectives by actively evaluating the placement of the resident applications in relation to each other, their mobile users, and cost and capacity of the infrastructure’s resources. The fundamental problem addressed in the paper is how to scalably and autonomously manage the infrastructures in such a manner, over a large number of resources, to guarantee application performance, while minimising the incurred cost on the infrastructure given a time-variant demand and a heterogeneous infrastructure, and mitigating resource skewness.

If the resident applications’ placements are not evaluated at the rate of which the applications’ demand is changing, the system cannot guarantee the applications’ performance goals or Service Level Agreements (SLAs), or minimum operational cost or system wide resource usage. The task of evaluating the placement of thousands of applications serving an even greater number of users across hundreds of heterogeneous nodes cannot be done manually, in real-time, by a system administrator. Furthermore, the breadth and depth, and heterogeneity of the infrastructure, and the rate of change in application demand make judging the trade-off, over time, non-trivial, and need to be performed holistically and autonomously by the system.

Restoring to naïve methods, such as placing applications randomly or greedy placing applications as close as possible to the end-user, fails to take into account the time-variant input to the system and the cost- and capacity-heterogeneity of the system, and can thus not guarantee that the applications meet their SLAs, nor does it guarantee that the cost of the system is maintained, and that the load is relatively balanced across the system.

As the MCN paradigm is novel, no implementation exists nor has a full definition materialised. As such, this problem has to the best of our knowledge not been addressed previously. Related performance centric problems can be found in literature for routing, intra- and inter-DC application placement, and in optimal content distribution in Content Delivery Networks (CDNs). However, to the best of our knowledge, none of the presented approaches simultaneously and holistically take into account rapid user mobility and vast resource cost- and capacity-heterogeneous infrastructures.

The contribution of this paper is threefold. (1) A performance model is presented of the proposed MCN infrastructure paradigm. (2) An optimisation problem based on aforementioned objectives is formulated and solved. The optimal solution achieves a 25% reduction in cost compared to the naïve methods. (3) A traceable, iterative, local-optimal algorithm is presented. This algorithm achieves a cost within 5% of the optimal, at only a fraction of the computational overhead.

This paper has the following structure: Section  2 highlights the resource management challenges facing the MCN. Section  3 describes mathematical models associated with the MCN. Section  4 formulates the problems as an optimisation problem. Section  5 describes application placement methods based on the objective function described in the earlier section. Sections  6 Evaluation model, 7 Experiments ​present how the proposed algorithm and models are evaluated by detailing the evaluation model and the experiments, respectively. Section  9 covers related work in tangent research fields. Section  10 summarises this paper’s contributions, conclusion of the experiments and future work.

Section snippets

Resource management challenges

This section provides a definition of the MCN and formalisation of an MCN’s service offerings. Thereafter, its resource management objectives are defined and the inherit resource management challenges are discussed.

Proposed system model

In order to explore the properties of an MCN and the management challenges it presents, a system model of the MCN is proposed. This section begins with the constitution of a general model for an abstracted MCN and its topology, followed by a more detailed model for each component in the system.

The topology depicted in Fig. 1 reflects the union of an MNO’s network and a federated cloud infrastructure and should be seen as an abstraction of an MCN topology proposed in  [7]. The placement and

Optimisation formulation

In this section, a set of application placement objectives for resource managing an MCN is formalised from which an optimal application placement algorithm is derived. This section begins by introducing a cost function reflecting the presented management objectives, encompassing the operational cost of an MCN’s sources and a heuristic overload cost. The optimal placement algorithm minimises this function over all feasible placement constellations. A local-optimal algorithm is then derived and

Application placement methods

In this section, two methods to re-evaluate and place applications in an MCN using the optimisation formulation and constraints are presented. The first method is an exhaustive search algorithm that finds the optimal placement and serves as a performance upper bound reference. The second method is a tractable iterative local search algorithm that operates on the same optimisation premise as the exhaustive method. The objective of the iterative method is to provide a tractable centralised

Evaluation model

In this section, the simulation set-up is detailed. The behaviour of the placement algorithms is studied by subjecting them to a variety of configuration and workload scenarios. The performance of each algorithm is evaluated using a set of heuristics.

Section  6.1 outlines the premise of the experiments and their objectives. Section  6.2 details the simulation software framework used to execute the experiments.

Experiments

This section details workload scenarios and parameter settings.

Results

This section presents the results of the experiments specified in Section  7. The section begins with presenting the resulting cost for each placement algorithm in Section  8.1. Sections  8.2 RTT, 8.3 Resource utilisation contrasts the mean RTT experienced by all applications and the mean utilisation level of each DC as a result of each placement policy, respectively.

Related work

In this section, related works are reviewed, and how the results from the literature can be employed in MCN research. Remaining challenges not covered by the current literature are also covered. There exists an extensive body of work in the field of content and service placement in distributed compute and content delivery systems. Existing research results address many of the challenges facing an MCN.

Conclusions

One of the foremost challenges in an MCN paradigm is how to manage the highly heterogeneous and distributed resources in a complex system. This paper contributes with a system model for the MCN and an objective function to minimise the global system cost as a means to manage the compute and network resources in an MCN. Based on this model, a globally optimal placement of static and mobile applications was designed.

Further, a locally optimal placement scheme with a fraction of the computational

Acknowledgements

This work is funded in part by the Swedish Research Council (VR) under contract number C0590801 for the project Cloud Control. Maria Kihl and William Tärneberg are members of the Lund Center for Control of Complex Engineering Systems (LCCC) funded by the Swedish Research Council (VR) and the Excellence Center Linköping — Lund in Information Technology (ELLIIT). William Tärneberg is also funded by the Mobile and Pervasive Computing Institute Lund University (MAPCI).

William Tärneberg is a Ph.D. candidate at the Department of Electrical and Information Technology at Lund University in Sweden. William received his M.Sc. in Electrical Engineering from Lund University in 2010. Prior to beginning his Ph.D. studies he worked as a Development and Research Engineer for Sony. His research interests include distributed systems and algorithms, machine learning, traffic shaping, and network simulation.

References (56)

  • E. Ahmed et al.
    (2015)
  • N. Fernando et al.
    (2013)
  • S. Ghafoor et al.
    (2014)
  • E. Ahmed et al.
    (2015)
  • T. Liu et al.
    (2016)
  • S.W. Loke
    (2012)
  • Y.-S. Chang et al.
    (2015)
  • U. Shaukat et al.
    (2016)
  • P. Radoslavov et al.
    (2002)
  • L.A. Barroso et al.

    The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines

    (2009)
  • Z. Sanaei et al.

    Heterogeneity in mobile cloud computing: Taxonomy and open challenges

    IEEE Commun. Surv. Tutorials

    (2014)
  • D. Evans, The Internet of everything: How more relevant and valuable connections will change the world, 2012, pp....
  • R. Shea et al.

    Cloud gaming: architecture and performance

    IEEE Netw.

    (2013)
  • G. Karagiannis, A. Jamakovic, A. Edmonds, C. Parada, T. Metsch, D. Pichon, M. Corici, S. Ruffino, A. Gomes, P.S....
  • M. Armbrust et al.
    (2010)
  • P. Bosch, A. Duminuco, F. Pianese, T. Wood, Telco clouds and virtual telco: Consolidation, convergence, and beyond, in:...
  • A. Ahmed et al.

    A survey on mobile edge computing

  • Y. Saleem et al.

    Resource management in mobile sink based wireless sensor networks through cloud computing

  • M. Rehmani

    Cognitive Radio Sensor Networks: Applications, Architectures, and Challenges: Applications, Architectures, and Challenges, Advances in Wireless Technologies and Telecommunication

    (2014)
  • M.H. Rehmani et al.

    Emerging Communication Technologies Based on Wireless Sensor Networks

    (2015)
  • B. Rochwerger et al.

    The reservoir model and architecture for open federated cloud computing

    IBM J. Res. Dev.

    (2009)
  • C. Adam et al.

    Service middleware for self-managing large-scale systems

    IEEE Trans. Netw. Serv. Manag.

    (2007)
  • Y. Zaki, L. Zhao, C. Goerg, A. Timm-Giel, LTE wireless virtualization and spectrum management, in: Wireless and Mobile...
  • S. Singh et al.
    (2012)
  • V. Ramasubramanian et al.
    (2009)
  • D. Jayasinghe, C. Pu, T. Eilam, M. Steinder, I. Whally, E. Snible, Improving performance and availability of services...
  • X. Meng, V. Pappas, L. Zhang, Improving the scalability of data center networks with traffic-aware virtual machine...
  • L.A. Barroso et al.
    (2013)
  • Cited by (61)

    • A two-stage Multi-Criteria Optimization method for service placement in decentralized edge micro-clouds

      2021, Future Generation Computer Systems
      Citation Excerpt :

      It does not even require additional communication among the replicas. Tärneberg et al. [37] present an algorithm that holistically returns the globally optimal placement of static and mobile applications in mobile clouds networks (MCN) [38]. The goal of the algorithm is to minimize the global system cost as a means to manage the compute and network resources in a MCN.

    • An improved multi-objective genetic algorithm with heuristic initialization for service placement and load distribution in edge computing

      2021, Computer Networks
      Citation Excerpt :

      However, these works cannot be directly applied to EC because they do not consider the distinct characteristics of EC. On the other hand, there are some research works on service placement in the context of Edge Computing, such as Tärneberg et al. [9], Gu et al. [16], Skarlat et al. [11], Zhao and Liu [17]. However, these existing works have shortcomings, such as not considering the limited resource capabilities of edge nodes, requirements of time-sensitive applications, or multiple conflicted optimization objectives.

    • Classification of optimization problems in fog computing

      2020, Future Generation Computer Systems
    • Angler: Dark Pool Resource Allocation

      2023, Proceedings - 2023 IEEE/ACM Symposium on Edge Computing, SEC 2023
    View all citing articles on Scopus

    William Tärneberg is a Ph.D. candidate at the Department of Electrical and Information Technology at Lund University in Sweden. William received his M.Sc. in Electrical Engineering from Lund University in 2010. Prior to beginning his Ph.D. studies he worked as a Development and Research Engineer for Sony. His research interests include distributed systems and algorithms, machine learning, traffic shaping, and network simulation.

    Amardeep Mehta is a Ph.D. candidate at the Department of Computing Science, Umeå University, Sweden. Amardeep received his M.Sc. in Computer Science from Uppsala University, Sweden. His research interests are workload analysis and distributed systems. Amardeep has also worked as a Software Developer at Ericsson in Stockholm, Sweden.

    Eddie Wadbro received his M.Sc. degree in Mathematics at Lund University in 2004 and his Licentiate and Ph.D. degrees in Scientific Computing at Uppsala University in 2006 and 2009, respectively. He works as an Assistant Professor at the Department of Computing Science, Umeå University. His research interests concern development and analysis of efficient numerical methods, primarily within the fields of design optimisation and inverse problems.

    Johan Tordsson is Associate Professor at the Department of Computing Science, Umeå University, from where he also received his Ph.D. in 2009. After a period as visiting postdoc researcher at Universidad Complutense de Madrid, he worked for several years in the RESERVOIR, VISION Cloud, and OPTIMIS European projects, in the latter as Lead Architect and Scientific Coordinator. Tordsson’s research interests include autonomic management problems for clouds and data centres as well as enabling technologies such as virtualization.

    Johan Eker is a Principal Researcher at Ericsson, Sweden. He received his Ph.D. in automatic control from Lund University in 1999. After a brief stint in industry he joined the Ptolemy group at UC Berkeley in the US in 2001 working on the CAL Actor Language, which later was turned into a global ISO standard by the MPEG organisation. He has been with Ericsson Research since 2003 working on embedded software for mobile phones, including operating systems, programming languages, compilers, and distributed systems. During the period 2008–2011 he acted as the coordinator of the European FP-7 research project ACTORS. Since February 2013 he is also adjoint Associate Professor at Lund University.

    Maria Kihl is Professor in Internetworked Systems at the Department of Electrical and Information Technology, Lund University, Sweden. Her work focuses on performance modelling, analysis, and control of distributed Internet-based systems, currently Cloud systems and media distribution architectures.

    Erik Elmroth is Professor in Computing Science at Umeå University. He has been Head and Deputy Head of the Department of Computing Science for ten years. He has established the Umeå University research on distributed systems, a addressing virtual computing infrastructures (Grid and Cloud computing), see http://www.cloudresearch.org. The research is focused on methods, algorithms, architectures, and software design principles for large scale distributed environments. The current research extends on Elmroth’s broad background in scientific and high-performance computing and extensive experience from organising supercomputing infrastructures. International experiences include a year at NERSC, Lawrence Berkeley National Laboratory, University of California, Berkeley, and one semester at the Massachusetts Institute of Technology (MIT), Cambridge, MA.

    View full text