scispace - formally typeset
Search or ask a question

Showing papers on "Resource management published in 2016"


Proceedings ArticleDOI
09 Nov 2016
TL;DR: This work presents DeepRM, an example solution that translates the problem of packing tasks with multiple resource demands into a learning problem, and shows that it performs comparably to state-of-the-art heuristics, adapts to different conditions, converges quickly, and learns strategies that are sensible in hindsight.
Abstract: Resource management problems in systems and networking often manifest as difficult online decision making tasks where appropriate solutions depend on understanding the workload and environment. Inspired by recent advances in deep reinforcement learning for AI problems, we consider building systems that learn to manage resources directly from experience. We present DeepRM, an example solution that translates the problem of packing tasks with multiple resource demands into a learning problem. Our initial results show that DeepRM performs comparably to state-of-the-art heuristics, adapts to different conditions, converges quickly, and learns strategies that are sensible in hindsight.

948 citations


Journal ArticleDOI
TL;DR: This paper presents a comprehensive state of the art of NFV-RA by introducing a novel classification of the main approaches that pose solutions to solve the NFV resource allocation problem.
Abstract: Network functions virtualization (NFV) is a new network architecture framework where network function that traditionally used dedicated hardware (middleboxes or network appliances) are now implemented in software that runs on top of general purpose hardware such as high volume server. NFV emerges as an initiative from the industry (network operators, carriers, and manufacturers) in order to increase the deployment flexibility and integration of new network services with increased agility within operator’s networks and to obtain significant reductions in operating expenditures and capital expenditures. NFV promotes virtualizing network functions such as transcoders, firewalls, and load balancers, among others, which were carried out by specialized hardware devices and migrating them to software-based appliances. One of the main challenges for the deployment of NFV is the resource allocation of demanded network services in NFV-based network infrastructures. This challenge has been called the NFV resource allocation (NFV-RA) problem. This paper presents a comprehensive state of the art of NFV-RA by introducing a novel classification of the main approaches that pose solutions to solve it. This paper also presents the research challenges that are still subject of future investigation in the NFV-RA realm.

762 citations


Journal ArticleDOI
TL;DR: A computation-efficient solution is proposed based on the formulation and validated by extensive simulation based studies to deal with the high computation complexity of fog computing supported software-defined embedded system.
Abstract: Traditional standalone embedded system is limited in their functionality, flexibility, and scalability. Fog computing platform, characterized by pushing the cloud services to the network edge, is a promising solution to support and strengthen traditional embedded system. Resource management is always a critical issue to the system performance. In this paper, we consider a fog computing supported software-defined embedded system, where task images lay in the storage server while computations can be conducted on either embedded device or a computation server. It is significant to design an efficient task scheduling and resource management strategy with minimized task completion time for promoting the user experience. To this end, three issues are investigated in this paper: 1) how to balance the workload on a client device and computation servers, i.e., task scheduling, 2) how to place task images on storage servers, i.e., resource management, and 3) how to balance the I/O interrupt requests among the storage servers. They are jointly considered and formulated as a mixed-integer nonlinear programming problem. To deal with its high computation complexity, a computation-efficient solution is proposed based on our formulation and validated by extensive simulation based studies.

359 citations


Journal ArticleDOI
TL;DR: This paper provides a detailed definition of the problem, analyzing how new trends such as software defined networking and network function virtualization can assist in the slicing, and describes some research challenges on this topic.
Abstract: New architectural and design approaches for radio access networks have appeared with the introduction of network virtualization in the wireless domain. One of these approaches splits the wireless network infrastructure into isolated virtual slices under their own management, requirements, and characteristics. Despite the advances in wireless virtualization, there are still many open issues regarding the resource allocation and isolation of wireless slices. Because of the dynamics and shared nature of the wireless medium, guaranteeing that the traffic on one slice will not affect the traffic on the others has proven to be difficult. In this paper, we focus on the detailed definition of the problem, discussing its challenges. We also provide a review of existing works that deal with the problem, analyzing how new trends such as software defined networking and network function virtualization can assist in the slicing. We will finally describe some research challenges on this topic.

344 citations


Journal ArticleDOI
TL;DR: This article defines user-centric UDN (UUDN) by introducing the philosophy of the network serving user and the "de-cellular" method, and proposes Dynamic AP grouping as the core function of UUDN.
Abstract: Ultra-dense networking (UDN) is considered as a promising technology for 5G. In this article, we define user-centric UDN (UUDN) by introducing the philosophy of the network serving user and the "de-cellular" method. Based on the analysis of challenges and requirements of UUDN, a new architecture is presented that breaks through the traditional cellular architecture of the network controlling user. Dynamic AP grouping is proposed as the core function of UUDN, through which a user could enjoy satisfactory and secure service following her movement. Furthermore, we provide methods for mobility management, resource management, interference management, and security issues. We point out that these functions should be co-designed and jointly optimized in order to improve the system throughput with higher resource utilization, better user experience, and increased energy efficiency. Finally, future works in UUDN are discussed.

329 citations


Posted Content
TL;DR: A simulator, called iFogSim, is proposed to model IoT and Fog environments and measure the impact of resource management techniques in latency, network congestion, energy consumption, and cost.
Abstract: Internet of Things (IoT) aims to bring every object (e.g. smart cameras, wearable, environmental sensors, home appliances, and vehicles) online, hence generating massive amounts of data that can overwhelm storage systems and data analytics applications. Cloud computing offers services at the infrastructure level that can scale to IoT storage and processing requirements. However, there are applications such as health monitoring and emergency response that require low latency, and delay caused by transferring data to the cloud and then back to the application can seriously impact their performances. To overcome this limitation, Fog computing paradigm has been proposed, where cloud services are extended to the edge of the network to decrease the latency and network congestion. To realize the full potential of Fog and IoT paradigms for real-time analytics, several challenges need to be addressed. The first and most critical problem is designing resource management techniques that determine which modules of analytics applications are pushed to each edge device to minimize the latency and maximize the throughput. To this end, we need a evaluation platform that enables the quantification of performance of resource management policies on an IoT or Fog computing infrastructure in a repeatable manner. In this paper we propose a simulator, called iFogSim, to model IoT and Fog environments and measure the impact of resource management techniques in terms of latency, network congestion, energy consumption, and cost. We describe two case studies to demonstrate modeling of an IoT environment and comparison of resource management policies. Moreover, scalability of the simulation toolkit in terms of RAM consumption and execution time is verified under different circumstances.

324 citations


Journal ArticleDOI
TL;DR: The results proved that the combinatorial double auction-based resource allocation model is an appropriate market-based model for cloud computing because it allows double-sided competition and bidding on an unrestricted number of items, which causes it to be economically efficient.

261 citations


Journal ArticleDOI
TL;DR: This paper studies the deployment of D2D communications as an underlay to long-term evolution-advanced (LTE-A) networks based on novel architectures such as cloud radio access network (C-RAN).
Abstract: Device-to-device (D2D) communication is a key enabler to facilitate the realization of the Internet of Things (IoT). In this paper, we study the deployment of D2D communications as an underlay to long-term evolution-advanced (LTE-A) networks based on novel architectures such as cloud radio access network (C-RAN). The challenge is that both energy efficiency (EE) and quality of service (QoS) are severely degraded by the strong intracell and intercell interference due to dense deployment and spectrum reuse. To tackle this problem, we propose an energy-efficient resource allocation algorithm through joint channel selection and power allocation design. The proposed algorithm has a hybrid structure that exploits the hybrid architecture of C-RAN: distributed remote radio heads (RRHs) and centralized baseband unit (BBU) pool. The distributed resource allocation problem is modeled as a noncooperative game, and each player optimizes its EE individually with the aid of distributed RRHs. We transform the nonconvex optimization problem into a convex one by applying constraint relaxation and nonlinear fractional programming. We propose a centralized interference mitigation algorithm to improve the QoS performance. The centralized algorithm consists of an interference cancellation technique and a transmission power constraint optimization technique, both of which are carried out in the centralized BBU pool. The achievable performance of the proposed algorithm is analyzed through simulations, and the implementation issues and complexity analysis are discussed in detail.

243 citations


Journal ArticleDOI
TL;DR: This study identifies two positive quasi-moderating effects of resource commitment on the IT resourceKMC relationship, which directly and positively enhances KMC, and strengthens the effects of IT human and IT relationship resources on KMC.

211 citations


Journal ArticleDOI
TL;DR: In this article, the waste hierarchy is analyzed on a conceptual level by studying its original aims, its potential to fulfill those aims, and its actual policy implementation, and the authors conclude that the hierarchy in its current form is an insufficient foundation for waste and resource policy to achieve absolute reductions in material throughput.

205 citations


01 Jan 2016
TL;DR: The water resources systems planning and management is universally compatible with any devices to read and it is set as public so you can download it instantly.
Abstract: water resources systems planning and management is available in our digital library an online access to it is set as public so you can download it instantly. Our book servers spans in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the water resources systems planning and management is universally compatible with any devices to read.

Journal ArticleDOI
TL;DR: A novel two-layer approach is proposed, which allows finding the optimum at each iteration by decoupling the EE optimization problem of joint resource allocation and power control into two separate steps.
Abstract: In this paper, joint resource allocation and power control for energy-efficient device-to-device (D2D) communications underlaying cellular networks are investigated. The resource and power are optimized for maximization of the energy efficiency (EE) of D2D communications. Exploiting the properties of fractional programming, we transform the original nonconvex optimization problem in fractional form into an equivalent optimization problem in subtractive form. Then, an efficient iterative resource allocation and power control scheme is proposed. In each iteration, part of the constraints of the EE optimization problem are removed by exploiting the penalty function approach. We further propose a novel two-layer approach, which allows finding the optimum at each iteration by decoupling the EE optimization problem of joint resource allocation and power control into two separate steps. In the first layer, the optimal power values are obtained by solving a series of maximization problems through root finding, with or without considering the loss of cellular users' rates. In the second layer, the formulated optimization problem belongs to a classical resource-allocation problem with single allocation format, which admits a network flow formulation so that it can be solved to optimality. Simulation results demonstrate the remarkable improvements in terms of EE by using the proposed iterative resource allocation and power control scheme.

Journal ArticleDOI
TL;DR: This paper transforms the V2X requirements into the constraints that are computable using slowly varying channel state information only, and formulates an optimization problem, taking into account the requirements of both vehicular users and cellular users, and proposes a heuristic algorithm, called Cluster-based Resource block sharing and pOWer allocatioN (CROWN).
Abstract: Deploying direct device-to-device (D2D) links is a promising technology for vehicle-to-X (V2X) applications. However, intracell interference, along with stringent requirements on latency and reliability, are challenging issues. In this paper, we study the radio resource management problem for D2D-based safety-critical V2X communications. We first transform the V2X requirements into the constraints that are computable using slowly varying channel state information only. Secondly, we formulate an optimization problem, taking into account the requirements of both vehicular users (V-UEs) and cellular users (C-UEs), where resource sharing can take place not only between a V-UE and a C-UE but also among different V-UEs. The NP-hardness of the problem is rigorously proved. Moreover, a heuristic algorithm, called Cluster-based Resource block sharing and pOWer allocatioN (CROWN), is proposed to solve this problem. Finally, simulation results indicate promising performance of the CROWN scheme.

Journal ArticleDOI
TL;DR: It is concluded that Sustainable Consumption and Production policies (goal 12) are most effective at minimizing trade-offs and argue for their centrality to the formulation of coherent SDG strategies.
Abstract: The 17 Sustainable Development Goals (SDGs) call for a comprehensive new approach to development rooted in planetary boundaries, equity, and inclusivity. The wide scope of the SDGs will necessitate unprecedented integration of siloed policy portfolios to work at international, regional, and national levels toward multiple goals and mitigate the conflicts that arise from competing resource demands. In this analysis, we adopt a comprehensive modeling approach to understand how coherent policy combinations can manage trade-offs among environmental conservation initiatives and food prices. Our scenario results indicate that SDG strategies constructed around Sustainable Consumption and Production policies can minimize problem-shifting, which has long placed global development and conservation agendas at odds. We conclude that Sustainable Consumption and Production policies (goal 12) are most effective at minimizing trade-offs and argue for their centrality to the formulation of coherent SDG strategies. We also find that alternative socioeconomic futures—mainly, population and economic growth pathways—generate smaller impacts on the eventual achievement of land resource–related SDGs than do resource-use and management policies. We expect that this and future systems analyses will allow policy-makers to negotiate trade-offs and exploit synergies as they assemble sustainable development strategies equal in scope to the ambition of the SDGs.

Journal ArticleDOI
TL;DR: In this paper, a hierarchical combinatorial auction mechanism is proposed to solve the resource allocation problem in 5G cellular networks, which satisfies the requirements of efficient resource allocation, strict inter-slice isolation and the ability of intra-slice customization.
Abstract: Virtualization has been seen as one of the main evolution trends in the forthcoming fifth generation (5G) cellular networks which enables the decoupling of infrastructure from the services it provides. In this case, the roles of infrastructure providers (InPs) and mobile virtual network operators (MVNOs) can be logically separated and the resources (e.g., subchannels, power, and antennas) of a base station owned by an InP can be transparently shared by multiple MVNOs, while each MVNO virtually owns the entire BS. Naturally, the issue of resource allocation arises. In particular, the InP is required to abstract the physical resources into isolated slices for each MVNO who then allocates the resources within the slice to its subscribed users. In this paper, we aim to address this two-level hierarchical resource allocation problem while satisfying the requirements of efficient resource allocation, strict inter-slice isolation, and the ability of intra-slice customization. To this end, we design a hierarchical combinatorial auction mechanism, based on which a truthful and sub-efficient resource allocation framework is provided. Specifically, winner determination problems (WDPs) are formulated for the InP and MVNOs, and computationally tractable algorithms are proposed to solve these WDPs. Also, pricing schemes are designed to ensure incentive compatibility. The designed mechanism can achieve social efficiency in each level even if each party involved acts selfishly. Numerical results show the effectiveness of the proposed scheme.

BookDOI
19 Dec 2016
TL;DR: The Handbook of Material Flow Analysis: For Environmental, Resource, and Waste Engineers, Second Edition serves as a concise and reproducible methodology as well as a basis for analysis, assessment and improvement of anthropogenic systems through an approach that is helpfully uniform and standardized as mentioned in this paper.
Abstract: In this second edition of a bestseller, authors Paul H. Brunner and Helmut Rechberger guide professional newcomers as well as experienced engineers and scientists towards mastering the art of material flow analysis (MFA) from the very beginning to an advanced state of material balances of complex systems. Handbook of Material Flow Analysis: For Environmental, Resource, and Waste Engineers, Second Edition serves as a concise and reproducible methodology as well as a basis for analysis, assessment and improvement of anthropogenic systems through an approach that is helpfully uniform and standardized. The methodology featured in this book is a vital resource for generating new data, fostering understanding, and increasing knowledge to benefit the growing MFA community working in the fields of industrial ecology, resource management, waste management, and environmental protection. This new second edition takes into account all new developments and readers will profit from a new exploration of STAN software, newly added citations, and thoroughly described case studies that reveal the potential of MFA to solve industrial ecology challenges.

Journal ArticleDOI
TL;DR: A reference framework for TE in the SDN is proposed, which consists of two parts, traffic measurement and traffic management; technologies related to traffic management include traffic load balancing, QoS-guarantee scheduling, energy-saving scheduling, and trafficmanagement for the hybrid IP/SDN.
Abstract: As the next generation network architecture, software-defined networking (SDN) has exciting application prospects. Its core idea is to separate the forwarding layer and control layer of network system, where network operators can program packet forwarding behavior to significantly improve the innovation capability of network applications. Traffic engineering (TE) is an important network application, which studies measurement and management of network traffic, and designs reasonable routing mechanisms to guide network traffic to improve utilization of network resources, and better meet requirements of the network quality of service (QoS). Compared with the traditional networks, the SDN has many advantages to support TE due to its distinguish characteristics, such as isolation of control and forwarding, global centralized control, and programmability of network behavior. This paper focuses on the traffic engineering technology based on the SDN. First, we propose a reference framework for TE in the SDN, which consists of two parts, traffic measurement and traffic management. Traffic measurement is responsible for monitoring and analyzing real-time network traffic, as a prerequisite for traffic management. In the proposed framework, technologies related to traffic measurement include network parameters measurement, a general measurement framework, and traffic analysis and prediction; technologies related to traffic management include traffic load balancing, QoS-guarantee scheduling, energy-saving scheduling, and traffic management for the hybrid IP/SDN. Current existing technologies are discussed in detail, and our insights into future development of TE in the SDN are offered.

Journal ArticleDOI
TL;DR: An aggregate network utility optimization framework is developed for the design of an online energy management, spectrum management, and resource allocation algorithm based on Lyapunov optimization to achieve two major goals: first, balancing sensors' energy consumption and energy harvesting while stabilizing their data and energy queues.
Abstract: In this paper, we study resource management and allocation for energy harvesting cognitive radio sensor networks (EHCRSNs). In these networks, energy harvesting supplies the network with a continual source of energy to facilitate the self-sustainability of the power-limited sensors. Furthermore, cognitive radio enables access to the underutilized licensed spectrum to mitigate the spectrum-scarcity problem in the unlicensed band. We develop an aggregate network utility optimization framework for the design of an online energy management, spectrum management, and resource allocation algorithm based on Lyapunov optimization. The framework captures three stochastic processes: energy harvesting dynamics, inaccuracy of channel occupancy information, and channel fading. However, a priori knowledge of any of these processes statistics is not required. Based on the framework, we propose an online algorithm to achieve two major goals: first, balancing sensors’ energy consumption and energy harvesting while stabilizing their data and energy queues; second, optimizing the utilization of the licensed spectrum while maintaining a tolerable collision rate between the licensed subscriber and unlicensed sensors. The performance analysis shows that the proposed algorithm achieves a close-to-optimal aggregate network utility while guaranteeing bounded data and energy queue occupancy. The extensive simulations are conducted to verify the effectiveness of the proposed algorithm and the impact of various network parameters on its performance.

Journal ArticleDOI
TL;DR: It is perceived that different schemes and algorithms did not consider some essential parameters and enhancement is requisite to improve the performance of the existing schemes to trigger new and innovative methods of handling the problems of resource scheduling in the cloud.

Journal ArticleDOI
TL;DR: A feasible and truthful incentive mechanism (TIM), to coordinate the resource auction between mobile devices as service users (buyers) and cloudlets as service providers (sellers) is proposed and extended to a more efficient design of auction (EDA).
Abstract: Mobile cloud computing offers an appealing paradigm to relieve the pressure of soaring data demands and augment energy efficiency for future green networks. Cloudlets can provide available resources to nearby mobile devices with lower access overhead and energy consumption. To stimulate service provisioning by cloudlets and improve resource utilization, a feasible and efficient incentive mechanism is required to charge mobile users and reward cloudlets. Although auction has been considered as a promising form for incentive, it is challenging to design an auction mechanism that holds certain desirable properties for the cloudlet scenario. Truthfulness and system efficiency are two crucial properties in addition to computational efficiency, individual rationality and budget balance. In this paper, we first propose a feasible and truthful incentive mechanism (TIM), to coordinate the resource auction between mobile devices as service users (buyers) and cloudlets as service providers (sellers). Further, TIM is extended to a more efficient design of auction (EDA). TIM guarantees strong truthfulness for both buyers and sellers, while EDA achieves a fairly high system efficiency but only satisfies strong truthfulness for sellers. We also show the difficulties for the buyers to manipulate the resource auction in EDA and the high expected utility with truthful bidding.

Proceedings ArticleDOI
22 Aug 2016
TL;DR: This paper considers a cloudlet in an Orthogonal Frequency-Division Multiplexing Access (OFDMA) system with multiple mobile devices, where the proposed algorithm significantly outperforms per- resource optimization, accommodating more offloading requests while achieving salient energy saving.
Abstract: In mobile edge computing systems, mobile devices can offload compute-intensive tasks to a nearby \emph{cloudlet}, so as to save energy and extend battery life. Unlike a fully-fledged cloud, a cloudlet is a small-scale datacenter deployed at a wireless access point, and thus is highly constrained by both radio and compute resources. We show in this paper that separately optimizing the allocation of either compute or radio resource - as most existing works did - is highly \emph{suboptimal}: the congestion of compute resource leads to the waste of radio resource, and vice versa. To address this problem, we propose a joint scheduling algorithm that allocates both radio and compute resources coordinately. Specifically, we consider a cloudlet in an Orthogonal Frequency-Division Multiplexing Access (OFDMA) system with multiple mobile devices, where we study subcarrier allocation for task offloading and CPU time allocation for task execution in the cloudlet. Simulation results show that the proposed algorithm significantly outperforms per- resource optimization, accommodating more offloading requests while achieving salient energy saving.

Journal ArticleDOI
TL;DR: This paper studies the resource allocation algorithm design for distributed antenna multiuser networks with full-duplex (FD) radio base stations (BSs), which enable simultaneous uplink and downlink communications and demonstrates the tradeoff between power efficiency and the number of active transmit antennas.
Abstract: In this paper, we study the resource allocation algorithm design for distributed antenna multiuser networks with full-duplex (FD) radio base stations (BSs), which enable simultaneous uplink and downlink communications. The considered resource allocation algorithm design is formulated as an optimization problem taking into account the antenna circuit power consumption of the BSs and the quality of service (QoS) requirements of both uplink and downlink users. We minimize the total network power consumption by jointly optimizing the downlink beamformer, the uplink transmit power, and the antenna selection. To overcome the intractability of the resulting problem, we reformulate it as an optimization problem with decoupled binary selection variables and nonconvex constraints. The reformulated problem facilitates the design of an iterative resource allocation algorithm, which obtains an optimal solution based on the generalized Bender’s decomposition (GBD). For this algorithm, we also propose a simple technique to improve the speed of convergence. Furthermore, to strike a balance between computational complexity and system performance, a suboptimal resource allocation algorithm with polynomial time complexity is proposed. Simulation results illustrate that the proposed GBD-based iterative algorithm converges to the globally optimal solution and the suboptimal algorithm achieves a close-to-optimal performance. Our results also demonstrate the tradeoff between power efficiency and the number of active transmit antennas when the circuit power consumption is taken into account. In particular, activating an exceedingly large number of antennas may not be an efficient approach for reducing the total system power consumption. In addition, our results reveal that FD systems facilitate significant power savings compared to traditional half-duplex systems, despite the nonnegligible self-interference.

Journal ArticleDOI
TL;DR: An overview on BS switch-off technologies is taken and the state of the art on each aspect is presented and some challenges that need to be solved for future work are described.
Abstract: For heterogeneous network, which has been viewed as one pioneering technology for making cellular networks be evolved into 5G systems, reducing energy consumption by dynamically switching off base stations (BSs) has attracted increasing attention recently. With aiming at optimization on energy saving only or another energy-related performance tradeoffs, several BS switch-off strategies have been proposed from different design perspectives, such as random, distance-aware, load-aware, and auction-based strategies. Furthermore, work has been done to consider joint design for BS switch-off strategy and another strategies, such as user association, resource allocation, and physical-layer interference cancellation strategies. Finally, there have been research results about this topic in emerging cloud radio access networks. In this paper, we take an overview on these technologies and present the state of the art on each aspect. Some challenges that need to be solved in this research filed for future work are also described.

Journal ArticleDOI
TL;DR: Simulation results show that the proposed scheme outperforms traditional schemes, and a delay-optimal virtualized radio resource scheduling scheme is proposed via stochastic learning.
Abstract: Due to the high density of vehicles and various types of vehicular services, it is challenging to guarantee the quality of vehicular services in current Long-Term Evolution (LTE) networks in a cost-efficient manner. Fortunately, with the development of fifth-generation (5G) technology, the installation of a large number of small cells is foreseen as one of the practical ways to achieve the low-delay requirement in vehicular environments. However, it may cause a huge operating expense and capital expenditure to mobile network operators due to the limited backhaul capacity and the explosion of signaling. In this paper, we integrate software-defined networking and radio resource virtualization into an LTE system for vehicular networks, i.e., software-defined heterogeneous vehicular network (SERVICE) . Based on this proposed system framework, a delay-optimal virtualized radio resource scheduling scheme is proposed via stochastic learning. The delay optimal problem is formulated as an infinite-horizon average-cost partially observed Markov decision process (POMDP). Then, an equivalent Bellman equation is derived to solve it. The proposed scheme can be divided into two stages, i.e., macro virtualization resource allocation (MaVRA) and micro virtualization resource allocation (MiVRA). The former is executed based on large timescale variables (traffic density), whereas the latter is operated according to short timescale variables (channel state and queue state). Simulation results show that the proposed scheme outperforms traditional schemes.

