云环境下基于组合双向拍卖的动态资源定价

云环境下的市场交易机制缺乏灵活性,且在某些情况下定价不合理。为此,提出一种基于组合双向拍卖的动态资源定价模型,给出云资源分配与定价算法,用户通过响应时间出价,资源提供商根据负载情况要价。仿真实验结果表明,该算法与固定比例的定价算法相比,能提高18%的用户利益与9%的资源提供商利益。     

基于随机游走算法的频谱组合拍卖机制

如何将频谱有效地分配给用户并提高提供商的收益是目前研究的热点。针对频谱组合拍卖中提供商收益低的问题，结合用户估值分布不对称的特点，设计了基于随机游走的频谱组合拍卖（RWSCA）机制，以最大化频谱提供商的收益。首先引入了虚拟估值的思想，用随机游走算法在参数空间搜索一组最优参数，并根据参数线性映射买家的估值；然后运行基于虚拟估值的VCG (Vickrey-Clarke-Groves)机制，从而确定赢得拍卖的用户并计算相应的支付金额。理论分析证明了所提机制具有激励相容和个体理性的性质。在频谱组合拍卖仿真实验中，相较于VCG机制，RWSCA机制至少提高16.84%以上提供商收益。     

云环境下基于神经网络和群搜索优化的资源分配机制

在云环境下,各种闲置资源可以通过池化形成资源池,进而利用虚拟化技术将资源池中的不同资源组合以服务的形式提供给用户使用,因此需要合理而有效的机制来分配资源.针对云环境下资源的特点,将经济学和智能方法相结合,提出了一种基于双向组合拍卖的智能资源分配机制.在该机制中,提出了基于体验质量（quality ofexperience,简称QoE）的威望系统,引入威望衰减系数和用户信誉度,降低拍卖中恶意行为造成的影响,为资源交易提供QoE 支持.对拍卖中的竞价决策,综合考虑多种因素,提出了基于BP 神经网络的竞标价格决策机制,不仅可以合理确定竞标价,而且使价格可以动态适应市场变化.最后,由于组合拍卖胜标确定问题是NP 完全的,因此引入群搜索优化算法,以市场盈余和总体威望为优化目标,得到资源分配方案.仿真研究结果表明,该机制是可行和有效的.     

基于多任务拍卖的资源调度算法

资源调度是计算网格资源管理系统的主要内容之一。文中借鉴市场模型中的拍卖机制，通过用户代理、资源代理、拍卖师和资源的交互作用，设计并实现了一个基于多任务拍卖的网格资源调度原型系统，系统使用多拍卖师结构，提高了作业的吞吐率并且可以有效地防止拍卖过程中双方的欺骗行为，改进了网格资源的调度性能。同时，与传统算法相比，该算法能够有效地配置资源和满足用户的服务质量需求。     

基于Kriging代理模型的动态云任务调度方法

任务调度在云计算环境中发挥着重要作用。提出一种基于Kriging代理模型的动态云任务调度方法。通过对云任务在不同资源组合下的性能表现进行Kriging代理模型建模并优化,从而得到对应于该云任务的最优资源分配方案;利用云平台的API,可动态对该云任务实施资源调度。基于OpenStack开源云平台,对两个工程计算应用进行了任务调度性能测试,结果表明该方法可有效动态调整云任务中的资源配给,按需按优对平台中的云任务进行资源调度。     

基于动态性有效资源分配的云计算效益学习模型研究

为了将有限的资源合理地分配给用户,并尽可能地提高云系统的资源和能量利用效率,提出了一种改进的面向动态性有效资源分配的云计算效益学习模型算法,在动态性有效资源分配上提出了服务质量准则框架(QSSF)来得出云服务的计费管理机制;采用资源竞拍策略和动态双向博弈策略更好地权衡用户和云计算提供商之间的利益关系,并将资源分配给资源需求量大的用户;在云系统的运算和存储任务的资源和能量分配上,采用了基于云计算的效益学习模型,通过权衡任务对资源和能量的需求量来实现系统效益的最优化;实验仿真结果表明,该算法能够更加合理地为系统的运算和存储任务分配资源和能量,在资源和能量的利用率上优于其他对比算法.     

基于多任务拍卖的资源调度算法

资源调度是计算网格资源管理系统的主要内容之一。文中借鉴市场模型中的拍卖机制,通过用户代理、资源代理、拍卖师和资源的交互作用,设计并实现了一个基于多任务拍卖的网格资源调度原型系统,系统使用多拍卖师结构,提高了作业的吞吐率并且可以有效地防止拍卖过程中双方的欺骗行为,改进了网格资源的调度性能。同时,与传统算法相比,该算法能够有效地配置资源和满足用户的服务质量需求。     

