Content Addressable Storage Optimization for Desktop Virtualization Based Disaster Backup Storage System

This paper proposes a content addres sable storage optimization method, VDeskCAS, for desktop virtualization storage based disaster backup storage system. The method implements a blocklevel storage optimization, by employing the algorithms of chunking image file into blocks, the blockffmger calculation and the block dedup li cation. A File system in Use Space （FUSE） based storage process for VDeskCAS is also introduced which optimizes current direct storage to suit our content addressable storage. An interface level modification makes our system easy to extend. Experiments on virtual desktop image files and normal files verify the effectiveness of our method and above 60% storage volume decrease is a chieved for Red Hat Enterprise Linux image files. Key words： disaster backup; desktop virtualization; storage optimization; content addressable storage

Lightweight Storage Framework for Blockchain-Enabled Internet of Things Under Cloud Computing

Due to its decentralized,tamper-proof,and trust-free characteristics,blockchain is used in the Internet of Things(IoT)to guarantee the reliability of data.However,some technical flaws in blockchain itself prevent the development of these applications,such as the issue with linearly growing storage capacity of blockchain systems.On the other hand,there is a lack of storage resources for sensor devices in IoT,and numerous sensor devices will generate massive data at ultra-high speed,which makes the storage problem of the IoT enabled by blockchain more prominent.There are various solutions to reduce the storage burden by modifying the blockchain’s storage policy,but most of them do not consider the willingness of peers.In attempt to make the blockchain more compatible with the IoT,this paper proposes a storage optimization scheme that revisits the system data storage problem from amore practically oriented standpoint.Peers will only store transactional data that they are directly involved in.In addition,a transaction verification model is developed to enable peers to undertake transaction verification with the aid of cloud computing,and an incentive mechanism is premised on the storage optimization scheme to assure data integrity.The results of the simulation experiments demonstrate the proposed scheme’s advantage in terms of storage and throughput.

Research on Optimal Configuration of Energy Storage in Wind-Solar Microgrid Considering Real-Time Electricity Price

Capacity allocation and energy management strategies for energy storage are critical to the safety and economical operation of microgrids.In this paper,an improved energymanagement strategy based on real-time electricity price combined with state of charge is proposed to optimize the economic operation of wind and solar microgrids,and the optimal allocation of energy storage capacity is carried out by using this strategy.Firstly,the structure and model of microgrid are analyzed,and the outputmodel of wind power,photovoltaic and energy storage is established.Then,considering the interactive power cost between the microgrid and the main grid and the charge-discharge penalty cost of energy storage,an optimization objective function is established,and an improved energy management strategy is proposed on this basis.Finally,a physicalmodel is built inMATLAB/Simulink for simulation verification,and the energy management strategy is compared and analyzed on sunny and rainy days.The initial configuration cost function of energy storage is added to optimize the allocation of energy storage capacity.The simulation results show that the improved energy management strategy can make the battery charge-discharge response to real-time electricity price and state of charge better than the traditional strategy on sunny or rainy days,reduce the interactive power cost between the microgrid system and the power grid.After analyzing the change of energy storage power with cost,we obtain the best energy storage capacity and energy storage power.

Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System

The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retrieval system（AS/RS）.However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems（MSWS） because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period（SWP） and lift idle period（LIP） during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units（SKUs） is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.

Performance Analysis and Framework Optimization of Open Source Cloud Storage System

More and more embedded devices, such as mobile phones, tablet PCs and laptops, are used in every field, so huge files need to be stored or backed up into cloud storage. Optimizing the performance of cloud storage is very important for Internet development. This paper presents the performance evaluation of the open source distributed storage system, a highly available, distributed, eventually consistent object/blob store from Open Stack cloud computing components. This paper mainly focuses on the mechanism of cloud storage as well as the optimization methods to process different sized files. This work provides two major contributions through comprehensive performance evaluations. First, it provides different configurations for Open Stack Swift system and an analysis of how every component affects the performance. Second, it presents the detailed optimization methods to improve the performance in processing different sized files. The experimental results show that our method improves the performance and the structure. We give the methods to optimize the object-based cloud storage system to deploy the readily available storage system.

Location problem of emergency supplies reserve storages under disease diffusion environment

Under the threat of bio-terrorism,this paper aims at improving the emergency rescue system's ability of dealing with a public health emergency.Focusing on the demand network,this research establishes the emergency rescue supply storage network under a danger diffusion environment.Combined with the infectious disease diffusion model,the traditional set covering model is rebuilt taking the decision optimization of reserve quantity into consideration.Under the premise of a certain emergency service level,the collaborative location optimizing model of an emergency rescue supply storage network is established in order to minimize the sum of the building costs and the preserving costs.The model is proved to be effective through numerical simulation.The collaborative location optimization of the nodes of the emergency rescue supply storage network and the reserve quantity of each storage node is realized.

Study on Optimal Fermentation and Storage Time of Soybean Food （Thua-Nao）in Thailand

