基于鞍点法的自适应分布式资源分配算法

研究一类带有不等式约束为凸函数的多智能体系统分布式资源分配问题.在资源分配问题中,各智能体拥有仅自身可知的局部成本函数和局部凸不等式约束.分布式资源分配旨在如何利用智能体间的信息交互设计一种分布式优化算法,完成定量资源分配的同时还保证最小化全局成本函数.针对该问题,基于卡罗需-库恩-塔克条件和比例积分控制思想,首先提出一种自适应分布式优化算法,其中凸不等式约束的对偶变量可实现自适应获取;然后,为了降低系统的通信资源消耗,设计一种动态事件触发控制策略以实现离散时间通信的分布式资源分配算法;最后,通过数值仿真验证所设计算法的有效性.     

支持D2D通信的蜂窝网自适应资源分配算法

针对蜂窝与D2D混合网络中资源分配技术不具有自适应性、造成资源浪费的问题,提出一种根据实际网络环境自适应调整的资源分配方案,并设计两阶段的资源分配算法对该方案进行求解。第一阶段根据用户间的干扰自适应调整使用每个资源块的用户个数和D2D用户可使用的资源块个数,第二阶段利用改进的粒子群算法以吞吐量最大为目标分配功率。仿真结果表明,该算法的性能与穷举搜索最优算法最相近,且系统吞吐量和D2D用户的接入率都明显大于固定分配的算法。     

视频服务节点共享资源池的分布式最优控制

针对三网融合背景下的视频服务网,研究实时服务提供设备( RSPE)的节点共享资源池的资源配置,提出一种完全分布式的最优控制解决方案。分别将物理计算资源和RSPE节点视为计算资源的共享池和资源消费者,给出RSPE节点之间的信息传播策略和分布式优化算法,从而实现资源池的分布式最优控制。仿真结果表明,在RSPE节点变化较小的情况下,该方案可保证节点间信息传播过程的收敛性和共享资源的最优资源配置。     

网格资源发现和分配算法研究

在分布式集群环境中,资源发现和资源分配是网格计算中非常重要的环节.根据丰富的日志记录信息,构造基于日志信息的资源发现和资源分配模型,利用网格环境中各个集群中的守护进程对各子节点的CPU资源使用状态进行分析,提出了一种基于日志的资源发现和资源分配算法LRDA.LRDA算法对比其它的资源发现和资源分配算法能有效地根据日志信息进行资源发现和分配,有效地提高了资源发现和分配的效率,为资源再分配和动态分配提供决策支持.     

面向大规模云资源调度的可扩展分布式调度方法

云数据中心异构物理服务器的能耗优化资源分配问题是NP难的组合优化问题,当资源分配问题规模较大时,求解的空间比较大,很难在合理时间内求得最优解。基于分而治之的思想,从调度模式方面提出可扩展分布式调度方法,即当云数据中心待调度的物理服务器的数量比较大时,将待调度的服务器划分为若干个服务器集群,然后在每个服务器集群建立能耗优化的资源分配模型,并利用约束编程框架Choco求解模型,获得能耗最优的资源分配方式。将提出的基于可扩展分布式调度方法的能耗优化云资源调度算法与非扩展调度算法进行实验比较,实验结果表明,提出的基于可扩展分布式调度方法的能耗优化云资源调度算法在大规模云资源分配上有明显的性能优势。     

基于二分图的D2D通信资源复用分配算法

为了提升D2D（Device to Device）通信资源复用分配的频谱效率,本文以最大化系统吞吐率为目标建立资源复用模型。同时面对高复杂度的组合优化求解过程,提出一种分布式的资源分配迭代算法,该算法使用二分图建立D2D用户与RB（Resource Block）资源的关系模型。每轮资源分配中,D2D用户根据所在RB资源上的动态干扰环境,自治的竞争RB资源,基站则根据吞吐率增益选举最优的D2D用户分配,避免多对一的RB竞争冲突。仿真实验表明,二分图算法在降低算法复杂度的同时,拥有较优的吞吐率性能优势。     

基于自适应精确罚函数的分布式资源分配算法

在多智能体系统中, 分布式资源分配问题是近年来研究热点之一. 分布式资源分配问题旨在通过智能体间信息交互实现资源最优配置. 其中智能体局部约束给算法设计带来巨大挑战. 首先, 针对一阶多智能体系统, 提出基于自适应精确罚函数的分布式资源分配算法, 其中各智能体利用距离函数实现局部约束求解. 此外, 自适应设计思想旨在避免算法对全局先验知识获取. 其次, 利用跟踪技术实现二阶多智能体系统算法设计. 并利用凸函数和非光滑分析法给出严谨的收敛性分析. 最后, 仿真结果验证了本文所设计优化算法对强凸分布式资源分配问题的有效性.     