基于SLA和双向拍卖机制的云计算服务资源分配

针对云计算环境下现有的服务资源分配方法在采用SLA约束时未能考虑到市场因素的问题,设计了一种基于SLA约束并采用双向拍卖机制来实现服务提供商利润最大化的服务资源分配方法;首先,定义了云计算环境下基于SLA的双向拍卖服务资源分配模型,然后设计了服务提供商与用户签约的SLA并实现了到其资源提供商的映射,为了保证资源提供商提供真实可靠的信息,设计了分配函数和支付函数对其进行激励约束;最后,定义了采用SLA和双向拍卖机制对云计算资源进行分配的具体算法;仿真实验表明,文中方法的任务执行成功率最高,平均约为78.2%,在具有较少的SLA违约率的同时服务提供商能获取较多的利润,同时较其它方法具有较高的任务成功率,具有很强的可行性。     

基于生产函数的效用优化云计算资源调度算法

针对云数据中心资源利用率低,云服务提供商收益低等问题,提出一种基于生产函数的云服务提供商收益最大化同时兼顾用户满意度的资源调度算法;该算法将资源调度分两阶段处理,首先合理规划云服务器所有资源,最优化配置资源,然后结合用户请求,云服务代理从资源池选择配置好的资源并分配资源给用户,通过两阶段的算法实现,解决了云数据中心资源利用率低,云服务提供商收益低等问题;最后通过与基于博弈的效用优化算法比较,仿真结果表明,该调度算法具有更好的性能。     

云存储中基于代理重加密的CP-ABE访问控制方案

针对云存储中基于密文策略的属性加密（CP-ABE）访问控制方案存在用户解密开销较大的问题,提出了一种基于代理重加密的CP-ABE （CP-ABE-BPRE）方案,并对密钥的生成方法进行了改进。此方案包含五个组成部分,分别是可信任密钥授权、数据属主、云服务提供商、代理解密服务器和数据访问者,其中云服务器对数据进行重加密,代理解密服务器完成大部分的解密计算。方案能够有效地降低用户的解密开销,在保证数据细粒度访问控制的同时还支持用户属性的直接撤销,并解决了传统CP-ABE方案中因用户私钥被非法盗取带来的数据泄露问题。与其他CP-ABE方案比较,此方案对访问云数据的用户在解密性能方面具有较好的优势。     

A distributed multiple dimensional QoS constrained resource scheduling optimization policy in computational grid

This paper is to solve efficient QoS based resource scheduling in computational grid. It defines a set of QoS dimensions with utility function for each dimensions, uses a market model for distributed optimization to maximize the global utility. The user specifies its requirement by a utility function. A utility function can be specified for each QoS dimension. In the grid, grid task agent acted as consumer pay for the grid resource and resource providers get profits from task agents. The task agent' utility can then be defined as a weighted sum of single-dimensional QoS utility function. QoS based grid resource scheduling optimization is decomposed to two subproblems: joint optimization of resource user and resource provider in grid market. An iterative multiple QoS scheduling algorithm that is used to perform optimal multiple QoS based resource scheduling. The grid users propose payment for the resource providers, while the resource providers set a price for each resource. The experiments show that optimal QoS based resource scheduling involves less overhead and leads to more efficient resource allocation than no optimal resource allocation.     

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.     

云计算中多QoS调度机制研究

云计算的作为分布式系统中的一种新的服务配置模式,鼓励研究人员在科学应用时探讨其利弊.云资源的动态变化给资源管理带来了很大的困难.在云计算环境中的调度工作中使用一个分割负载理论（DLT）设计有效的策略来最小化总的处理时间,处理器是负载均衡的,推导出一个封闭形式的解决方案将负载分段分配给每个处理器.以这种方式进行工作调度使得云提供商可以获得最大的服务效益并满足客户的服务质量（QoS）需求.最后,通过严格的仿真研究量化该策略的性能.     

Resource scheduling with conflicting objectives in grid environments: Model and evaluation

The paper is to consider resource scheduling with conflicting objectives in the grid environment. The objectives of the grid users, the grid resources and the grid system clash with each other. Grid users want to access enough system resources to achieve the desired level of quality of service (QoS). Resource providers pay more attention to the performance of their resources. Our resource scheduling employs market strategies to determine which jobs are executed at what time on which resources and at what prices. A grid resource provider uses its utility function to maximize its profit and a grid user uses its utility function to complete tasks while minimizing its spending. The paper proposes grid system objective optimization scheduling that provides a joint optimization of objectives for both the resource provider and grid user, which combines the benefits of both resource provider objective optimization and user objective optimization. Experiments are designed to study the performances of three resource-scheduling optimization algorithms. Performance metrics are classified into efficiency metrics, utility metrics and time metrics.     

