Towards a trust evaluation middleware for cloud service selection

With the advent of cloud computing, employing various cloud services to build highly reliable cloud applications has become increasingly popular. The trustworthiness of cloud services is a critical issue that hinders the development of cloud applications, and thus is an urgently-required research problem. Previous studies evaluate trustworthiness of services via either QoS monitoring mechanisms or user feedback ratings, while seldom they combine both of them for enhancing service trust evaluation. This paper proposes a trustworthy selection framework for cloud service selection, named TRUSS. Aiming at developing an effective trust evaluation middleware for TRUSS, we propose an integrated trust evaluation method via combining objective trust assessment and subjective trust assessment. The objective trust assessment is based on QoS monitoring, while the subjective trust assessment is based on user feedback ratings. Experiments conducted using a synthesized dataset show that our proposed method significantly outperforms the other trust and reputation methods.     

基于云计算的图书馆云服务模型研究

通过借鉴OCLC在云计算图书馆的设计思路以及基于云计算整合图书馆资源与日常服务的办法,提出了在云计算图书馆云服务的构建思路及其模型。     

Packet aggregation based network I/O virtualization for cloud computing

Virtualization is a key technology to enable cloud computing. Driver domain based model for network virtualization offers isolation and high levels of flexibility. However, it suffers from poor performance and lacks scalability. In this paper, we evaluate networking performance of virtual machines within Xen. The I/O channel transferring packets between the driver domain and the virtual machines is shown to be the bottleneck. To overcome this limitation, we proposed a packet aggregation based mechanism to transfer packets from the driver domain to the virtual machines. Packet aggregation, combined with an efficient core allocation, allows virtual machines throughput to scale up by 700%, while minimizing both memory and CPU consumption. Besides, aggregation impact on packets delay and jitter remains acceptable. Hence, the proposed I/O virtualization model satisfies infrastructure providers to offer Cloud computing services.     

智能电网中虚拟化云计算的应用和安全技术分析

智能电网符合当前需求,意义重大。首先简单介绍了云计算和智能电网,并对云计算在智能电网中的应用做了阐述,然后主要对云计算的安全技术进行了分析。     

云计算资源调度算法仿真

针对云计算的资源调度问题,有效利用云网络结构,是分布式结构与网格技术中的主要问题.大量资源调度算法使用任务结构对云计算环境下的负载进行分配,但较少考虑网络节点的动态信任度问题使得云计算资源存在一定的安全隐患.首先基于云计算任务串并联结构对网络动态资源进行分配,然后使用粒子群算法并结合节点置信度指标进行改进.通过仿真进行验证,证明了改进方法在增加节点信任度指标后提高了云计算资源的利用率,降低了网络资源负载.     

Policy based resource allocation in IaaS cloud

In present scenario, most of the Infrastructure as a Service (IaaS) clouds use simple resource allocation policies like immediate and best effort. Immediate allocation policy allocates the resources if available, otherwise the request is rejected. Best-effort policy also allocates the requested resources if available otherwise the request is placed in a FIFO queue. It is not possible for a cloud provider to satisfy all the requests due to finite resources at a time. Haizea is a resource lease manager that tries to address these issues by introducing complex resource allocation policies. Haizea uses resource leases as resource allocation abstraction and implements these leases by allocating Virtual Machines (VMs). Haizea supports four kinds of resource allocation policies: immediate, best effort, advanced reservation and deadline sensitive. This work provides a better way to support deadline sensitive leases in Haizea while minimizing the total number of leases rejected by it. Proposed dynamic planning based scheduling algorithm is implemented in Haizea that can admit new leases and prepare the schedule whenever a new lease can be accommodated. Experiments results show that it maximizes resource utilization and acceptance of leases compared to the existing algorithm of Haizea.     

基于云模式的媒体取证服务体系研究

根据现有媒体取证系统所面临的问题,结合云计算的思想,提出了基于云模式的媒体取证服务体系。针对大规模媒体取证服务所面临的异构性、可扩展性和效率问题等几大挑战,利用层次结构模型方法,创造性地提出了三层媒体取证服务体系架构模型,详细阐述了该模型所步及的关键技术,即资源虚拟化、系统任务并行化和自适应能力,最后给出了应用实例及分析。     

CyberGuarder: A virtualization security assurance architecture for green cloud computing