基于分布式资源覆盖树的P2P网格资源发现机制

现有网格环境中大部分的资源分配策略都是集中式的,但集中式的资源分配机制对于资源在网络中构成节点数量巨大的时候,无法保证高度的动态性、有效性和健壮性,从而出现了分布式的资源分配机制,但已有的分布式资源分配机制也无法在三个方面进行有效的平衡.提出了一种基于分布式资源覆盖树DROT(Distributed Resoure Overlay Tree)的网格资源发现机制DROT _GRDM(DROT Based Grid Resource Discovery Mechanism),通过对网络资源覆盖拓扑结构构建,资源寻获等方面来说明资源的分配过程.DROT _GRDM具有以下特征:(1)采用树状结构在逻辑上建立网络中的资源提供者节点组成空间;(2)分布式资源覆盖树不是一个整体网络结构的反映,而是分散存在的;(3)分布式资源覆盖树结构是与网络拓扑结构相剥离的.     

多用户分布式MIMO-OFDM系统的多维资源分配算法

针对多用户分布式MIMO-OFDM系统中的资源分配问题,结合分布式架构特点,提出了一种基于分级优化的天线、子载波与功率联合分配算法.该算法将三维的资源联合分配问题分级转换为两次二维资源联合分配问题,即先引入端口并行处理机制,完成天线与子载波的分配,形成"用户-子信道对",进而采用注水功率分配的方式,完成功率在"用户-子...     

基于IaaS云中的任务调度分配算法的研究与实现

近年来,基于互联网技术的云计算的应用日趋成熟,诸多开源的云平台不断出现。异构分布式环境中,在面对不同情况时,如何保障负载均衡已经成为云计算研究中的重要研究方向。本文提出了一种基于DAG(Directed Acyclic Graph)的异构分布式系统的任务调度策略。该算法通过资源效益度的竞争,从筛选后的资源池中选择恰当的资源节点进行任务分配,以此提高系统的负载均衡能力。通过实验表明,该任务调度算法可以有效降低通信开销,提高资源利用率,提升负载均衡能力,为整个系统提供高效的性能。     

Adaptive joint bandwidth and power allocation in heterogeneous wireless access environment

Joint bandwidth and power allocation for a multi-radio access(MRA)system in a heterogeneous wireless access environment is studied.Since both the number of users being served by the system and the wireless channel state are time-varying,the optimal resource allocation is no longer a static optimum and will change with the varying network state.Moreover,distributed resource allocation algorithms that require iterative updating and signaling interactions cannot converge in negligible time.Thus,it is unrealistic to assume that the active user number and the wireless channel state remain unchanged during the iterations.In this paper,we propose an adaptive joint bandwidth and power allocation algorithm based on a novel iteration stepsize selection method,which can adapt to the varying network state and accelerate the convergence rate.A distributed solution is also designed for the adaptive joint resource allocation implementation.Numerical results show that the proposed algorithm can not only track the varying optimal resource allocation result much more quickly than a traditional algorithm with fixed iteration stepsize,but can also reduce the data transmission time for users and increase the system throughput.     

Energy efficient and robust allocation of interdependent tasks on mobile ad hoc computational grid

A mobile ad hoc computational grid is a distributed computing infrastructure that allows mobile nodes to share computing resources in a mobile ad hoc environment. Compared to traditional distributed systems such as grids and clouds, resource allocation in mobile ad hoc computational grids is not straightforward because of node mobility, limited battery power and an infrastructure‐less network environment. The existing schemes are either based on a decentralized architecture that results in poor allocation decisions or assume independent tasks. This paper presents a scheme that allocates interdependent tasks and aims to reduce task completion time and the amount of energy consumed in transmission of data. This scheme comprises two key algorithms: resource selection and resource allocation. The resource selection algorithm is designed to select nodes that remain connected for a longer period, whereas the resource assignment or allocation algorithm is developed to allocate interdependent tasks to the nodes that are accessible at the minimum transmission power. The scheme is based on a hybrid architecture that results in effective allocation decisions, reduces the communication cost associated with the exchange of control information, and distributes the processing burden among the nodes. The paper also investigates the relationship between the data transfer time and transmission energy consumption and presents a power‐based routing protocol to reduce data transfer costs and transmission energy consumption. Copyright © 2014 John Wiley & Sons, Ltd.     

Distributed optimal resource allocation of second‐order multiagent systems

