检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵红礼[1]
机构地区:[1]北京交通大学电子信息工程学院,北京100044
出 处:《铁道学报》2006年第6期79-82,共4页Journal of the China Railway Society
摘 要:未来的全IP移动通信系统能够提供多种不同QoS要求的业务,资源调度对保证QoS和提高资源利用效率起关键作用。动态规划方法可以求解满足QoS保证的最优调度,但是它对运算速度和存储容量要求很高,难以在实际中应用。为此本文提出一种比例资源调度算法,将QoS保证映射为接纳控制阶段的比例资源分配。由于信道的相关特性已经在接纳控制阶段进行了考虑,而且资源分配比例是时不变的,因此将动态规划问题简化为线性规划问题。文中采用吞吐量最大化调度作为比较基准,仿真了比例资源调度算法的性能,结果表明:由动态规划转化为线性规划带来的性能损失很小;另外当平均信噪比较小时,调度增益较大,并且调度增益随用户数的增加而增大。Future mobile telecommunication will be all-IP-based, it can provide different QoS services. Radio resource scheduling plays a key role in guaranteeing QoS and enhancing utilizing efficiency of radio resources. The dynamic programming method can figure out the best scheduling to guarantee QoS. But it is difficult to use in practice because it requires very high operation speeds and big memory capacity. So this paper proposes a proportion resource scheduling algorithm, it can map QoS guarantee to proportion resource distribution in the phase of call admission control. Owing to the fact that the specialties of channels have been considered in the phase of call admission control, and the proportion of resource distribution is not changed by time, dynamic programming is simplified into linear programming. This paper simulates the performance of the proportion resource scheduling algorithm, by adopting the best throughput scheduling as the benchmark. The result indicates; The performance loss is very small by transforming dynamic programming to linear programming; the scheduling gain is large when the average SNR is small, and the scheduling gain is enhanced by the increase of users.
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222