期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
基于最大吞吐量目标的WiMax网状网络的公平调度
1
作者 艾明 李正民 《国外电子测量技术》 北大核心 2021年第11期122-129,共8页
对WiMax网状网络的上行链路的集中调度问题进行了研究。首先在调度树T下定义一个WiMax网状网络的上行链路容量区域,将容量区域的边界称之为Pareto表面;然后考虑加权公平性约束,构建一个最佳公平速率分配模型,将公平性与实际的流量需求... 对WiMax网状网络的上行链路的集中调度问题进行了研究。首先在调度树T下定义一个WiMax网状网络的上行链路容量区域,将容量区域的边界称之为Pareto表面;然后考虑加权公平性约束,构建一个最佳公平速率分配模型,将公平性与实际的流量需求结合在一起;为了求解这个问题,提出一种上行链路公平调度算法,将该问题等效为求一系列简化的最佳公平速率分配优化问题,即一种简单的线性规划问题,从而获得高的系统吞吐量,并为用户站提供公平的接入。仿真实验结果表明,与其他的上行链路集中式调度方案相比,提出的方案不仅能够获得系统总吞吐量的提高,而且还能够在保持公平性的同时提高每个用户站的吞吐量。 展开更多
关键词 宽带接入技术 WiMax网状网络 上行链路 最佳公平速率分配 集中式调度 吞吐量
原文传递
Throughput scheduling in cognitive radio networks based on immune optimization
2
作者 柴争义 郑宝林 +1 位作者 沈连丰 朱思峰 《Journal of Southeast University(English Edition)》 EI CAS 2015年第4期431-436,共6页
To study the throughput scheduling problem under interference temperature in cognitive radio networks, an immune algorithm-based suboptimal method was proposed based on its NP-hard feature. The problem is modeled as a... To study the throughput scheduling problem under interference temperature in cognitive radio networks, an immune algorithm-based suboptimal method was proposed based on its NP-hard feature. The problem is modeled as a constrained optimization problem to maximize the total throughput of the secondary users( SUs). The mapping between the throughput scheduling problems and the immune algorithm is given. Suitable immune operators are designed such as binary antibody encoding, antibody initialization based on pre-knowledge, a proportional clone to its affinity and an adaptive mutation operator associated with the evolutionary generation. The simulation results showthat the proposed algorithm can obtain about 95% of the optimal throughput and operate with much lower liner computational complexity. 展开更多
关键词 cognitive radio networks throughput scheduling immune algorithm interference temperature
下载PDF
Optimizing the Resource Utilization of Datacenter Networks with OpenFlow 被引量:3
3
作者 LIU Bo CHEN Ming +2 位作者 HU Chao HU Hui XU Bo 《China Communications》 SCIE CSCD 2016年第3期1-11,共11页
Decreasing the flow completion time(FCT) and increasing the throughput are two fundamental targets in datacenter networks(DCNs), but current mechanisms mostly focus on one of the problems. In this paper, we propose OF... Decreasing the flow completion time(FCT) and increasing the throughput are two fundamental targets in datacenter networks(DCNs), but current mechanisms mostly focus on one of the problems. In this paper, we propose OFMPC, an Open Flow based Multi Path Cooperation framework, to decrease FCT and increase the network throughput. OFMPC partitions the end-to-end transmission paths into two classes, which are low delay paths(LDPs) and high throughput paths(HTPs), respectively. Short flows are assigned to LDPs to avoid long queueing delay, while long flows are assigned to HTPs to guarantee their throughput. Meanwhile, a dynamic scheduling mechanism is presented to improve network efficiency. We evaluate OFMPC in Mininet emulator and a testbed, and the experimental results show that OFMPC can effectively decrease FCT. Besides, OFMPC also increases the throughput up to more than 84% of bisection bandwidth. 展开更多
关键词 datacenter flow completion times muitipath openflow
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部