In this paper, the resource allocation problems of multiagent systems are investigated. Different from the well‐studied resource allocation problems, the dynamics of agents are taken into account in our problem, which results that the problem could not be solved by most of existing resource allocation algorithms. Here, the agents are in the form of second‐order dynamics, which causes the difficulties in designing and analyzing distributed resource allocation algorithms. Based on gradient descent and state feedback, two distributed resource allocation algorithms are proposed to achieve the optimal allocation, and their convergence are analyzed by constructing suitable Lyapunov functions. One of the two algorithms can ensure that the decisions of all agents asymptotically converge to the exact optimal solution, and the other algorithm achieves the exponential convergence. Finally, numerical examples about the economic dispatch problems of power grids are given to verify the effectiveness of the obtained results.     

基于QoE的LTE多业务资源分配算法

高效地利用无线频谱资源和保证用户体验质量是未来无线网络的主要目标。基于此，提出一种基于QoE的LTE多业务资源分配算法。在考虑信道信息、QoS要求及公平性的基础上，引入QoE来计算的用户优先级。特别的，引入最小QoE约束来保证RT用户QoE要求；提出一种次优资源块（Resource Block，RB）分配算法来解决复杂的资源分配优化问题，该算法主要分为两步：保证RT用户最小QoE要求；最大化系统加权和速率。仿真结果表明，相较现有的RT/NRT资源分配算法，该算法在用户分组丢失率、平均QoE和小区频谱效率方面性能都有所提升。     

车车通信中通信模式选择与资源分配算法

在城市轨道交通列车控制系统中,车车（train-to-train,T2T）通信是利用列车之间直接通信来保障列车安全、高效运行的一种通信模式。与传统的车地（train-to-ground,T2G）通信模式相比,基于T2T通信的系统可以简化系统结构,降低系统成本,提高列车运营效率。为保证通信链路信噪比的同时最大程度地提高整个系统的信道容量,研究了T2G通信模式与T2T通信模式共存情况下的联合通信模式选择和资源分配问题。提出了一种通信模式选择算法,其目的是使列车能够自适应地选择具有更好通信质量的通信模式。在通信模式选择的基础上,提出了一种基于拉格朗日对偶函数法的资源分配算法,该算法可获得列车在不同通信模式下的最佳传输功率。仿真结果表明,相比于其他资源分配算法,所提算法能明显提升系统的信道容量。     

基于比例公平的多用户MIMO-OFDM系统自适应资源分配算法*

针对传统多用户MIMO-OFDM系统中自适应资源分配算法计算复杂度较高、实时性不强、无法保证用户间公平性等问题,提出了一种低复杂度的自适应子载波、比特及功率分配算法。在子载波分配上,该算法能够在兼顾比例速率约束的前提下使系统发射功率达到最小化;在比特及功率分配上,该算法将非线性优化问题转换为线性优化问题,在保证系统性能的同时显著降低计算量。仿真结果表明,该算法具有良好的性能,能够有效降低计算量,并使系统容量在用户间分配得更加公平和合理。     

A Class of Cross‐Layer Optimization Design for Congestion and Energy Efficiency with Compressed Sensing in Wireless Sensing Networks

In wireless sensor networks (WSNs), the congestion problem not only causes packet loss, but also leads to an increase in delays and energy consumption. The actual performance of wireless sensor networks (WSNs) can be severely influenced by the quality of the communication channel and the bit in transmission. In this paper, the distributed protocols, which attain global optimum control for signals by the compressed sensing technique and achieve fair channel allocation by the scheduling algorithm, are proposed for WSNs. We take into account the congestion problem by robust optimization with congestion ratio for two classic aspects in energy limited WSNs: minimum transmission rate and maximum transmitted information. To achieve the goal, three protocols are developed. In the first protocol, the desired control input is designed based on the compressed sensing technique. A minimal bit of signal is provided to reduce the transmission flow for the congestion model. The second protocol is resource allocation. The resources can be allocated increasingly to the channel in order to avoid more severe congestion. This can also avoid conservative reduction of resource allocation for eliminating congestion. Channel selection abides by the fair resource allocation principle. The above protocols separately are implemented through a congestion ratio at network layer, transport layer, and MAC layer. Simulation results demonstrate that the proposed algorithm effectively relieves congestion, and achieves higher throughput and lower energy consumption.     

基于资源特征匹配的虚拟机放置算法

针对目前数据中心的资源低效利用问题,提出了一种基于资源消耗特征匹配的虚拟机放置算法VMP-RUFM (virtual machines placement algorithm based on resource utilization feature-matching).算法在虚拟机应用的性能表现和访问模式两个层面上,建立虚拟机资源特征模型,进而选择资源消耗特征与物理机资源配置相匹配的虚拟机集合.实验结果表明,该算法对满足条件的虚拟机进行关联后,能够显著优化虚拟机整体资源消耗和对应物理机资源配置的匹配程度.