张永晖, 林漳希, 蒋新华, 梁泉. 基于位置的开放式容迟网络路由算法[J]. 微电子学与计算机, 2012, 29(9): 87-90,94.
引用本文: 张永晖, 林漳希, 蒋新华, 梁泉. 基于位置的开放式容迟网络路由算法[J]. 微电子学与计算机, 2012, 29(9): 87-90,94.
ZHANG Yong-hui, LIN Zhang-xi, JIANG Xin-hua, LIANG Quan. Open Delay Tolerant Network Routing Algorithm Based on Location Information[J]. Microelectronics & Computer, 2012, 29(9): 87-90,94.
Citation: ZHANG Yong-hui, LIN Zhang-xi, JIANG Xin-hua, LIANG Quan. Open Delay Tolerant Network Routing Algorithm Based on Location Information[J]. Microelectronics & Computer, 2012, 29(9): 87-90,94.

基于位置的开放式容迟网络路由算法

Open Delay Tolerant Network Routing Algorithm Based on Location Information

  • 摘要: 移动环境下互联网接入网络频繁中断,需使用容迟网络协议.然而时间概率不确定性导致DTN路由算法的先验知识计算复杂,文中提出基于空间的路由算法以消除.进一步由接入路由器信息矩阵决定实现接入路由器的k集合,提出广义k选播以缓解概率不确定性,使用效用最大化的规划模型,在整个许可时间段和k个路由器之间进行路由和资源分配,结合DTN的托管传送,可以对多个目的地同时传送数据包.仿真验证了传输性能和鲁棒性整体较优,能灵活支持开放式网络拓扑结构变化.

     

    Abstract: Mobile Internet access must deal with frequent network disruption, segmentation and highly error rate.Delay tolerant network protocol can help it.However, in this circumstance, the knowledge oracle, that DTN routing algorithms need, is probabilistic uncertain.So a space-based routing algorithm was proposed to eliminate it.Access router information matrixes in Path Predictable Environment were designed to decided k-Anycast router aggregate, so that the generalized k-Anycast can moderate traffic explosion.Utility maximization model allocates bandwidth resources to k eligible access routers in access period, with DTN custody transfer, can be transmitted packets simultaneously to multiple destination.Simulations show that it gains better transmission performance and robustness and more flexibility to support open network topology changes.

     

/

返回文章
返回