Distributed Algorithm for Robust Resource Allocation with Polyhedral Uncertain Allocation Parameters

This paper studies a distributed robust resource allocation problem with nonsmooth objective functions under polyhedral uncertain allocation parameters. In the considered distributed robust resource allocation problem, the (nonsmooth) objective function is a sum of local convex objective functions assigned to agents in a multi-agent network. Each agent has a private feasible set and decides a local variable, and all the local variables are coupled with a global affine inequality constraint, which is subject to polyhedral uncertain parameters. With the duality theory of convex optimization, the authors derive a robust counterpart of the robust resource allocation problem. Based on the robust counterpart, the authors propose a novel distributed continuous-time algorithm, in which each agent only knows its local objective function, local uncertainty parameter, local constraint set, and its neighbors’ information. Using the stability theory of differential inclusions, the authors show that the algorithm is able to find the optimal solution under some mild conditions. Finally, the authors give an example to illustrate the efficacy of the proposed algorithm.     

基于DEA方法的额外资源分配算法

研究基于DEA(数据包络分析)方法的资源分配问题.求解该类问题的难点在于:对于参与分配的决策单元来说,其分得的额外资源数不仅依赖于该决策单元的相对效率值,还依赖于它的规模大小,因此分配权重难以确定.根据输入、输出指标数的分布情况,建立了3种基本模型,分别是单输入单输出、多输入单输出、单输入多输出模型,给出了这3种模型的资源分配权重的确定算法.最后给出实例,并对给出的分配原则的合理性进行了分析讨论.     

基于m-best算法与rollout策略的平台任务关系优化设计方法#br#

在平台任务关系优化设计中,考虑单个任务资源分配过程中平台资源冗余度对后续任务分配的影响,分析优化设计过程的约束条件,构建了以最大任务执行精度与最小资源冗余度为综合目标函数的平台任务关系设计的问题模型,并使用基于m-best算法与rollout策略的方法对问题模型进行求解。m-best算法生成单个任务的m个平台分配方案,rollout策略用于均衡不同优先级任务之间的任务执行精度。最后,分别通过特殊算例和一般算例验证所提优化设计方法的优越性,算例的结果表明,使用该优化设计方法能够使高优先权任务的资源冗余度降低,从而使得整体任务执行精度提高。     

基于移动边缘计算的车联网任务卸载研究与仿真

为能够在接近用户端利用边缘设备的计算资源为人们提供高质量的服务,基于移动边缘计算的车联网架构设计了一种联合资源分配和任务卸载的机制。将原问题分解为资源分配和卸载决策2个子问题分别求解。将原问题简化成系统容量最大化的资源分配问题,通过比例资源分配算法得到初始卸载集合;采用联合卸载决策与资源分配机制求解上述问题。通过迭代直到实验现象趋于平稳。仿真结果表明：与以往方法相比该机制降低了算法的复杂度,并且用户效用始终较高,大大提升了车联网系统的服务效率。     

Resource allocation with minimum transmit power in multicast OFDM systems

To minimize the total transmit power for multicast service in an orthogonal frequency division multiplexing (OFDM) downlink system, resource allocation algorithms that adaptively allocate subcarriers and bits are proposed. The proposed algorithms select users with good channel conditions for each subcarrier to reduce the transmit power, while guaranteeing each user’s instantaneous minimum rate requirement. The resource allocation problem is first formulated as an integer programming (IP) problem, and then, a full search algorithm that achieves an optimal solution is presented. To reduce the computation load, a suboptimal algorithm is proposed. This suboptimal algorithm decouples the joint resource allocation problem by separating subcarrier and bit allocation. Greedy-like algorithms are employed in both procedures. Simulation results illustrate that the proposed algorithms can significantly reduce the transmit power compared with the conventional multicast approach and the performance of the suboptimal algorithm is close to the optimum.     

云计算环境中SBS应用动态资源分配方法

建立了一个SBS（基于服务的系统，service based system）应用端到端性能评价模型，并在该模型的基础上提出了SBS应用动态资源分配方法，该方法通过将静态的初始资源分配和动态的资源分配方案调整相结合，能够适应用户访问行为的动态变化，保证SBS应用端到端性能. 在SBS应用动态资源分配问题求解中，提出了服务吞吐量约束确定算法并在此基础上 给出了SBS应用动态资源分配算法，该算法根据SBS应用吞吐量约束确定服务资源需求量并在此基础上通过起始服务 到服务间的转移时间计算服务的资源分配时刻，从而能够在保证SBS应用端到端性能约束的同时提高资源利用率. 实验验证了所提出的基于SBS应用端到端性能评价模型的动态资源分配方法的有效性.     

放大转发中继系统中基于SCMA的能效资源分配方案

