异构网络中时延最小的多接入业务分配算法  

Traffic allocation algorithm of multi-radio access transmission based on minimizing delay over heterogeneous networks

作　　者：郑杰[1] 李建东[1] 刘勤[1] 石华[1] 杨小牛[2] 

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071 [2]中国电子科技集团公司第三十六研究所,浙江嘉兴314001

出　　处：《西安电子科技大学学报》2014年第2期1-8,共8页Journal of Xidian University

基　　金：国家自然科学基金重点资助项目(61231008);国家重点基础研究发展计划("973"计划)资助项目(2009CB320404);长江学者和创新团队发展计划资助项目(IRT0852);高等学校科学创新引智计划基金资助项目(B08038)

摘　　要：以业务到达时延最小化为目标,提出一种联合网络选择和业务分配的并行多接入算法.该算法中考虑了不同网络的可利用传输速率和网络时延,利用贝克曼变化思想证明了最优业务分配问题存在门限值,可以根据门限选择最小的接入网络集合获得最小时延.仿真结果表明在重负载情况下,该算法不仅能获得最大吞吐量,并且能够有效地降低业务的到达时延.To minimize the traffic arrival delay, a joint network selection and traffic allocation algorithm is proposed for parallel multi-radio access transmission. The algorithm takes into account the available bit rates and network delays of different networks. Based on the Beckmann transformation method, we obtain the threshold for the optimal traffic allocation. According to such a threshold, a minimal subset of admitted networks can be chosen and traffic allocation among these networks can be done to achieve the minimum delay. Simulation results show that the proposed algorithm could improve the arrival delay effectively and guarantee the maximum throughput under the heavy load condition.

关 键 词：异构网络 并行多接入 最小时延 业务分配 门限 

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