Abstract:Cloud computing heavily relies on virtualization, as with cloud computing virtual resources are typically leased to the consumer, for example as virtual machines. Efficient management of these virtual resources is of great importance, as it has a direct impact on both the scalability and the operational costs of the cloud environment. Recently, containers are gaining popularity as virtualization technology, due to the minimal overhead compared to traditional virtual machines and the offered portability. Tradit… Show more
“…Finally, although designed for VMs, we consider that the ECO-VMAP model can also be used for allocating containers. Relatively recent container technology offers a lightweight alternative for virtual machines [58][59][60]. VMs are emulated by a hypervisor that runs on a physical server, i.e., host machine.…”
Section: The Eco-vmap Modelmentioning
confidence: 99%
“…Therefore, containers are considered to be more vulnerable to possible attacks from malicious containers and prone to higher security risks [63,64]. Although these risks can be reduced to a degree by using additional security mechanisms, these mechanisms would bring additional overhead reducing the performance and elasticity of container platforms [58,63]. Another important issue yet to be solved within container technology is migration [65].…”
Section: The Eco-vmap Modelmentioning
confidence: 99%
“…Thus, to migrate a number of containers to a destination host, the operating system of the host should support these libraries required by the containers. However, VMs can be migrated to a destination host as long as a compatible hypervisor exists in the host [58]. Thus, both VMs and containers have pros and cons, and although the container technology is promising, it is not dominant over the VM technology yet [67].…”
Resource allocation is an important problem for cloud environments. This paper introduces an energyaware combinatorial auction-based model for the resource allocation problem in clouds. The proposed model allows users of a cloud to submit their virtual resource requests as bids using the provided bidding language which allows complementarities and substitutabilities among those resources to be declared. The model finds the most profitable mutually satisfiable set of winning bids, and the corresponding allocation of virtual resources to the users while considering the placement of virtual resources to the available physical resources in the cloud by executing an optimization problem. During the optimization, the model also takes account of the non-linear energy requirements of the physical resources based on their utilization levels to find a placement with the lowest energy cost, thus, providing an energy-aware solution to the resource allocation problem. The associated optimization problem is formally defined and formulated using integer programming. Since the optimization problem is intractable, four heuristic methods are also proposed. To evaluate the performance of the model and the proposed heuristic methods, several experiments are conducted on a comprehensive test suite. The results demonstrate the benefits of the proposed model, and the high-quality solutions provided by the proposed methods.
“…Finally, although designed for VMs, we consider that the ECO-VMAP model can also be used for allocating containers. Relatively recent container technology offers a lightweight alternative for virtual machines [58][59][60]. VMs are emulated by a hypervisor that runs on a physical server, i.e., host machine.…”
Section: The Eco-vmap Modelmentioning
confidence: 99%
“…Therefore, containers are considered to be more vulnerable to possible attacks from malicious containers and prone to higher security risks [63,64]. Although these risks can be reduced to a degree by using additional security mechanisms, these mechanisms would bring additional overhead reducing the performance and elasticity of container platforms [58,63]. Another important issue yet to be solved within container technology is migration [65].…”
Section: The Eco-vmap Modelmentioning
confidence: 99%
“…Thus, to migrate a number of containers to a destination host, the operating system of the host should support these libraries required by the containers. However, VMs can be migrated to a destination host as long as a compatible hypervisor exists in the host [58]. Thus, both VMs and containers have pros and cons, and although the container technology is promising, it is not dominant over the VM technology yet [67].…”
Resource allocation is an important problem for cloud environments. This paper introduces an energyaware combinatorial auction-based model for the resource allocation problem in clouds. The proposed model allows users of a cloud to submit their virtual resource requests as bids using the provided bidding language which allows complementarities and substitutabilities among those resources to be declared. The model finds the most profitable mutually satisfiable set of winning bids, and the corresponding allocation of virtual resources to the users while considering the placement of virtual resources to the available physical resources in the cloud by executing an optimization problem. During the optimization, the model also takes account of the non-linear energy requirements of the physical resources based on their utilization levels to find a placement with the lowest energy cost, thus, providing an energy-aware solution to the resource allocation problem. The associated optimization problem is formally defined and formulated using integer programming. Since the optimization problem is intractable, four heuristic methods are also proposed. To evaluate the performance of the model and the proposed heuristic methods, several experiments are conducted on a comprehensive test suite. The results demonstrate the benefits of the proposed model, and the high-quality solutions provided by the proposed methods.
“…A literature review by Maenhaut, Volckaert, Ongenae and De Turck [5] discusses challenges related to service orchestration, resource management and pricing in (distributed) clouds and the fog. An overview of the challenges in fog and edge computing is presented by Avasalcai, Murturi and Dustdar [6].…”
Recent years have seen fog and edge computing emerge as new paradigms to provide more responsive software services. While both these concepts have numerous advantages in terms of efficiency and user experience by moving computational tasks closer to where they are needed, effective service scheduling requires a different approach in the geographically widespread fog than it does in the cloud. Additionally, fog and edge networks are volatile, and of such a scale that gathering all the required data for a centralized scheduler results in prohibitively high memory use and network traffic. Since the fog is a geographically distributed computational substrate, a suitable solution is to use a decentralized service scheduler, deployed on all nodes, which can monitor and deploy services in its neighbourhood without having to know the entire service topology.This article presents a fully decentralized service scheduler, labeled "SoSwirly", for fog and edge networks containing hundreds of thousands of devices. It scales service instances as required by the edge, based on available resources This is a post-peer-review, pre-copyedit version of an article published in Journal of Network and Systems Management.
“…Some research has been done in related fields, see for example the studies reported in [17][18][19][20], but these have not been in the context of containers. Others have reviewed the use of containers from a general perspective, without special emphasis on scheduling of containerized edge computing, see for example studies in [21,22]. Ahmad et al [23] report a survey of scheduling techniques in edge computing.…”
Containers are a form of software virtualization, rapidly becoming the de facto way of providing edge computing services. Research on container-based edge computing is plentiful, and this has been buoyed by the increasing demand for single digit, milliseconds latency computations. A container scheduler is part of the architecture that is used to manage and orchestrate multiple container-based applications on heterogenous computing nodes. The scheduler decides how incoming computing requests are allocated to containers, which edge nodes the containers are placed on, and where already deployed containers are migrated to. This paper aims to clarify the concept of container placement and migration in edge servers and the scheduling models that have been developed for this purpose. The study illuminates the frameworks and algorithms upon which the scheduling models are built. To convert the problem to one that can be solved using an algorithm, the container placement problem in mostly abstracted using multi-objective optimization models or graph network models. The scheduling algorithms are predominantly heuristic-based algorithms, which are able to arrive at sub-optimal solutions very quickly. There is paucity of container scheduling models that consider distributed edge computing tasks. Research in decentralized scheduling systems is gaining momentum and the future outlook is in scheduling containers for mobile edge nodes.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.