放大转发中继系统中,以提升能效为目标,在保障各用户的最小速率需求下,提出一种子载波顺序配对以及稀疏码分多址(sparse code division multiple access, SCMA)码本功率联合资源分配算法。将能效资源分配建模为一个混合型整数优化问题,并将其拆分为子载波配对和码本及功率分配两个独立的子问题。首先,预设码本和功率分配,基于能效对子载波进行配对。然后,在子载波固定配对的情况下,基于能效码本采用最优信道选择的分配方法,功率问题转化为含有参量的凹函数,构建拉格朗日函数进行迭代求解。最后,码本和功率交替迭代优化直至收敛。仿真表明,所提算法较其他方案可以提升约29%的系统平均能效,同时也保证了每个用户的最小速率需求。     

A Comprehensive Dea Approach for the Resource Allocation Problem based on Scale Economies Classification

This paper is concerned with the resource allocation problem based on data envelopment analysis （DEA） which is generally found in practice such as in public services and in production process. In management context, the resource allocation has to achieve the effective-efficient-equality aim and tries to balance the different desires of two management layers： central manager and each sector. In mathematical programming context, to solve the resource allocation asks for introducing many optimization techniques such as multiple-objective programming and goal programming. We construct an algorithm framework by using comprehensive DEA tools including CCR, BCC models, inverse DEA model, the most compromising common weights analysis model, and extra resource allocation algorithm. Returns to scale characteristic is put major place for analyzing DMUs＇ scale economies and used to select DMU candidates before resource allocation. By combining extra resource allocation algorithm with scale economies target, we propose a resource allocation solution, which can achieve the effective-efficient-equality target and also provide information for future resource allocation. Many numerical examples are discussed in this paper, which also verify our work.     

Hierarchical resource allocation for integrated modular avionics systems

Recently the integrated modular avionics (IMA) architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture.A novel hierarchical approach is proposed to solve the resource allocation problem for IMA systems in distributed environments.Firstly,the worst case response time of tasks with arbitrary deadlines is analyzed for the two-level scheduler.Then,the hierarchical resource allocation approach is presented in two levels.At the platform level,a task assignment algorithm based on genetic simulated annealing (GSA) is proposed to assign a set of pre-defined tasks to different processing nodes in the form of task groups,so that resources can be allocated as partitions and mapped to task groups.While yielding to all the resource constraints,the algorithm tries to find an optimal task assignment with minimized communication costs and balanced work load.At the node level,partition parameters are optimized,so that the computational resource can be allocated further.An example is shown to illustrate the hierarchal resource allocation approach and manifest the validity.Simulation results comparing the performance of the proposed GSA with that of traditional genetic algorithms are presentod in the context of task assignment in IMA systems.     

Resource Allocation Based on DEA and Non-Cooperative Game

Resource allocation is one of the most important applications of data envelopment analysis (DEA). Usually, the resource to be allocated is directly related to the interests of decision-making units (DMUs), thus the dynamic non-cooperative game is one of the representative behaviours in the allocation process. However, it is rarely considered in the previous DEA-based allocation studies, which may reduce the acceptability of the allocation plan. Therefore, this paper proposes a DEA-based resource allocation method considering the dynamic non-cooperative game behaviours of DMUs. The authors first deduce the efficient allocation set under the framework of variable return to scale (VRS) and build the allocation model subjecting to the allocation set. Then an iteration algorithm based on the concept of the non-cooperative game is provided for generating the optimal allocation plan. Several interesting characteristics of the algorithm are proved, including i) the algorithm is convergent, ii) the optimal allocation plan is a unique Nash equilibrium point, and iii) the optimal allocation plan is unique no matter which positive value the initial allocation takes. Some advantages of the allocation plan have been found. For example, the allocation plan is more balanced, has more incentives and less outliers, compared with other DEA-based allocation plans. Finally, the proposed method is applied to allocate the green credit among the 30 Chinese iron and steel enterprises, and the results highlight the applicability of the allocation method and solution approach. Therefore, the approach can provide decision makers with a useful resource allocation tool from the perspective of dynamic non-cooperative game.

     

基于集中式MIMO雷达的功率带宽联合分配算法

针对集中式多输入多输出雷达对多目标进行跟踪的问题,提出一种基于后验克拉美罗下界的功率和带宽联合分配方法。该方法首先对各目标位置误差的后验克拉美罗下界进行预测,将克拉美罗下界构建为代价函数建立优化模型,从而将资源分配问题转化为求解非凸优化问题;而后运用凸松弛技术和循环最小化算法对该非凸优化问题进行求解;最后通过仿真验证所提算法的有效性。结果表明,与另外3种分配算法相比,所提算法在多种场景下均能有效提高目标跟踪精度。     

云边协同系统中基于博弈论的资源分配与任务卸载方案

综合考虑时延、能耗和计算资源成本，构建云边协同系统中的效用最大化问题，并将其分解为计算资源分配、上行功率分配和任务卸载策略三个子问题。提出一种基于博弈论的资源分配和任务卸载方案（game-based resource allocation and task offloading， GRATO） 以分别解决上述子问题。利用凸优化条件求得计算资源分配最优解；设计一种低复杂度的上行功率分配方法用于降低无线干扰；针对任务卸载策略优化问题，提出一种基于博弈论的分布式任务卸载算法（game-based distributed task offloading algorithm， GDTOA）。仿真结果表明，GRATO方案在时延和能耗方面的性能优于其他方案，还可以感知用户的优先级，使紧急用户具有更高的效用和更低的时延。     

