umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Resource allocation for Mobile Edge Clouds
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
2018 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

Recent advances in Internet technologies have led to the proliferation of new distributed applications in the transportation, healthcare, mining, security, and entertainment sectors. The emerging applications have characteristics such as being bandwidth-hungry, latency-critical, and applications with a user population contained within a limited geographical area, and require high availability, low jitter, and security.

One way of addressing the challenges arising because of these emerging applications, is to move the computing capabilities closer to the end-users, at the logical edge of a network, in order to improve the performance, operating cost, and reliability of applications and services. These distributed new resources and software stacks, situated on the path between today's centralized data centers and devices in close proximity to the last mile network, are known as Mobile Edge Clouds (MECs). The distributed MECs provides new opportunities for the management of compute resources and the allocation of applications to those resources in order to minimize the overall cost of application deployment while satisfying end-user demands in terms of application performance.

However, these opportunities also present three significant challenges. The first challenge is where and how much computing resources to deploy along the path between today's centralized data centers and devices for cost-optimal operations. The second challenge is where and how much resources should be allocated to which applications to meet the applications' performance requirements while minimizing operational costs. The third challenge is how to provide a framework for application deployment on resource-constrained IoT devices in heterogeneous environments. 

This thesis addresses the above challenges by proposing several models, algorithms, and simulation and software frameworks. In the first part, we investigate methods for early detection of short-lived and significant increase in demand for computing resources (also called spikes) which may cause significant degradation in the performance of a distributed application. We make use of adaptive signal processing techniques for early detection of spikes. We then consider trade-offs between parameters such as the time taken to detect a spike and the number of false spikes that are detected. In the second part, we study the resource planning problem where we study the cost benefits of adding new compute resources based on performance requirements for emerging applications. In the third part, we study the problem of allocating resources to applications by formulating as an optimization problem, where the objective is to minimize overall operational cost while meeting the performance targets of applications. We also propose a hierarchical scheduling framework and policies for allocating resources to applications based on performance metrics of both applications and compute resources. In the last part, we propose a framework, Calvin Constrained, for resource-constrained devices, which is an extension of the Calvin framework and supports a limited but essential subset of the features of the reference framework taking into account the limited memory and processing power of the resource-constrained IoT devices.

Ort, förlag, år, upplaga, sidor
Umeå: Umeå University , 2018. , s. 30
Serie
Report / UMINF, ISSN 0348-0542 ; 18.10
Nyckelord [en]
Mobile Edge Clouds, Edge/Fog Computing, IoTs, Distributed Resource Allocation
Nationell ämneskategori
Datorsystem
Forskningsämne
datalogi; datorteknik
Identifikatorer
URN: urn:nbn:se:umu:diva-151480ISBN: 978-91-7601-925-2 (tryckt)OAI: oai:DiVA.org:umu-151480DiVA, id: diva2:1245153
Disputation
2018-10-01, MA121, MIT-huset, Umeå, 13:30 (Engelska)
Opponent
Handledare
Tillgänglig från: 2018-09-10 Skapad: 2018-09-04 Senast uppdaterad: 2018-09-07Bibliografiskt granskad
Delarbeten
1. Online Spike Detection in Cloud Workloads
Öppna denna publikation i ny flik eller fönster >>Online Spike Detection in Cloud Workloads
2015 (Engelska)Ingår i: 2015 IEEE INTERNATIONAL CONFERENCE ON CLOUD ENGINEERING (IC2E 2015), New York: IEEE Computer Society, 2015, s. 446-451Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

We investigate methods for detection of rapid workload increases (load spikes) for cloud workloads. Such rapid and unexpected workload spikes are a main cause for poor performance or even crashing applications as the allocated cloud resources become insufficient. To detect the spikes early is fundamental to perform corrective management actions, like allocating additional resources, before the spikes become large enough to cause problems. For this, we propose a number of methods for early spike detection, based on established techniques from adaptive signal processing. A comparative evaluation shows, for example, to what extent the different methods manage to detect the spikes, how early the detection is made, and how frequently they falsely report spikes.

