-
公开(公告)号：US4967345A
公开(公告)日：1990-10-30
申请号：US210471
申请日：1988-06-23
IPC分类号： H04L12/56
摘要： A least weight route computation algorithm for use in computing routes through a data communications network is improved by recording the number of equally weighted paths to a particular node through different predecessor nodes. If a route must be selected to the particular node, the relative numbers of equally weighted routes through different predecessor nodes determines the probability with which a route will be selected through the particular predecessor node.
-
2.发明授权Method for selecting least weight end node to end node route in a data communications network 失效在数据通信网络中选择最小权重终端节点到终端节点路由的方法
公开(公告)号：US4873517A
公开(公告)日：1989-10-10
申请号：US210273
申请日：1988-06-23
申请人： Alan E. Baratz , Kathryn E. Clarke , Melinda R. Pollard , Diane P. Pozefsky , Lee M. Rafalow , William E. Siddall , James P. Gray
发明人： Alan E. Baratz , Kathryn E. Clarke , Melinda R. Pollard , Diane P. Pozefsky , Lee M. Rafalow , William E. Siddall , James P. Gray
摘要： When computing a least weight path from an origin node to a destination node in a data communication network, a route-computing network node uses information provided by the origin and destination nodes to compute least weight routes from those nodes to adjacent network nodes. The route-computing network node uses information in the topology database to compute least weight routes from network nodes adjacent the origin node to network nodes adjacent the destination node. The results of the computations are concatenated to determine an optimum route from the origin node to the destination node. The topology database need not include information about the transmission groups connecting the origin/destination nodes to network nodes.
-
3.发明授权Route selection using cached partial trees in a data communications network 失效在数据通信网络中使用缓存的部分树进行路由选择
公开(公告)号：US5321815A
公开(公告)日：1994-06-14
申请号：US962626
申请日：1992-10-16
摘要： A process for selecting a least weight path between two nodes in a data communication network uses partial trees created and cached in prior route selection operations. All root nodes on possible paths between the two nodes are identified. Any cached tree having a root matching one of the identified root nodes is retrieved from storage. If necessary, each retrieved tree is extended until it includes all possible destination nodes. The extended and/or retrieved trees are used to select the least weight path between the two nodes. The extended tree is then cached for possible use in future route selection operations.
摘要翻译： 用于在数据通信网络中的两个节点之间选择最小权重路径的过程使用在先前的路由选择操作中创建和缓存的部分树。 识别两个节点之间可能路径上的所有根节点。 从存储器中检索到具有与所识别的根节点之一匹配的根的任何缓存的树。 如果需要，每个检索到的树被扩展，直到它包括所有可能的目的地节点。 扩展和/或检索到的树用于选择两个节点之间的最小权重路径。 然后缓存扩展树，以便将来可能在路由选择操作中使用。
-
-
搜索结果
3 条记录 (耗时 0.023 秒)
