检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李知航[1] 王浩[1] 蒋慧琳[1] 潘志文[1] 尤肖虎[1]
机构地区:[1]东南大学移动通信国家重点实验室,南京210096
出 处:《东南大学学报(自然科学版)》2013年第3期453-457,共5页Journal of Southeast University:Natural Science Edition
基 金:国家科技重大专项资助项目(2011ZX03003-002-02;2012ZX03003-010-002);江苏省"六大人才高峰"资助项目;江苏省科技支撑计划资助项目(BE2012165);华为技术有限公司资助项目
摘 要:研究了长期演进(long term evolution,LTE)网络中考虑机会调度并可提供不同服务质量(QoS)保障的准入控制(CAC)算法的设计.使用基于累积分布函数的调度(cumulative distributed function based scheduling,CS)作为基本调度策略.首先采用机会轮询(opportunistic roundrobin,ORR)计算CS性能下界,并通过仿真验证此计算方法的正确性.然后提出一个CS与ORR相结合的CAC算法COCDQ(CS/ORR based CAC algorithm for different QoS requirements),其可同时保障新接入用户和已存在用户的不同QoS需求.最后通过系统级仿真验证所提算法性能,结果表明联合考虑机会调度与QoS需求,COCDQ算法可有效降低新接入用户阻塞率,提供更好的QoS保障,其代价是仅总吞吐量略有降低.Considering opportunistic scheduling and different quality of service(QoS) guarantees in long term evolution(LTE) network,the design of call admission control(CAC) algorithms is studied.Cumulative distributed function based scheduling(CS) is used as the scheduling scheme.First,opportunistic round robin(ORR) is adopted to calculate the statistical performance lower bound of CS,and the correctness of the calculation method is verified by simulations.Then,a CS/ORR based CAC algorithm COCDQ(CS/ORR based CAC algorithm for different QoS requirements) is proposed,which can guarantee different QoS requirements of both new access users and existing ones simultaneously.Finally,the performance of the proposed algorithm is evaluated via system level simulation.Results show that with the joint consideration of opportunistic scheduling and QoS requirements,the COCDQ algorithm can efficiently reduce new call block probability and provide better QoS guarantee,while the cost is a bit degradation of total throughput.
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.232.164