As the sizes of IT infrastructure continue to grow, cloud computing is a natural extension of virtualisation technologies that enable scalable management of virtual machines over a plethora of physically connected systems. The so-called virtualisation-based cloud computing paradigm offers a practical approach to green IT/clouds, which emphasise the construction and deployment of scalable, energy-efficient network software applications (NetApp) by virtue of improved utilisation of the underlying resources. The latter is typically achieved through increased sharing of hardware and data in a multi-tenant cloud architecture/environment and, as such, accentuates the critical requirement for enhanced security services as an integrated component of the virtual infrastructure management strategy. This paper analyses the key security challenges faced by contemporary green cloud computing environments, and proposes a virtualisation security assurance architecture, CyberGuarder, which is designed to address several key security problems within the ‘green’ cloud computing context. In particular, CyberGuarder provides three different kinds of services; namely, a virtual machine security service, a virtual network security service and a policy based trust management service. Specifically, the proposed virtual machine security service incorporates a number of new techniques which include (1) a VMM-based integrity measurement approach for NetApp trusted loading, (2) a multi-granularity NetApp isolation mechanism to enable OS user isolation, and (3) a dynamic approach to virtual machine and network isolation for multiple NetApp’s based on energy-efficiency and security requirements. Secondly, a virtual network security service has been developed successfully to provide an adaptive virtual security appliance deployment in a NetApp execution environment, whereby traditional security services such as IDS and firewalls can be encapsulated as VM images and deployed over a virtual security network in accordance with the practical configuration of the virtualised infrastructure. Thirdly, a security service providing policy based trust management is proposed to facilitate access control to the resources pool and a trust federation mechanism to support/optimise task privacy and cost requirements across multiple resource pools. Preliminary studies of these services have been carried out on our iVIC platform, with promising results. As part of our ongoing research in large-scale, energy-efficient/green cloud computing, we are currently developing a virtual laboratory for our campus courses using the virtualisation infrastructure of iVIC, which incorporates the important results and experience of CyberGuarder in a practical context.     

Resource failures risk assessment modelling in distributed environments

Service providers offer access to resources and services in distributed environments such as Grids and Clouds through formal Service level Agreements (SLA), and need well-balanced infrastructures so that they can maximise the Quality of Service (QoS) they offer and minimise the number of SLA violations. We propose a mathematical model to predict the risk of failure of resources in such environments using a discrete-time analytical model driven by reliability functions fitted to observed data. The model relies on the resource historical data so as to predict the risk of failure for a given time interval. The model is evaluated by comparing the predicted risk of failure with the observed risk of failure, and is shown to accurately predict the resources risk of failure, allowing a service provider to selectively choose which SLA request to accept.     

基于改进粒子群算法的云计算任务调度算法

如何对任务进行高效合理的调度是云计算需要解决的关键问题之一,针对云计算的编程模型框架,在传统粒子群优化算法（PSO）的基础上,提出了一种具有双适应度的粒子群算法（DFPSO）。通过该算法不但能找到任务总完成时间较短的调度结果,而且此调度结果的任务平均完成时间也较短。仿真分析结果表明,在相同的条件设置下,该算法优于传统的粒子群优化算法,当任务数量增多时,其综合调度性能优点明显。     

Empirical prediction models for adaptive resource provisioning in the cloud

Cloud computing allows dynamic resource scaling for enterprise online transaction systems, one of the key characteristics that differentiates the cloud from the traditional computing paradigm. However, initializing a new virtual instance in a cloud is not instantaneous; cloud hosting platforms introduce several minutes delay in the hardware resource allocation. In this paper, we develop prediction-based resource measurement and provisioning strategies using Neural Network and Linear Regression to satisfy upcoming resource demands.Experimental results demonstrate that the proposed technique offers more adaptive resource management for applications hosted in the cloud environment, an important mechanism to achieve on-demand resource allocation in the cloud.     

基于排队论的服务资源可用性相关研究综述

排队论在很多领域中解决了复杂的排队问题,文中首先对排队论的一般模型表示和常见模型进行了介绍.然后,简要对排队论解决的各类问题进行了归纳总结,重点对近年来有关排队论的服务资源可用性预测文献进行了综述,对排队模型在日常生活、云计算以及网络资源等场景中的应用进行总结.通过对文献进行综述找到服务与用户需求之间的关系,并对预测服...     

基于云计算的军事物流平台设计

通过研究云计算的理论技术,结合军事物流的发展现状,设计了基于云计算的军事物流平台的总体架构,提出了平台的技术架构和功能架构,并对平台提供的具体服务分别进行了阐述。最后对云计算技术在军事物流体系中的实际应用提出了展望。     

Uncertainty in cloud service relationships: Uncovering the differential effect of three social influence processes on potential and current users

Consumer cloud services are characterized by uncertainty before usage but also for individuals who are already using the service. Our cloud service relationship model posits that individuals facing continuous uncertainty during adoption and continuance decisions rely on their social environment to make evaluations and decisions. Drawing on a representative dataset of 2011 Internet users, we distinguish three social influence processes from social influence theory (identification, internalization, and compliance) and uncover their differential effect on potential and current users’ uncertainty evaluations and on usage intentions. Our results can help cloud providers to successfully manage their relationships with potential and current users.     

Impact of user patience on auto-scaling resource capacity for cloud services

An important feature of most cloud computing solutions is auto-scaling, an operation that enables dynamic changes on resource capacity. Auto-scaling algorithms generally take into account aspects such as system load and response time to determine when and by how much a resource pool capacity should be extended or shrunk. In this article, we propose a scheduling algorithm and auto-scaling triggering strategies that explore user patience, a metric that estimates the perception end-users have from the Quality of Service (QoS) delivered by a service provider based on the ratio between expected and actual response times for each request. The proposed strategies help reduce costs with resource allocation while maintaining perceived QoS at adequate levels. Results show reductions on resource-hour consumption by up to approximately 9% compared to traditional approaches.     

Towards efficient and fair resource trading in community-based cloud computing

In this paper, we investigate the resource trading problem in a community-based cloud computing setting where multiple tenants communicate in a peer-to-peer (P2P) fashion. Enabling resource trading in a community cloud unleashes the untapped cloud resources, thus presents a flexible solution for managing resource allocation. However, finding an efficient and fair resource allocation is challenging mainly due to the heterogeneity of tenants. Our work first develops a market-oriented model to support resource negotiation and trading. Based on this model, we adopt a multiagent-based technique that allows a group of autonomous tenants to reach an efficient and fair resource allocation. Further, when budget constraint presents, we propose a directed hypergraph model to facilitate resource trading amongst heterogeneous tenants. We analyze the application of the directed hypergraph model to trading decision making, and design a series of heuristic-based resource trading protocols for both budget-unaware and budget-aware scenarios. The performances of the proposed protocols are validated through simulations. The results are in tune with the theoretical analysis and provide insights into practical application issues.     

Integrated core selection and mapping for mesh based Network-on-Chip design with irregular core sizes

Network-on-Chip (NoC) has been proposed to replace traditional bus based System-on-Chip (SoC) architecture to address the global communication challenges in nanoscale technologies. A major challenge in NoC based system design is to select Intellectual Property (IP) cores for implementing tasks and associate the selected cores to the routers to optimize cost and performance. These are commonly known as the process of core selection and application mapping respectively. In this paper, integrated core selection and mapping problem has been addressed. Mesh architecture has been considered for experimentation. The integrated core selection and mapping problem takes as input the application task graph, topology graph and a core library. It outputs the selected cores for the tasks and their mapping onto the topology graph, such that, all communication requirements of the application are satisfied. The cores present in a core library may perform more than one task and have non-uniform sizes. For this, a technique based on Particle Swarm Optimization (PSO) has been proposed to select cores from the given core library and map the resultant core graph onto mesh based architectures. An efficient heuristic for mapping has also been proposed, which maps the selected cores onto mesh based architectures, considering non-uniform core sizes. Comparisons have been carried out with step-by-step core selection and mapping approach and also with mapping algorithms that exist in the literature. Significant reductions have been observed in terms of communication cost over all the cases. Area comparisons have also been made. On average, improvement of 13.05% in communication cost and 2.07% in area have been observed. The proposed approach has also been compared in dynamic environment and significant reductions in the average network latency could be observed. On average, improvement of 5.48% in average network latency and 15.68% in network throughput has been observed. Comparison of energy consumption has also been done in both the cases.