检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]湖南工学院计算机与信息科学学院,湖南衡阳421002
出 处:《计算机应用研究》2016年第2期575-579,585,共6页Application Research of Computers
基 金:湖南省科技计划资助项目(2013FJ3095)
摘 要:针对信息中心网络(ICN)中终端用户体验不佳、网络资源利用率低等不足,对ICN中联合多径拥塞控制和请求转发问题展开研究。将该问题看成是以用户吞吐量最大化和总体网络成本最小化为目标的全局优化问题,通过分解策略解决这一全局优化问题,为接收机确定一组最优拥塞控制策略,为网络节点确定一组分布式动态请求转发算法。为了评估其性能,使用CCNx部署该协议,并设置测试床用于大规模实验仿真。不同网络场景下的实验评估证明了该方案的效率和全局公平性,达到最优方案的预期效果,即使面对路径内缓存和网络拥塞导致的延时不确定性也具有稳定的性能。In order to resolve the lacking of end-user experience and the low utilization of network resources in information eenteie network (ICN) , this paper carried out a research of joint muhipath congestion control and request forwarding in ICN. It formulated the question as a global optimization problem with the twofold objective of maximizing user throughput and mini- mizing overall network cost, decomposed the problem for the purpose of fixing it. It proposed a group of optimal congestion control strategies for the receiver and a set of distributed algorithms for dynamic request forwarding at network nodes. To assess the performance of the design, deployed the proposed protocols in CCNx and a set up testbed for large scale experimentation. Experimental evaluations under different network scenarios confirm the efficiency and fairness of the overall scheme, the de- sired effect of the optimal solution is achieved. Even in the face of the delay uncertainty caused by the in-path caching and net- work congestion the scheme has a stable performance.
关 键 词:信息中心网络 资源利用率 拥塞控制 请求转发 测试床
分 类 号:TP393.07[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.127