94,837 research outputs found
Offline and online power aware resource allocation algorithms with migration and delay constraints
© . This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/In order to handle advanced mobile broadband services and Internet of Things (IoT), future Internet and 5G networks are expected to leverage the use of network virtualization, be much faster, have greater capacities, provide lower latencies, and significantly be power efficient than current mobile technologies. Therefore, this paper proposes three power aware algorithms for offline, online, and migration applications, solving the resource allocation problem within the frameworks of network function virtualization (NFV) environments in fractions of a second. The proposed algorithms target minimizing the total costs and power consumptions in the physical network through sufficiently allocating the least physical resources to host the demands of the virtual network services, and put into saving mode all other not utilized physical components. Simulations and evaluations of the offline algorithm compared to the state-of-art resulted on lower total costs by 32%. In addition to that, the online algorithm was tested through four different experiments, and the results argued that the overall power consumption of the physical network was highly dependent on the demands’ lifetimes, and the strictness of the required end-to-end delay. Regarding migrations during online, the results concluded that the proposed algorithms would be most effective when applied for maintenance and emergency conditions.Peer ReviewedPreprin
Scheduling Resources for Executing a Partial Set of Jobs
In this paper, we consider the problem of choosing a minimum cost set of
resources for executing a specified set of jobs. Each input job is an interval,
determined by its start-time and end-time. Each resource is also an interval
determined by its start-time and end-time; moreover, every resource has a
capacity and a cost associated with it. We consider two versions of this
problem. In the partial covering version, we are also given as input a number
k, specifying the number of jobs that must be performed. The goal is to choose
k jobs and find a minimum cost set of resources to perform the chosen k jobs
(at any point of time the capacity of the chosen set of resources should be
sufficient to execute the jobs active at that time). We present an O(log
n)-factor approximation algorithm for this problem.
We also consider the prize collecting version, wherein every job also has a
penalty associated with it. The feasible solution consists of a subset of the
jobs, and a set of resources, to perform the chosen subset of jobs. The goal is
to find a feasible solution that minimizes the sum of the costs of the selected
resources and the penalties of the jobs that are not selected. We present a
constant factor approximation algorithm for this problemComment: Full version of paper accepted to FSTTCS'201
Elastic Business Process Management: State of the Art and Open Challenges for BPM in the Cloud
With the advent of cloud computing, organizations are nowadays able to react
rapidly to changing demands for computational resources. Not only individual
applications can be hosted on virtual cloud infrastructures, but also complete
business processes. This allows the realization of so-called elastic processes,
i.e., processes which are carried out using elastic cloud resources. Despite
the manifold benefits of elastic processes, there is still a lack of solutions
supporting them.
In this paper, we identify the state of the art of elastic Business Process
Management with a focus on infrastructural challenges. We conceptualize an
architecture for an elastic Business Process Management System and discuss
existing work on scheduling, resource allocation, monitoring, decentralized
coordination, and state management for elastic processes. Furthermore, we
present two representative elastic Business Process Management Systems which
are intended to counter these challenges. Based on our findings, we identify
open issues and outline possible research directions for the realization of
elastic processes and elastic Business Process Management.Comment: Please cite as: S. Schulte, C. Janiesch, S. Venugopal, I. Weber, and
P. Hoenisch (2015). Elastic Business Process Management: State of the Art and
Open Challenges for BPM in the Cloud. Future Generation Computer Systems,
Volume NN, Number N, NN-NN., http://dx.doi.org/10.1016/j.future.2014.09.00
- …