Ort, förlag, år, upplaga, sidor
New York: IEEE Computer Society, 2015
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:umu:diva-125610 (URN)10.1109/IC2E.2015.50 (DOI)000380449000072 ()978-1-4799-8218-9 (ISBN)
Konferens
2015 IEEE International Conference on Cloud Engineering, Arizona State University, Tempe, AZ, Mar 09-12, 2015.
Tillgänglig från: 2016-10-11 Skapad: 2016-09-13 Senast uppdaterad: 2018-09-04Bibliografiskt granskad
2. Dynamic application placement in the Mobile Cloud Network
Öppna denna publikation i ny flik eller fönster >>Dynamic application placement in the Mobile Cloud Network
Visa övriga...
2017 (Engelska)Ingår i: Future generations computer systems, ISSN 0167-739X, E-ISSN 1872-7115, Vol. 70, s. 163-177Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

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 capacityheterogeneous 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.

Nyckelord
Cloud computing, Distributed, Edge, Graph, Infrastructure, Mobile, Mobile Cloud, Modelling, Networks, Optimisation, Placement, Telco-cloud
Nationell ämneskategori
Kommunikationssystem Datorteknik
Forskningsämne
datalogi
Identifikatorer
urn:nbn:se:umu:diva-129247 (URN)10.1016/j.future.2016.06.021 (DOI)000394401800015 ()2-s2.0-85006970632 (Scopus ID)
Tillgänglig från: 2016-12-21 Skapad: 2016-12-21 Senast uppdaterad: 2018-09-04Bibliografiskt granskad
3. How beneficial are intermediate layer Data Centers in Mobile Edge Networks?
Öppna denna publikation i ny flik eller fönster >>How beneficial are intermediate layer Data Centers in Mobile Edge Networks?
Visa övriga...
2016 (Engelska)Ingår i: 2016 IEEE 1st International Workshops on Foundations and Applications of Self-* Systems / [ed] Sameh Elnikety, Peter R. Lewis and Christian Müller-Schloer, 2016, s. 222-229Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

To reduce the congestion due to the future bandwidth-hungry applications in domains such as Health care, Internet of Things (IoT), etc., we study the benefit of introducing additional Data Centers (DCs) closer to the network edge for the optimal application placement. Our study shows that the edge layer DCs in a Mobile Edge Network (MEN) infrastructure is cost beneficial for the bandwidth-hungry applications having their strong demand locality and in the scenarios where large capacity is deployed at the edge layer DCs. The cost savings for such applications can go up to 67%. Additional intermediate layer DCs close to the root DC can be marginally cost beneficial for the compute intensive applications with medium or low demand locality. Hence, a Telecom Network Operator should start building an edge DC first having capacity up to hundreds of servers at the network edge to cater the emerging bandwidth-hungry applications and to minimize its operational cost.