Journal ArticleDOI
TL;DR: The proposed multi-resource allocation strategy enhances the quality of mobile cloud service, in terms of the system throughput (the number of admitted mobile applications) and the service latency, and outperforms greedy admission control over a broad range of environments.
Abstract: Mobile cloud computing utilizing cloudlet is an emerging technology to improve the quality of mobile services. In this paper, to better overcome the main bottlenecks of the computation capability of cloudlet and the wireless bandwidth between mobile devices and cloudlet, we consider the multi-resource allocation problem for the cloudlet environment with resource-intensive and latency-sensitive mobile applications. The proposed multi-resource allocation strategy enhances the quality of mobile cloud service, in terms of the system throughput (the number of admitted mobile applications) and the service latency. We formulate the resource allocation model as a semi-Markov decision process under the average cost criterion, and solve the optimization problem using linear programming technology. Through maximizing the long-term reward while meeting the system requirements of the request blocking probability and service time latency, an optimal resource allocation policy is calculated. From simulation result, it is indicated that the system adaptively adjusts the allocation policy about how much resource to allocate and whether to utilize the distant cloud according to the traffic of mobile service requests and the availability of the resource in the system. Our algorithm outperforms greedy admission control over a broad range of environments.

Journal ArticleDOI
TL;DR: An auction-based online mechanism for VM provisioning, allocation, and pricing in clouds that considers several types of resources is designed and it is proved that the mechanism is incentive-compatible, that is, it gives incentives to the users to reveal their actual requests.
Abstract: Cloud providers provision their various resources such as CPUs, memory, and storage in the form of virtual machine (VM) instances which are then allocated to the users. The users are charged based on a pay-as-you-go model, and their payments should be determined by considering both their incentives and the incentives of the cloud providers. Auction markets can capture such incentives, where users name their own prices for their requested VMs. We design an auction-based online mechanism for VM provisioning, allocation, and pricing in clouds that considers several types of resources. Our proposed online mechanism makes no assumptions about future demand of VMs, which is the case in real cloud settings. The proposed online mechanism is invoked as soon as a user places a request or some of the allocated resources are released and become available. The mechanism allocates VM instances to selected users for the period they are requested for, and ensures that the users will continue using their VM instances for the entire requested period. In addition, the mechanism determines the payment the users have to pay for using the allocated resources. We prove that the mechanism is incentive-compatible, that is, it gives incentives to the users to reveal their actual requests. We investigate the performance of our proposed mechanism through extensive experiments.

Journal ArticleDOI
TL;DR: In this article, the United Nations 2030 Sustainable Development Goals place a high priority on food and energy security; bioenergy plays an important role in achieving both goals, and food security programs begin by clearly defining the problem and asking, what can be done to assist people at high risk?
Abstract: Understanding the complex interactions among food security, bioenergy sustainability, and resource management requires a focus on specific contextual problems and opportunities. The United Nations’ 2030 Sustainable Development Goals place a high priority on food and energy security; bioenergy plays an important role in achieving both goals. Effective food security programs begin by clearly defining the problem and asking, ‘What can be done to assist people at high risk?’ Simplistic global analyses, headlines, and cartoons that blame biofuels for food insecurity may reflect good intentions but mislead the public and policymakers because they obscure the main drivers of local food insecurity and ignore opportunities for bioenergy to contribute to solutions. Applying sustainability guidelines to bioenergy will help achieve near- and long-term goals to eradicate hunger. Priorities for achieving successful synergies between bioenergy and food security include the following: (1) clarifying communications with clear and consistent terms, (2) recognizing that food and bioenergy need not compete for land and, instead, should be integrated to improve resource management, (3) investing in technology, rural extension, and innovations to build capacity and infrastructure, (4) promoting stable prices that incentivize local production, (5) adopting flex crops that can provide food along with other products and services to society, and (6) engaging stakeholders to identify and assess specific opportunities for biofuels to improve food security. Systematic monitoring and analysis to support adaptive management and continual improvement are essential elements to build synergies and help society equitably meet growing demands for both food and energy.