Resource scheduling approach for multimedia cloud content management

With the development of multimedia application and services, the multimedia technology has already permeated each aspect of our life. Multimedia cloud is used for processing multimedia services. However due to huge data volume, high concurrency, strict real-time, resource scheduling for content dissemination in multimedia cloud still remain challenges. In order to increase the user satisfaction and decrease completion time of content dissemination, the resource scheduling for content dissemination in multimedia cloud is proposed in this paper. The multimedia jobs are clustered according to user expectation and job complexity. The job with highest priority will be executed first. Moreover, considered multimedia task types and the impact of stragglers, the multimedia task scheduling based on task types and node workload is presented, which is a time-efficient scheduling approach. The experiments are conducted and the experiment results show that the job clustering algorithm-based user expectation and job complexity in multimedia cloud has better user satisfaction and shorter completion time, while the multimedia task scheduling based on task types and node workload can reduce completion time and achieve load-balancing.     

多智能体车间调度系统研究

现在制造业所面临的动态需求使得其必须具有更加灵活的应变机制，这使得车间调度问题变得越来越复杂。本文采取多智能体系统技术（MAS）设计了一个包含四个智能体（agent）的多智能体车间调度系统，分别为车间调度智能体、任务分配智能体、车间资源智能体以及拍卖智能体。通过这四个智能体的通信、交互和合作，系统可以给出一个满足当前制造需求的调度最优结果。     

面向边缘计算的组合拍卖式任务卸载机制

在万物互联的时代,数据量与计算需求飞速增长,促使应用部署方式由云计算模式向边缘计算模式演进,以解决带宽消耗严重和响应时延过高等问题。为推进面向边缘网络的任务卸载,需要解决应用服务提供商(ASP)与边缘计算提供商(ECP)之间的双向选择问题。针对这一问题,提出一种面向边缘计算的组合拍卖式任务卸载机制。首先建立系统模型,并对模型落地的关键问题进行说明,然后分析ECP的投标决策过程,证明选择最大化资源利用率的任务组合是NP完全问题,进而提出一种启发式任务选择算法。在此基础上,设计两种拍卖算法,单胜者拍卖和多胜者拍卖,分别适用于可信度优先和效率优先的场景。实验结果表明,相较于单项拍卖机制,所提出的方案提高ECP资源利用率达13%,同时增加ASP收益达37%。     

Oppositional Red Fox Optimization Based Task Scheduling Scheme for Cloud Environment

Owing to massive technological developments in Internet of Things (IoT) and cloud environment, cloud computing (CC) offers a highly flexible heterogeneous resource pool over the network, and clients could exploit various resources on demand. Since IoT-enabled models are restricted to resources and require crisp response, minimum latency, and maximum bandwidth, which are outside the capabilities. CC was handled as a resource-rich solution to aforementioned challenge. As high delay reduces the performance of the IoT enabled cloud platform, efficient utilization of task scheduling (TS) reduces the energy usage of the cloud infrastructure and increases the income of service provider via minimizing processing time of user job. Therefore, this article concentration on the design of an oppositional red fox optimization based task scheduling scheme (ORFO-TSS) for IoT enabled cloud environment. The presented ORFO-TSS model resolves the problem of allocating resources from the IoT based cloud platform. It achieves the makespan by performing optimum TS procedures with various aspects of incoming task. The designing of ORFO-TSS method includes the idea of oppositional based learning (OBL) as to traditional RFO approach in enhancing their efficiency. A wide-ranging experimental analysis was applied on the CloudSim platform. The experimental outcome highlighted the efficacy of the ORFO-TSS technique over existing approaches.     

基于改进量子遗传算法的云计算资源调度

针对云计算环境下资源的高效调度问题,当前研究较少关注云服务提供商的服务成本,为此,以云服务提供商降低最小服务成本为目的,提出了改进量子遗传算法的云资源调度算法。由于采用二进制量子位表示的染色体无法描述资源调度矩阵,该算法将量子位的二进制编码转换为实数编码,并使用旋转策略和变异算子保证算法的收敛性。通过仿真实验平台将此算法与遗传算法和粒子群算法进行比较分析,在种群迭代次数为100的情况下,分别取种群数为1和10,实验结果表明该算法能取得更小的最小服务成本。