Nationell ämneskategori
Kommunikationssystem
Identifikatorer
urn:nbn:se:umu:diva-125640 (URN)10.1109/FAS-W.2016.55 (DOI)000391523100042 ()978-1-5090-3651-6 (ISBN)
Konferens
FAS* Foundations and Applications of Self* Systems University of Augsburg, Augsburg, Germany, 12-16 September 2016
Tillgänglig från: 2016-09-13 Skapad: 2016-09-13 Senast uppdaterad: 2018-09-04Bibliografiskt granskad
4. Calvin Constrained: A Framework for IoT Applications in Heterogeneous Environments
Öppna denna publikation i ny flik eller fönster >>Calvin Constrained: A Framework for IoT Applications in Heterogeneous Environments
Visa övriga...
2017 (Engelska)Ingår i: 2017 IEEE 37TH International Conference on Distributed Computing Systems (ICDCS 2017) / [ed] Lee, K., Liu, L., IEEE Computer Society, 2017, s. 1063-1073Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Calvin is an IoT framework for application development, deployment and execution in heterogeneous environments, that includes clouds, edge resources, and embedded or constrained resources. Inside Calvin, all the distributed resources are viewed as one environment by the application. The framework provides multi-tenancy and simplifies development of IoT applications, which are represented using a dataflow of application components (named actors) and their communication. The idea behind Calvin poses similarity with the serverless architecture and can be seen as Actor as a Service instead of Function as a Service. This makes Calvin very powerful as it does not only scale actors quickly but also provides an easy actor migration capability. In this work, we propose Calvin Constrained, an extension to the Calvin framework to cover resource-constrained devices. Due to limited memory and processing power of embedded devices, the constrained side of the framework can only support a limited subset of the Calvin features. The current implementation of Calvin Constrained supports actors implemented in C as well as Python, where the support for Python actors is enabled by using MicroPython as a statically allocated library, by this we enable the automatic management of state variables and enhance code re-usability. As would be expected, Python-coded actors demand more resources over C-coded ones. We show that the extra resources needed are manageable on current off-the-shelve micro-controller-equipped devices when using the Calvin framework.

Ort, förlag, år, upplaga, sidor
IEEE Computer Society, 2017
Serie
IEEE International Conference on Distributed Computing Systems, ISSN 1063-6927
Nyckelord
IoT, Distributed Cloud, Serverless Architecture, Dataflow Application Development Model
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
urn:nbn:se:umu:diva-142013 (URN)10.1109/ICDCS.2017.181 (DOI)000412759500098 ()978-1-5386-1791-5 (ISBN)978-1-5386-1792-2 (ISBN)978-1-5386-1793-9 (ISBN)
Konferens
37th IEEE International Conference on Distributed Computing Systems (ICDCS), JUN 05-08, 2017, Atlanta, GA
Forskningsfinansiär
Vetenskapsrådet, C0590801
Tillgänglig från: 2017-11-21 Skapad: 2017-11-21 Senast uppdaterad: 2018-09-07Bibliografiskt granskad
5. Distributed Cost-Optimized Placement for Latency-Critical Applications in Heterogeneous Environments
Öppna denna publikation i ny flik eller fönster >>Distributed Cost-Optimized Placement for Latency-Critical Applications in Heterogeneous Environments
2018 (Engelska)Ingår i: Proceedings of the IEEE 15th International Conference on Autonomic Computing (ICAC), IEEE Computer Society, 2018, s. 121-130Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Mobile Edge Clouds (MECs) with 5G will create new opportunities to develop latency-critical applications in domains such as intelligent transportation systems, process automation, and smart grids. However, it is not clear how one can costefficiently deploy and manage a large number of such applications given the heterogeneity of devices, application performance requirements, and workloads. This work explores cost and performance dynamics for IoT applications, and proposes distributed algorithms for automatic deployment of IoT applications in heterogeneous environments. Placement algorithms were evaluated with respect to metrics including number of required runtimes, applications’ slowdown, and the number of iterations used to place an application. Iterative search-based distributed algorithms such as Size Interval Actor Assignment in Groups (SIAA G) outperformed random and bin packing algorithms, and are therefore recommended for this purpose. Size Interval Actor Assignment in Groups at Least Utilized Runtime (SIAA G LUR) algorithm is also recommended when minimizing the number of iterations is important. The tradeoff of using SIAA G algorithms is a few extra runtimes compared to bin packing algorithms.