Journal ArticleDOI
TL;DR: A hybrid method to take full advantages of both traffic offloading and resource sharing methods, where cellular base stations offload traffic to WiFi networks and simultaneously occupy certain number of time slots on unlicensed bands is developed.
Abstract: Traffic offloading and resource sharing are two common methods for delivering cellular data traffic over unlicensed bands. In this paper, we first develop a hybrid method to take full advantages of both traffic offloading and resource sharing methods, where cellular base stations (BSs) offload traffic to WiFi networks and simultaneously occupy certain number of time slots on unlicensed bands. Then, we analytically compare the cellular throughput of the three methods with the guarantee of WiFi per-user throughput in the single-BS scenario. We find that traffic offloading can achieve better performance than resource sharing when existing WiFi user number is below a threshold and the hybrid method achieves the same performance as the resource sharing method when existing WiFi user number is large enough. In the multi-BS scenario where the coverage of small cells and WiFi access points are mutually overlapped, we consider to maximize the minimum average per-user throughput of each small cell and derive a closed-form expression for the throughput upper bound in each method. Meanwhile, practical traffic offloading and resource sharing algorithms are also developed for the three methods, respectively. Numerical results validate our theoretical analysis and demonstrate the effectiveness of the proposed algorithms as well.

Journal ArticleDOI
TL;DR: Results indicate that the proposed resource-sharing scheme with the geodistributed cloudlets can improve resource utilization and reduce system power consumption and with the integration of a software-defined network architecture, a vehicular network can easily reach a globally optimal solution.
Abstract: Vehicular networks are expected to accommodate a large number of data-heavy mobile devices and multiapplication services, whereas it faces a significant challenge when we need to deal with the ever-increasing demand of mobile traffic. In this paper, we present a new paradigm of fifth-generation (5G)-enabled vehicular networks to improve network capacity and system computing capability. We extend the original cloud radio access network (C-RAN) to integrate local cloud services to provide a low-cost, scalable, self-organizing, and effective solution. The new C-RAN is named enhanced C-RAN (EC-RAN). Cloudlets in EC-RAN are geographically distributed for local services. Furthermore, device-to-device (D2D) and heterogeneous networks are essential technologies in 5G systems. They can greatly improve spectrum efficiency and support large-scale live video streaming in short-distance communications. We exploit matrix game theoretical approach to operate the cloudlet resource management and allocation. A Nash equilibrium solution can be obtained by a Karush–Kuhn–Tucker (KKT) nonlinear complementarity approach. Illustrative results indicate that the proposed resource-sharing scheme with the geodistributed cloudlets can improve resource utilization and reduce system power consumption. Moreover, with the integration of a software-defined network architecture, a vehicular network can easily reach a globally optimal solution.

Journal ArticleDOI
TL;DR: This research depicts a broad methodical literature analysis of cloud resource provisioning in general and cloud resource identification in specific and highlights the previous research, current status and future directions of resource provisioner provisioning and management in cloud computing.
Abstract: Cloud resource provisioning is a challenging job that may be compromised due to unavailability of the expected resources. Quality of Service (QoS) requirements of workloads derives the provisioning of appropriate resources to cloud workloads. Discovery of best workload---resource pair based on application requirements of cloud users is an optimization problem. Acceptable QoS cannot be provided to the cloud users until provisioning of resources is offered as a crucial ability. QoS parameters-based resource provisioning technique is therefore required for efficient provisioning of resources. This research depicts a broad methodical literature analysis of cloud resource provisioning in general and cloud resource identification in specific. The existing research is categorized generally into various groups in the area of cloud resource provisioning. In this paper, a methodical analysis of resource provisioning in cloud computing is presented, in which resource management, resource provisioning, resource provisioning evolution, different types of resource provisioning mechanisms and their comparisons, benefits and open issues are described. This research work also highlights the previous research, current status and future directions of resource provisioning and management in cloud computing.