LTE中基于排队机制的动态资源预留接纳控制算法  

Admission control algorithm with dynamic resource reservation based on queuing in LTE

作　　者：唐宏[1] 万晋京 李兆玉[1] 

机构地区：[1]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065

出　　处：《系统工程与电子技术》2017年第2期418-424,共7页Systems Engineering and Electronics

基　　金：长江学者和创新团队发展计划(IRT1299)资助课题

摘　　要：长期演进(long term evolution,LTE)系统中,接纳控制是保证用户服务质量(quality of service,QoS)要求的重要技术之一。针对现有资源预留算法受预留门限值影响较大,且掉线率较高的缺点,提出一种适用于LTE系统的基于排队机制的动态资源预留算法。首先该算法通过设置门限预留部分资源,让切换呼叫直接接入,新呼叫以新定义的请求概率动态接入。其次在系统资源耗尽时,对切换呼叫采取排队机制,等待系统有剩余资源时接入。仿真结果表明,所提算法能有效降低切换呼叫掉线率,提高资源利用率,并且算法受预留门限值的影响较小。In the long term evolution（LTE） system, admission control is one of the most important techniques to guarantee the quality of service（QoS）. The admission control algorithm with resource reservation is highly affected by the reservation threshold value, also it has a high handoff dropping rate. To deal with these disadvantages, an algorithm with dynamic resource reservation based on queuing in LTE is proposed. First, the algorithm reserves some resources through setting threshold value. After that the new call can use these re- sources directly while the handoff call must request {or it. Whatever the request probability is newly defined in this paper. Then when the resources of the system are used up, in order to further reduce the handoff dropping rate, queuing for handoff calls waiting is used for the system own remaining resources. The simulation results show that the proposed algorithm can effectively reduce the handoff dropping rate, improve the utilization rate of system resources. Also the proposed algorithm is less affected by the reservation threshold value.

关 键 词：长期演进 接纳控制 动态资源预留 请求概率 排队 

分 类 号：TN915.01[电子电信—通信与信息系统]