检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京邮电大学信息与通信工程学院,北京100876 [2]三峡大学计算机与信息学院,湖北宜昌443002
出 处:《计算机工程》2012年第15期77-80,共4页Computer Engineering
基 金:三峡大学自然科学基金资助项目(KJ2011B042)
摘 要:提出一种新的具有多重服务质量保证的区分业务到无线链路的优化映射。在保证丢包率的条件下,建立线性整数规划模型,采用搜索求解,实现资源消耗最小的区分业务到无线链路业务类别映射。在已知类别映射的条件下,基于统计流模型,用最陡下降法求解丢包率,建立时延误差最小映射的带宽分配优化模型,且考虑链路时变对带宽分配的影响。仿真结果表明,相比其他方法,该优化映射可使总的资源消耗、丢包率以及时延映射误差达到最小,并能够跟踪链路时变。An optimal mapping from differential service to wireless link with multiple Quality of Service(QoS) support is piesented, which include two steps. The first is the optimal service category mapping from the difference service to the wireless link subjected to the packets loss ratio based on the line integer programming and its search solution. The second is to set up an optimal bandwidth allocation model for the mapped service subjected to the minimum error of the packets loss ratio and the delay based on the queue statistical flow theory and to solve the model using the steepest descent method, where the numerical description for the bandwidth gradient is used and the effect of the time variation to the bandwidth allocation is involved. Simulation results show that the mapping can make the resource consumption and the mapping error of the packets loss ratio and delay the least, and the result can be adaptive to the time variation of the link.
关 键 词:服务质量映射 类映射 线性整数规划 带宽分配 最陡下降法 时变链路
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.118.14.81