-
1.发明授权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.
-
公开(公告)号：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.
-
3.发明授权Method of reducing the amount of information included in topology database update messages in a data communications network 失效降低数据通信网络拓扑数据库更新信息中包含的信息量的方法
公开(公告)号：US5101348A
公开(公告)日：1992-03-31
申请号：US210251
申请日：1988-06-23
申请人： Andrew H. Arrowood , Kathryn E. Clarke , John E. Drake, Jr. , John L. Eisenbies , James P. Gray , Karla J. Norsworthy , Diane P. Pozefsky , Terence D. Smetanka
发明人： Andrew H. Arrowood , Kathryn E. Clarke , John E. Drake, Jr. , John L. Eisenbies , James P. Gray , Karla J. Norsworthy , Diane P. Pozefsky , Terence D. Smetanka
摘要： In a communications network, each network node can maintain its own list of network resources in a topology database. When the state of a resource "owned" by a particular node changes, that node broadcasts a topology database update (TDU) message to adjacent nodes. Each adjacent node updates its own topology database and rebroadcasts the message. To minimize the amount of information that must be included in TDU messages when two nodes are reconnected after an outage, each node assigns flow reduction sequence numbers (FRSNs) to TDU meassages and keeps a record of the FRSN for the last TDU message sent to an adjacent node. The node also records, for each resource in its database, the FRSN of the last TDU message including that resource. When two nodes are reconnected, the sending node includes in the TDU message only those resources having a FRSN greater than the FRSN assigned to the last TDU sent to the adjacent node to which the TDU message is directed.
-
-
搜索结果
3 条记录 (耗时 0.03 秒)