Ort, förlag, år, upplaga, sidor
IEEE Computer Society, 2018
Serie
Proceedings of the International Conference on Autonomic Computing, ISSN 2474-0764
Nyckelord
Mobile Edge Clouds, Fog Computing, IoTs, Distributed algorithms
Nationell ämneskategori
Datorsystem
Identifikatorer
urn:nbn:se:umu:diva-151457 (URN)10.1109/ICAC.2018.00022 (DOI)978-1-5386-5139-1 (ISBN)
Konferens
2018 IEEE International Conference on Autonomic Computing, Trento, Italy, September 3-7, 2018
Tillgänglig från: 2018-09-04 Skapad: 2018-09-04 Senast uppdaterad: 2019-06-26Bibliografiskt granskad
6. Utility-based Allocation of Industrial IoT Applications in Mobile Edge Clouds
Öppna denna publikation i ny flik eller fönster >>Utility-based Allocation of Industrial IoT Applications in Mobile Edge Clouds
2018 (Engelska)Rapport (Övrigt vetenskapligt)
Abstract [en]

Mobile Edge Clouds (MECs) create new opportunities and challenges in terms of scheduling and running applications that have a wide range of latency requirements, such as intelligent transportation systems, process automation, and smart grids. We propose a two-tier scheduler for allocating runtime resources to Industrial Internet of Things (IIoTs) applications in MECs. The scheduler at the higher level runs periodically – monitors system state and the performance of applications – and decides whether to admit new applications and migrate existing applications. In contrast, the lower-level scheduler decides which application will get the runtime resource next. We use performance based metrics that tells the extent to which the runtimes are meeting the Service Level Objectives (SLOs) of the hosted applications. The Application Happiness metric is based on a single application’s performance and SLOs. The Runtime Happiness metric is based on the Application Happiness of the applications the runtime is hosting. These metrics may be used for decision-making by the scheduler, rather than runtime utilization, for example.

We evaluate four scheduling policies for the high-level scheduler and five for the low-level scheduler. The objective for the schedulers is to minimize cost while meeting the SLO of each application. The policies are evaluated with respect to the number of runtimes, the impact on the performance of applications and utilization of the runtimes. The results of our evaluation show that the high-level policy based on Runtime Happiness combined with the low-level policy based on Application Happiness outperforms other policies for the schedulers, including the bin packing and random strategies. In particular, our combined policy requires up to 30% fewer runtimes than the simple bin packing strategy and increases the runtime utilization up to 40% for the Edge Data Center (DC) in the scenarios we evaluated.

Ort, förlag, år, upplaga, sidor
Umeå: Umeå universitet, 2018. s. 28
Serie
Report / UMINF, ISSN 0348-0542 ; 18.11
Nyckelord
Edge/Fog Computing, Hierarchical Resource Allocation, IoTs, Mobile Edge Clouds
Nationell ämneskategori
Datorsystem
Forskningsämne
datorteknik
Identifikatorer
urn:nbn:se:umu:diva-151455 (URN)
Tillgänglig från: 2018-09-04 Skapad: 2018-09-04 Senast uppdaterad: 2018-09-07Bibliografiskt granskad

Open Access i DiVA

fulltext(6193 kB)200 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 6193 kBChecksumma SHA-512
246fe0569209bd310a53485a208657d5c21ab63fcd45a9787ef80e56cfd5b9720e89a9857d346b780274e1264e392687b0017842155290d4b787c25c4e4f4704
Typ fulltextMimetyp application/pdf
spikblad(129 kB)17 nedladdningar
Filinformation
Filnamn SPIKBLAD02.pdfFilstorlek 129 kBChecksumma SHA-512
cb72872c24d9a7e5a8d00aa9e2bc1945e08945ac4d63853a8a7a62bc5d12dc87a3b7f3ae534356fa43105dbab25ae587576c6680d1cd6441f85eff55e30c9a17
Typ spikbladMimetyp application/pdf

Personposter BETA

Mehta, Amardeep

Sök vidare i DiVA

Av författaren/redaktören
Mehta, Amardeep
Av organisationen
Institutionen för datavetenskap
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 200 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

isbn
urn-nbn

Altmetricpoäng

isbn
urn-nbn
Totalt: 1067 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf