With the growing popularity of the Internet of Things (IoT), energy efficiency has been a critical concern during the design and development of IoT service systems. Meanwhile, edge computing has drawn significant attention as a burgeoning computing paradigm. This paper studies the energy efficiency issue of IoT systems by proposing a joint scheme of resource allocation and task scheduling under the edge computing paradigm. Specifically, dynamic processes of the IoT services and system are formulated by generalized queueing network models, based on which quantitative analyses of performance and energy consumption are conducted. The resource management and task scheduling are formulated by Markov Decision Process (MDP), which can balance the tradeoff between energy costs and QoS requirements. To attack the challenge of MDP search space explosion due to the large scale of IoT systems, Ordinal Optimization (OO) techniques are applied to the MDP algorithms, which are able to significantly narrow the search of MDP by slightly softening the optimization objective to a good enough subset. Finally, we conduct simulation experiments based on real-world IoT data. Evaluations and comparisons demonstrate that our approach is effective and efficient in practice.
7 October 2021 in IEEE Transactions on Cognitive Communications and Networking
With the increasing prevalence of online services mounted on IoT devices, edge computing gains significant momentum over conventional cloud-centric architecture. Edge servers are geographically deployed in a distributed manner nearby IoT devices, which not only frees online services from the high hardware requirement but also sharply reduces network latency experienced by IoT users. Recent works have extensively studied the problem of edge resource management and request scheduling to achieve high Quality of Service (QoS) with low latency, but there has been little focus on Quality of Experience (QoE) that an edge resource allocation scheme brings about. In this article, we study the Edge Resource Allocation (ERA) problem across multiple service requests with the objective of overall QoE maximization, which has non-polynomial computational complexity. To attack the $\mathcal {NP}$ -hardness of solving the ERA problem, we adopt a game-theoretic approach to formulate the ERA problem as a potential game ERAGame which admits a Nash Equilibrium (NE). Then, we novelly present a decentralized algorithm namely QoE-DEER to find an NE solution which equivalently maximizes the overall QoE as the ERA problem. Finally, the performance and convergence of our algorithm is evaluated both theoretically and experimentally, which indicates its significant advantages over the state-of-the-art approaches.
10 November 2020 in IEEE Transactions on Network and Service Management
For a cloud service provider, it necessitates an emerging cloud ecosystem to consolidate the existing users and attract more potential users, further gaining its market share. Therefore, in this article, we design a price-incentive resource auction mechanism in cloud environment. In response to the cloud resource price, each user synthesizes her bidding budget and QoS requirement, and purchases cloud resources according to her resource demand in a strategic manner. The cloud service provider, meanwhile, can regulate the resource demands of users through conducting a market-based pricing strategy, against too low prices to cover the operational costs (i.e., energy costs) or too high prices resulting in user churn. In virtue of an elaborate market-based pricing strategy, the interests of users and the cloud service provider are balanced. Our price-incentive resource auction mechanism targets to stimulate maximum users willing to purchase resources and perform their applications at the cloud, on the premise of a minimum profit rate guaranteed for the cloud service provider. It is also able to provide budge balance and truthfulness guarantee, and satisfy the envy-freeness. In order to carry out the above objectives, we carefully design the user utility function reflecting the complicated user interest, and formulate our resource pricing and auction problem as a bin packing problem, which has non-polynomial computational complexity. Regarding the NP-hardness of optimization problem and the concavity of user utility, we present a computational-efficient ( $1+\epsilon $ )-approximate algorithm namely PIRA. Finally, we conduct simulations based on the real-world dataset to validate the effectiveness of our proposed approach.
2 June 2021 in IEEE Transactions on Network and Service Management
With more users outsourcing their applications to the cloud, resource pricing becomes an important issue for IaaS cloud management. Jointly considering her own bidding budget and the price of cloud resources, each user is self-motivated to purchase cloud resources according to her resource demand which maximizes her own utility. Meanwhile, the cloud service provider (CSP) regulates the price of cloud resources with a certain profitability objective achieved. With an elaborate resource pricing strategy, the goals from users and the CSP are balanced and respectively satisfied to some extent. This article provides an insight into the market-oriented cloud pricing strategy. In specific, we propose an auction market in the IaaS cloud, where multiple users with heterogeneous bidding budgets and QoS requirements subscribe cloud resources according to their resource demands. The resource pricing and demand allocation scheme targeting revenue maximization also satisfies essential properties including budget feasibility, incentive compatibility and envy-freeness. To attack the NP-hardness and non-convexity of revenue maximization problem, we design a price-incentive resource auction mechanism namely RARM, which preserves an ( 1+α) approximation ratio on revenue maximization. Finally, we evaluate our RARM mechanism based on the real-world dataset to certify the efficacy of our proposed approach.
With the growing popularity of Internet of Things (IoT) services being applied in several aspects of real-life applications, performance has become an important requirement. Meanwhile, the techniques for reliability enhancement such as virtual machine migration and recovery also have significant impact on end-to-end performance. This paper proposes a predictive approach of reliability-aware performance evaluation for recoverable IoT services using the modeling techniques of generalized stochastic Petri net (GSPN). Mathematical models formulating the dynamics of both server clusters and IoT systems are presented, and quantitative analyses of performance metrics are provided. Empirical experiments based on real-world data obtained from IoT services and cloud systems are conducted, and parameter settings as well as experimental results are discussed in detail.