专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US06646989B1 Hop-by-hop routing with node-dependent topology information 有权
标题翻译：具有节点依赖拓扑信息的逐跳路由
公开(公告)号：US06646989B1
公开(公告)日：2003-11-11
申请号：US09273434
申请日：1999-03-20
申请人： Dennis Andreyevich Khotimsky , Vincent Georges Pierre Fayet , Antoni Bronislaw Przygienda
发明人： Dennis Andreyevich Khotimsky , Vincent Georges Pierre Fayet , Antoni Bronislaw Przygienda
IPC分类号： G08C1500
CPC分类号： H04L45/12
摘要： This invention relates to a method to effect hop-by-hop routing in a network segment where different nodes have different views of the network topology. In particular, the methods of this invention are applicable when each node in a network or network segment may be aware of only a subset of the communication links in the network, without perceiving other communication links. Based on each node's individual view of the network, the method introduces the concept of a visibility set that includes all visible communication links. More specifically, an efficient algorithm is disclosed for searching for a family of one-to-all optimal feasible paths in communication network where different nodes may have different views of the network topology. The algorithm comprises (a) restricting the set of available paths to a destination node to the set of feasible paths from the source node to the destination node; and choosing as the optimal route the feasible path which has the lowest cost, wherein a path is a feasible path if (i) the path does not contain a cycle, and (ii) for each intermediate node visited by the path, the subpath from that intermediate node to the destination node is visible from the intermediate node.
摘要翻译：本发明涉及一种在不同节点具有不同网络拓扑视图的网段中实现逐跳路由的方法。特别地，本发明的方法适用于网络或网段中的每个节点只能知道网络中的通信链路的子集，而不会感知到其他通信链路。基于每个节点对网络的单独视图，该方法引入了包括所有可见通信链路的可见性集合的概念。更具体地，公开了一种用于在通信网络中搜索一对一最佳可行路径的系列的有效算法，其中不同节点可以具有不同的网络拓扑的视图。该算法包括（a）将来自目的地节点的可用路径集合限制到从源节点到目的地节点的可行路径集合; 并且选择具有最低成本的可行路径作为最佳路径，其中如果（i）路径不包含循环，则路径是可行路径，并且（ii）对于由路径访问的每个中间节点，子路径从中间节点到目标节点的中间节点是可见的。

IPRDB

热门服务

关于我们

友情链接

联系方式