检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:黄松华[1,2] 吴小兵[2] 黄皓[2] 陈贵海[2]
机构地区:[1]中国电科第28研究所C4ISR技术国防科技重点实验室,江苏南京210007 [2]南京大学软件新技术国家重点实验室,江苏南京210093
出 处:《小型微型计算机系统》2010年第1期22-25,共4页Journal of Chinese Computer Systems
基 金:国家"八六三"高技术研究发展基金项目(2007AA01Z409)资助;国家"九七三"重点基础研究基金项目(2006CB303004)资助;国家自然科学基金项目(60473093)资助
摘 要:链路容错是多穴嵌套移动网络的一个重要议题.在分析多穴嵌套移动网络存在的问题和回顾现有链路容错方案基础上,提出接入路由器树模型及其三类快速切换算法以确保当前会话在接入链路失效突发时的连续性.算法具有以下优点:(1)切换延时降低;(2)数据包利用率加大;(3)兼容原有网络移动协议,易于实现.算法的仿真结果表明,和现有的方案相比,本文算法的切换延时和相应的数据传输延时最小,可以实现链路容错.Link failure tolerant is a crucial issue for multihomed and nested mobile networks. Existing solutions are however not satisfactory. In this paper, a thorough analysis on the problems of multihomed and nested mobile networks is made and the existing schemes in the eye of failure tolerant are reviewed first. Then an access router tree model with three handover algorithms are proposed to enhance the robustness of system by providing fast handover among all available access routers, so ongoing sessions may survive when any access failure bursts. The algorithms gain advantages as follows: ( 1 ) the handover delay is reduced significantly; (2) the data efficiency of packet is raised remarkably ; ( 3 ) resulting from lightweight processes and previous-protocols compatibility, it is easy to be implemented in practice. Extensive simulations are performed to evaluate the proposed scheme. Results indicate that link failure tolerant can be achieved with least latency of packet transmission compared with its existing counterparts.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15