AMAD:Adaptive Mapping Approach for Datacenter Networks,an Energy-Friend Resource Allocation Framework via Repeated Leader Follower Game

Cloud Datacenter Network(CDN)providers usually have the option to scale their network structures to allow for far more resource capacities,though such scaling options may come with exponential costs that contradict their utility objectives.Yet,besides the cost of the physical assets and network resources,such scaling may also imposemore loads on the electricity power grids to feed the added nodes with the required energy to run and cool,which comes with extra costs too.Thus,those CDNproviders who utilize their resources better can certainly afford their services at lower price-units when compared to others who simply choose the scaling solutions.Resource utilization is a quite challenging process;indeed,clients of CDNs usually tend to exaggerate their true resource requirements when they lease their resources.Service providers are committed to their clients with Service Level Agreements(SLAs).Therefore,any amendment to the resource allocations needs to be approved by the clients first.In this work,we propose deploying a Stackelberg leadership framework to formulate a negotiation game between the cloud service providers and their client tenants.Through this,the providers seek to retrieve those leased unused resources from their clients.Cooperation is not expected from the clients,and they may ask high price units to return their extra resources to the provider’s premises.Hence,to motivate cooperation in such a non-cooperative game,as an extension to theVickery auctions,we developed an incentive-compatible pricingmodel for the returned resources.Moreover,we also proposed building a behavior belief function that shapes the way of negotiation and compensation for each client.Compared to other benchmark models,the assessment results showthat our proposed models provide for timely negotiation schemes,allowing for better resource utilization rates,higher utilities,and grid-friend CDNs.

Energy-Aware Scheduling Scheme Using Workload-Aware Consolidation Technique in Cloud Data Centres

To reduce energy consumption in cloud data centres,in this paper,we propose two algorithms called the Energy-aware Scheduling algorithm using Workload-aware Consolidation Technique(ESWCT) and the Energyaware Live Migration algorithm using Workload-aware Consolidation Technique(ELMWCT).As opposed to traditional energy-aware scheduling algorithms,which often focus on only one-dimensional resource,the two algorithms are based on the fact that multiple resources(such as CPU,memory and network bandwidth)are shared by users concurrently in cloud data centres and heterogeneous workloads have different resource consumption characteristics.Both algorithms investigate the problem of consolidating heterogeneous workloads.They try to execute all Virtual Machines(VMs) with the minimum amount of Physical Machines(PMs),and then power off unused physical servers to reduce power consumption.Simulation results show that both algorithms efficiently utilise the resources in cloud data centres,and the multidimensional resources have good balanced utilizations,which demonstrate their promising energy saving capability.

Energy-Aware Traffic Routing with Named Data Networking

Greening Internet is an important issue now, which studies the way to reduce the increas- ing energy expenditure. Our work focuses on the network infrastructure and considers its energy awareness in traffic routing. We formulate the model by traffic engineering to achieve link rate a- daption, and also predict traffic matrices to pre- serve network stability. However, we realize that there is a tradeoff between network performance and energy efficiency, which is an obvious issue as Internet grows larger and larger. An essential cause is the huge traffic, and thus we try to fred its so- lution from a novel architecture called Named Data Networking （NDN） which tent in edge routers and can flexibly cache con- decrease the backbone traffic. We combine our methods with NDN, and finally improve both the network performance and the energy efficiency. Our work shows that it is effective, necessary and feasible to consider green- ing idea in the design of future Internet.

Energy-Aware Service Selection Method Based on Sharing Routes in Wireless Sensor Networks

This paper presents a novel energy-aware algorithm for service composition based on sharing routes in Wireless Sensor Networks (WSNs). The method integrates the resource of the overlapping WSNs to a virtual resource pool in the execution cycles of the workflow. This approach chooses the suitable service instances according to the current execution environment and user requirements with minimum energy consumption. Finally, the performance of sharing routes service composition selection in WSNs has been evaluated.

Energy-Aware Multi.Replica Routing in Delay Tolerant Mobile Sensor Network