The soybean cultivar Tadang Muangpai was used to improve the productive quality of Thua-Nao and reduce the concentration of aflatoxin to less than 20 ppb. It was conducted at CMFCRC, Chiangmai, Thailand between Dec. 2006 and Mar. 2007. Soybean was boiled for 5 hours and then fermented at different time to create natural bacterial species, mainly Bacillus spp. Thua-Nao could be stored up to 90 days after in storage. Nutritional value, food value, and microorganisms content were investigated during fermentation and storage. Also, aflatoxin content of Thua-Nao was recorded during storage. The results showed that 3 days of soybean fermentation gave the best performance of Thua-Nao in term of nutritional value （protein = 47.12%）, food value, and content of Bacillus spp. （2.78 × 10^9 CFU/g）. Without being harmed from aflatoxin, Thua-Nao could be stored not more than 23 days in normal room （Tmax. = 33.9 ℃, Tmin. = 15.8 ℃） and not more than 36 days in climate-controlled room （Tmax. = 20 ℃, Tmin. = 15 ℃）.

Efficiency analysis of numerical integrations for finite element substructure in real-time hybrid simulation

Finite element（FE） is a powerful tool and has been applied by investigators to real-time hybrid simulations（RTHSs）. This study focuses on the computational efficiency, including the computational time and accuracy, of numerical integrations in solving FE numerical substructure in RTHSs. First, sparse matrix storage schemes are adopted to decrease the computational time of FE numerical substructure. In this way, the task execution time（TET） decreases such that the scale of the numerical substructure model increases. Subsequently, several commonly used explicit numerical integration algorithms, including the central difference method（CDM）, the Newmark explicit method, the Chang method and the Gui-λ method, are comprehensively compared to evaluate their computational time in solving FE numerical substructure. CDM is better than the other explicit integration algorithms when the damping matrix is diagonal, while the Gui-λ（λ = 4） method is advantageous when the damping matrix is non-diagonal. Finally, the effect of time delay on the computational accuracy of RTHSs is investigated by simulating structure-foundation systems. Simulation results show that the influences of time delay on the displacement response become obvious with the mass ratio increasing, and delay compensation methods may reduce the relative error of the displacement peak value to less than 5% even under the large time-step and large time delay.

Energy cost minimization through optimization of EV, home and workplace battery storage

Besides grid-to-vehicle(G2 V) and vehicle-to-grid(V2 G) functions, the battery of an electric vehicle(EV) also has the specific feature of mobility. This means that EVs not only have the potential to utilize the storage of cheap electricity for use in high energy price periods, but can also transfer energy from one place to another place. Based on these special features of an EV battery, a new EV energy scheduling method has been developed and is described in this article. The approach is aimed at optimizing the utilization EV energy for EVs that are regularly used in multiple places. The objective is to minimize electricity costs from multiple meter points. This work applies real data in order to analyze the effectiveness of the method. The results show that by applying the control strategy presented in this paper at locations where the EVs are parked, the electricity cost can be reduced without shifting the demand and lowering customer's satisfaction. The effects of PV size and number of EVs on our model are also analyzed in this paper. This model has the potential to be used by energy system designers as a new perspective to determine optimal sizes of generators or storage devices in energy systems.

Optimal Operation of Energy Hub Based Micro-energy Network with Integration of Renewables and Energy Storages

This study proposes an optimized model of a micro-energy network(MEN)that includes electricity and natural gas with integrated solar,wind,and energy storage systems(ESSs).The proposed model is based on energy hubs(EHs)and it aims to minimize operation costs and greenhouse emissions.The research is motivated by the increasing use of renewable energies and ESSs for secure energy supply while reducing operation costs and environment effects.A general algebraic modeling system(GAMS)is used to solve the optimal operation problem in the MEN.The results demonstrate that an optimal MEN formed by multiple EHs can provide appropriate and flexible responses to fluctuations in electricity prices and adjustments between time periods and seasons.It also yields significant reductions in operation costs and emissions.The proposed model can contribute to future research by providing a more efficient network model(as compared with the traditional electricity supply system)to scale down the environmental and economic impacts of electricity storage and supply systems on MEN operation.

ERFC:An Enhanced Recursive Flow Classification Algorithm

Packet classification on multi-fields is a fundamental mechanism in network equipments,and various classification solutions have been proposed.Because of inherent difficulties,many of these solutions scale poorly in either time or space as rule sets grow in size.Recursive Flow Classification（RFC） is an algorithm with a very high classifying speed. However,its preprocessing complexity and memory requirement are rather high.In this paper,we propose an enhanced RFC（ERFC） algorithm,in which a hash-based aggregated bit vector scheme is exploited to speed up its preprocessing procedure.A compressed and cacheable data structure is also introduced to decrease total memory requirement and improve its searching performance.Evaluation results show that ERFC provides a great improvement over RFC in both space requirement and preprocessing time.The search time complexity of ERFC is equivalent to that of RFC in the worst case; and its average classifying speed is improved by about 100%.