基于Maxmin公平的风险控制资源比例分摊方法

在项目风险管理实践中,如何将风险控制资源适当地分摊给各风险因素是一个重要议题.在风险控制资源总量有限的情况下,合理地分配风险控制资源将有助于提高风险控制效果,提高资源利用效率.考虑到比例分摊是一种在实践中被广泛采用的分摊方法,其直观的分摊原理更容易被决策者所理解和接受,因此引入比例分摊思想研究该问题.首先推导出项目风险控制资源分摊集的数学表达式,进而定义各定义风险因素的分摊效用函数,在此基础上以分摊效用值满足Maxmin公平为目标,构建风险控制资源分摊模型并给出相应的分摊算法.该模型被应用到软件项目开发实例中,结果表明该方法能够实现对风险控制资源的合理分摊,可以为项目经理提供有效的决策支持.     

基于OFDMA的无线协作多播网络资源分配算法

在传统的无线多播传输中,多播组的系统性能受限于多播组内的最差用户的信道质量。为了克服多播组的系统性能受限的问题,将协作传输引入到基于正交频分多址(orthogonal frequency division multiple access,OFDMA)的无线多播网络中,并提出了在总传输速率受限的情况下,最小化总传输功率的动态资源分配算法。为了减少计算复杂度和保障公平性,提出了协作公平子载波分配算法(cooperative fair, CF)和迭代注水功率分配算法。仿真结果显示,在多播组的用户中进行协作传输的系统性能,要远高于采用传统多播直接传输的性能,并且所提算法也在保证系统性能的同时,实现了多播组间良好的公平性。     

一类多卫星动态调度问题的建模与求解方法

卫星调度是空间资源管理的重要内容之一，其本身也是一类复杂的资源分配问题。基于动态约束满足理论，针对卫星初始调度方案执行过程中卫星资源出现故障的情况，建立了多卫星动态调度模型，提出了求解模型的启发式搜索方法。最后，以地球资源观测卫星调度问题为例，对模型和算法进行了验证。     

基于时间反演的上行NOMA系统能效优化算法

为了解决上行非正交多址接入(non-orthogonal multiple access,NOMA)系统在多径环境下传输效率较低问题,提出了一种基于时间反演(time reversal,TR)的上行NOMA网络资源分配算法.首先,利用TR技术独特的空时聚焦特性,增大信号的接收强度.其次,考虑用户最小传输速率约束和用户最...     

角闪烁噪声下的集中式MIMO雷达自适应资源分配算法

为解决角闪烁噪声下集中式多输入多输出(multi-input and multi-output,MIMO)雷达的资源优化分配问题,设计了一种面向多目标跟踪任务的自适应资源分配算法.首先采用平方根容积粒子滤波(square-root cubature particle filter,SCPF)算法对各目标状态进行估计,并...     

一种基于剩余能量的无线网络资源分配算法研究

针对采用网状网模式组网的WMAN中,提出一种由移动站电量余量决定的分配优先级的系统带宽分配算法,按需分配网络资源并提高网络整体性能问题。通过提高重要节点收发数据时的时间集中度,降低重要节点收发数据时的功率消耗,较大程度降低了重复迭代计算的算法复杂度。该算法可以通过启发式分配等效可分配时间和发射功率来优化系统的资源分配,亦还可以通过改变效用函数的斜度参数满足不同的业务特性。     

基于极大熵方法的网格资源分配策略

针对基于市场机制的网格资源分配中的出价问题,提出了一种用于并行任务资源分配的优化策略。该策略先将具有并行任务的多个用户竞争同一资源的行为形式化为一个极大极小问题,然后利用极大熵方法将其转化为一个可微的优化问题,最后通过二分搜索最优解产生一组优化的用户出价,根据这组出价按比例划分资源的计算能力。研究了用户出价函数的特征,给出了求出价组合最优解的具体算法。研究结果表明提出的分配策略具有较低的时间复杂度,从而能够提高资源分配效率,对于动态的网格环境具有更好的适应性。     

超密集网络中基于聚类的资源分配方案

超密集网络(ultra-dense network, UDN)中,毫微微基站(femto-cell base station, FBS)的密集和随机部署会导致严重的小区间干扰。为了减轻干扰、保障用户服务质量(quality of service, QoS),提出了一种UDN中基于聚类的资源分配方案。首先,设计了一种基于加权密度的改进K-means聚类算法,将FBS动态划分为不同的簇。然后,以最大化UDN系统吞吐量为目标提出了一种两阶段时频资源分配方案:第一阶段,每个聚类内使用贪婪算法执行时频资源块的分配;第二阶段,利用资源补偿分配算法分配剩余的资源块,在考虑用户公平性的同时保证用户QoS。仿真结果表明,本文提出的资源分配方案能够有效提升系统吞吐量,同时保证用户QoS和公平性。