检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:欧阳伟[1] 鲁鹏俊[1] 李杨[1] 曹文君[1]
机构地区:[1]复旦大学计算机信息与技术系,上海200433
出 处:《计算机应用与软件》2007年第8期125-127,共3页Computer Applications and Software
摘 要:"三角路由"问题是整个移动IP协议中路由效率问题的核心。许多路由协议解决方案[2,3,6]都对这个问题进行了讨论与研究。然而,由于传统IPV4的不足和这些解决方案本身的局限性,导致这些算法的适应性很差。提出路由协议算法,对移动IP协议进行了很小的扩展,能够根据当前网络自动地寻找较好的路由选路,有效地将平均路由路径长度缩减到1/2,通过对当前网络资源进行有效配置,可获得最佳路由效率。Triangle Routing Problem is the key problem of effective routing in Mobile IP Protocol (MIP). Many researches such as [ 2,3, 6 ] have done much in this area. However, most of them are hard to be large-scale deployed because of either the drawback of traditional IPV4 or the limitations of the algorithms. A novel algorithm is proposed, which can reduce the average length of routing path to 1/2 of before with little extension of current MIP and make it more scalable. By effective configuration of current network resources, the optimum solution for more effective MIP routing can be reached.
分 类 号:TP31[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145