The two-phase replication-based routing has great prospects for Delay Tolerant Mobile Sensor Network (DTMSN) with its advantage of high message delivery ratio, but the blind spraying and the low efficiency forwarding algorithm directly influences the overall network performance. Considering the characteristic of the constrained energy and storage resources of sensors, we propose a novel two-phase multi-replica routing for DTMSN, called Energy-Aware Sociality-Based Spray and Search Routing (ESR), which implements the quota-style message replication mechanism by utilizing the energy and speed information of sensors. In addition, based on the difference of history encounters, a sociality metric is defined to improve the forwarding efficiency in search phase. Simulation experiments show that ESR can reduce the message delay and improve the resource utilization while maximizing the message delivery ratio compared with the exiting popular two-phase routing protocols.

Energy-aware Load-balaning Fault-tolerant Routing Scheme for Ad hoc Sensor Networks

Most routing protocols for sensor networks try to extend network lifetime by minimizing the energy consumption, but have not taken the network reliability into account. An energy-aware, load-balancing and fault-tolerant routing scheme, termed as ELFR was propsed to adapt to the harsh environment. First a network robustness model was presented. Based on this model, the route discovery phase was designed to make the sensors to construct into a hop-leveled network which is mesh structure. A cross-layer design was adopted to measure the transmission delay so as to detect the failed nodes. The routing scheme works with acknowledge (ACK) feedback mechanism to transfer control messages to avoid producing extra control overhead messages. When nodes fail, the new healthy paths will be selected locally without rerouting. Simulation results show that our scheme is much robust, and it achieves better energy efficiency, load balancing and maintains good end-to-end delay.

Energy-Aware Scheduling for Tasks with Target-Time in Blockchain based Data Centres

Cloud computing infrastructures have intended to provide computing services to end-users through the internet in a pay-per-use model.The extensive deployment of the Cloud and continuous increment in the capacity and utilization of data centers(DC)leads to massive power consumption.This intensifying scale of DCs has made energy consumption a critical concern.This paper emphasizes the task scheduling algorithm by formulating the system model to minimize the makespan and energy consumption incurred in a data center.Also,an energy-aware task scheduling in the Blockchain-based data center was proposed to offer an optimal solution that minimizes makespan and energy consumption.The estab-lished model was analyzed with a target-time responsive precedence scheduling algorithm.The observations were analyzed and compared with the traditional scheduling algorithms.The outcomes exhibited that the developed solution incurs better performance with a response to resource utilization and decreasing energy consumption.The investigation revealed that the applied strategy considerably enhanced the effectiveness of the designed schedule.

An Energy-aware Hierarchical Architecture Design Scheme

Compared with the flat architecture in the design of sensor networks, the hierarchical architecture gains much attractive for the reason of scalability, management and energy efficiency. In order to distribute the energy evenly, nodes act the cluster head in some orders. The existing approaches don’t pay a critical attention to the overhead during the role rotations. And the duration of a round is a priori, which is very application-specific. An energy-aware hierarchical architecture design scheme is put forward in this paper, namely, Adaptive Minimum Rotational Cost (AMRC) cluster formation scheme. The decision of beginning a new round is made adaptively by the cluster head itself. It combines the dynamic and static advantages in the clustering architecture. The simulation results demonstrate AMRC outperforms some other clustering protocols in many aspects.

An Energy-Aware Clustering Approach for Wireless Sensor Networks

Energy conservation is an essential and critical requirement for a wireless sensor network with battery oper-ated nodes intended for long term operations. Prior work has described different approaches to routing protocol designs that achieve energy efficiency in a wireless sensor network. Several of these works involve variations of mote-to-mote routing (flat routing) while some make use of leader nodes in clusters to perform routing (hierarchical routing). A key question then arises as to how the performance of an energy-aware, flat routing protocol compare with that of one based on hierarchical routing. This paper demonstrates a hierarchical routing protocol design that can conserve significant energy in its setup phase as well as during its steady state data dissemination phase. This paper describes the design of this protocol and evaluates its performance against existing energy-aware flat routing protocols. Simulation results show that it exhibits competitive performance against the flat routing protocols.

Two-Stage Adaptive Memetic Algorithm with Surprisingly Popular Mechanism for Energy-Aware Distributed Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time

