MU-MIMO下行链路基于关联干扰的先验式用户调度

该文针对MU-MIMO下行(广播)信道提出一种基于空间子信道关联干扰的先验式调度算法。该方法将用户调度转换为子信道的选择问题,通过综合考虑候选子信道的传输增益,以及候选者与已选的和潜在的、将来可能被选中的子信道间的相互干扰,获得一组相互干扰较小的子信道。仿真结果表明,合理地选取关联干扰参数,该算法能够获得计算复杂度与传输性能的良好折中,有效改善系统和速率。     

有限反馈中继系统基于业务速率的跨层调度算法

针对正交频分复用(OFDM)中继系统中用户不同业务速率需求的应用场景,该文提出了一种基于用户业务速率的反馈机制(Considering Traffic Rate Feedback, CTRF)。CTRF根据业务速率动态调整用户的反馈效用函数值,并与反馈门限比较判决用户是否反馈,从而减少系统的反馈量。同时,提出了一种基于业务队列公平性(Traffic Queue Proportional Fair, TQPF)的跨层调度准则。在此基础上,给出了一种联合CTRF与TQPF的支持不同业务速率的减少反馈调度算法(CTRF-TQPF)。理论和仿真结果表明,CTRF可以有效地减少反馈量,CTRF-TQPF算法可以有效保障用户的不同业务需求,降低系统的丢包率。     

多级交换中支持包保序的交换结构及调度算法

现有单级交换结构在其规模的有效扩展方面存在瓶颈。该文提出了一种新的中间级带缓存的高可扩展多级交换结构,并建立了该结构的排队论模型。针对交换网络内部的信元乱序问题,该文基于上述结构提出一种新的包保序算法,该算法通过严格同步输入级和中间级调度指针,能够简单有效地实现信元保序。理论分析结果表明,该结构能够获得100%的吞吐量且实现代价较小。仿真实验表明,该算法不仅能够获得较为理想的高吞吐量,并且在高负载强度下的平均时延性能优势明显。     

前向分组数据业务中重传分组优先权的研究

该文研究了前向分组数据业务中应用的调度算法,在对常见的几种调度算法分析之后,提出一种新的调度算法。从理论和仿真两方面的性能分析显示,该算法通过适当改变重传分组的优先权,在保证满足公平性准则的前提下,提高了系统吞吐量,降低了平均分组时延,改善了分组时延分布。     

Round robin调度算法在FPGA中的实现

Round robin调度算法是一个在许多方面有着广泛应用的经典调度算法。该文在考虑了FPGA的结构特点和实际系统需求后,利用桶式移位器和分段式优先级编码器,在FPGA中实现了Round robin调度算法,并对实现方法的面积和性能进行了讨论。系统测试结果表明该算法实现是高效的,满足了系统的需求,在实际系统中运行状况良好。     

对数比例公平队列:一种新的调度算法

Internet路由器中的队列调度算法关系到用户数据流能够获得的服务质量以及整个网络的性能,该文提出了一种新的队列调度算法对数比例公平队列调度算法,并通过理论分析和仿真说明了该队列调度算法的一些特性,这种算法不仅实现了网络总效用、网络传输性能与资源分配公平性的折衷,还具有对恶意用户的惩罚作用,鼓励用户使用合理的端到端流量控制算法。     

Optimal decision making in ventilation control

In this paper, a two-mode ventilation control of a single facility is formulated as a scheduling model over multiple time horizons. Using the CO₂ concentration as the major indoor air quality index and expected room occupancy schedule, optimal solutions leading to reduced CO₂ concentration and energy costs are obtained by solving the multi-objective optimization model formulated in the paper. A modified evolutionary strategy algorithm is used to solve the model at different time horizons. The optimized ventilation schedules result in energy savings and maintain an acceptable level of indoor CO₂ concentration.     

公平调度的分组调度算法设计

针对无线实时多媒体业务应用,该文在算法Exponential rule(Exp)基础上提出了一种增强调度公平性能的Modified Exponential rule(MExp)分组调度算法。通过理论分析和系统级仿真对算法性能进行了分析和验证。     

Optimal production sequence and processing schedules of multiproduct batch processes for heat integration and minimum equipment costs

The production sequence and the processing schedules of multiproduct batch processes can be changed for maximum heat recovery and minimum equipment costs between batch streams. However, the modified production sequence and processing schedule may increase the production cycle time, which causes the bigger equipment sizes required in batch processes. In this study, the required equipment sizes, the production sequence and the processing times of the multiproduct batch processes are mathematically formulated for maximum heat integration and low equipment costs in a mixed integer nonlinear programming. The optimal solution of this formulation was obtained by GAMS/DICOPT programming solver. Examples are presented to show the capabilities of the model.     

A novel MILP formulation for short-term scheduling of multi-stage multi-product batch plants with sequence-dependent constraints

This paper presents a continuous-time mixed-integer linear programming (MILP) model for short-term scheduling of multi-stage multi-product batch plants. The model determines the optimal sequencing and the allocation of customer orders to non-identical processing units by minimizing the earliness and tardiness of order completion. This is a highly combinatorial problem, especially when sequence-dependent relations are considered such as the setup time between consecutive orders. A common approach to this scheduling problem relies on the application of tetra-index binary variables, i.e. (order, order, stage, unit) to represent all the combinations of order sequences and assignments to units in the various stages. This generates a huge number of binary variables and, as a consequence, much time is required for solutions. This paper proposes a novel formulation that replaces the tetra-index binary variables by one set of tri-index binary variables (order, order, stage) without losing the model's generality. By the elimination of the unit index, the new formulation requires considerably fewer binary variables, thus significantly shortening the solution time.