公开(公告)号：US5491690A

公开(公告)日：1996-02-13

申请号：US279373

申请日：1994-07-22

申请人： Jean-Pierre Alfonsi ,  Claude Galand ,  Gerald Lebizay ,  Olivier Maurel

发明人： Jean-Pierre Alfonsi ,  Claude Galand ,  Gerald Lebizay ,  Olivier Maurel

IPC分类号： H04L12/56

CPC分类号： H04L45/04

摘要： Currently, routing algorithms compute all the available paths in the network, from a source node to a destination node before selecting the optimal route. The route computation is often time and resource consuming. Some paths are not acceptable due to the particular geographical configuration of the network. In the real world, large transport networks are not fully meshed. The present invention is based on the observation that networks are usually built around a hierarchical structure. A set of nodes, interconnected by high throughput lines, are used to build a `Backbone` (401) with a high degree of meshing to allow the redundancy and reliability required by the user. The other nodes or `local` nodes (404) are attached to one or several backbone nodes. It is the network designer responsibility, at the configuration time to define for each node what is its attribution: backbone (402) or local node (404). The list of the node attributions appears in the topology table (306) and is updated each time a node is added to or dropped from the network. The routing algorithm can take advantage of the particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are eligible and are taken in account by the algorithm in the optimal route search. The object of the invention is to split the network into backbone and local nodes to speed up the path selection.

摘要翻译： 目前，在选择最优路由之前，路由算法计算网络中的所有可用路径，从源节点到目标节点。 路由计算通常是时间和资源消耗的。 由于网络的特定地理配置，一些路径是不可接受的。 在现实世界中，大型运输网络并没有完全啮合。 本发明基于网络通常围绕分级结构构建的观察。 通过高吞吐量线路互连的一组节点用于构建具有高度网格划分的“骨干”（401），以允许用户所需的冗余和可靠性。 其他节点或“本地”节点（404）连接到一个或多个骨干节点。 网络设计师负责，在配置时间为每个节点定义它的属性是什么：骨干（402）或本地节点（404）。 节点属性的列表出现在拓扑表（306）中，并且每当将节点添加到网络或从网络中删除时更新。 路由算法可以利用特定的网络拓扑来大幅降低路径计算的复杂度。 对于给定的连接，只有有限数量的节点是合格的，并且通过算法在最优路由搜索中被考虑。 本发明的目的是将网络分为骨干和本地节点，以加速路径选择。