This paper considers the impact of setup time in production scheduling and proposes energy-aware distributed hybrid flow shop scheduling problem with sequence-dependent setup time(EADHFSP-ST)that simultaneously optimizes the makespan and the energy consumption.We develop a mixed integer linear programming model to describe this problem and present a two-stage adaptive memetic algorithm(TAMA)with a surprisingly popular mechanism.First,a hybrid initialization strategy is designed based on the two optimization objectives to ensure the convergence and diversity of solutions.Second,multiple population co-evolutionary approaches are proposed for global search to escape from traditional cross-randomization and to balance exploration and exploitation.Third,considering that the memetic algorithm(MA)framework is less efficient due to the randomness in the selection of local search operators,TAMA is proposed to balance the local and global searches.The first stage accumulates more experience for updating the surprisingly popular algorithm(SPA)model to guide the second stage operator selection and ensures population convergence.The second stage gets rid of local optimization and designs an elite archive to ensure population diversity.Fourth,five problem-specific operators are designed,and non-critical path deceleration and right-shift strategies are designed for energy efficiency.Finally,to evaluate the performance of the proposed algorithm,multiple experiments are performed on a benchmark with 45 instances.The experimental results show that the proposed TAMA can solve the problem effectively.

Joint Power Allocation and Mode Selection for D2D Communications with Imperfect CSI

Device-to-device(D2D) communications can be underlaid with a cellular infrastructure to increase resource utilization, improve user throughput and save battery energy. In such networks, power allocation and mode selection are crucial problems. To address the joint optimization of power and mode selection under imperfect CSI, we propose an optimal, energy-aware joint power allocation and mode selection(JPAMS) scheme. First, we derive the closed-form solution for the power minimization for both D2 D and cellular links while satisfying different quality of service(Qo S) constraints. Second, we address the mode selection problem in presence of imperfect CSI, based on the derived power allocation. Moreover, the theoretical analysis and simulation results are presented to evaluate the proposed scheme for the D2 D communications.

EA-DFPSO:An intelligent energy-efficient scheduling algorithm for mobile edge networks

Cloud data centers have become overwhelmed with data-intensive applications due to the limited computational capabilities of mobile terminals.Mobile edge computing is emerging as a potential paradigm to host application execution at the edge of networks to reduce transmission delays.Compute nodes are usually distributed in edge environments,enabling crucially efficient task scheduling among those nodes to achieve reduced processing time.Moreover,it is imperative to conserve edge server energy,enhancing their lifetimes.To this end,this paper proposes a novel task scheduling algorithm named Energy-aware Double-fitness Particle Swarm Optimization(EA-DFPSO)that is based on an improved particle swarm optimization algorithm for achieving energy efficiency in an edge computing environment along with minimal task execution time.The proposed EA-DFPSO algorithm applies a dual fitness function to search for an optimal tasks-scheduling scheme for saving edge server energy while maintaining service quality for tasks.Extensive experimentation demonstrates that our proposed EA-DFPSO algorithm outperforms the existing traditional scheduling algorithms to achieve reduced task completion time and conserve energy in an edge computing environment.

An Efficient Priority Based Routing Technique That Maximizes the Lifetime and Coverage of Wireless Sensor Networks

Recent development in sensor technologies makes wireless sensor networks (WSN) very popular in the last few years. A limitation of most popular sensors is that sensor nodes have a limited battery capacity that leads to lower the lifetime of WSN. For that, it raises the need to develop energy efficient solutions to keep WSN functioning for the longest period of time. Due to the fact that most of the nodes energy is spent on data transmission, many routing techniques in the literature have been proposed to expand the network lifetime such as the Online Maximum Lifetime heuristics (OML) and capacity maximization (CMAX). In this paper, we introduce an efficient priority based routing power management heuristic in order to increase both coverage and extend lifetime by managing the power at the sensor level. We accomplished that by setting priority metric in addition to dividing the node energy into two ratios;one for the sensor node originated data and the other part is for data relays from other sensors. This heuristic, which is called pERPMT (priority Efficient Routing Power Management Technique), has been applied to two well know routing techniques. Results from running extensive simulation runs revealed the superiority of the new methodology pERPMT over existing heuristics. The pEPRMT increases the lifetime up to 77% and 54% when compared to OML and CMAX respectively.

Decomposition-Based Multi-Objective Optimization for Energy-Aware Distributed Hybrid Flow Shop Scheduling with Multiprocessor Tasks

This paper addresses the Energy-Aware Distributed Hybrid Flow Shop Scheduling Problem with Multiprocessor Tasks(EADHFSPMT)by considering two objectives simultaneously,i.e.,makespan and total energy consumption.It consists of three sub-problems,i.e.,job assignment between factories,job sequence in each factory,and machine allocation for each job.We present a mixed inter linear programming model and propose a Novel MultiObjective Evolutionary Algorithm based on Decomposition(NMOEA/D).We specially design a decoding scheme according to the characteristics of the EADHFSPMT.To initialize a population with certain diversity,four different rules are utilized.Moreover,a cooperative search is designed to produce new solutions based on different types of relationship between any solution and its neighbors.To enhance the quality of solutions,two local intensification operators are implemented according to the problem characteristics.In addition,a dynamic adjustment strategy for weight vectors is designed to balance the diversity and convergence,which can adaptively modify weight vectors according to the distribution of the non-dominated front.Extensive computational experiments are carried out by using a number of benchmark instances,which demonstrate the effectiveness of the above special designs.The statistical comparisons to the existing algorithms also verify the superior performances of the NMOEA/D.

HAG： An Energy-Proportional Data Storage Scheme for Disk Array Systems

Energy consumption has been a critical issue for data storage systems, especially for modern data centers. A recent survey has showed that power costs amount to about 50%of the total cost of ownership in a typical data center, with about 27% of the system power being consumed by storage systems. This paper aims at providing an effective solution to reducing the energy consumed by disk storage systems, by proposing a new approach to reduce the energy consumption. Differing from previous approaches, we adopt two new designs. 1） We introduce a hotness-aware and group-based system model （HAG） to organize the disks, in which all disks are partitioned into a hot group and a cold group. We only make file migration between the two groups and avoid the migration within a single group, so that we are able to reduce the total cost of file migration. 2） We use an on-demand approach to reorganize files among the disks that is based on workload change as well as the change of data hotness. We conduct trace-driven experiments involving two real and nine synthetic traces and we make detailed comparisons between our method and competitor methods according to different metrics. The results show that our method can dynamically select hot files and disks when the workload changes and that it is able to reduce energy consumption for all the traces. Furthermore, its time performance is comparable to that of the compared algorithms. In general, our method exhibits the best energy e？ciency in all experiments, and it is capable of maintaining an improved trade-off between performance and energy consumption.

Key technologies of system on chip design

The most supreme characteristic of SoC （system on chip） era is the high complexity of the chips; architecture and software design have become the indivisible part of chip design. As semiconductor fabrication technology evolves into very deep sub-micron （DSM） level, power consumption has become the inevitable challenge in SoC design. In order to maximize the lifetime of portable system battery, SoC is required not only to be energy-efficient but also to work in an optimal and battery-aware manner. This paper intends to discuss some key technologies of SoC design from the above perspectives of view.

Toward the Optimal Configuration of Dynamic Voltage Scaling Points in Real-Time Applications

In real-time applications, compiler-directed dynamic voltage scaling （DVS） could reduce energy consumption efficiently, where compiler put voltage scaling points in the proper places, and the supply voltage and clock frequency were adjusted to the relationship between the reduced time and the reduced workload. This paper presents the optimal configuration of dynamic voltage scaling points without voltage scaling overhead, which minimizes energy consumption. The conclusion is proved theoretically. Finally, it is confirmed by simulations with equally-spaced voltage scaling configuration.

Minimization of total energy consumption in an m-machine flow shop with an exponential time-dependent learning effect

This study investigates an energy-aware flow shop scheduling problem with a time-dependent learning effect. The relationship between the traditional and the proposed scheduling problem is shown and objective is to determine a job sequence in which the total energy consumption is minimized. To provide an efficient solution framework, composite lower bounds are proposed to be used in a solution approach with the name of Boundsbased Nested Partition(BBNP). A worst-case analysis on shortest process time heuristic is conducted for theoretical measurement. Computational experiments are performed on randomly generated test instances to evaluate the proposed algorithms. Results show that BBNP has better performance than conventional heuristics and provides considerable computational advantage.