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

1. 发明授权

US08149736B2 Distributed storage of routing information in a link state protocol controlled network 失效
标题翻译：路由信息在链路状态协议控制网络中的分布式存储
公开(公告)号：US08149736B2
公开(公告)日：2012-04-03
申请号：US12728977
申请日：2010-03-22
申请人： Peter Ashwood Smith , Guoli Yin , William McCormick
发明人： Peter Ashwood Smith , Guoli Yin , William McCormick
IPC分类号： H04L12/28
CPC分类号： H04L45/742 , H04L45/02 , H04L45/44 , H04L45/54 , H04L45/745 , H04L67/104 , H04L67/1065
摘要： A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network. The DHT may be implemented to store MAC addresses, IP addresses, MPLS labels, or other information of interest to enable routes to be stored and learned by network elements on the network.
摘要翻译：实现分布式哈希表以在网络上存储路由信息。在链路状态路由协议的实现中交换的节点ID被用作分布式哈希表中的密钥，并且路由被存储在网络上的一个或多个节点上。当学习路由时，根据密钥集处理路由，以确定哪些节点应存储路由。当需要路由时，根据密钥集处理路由，以确定哪些节点应该具有路由信息。在两种情况下，路由处理方式相同，因此可以使用DHT来存储和检索网络上的路由信息。可以实现DHT来存储MAC地址，IP地址，MPLS标签或感兴趣的其他信息，以使网络上的网络元素能够存储和学习路由。

2. 发明申请

US20100172270A1 Distributed Storage of Routing Information In a Link State Protocol Controlled Network 失效
标题翻译：路由信息在链路状态协议控制网络中的分布式存储
公开(公告)号：US20100172270A1
公开(公告)日：2010-07-08
申请号：US12728977
申请日：2010-03-22
申请人： Peter Ashwood Smith , Guoli Yin , William McCormick
发明人： Peter Ashwood Smith , Guoli Yin , William McCormick
IPC分类号： H04L12/28
CPC分类号： H04L45/742 , H04L45/02 , H04L45/44 , H04L45/54 , H04L45/745 , H04L67/104 , H04L67/1065
摘要： A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network. The DHT may be implemented to store MAC addresses, IP addresses, MPLS labels, or other information of interest to enable routes to be stored and learned by network elements on the network.
摘要翻译：实现分布式哈希表以在网络上存储路由信息。在链路状态路由协议的实现中交换的节点ID被用作分布式哈希表中的密钥，并且路由被存储在网络上的一个或多个节点上。当学习路由时，根据密钥集处理路由，以确定哪些节点应存储路由。当需要路由时，根据密钥集处理路由，以确定哪些节点应该具有路由信息。在两种情况下，路由处理方式相同，因此可以使用DHT来存储和检索网络上的路由信息。可以实现DHT来存储MAC地址，IP地址，MPLS标签或感兴趣的其他信息，以使网络上的网络元素能够存储和学习路由。

3. 发明申请

US20120207061A1 Distributed Storage of Routing Information in a Link State Protocol Controlled Network 失效
标题翻译：路由信息在链路状态协议控制网络中的分布式存储
公开(公告)号：US20120207061A1
公开(公告)日：2012-08-16
申请号：US13420720
申请日：2012-03-15
申请人： Peter Ashwood Smith , Guoli Yin , William McCormick
发明人： Peter Ashwood Smith , Guoli Yin , William McCormick
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/742 , H04L45/02 , H04L45/44 , H04L45/54 , H04L45/745 , H04L67/104 , H04L67/1065
摘要： A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network.
摘要翻译：实现分布式哈希表以在网络上存储路由信息。在链路状态路由协议的实现中交换的节点ID被用作分布式哈希表中的密钥，并且路由被存储在网络上的一个或多个节点上。当学习路由时，根据密钥集处理路由，以确定哪些节点应存储路由。当需要路由时，根据密钥集处理路由，以确定哪些节点应该具有路由信息。在两种情况下，路由处理方式相同，因此可以使用DHT来存储和检索网络上的路由信息。

4. 发明授权

US07684352B2 Distributed storage of routing information in a link state protocol controlled network 失效
标题翻译：路由信息在链路状态协议控制网络中的分布式存储
公开(公告)号：US07684352B2
公开(公告)日：2010-03-23
申请号：US11714508
申请日：2007-03-06
申请人： Peter Ashwood Smith , Guoli Yin , William McCormick
发明人： Peter Ashwood Smith , Guoli Yin , William McCormick
IPC分类号： H04L12/28 , G06F15/173
CPC分类号： H04L45/742 , H04L45/02 , H04L45/44 , H04L45/54 , H04L45/745 , H04L67/104 , H04L67/1065
摘要： A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network. The DHT may be implemented to store MAC addresses, IP addresses, MPLS labels, or other information of interest to enable routes to be stored and learned by network elements on the network.
摘要翻译：实现分布式哈希表以在网络上存储路由信息。在链路状态路由协议的实现中交换的节点ID被用作分布式哈希表中的密钥，并且路由被存储在网络上的一个或多个节点上。当学习路由时，根据密钥集处理路由，以确定哪些节点应存储路由。当需要路由时，根据密钥集处理路由，以确定哪些节点应该具有路由信息。在两种情况下，路由处理方式相同，因此可以使用DHT来存储和检索网络上的路由信息。可以实现DHT来存储MAC地址，IP地址，MPLS标签或感兴趣的其他信息，以使网络上的网络元素能够存储和学习路由。

5. 发明授权

US08687522B2 Distributed storage of routing information in a link state protocol controlled network 失效
标题翻译：路由信息在链路状态协议控制网络中的分布式存储
公开(公告)号：US08687522B2
公开(公告)日：2014-04-01
申请号：US13420720
申请日：2012-03-15
申请人： Peter Ashwood Smith , Guoli Yin , William McCormick
发明人： Peter Ashwood Smith , Guoli Yin , William McCormick
IPC分类号： H04L12/28
CPC分类号： H04L45/742 , H04L45/02 , H04L45/44 , H04L45/54 , H04L45/745 , H04L67/104 , H04L67/1065
摘要： A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network.
摘要翻译：实现分布式哈希表以在网络上存储路由信息。在链路状态路由协议的实现中交换的节点ID被用作分布式哈希表中的密钥，并且路由被存储在网络上的一个或多个节点上。当学习路由时，根据密钥集处理路由，以确定哪些节点应存储路由。当需要路由时，根据密钥集处理路由，以确定哪些节点应该具有路由信息。在两种情况下，路由处理方式相同，因此可以使用DHT来存储和检索网络上的路由信息。

6. 发明申请

US20080107043A1 Distributed storage of routing information in a link state protocol controlled network 失效
标题翻译：路由信息在链路状态协议控制网络中的分布式存储
公开(公告)号：US20080107043A1
公开(公告)日：2008-05-08
申请号：US11714508
申请日：2007-03-06
申请人： Peter Ashwood Smith , Guoli Yin , William McCormick
发明人： Peter Ashwood Smith , Guoli Yin , William McCormick
IPC分类号： H04L12/28
CPC分类号： H04L45/742 , H04L45/02 , H04L45/44 , H04L45/54 , H04L45/745 , H04L67/104 , H04L67/1065
摘要： A distributed hash table is implemented to store routing information on a network. Node IDs exchanged in connection with implementation of a link state routing protocol are used as keys in the distributed hash table, and routes are stored at one or more nodes on the network. When a route is learned, the route is processed against the set of keys to determine which nodes should store the route. When a route is needed, the route is processed against the set of keys to determine which nodes should have the route information. The manner in which the route is processed against the set of keys is the same in both instances, so that the DHT may be used to store and retrieve route information on the network. The DHT may be implemented to store MAC addresses, IP addresses, MPLS labels, or other information of interest to enable routes to be stored and learned by network elements on the network.
摘要翻译：实现分布式哈希表以在网络上存储路由信息。在链路状态路由协议的实现中交换的节点ID被用作分布式哈希表中的密钥，并且路由被存储在网络上的一个或多个节点上。当学习路由时，根据密钥集处理路由，以确定哪些节点应存储路由。当需要路由时，根据密钥集处理路由，以确定哪些节点应该具有路由信息。在两种情况下，路由处理方式相同，因此可以使用DHT来存储和检索网络上的路由信息。可以实现DHT来存储MAC地址，IP地址，MPLS标签或感兴趣的其他信息，以使网络上的网络元素能够存储和学习路由。

7. 发明授权

US09124512B2 Method and apparatus for simplifying the computation of alternate network paths 有权
标题翻译：用于简化备用网络路径计算的方法和装置
公开(公告)号：US09124512B2
公开(公告)日：2015-09-01
申请号：US13595011
申请日：2012-08-27
申请人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
发明人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
IPC分类号： H04L12/26 , H04L12/707 , H04L12/66 , H04L12/751 , H04J3/14
CPC分类号： H04L45/22 , H04J3/14 , H04L12/66 , H04L45/02
摘要： An alternate path calculation process may be terminated after considering some of a source node's neighbors and without considering each of its neighbors, to reduce the amount of processing required to perform the alternate path calculations. The neighbors may be ranked according to the number of alternate paths that the neighbor has historically been able to provide on the network. The influence of historical success or failure may degrade over time so that the rankings may be adjusted to reflect changes in network topography. A given source node, when computing alternate paths through the network, may preferentially select neighbors to perform alternate path calculations on historically higher scoring nodes before performing calculations on historically lower scoring nodes. Several different criteria may be used to stop the alternate path calculation process before considering all neighbors. The neighbors may be loop free neighbors or U-turn neighbors.
摘要翻译：替代路径计算过程可以在考虑了源节点的邻居中的一些并且不考虑其每个邻居的情况下终止，以减少执行备用路径计算所需的处理量。可以根据邻居历史上能够在网络上提供的备用路径的数量来排列邻居。历史成功或失败的影响可能随着时间的推移而降低，以便调整排名以反映网络地形的变化。给定的源节点在计算通过网络的备用路径时，可以优先选择邻居，以便在历史上较高的得分节点执行计算之前对历史上较高的评分节点执行备用路径计算。在考虑所有邻居之前，可以使用几种不同的标准来停止备用路径计算过程。邻居可以是无循环的邻居或U形圈邻居。

8. 发明申请

US20120314582A1 METHOD AND APPARATUS FOR SIMPLIFYING THE COMPUTATION OF ALTERNATE NETWORK PATHS 有权
标题翻译：用于简化备用网络计算的方法和装置
公开(公告)号：US20120314582A1
公开(公告)日：2012-12-13
申请号：US13595011
申请日：2012-08-27
申请人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
发明人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
IPC分类号： H04L12/28 , H04L12/26
CPC分类号： H04L45/22 , H04J3/14 , H04L12/66 , H04L45/02
摘要： An alternate path calculation process may be terminated after considering some of a source node's neighbors and without considering each of its neighbors, to reduce the amount of processing required to perform the alternate path calculations. The neighbors may be ranked according to the number of alternate paths that the neighbor has historically been able to provide on the network. The influence of historical success or failure may degrade over time so that the rankings may be adjusted to reflect changes in network topography. A given source node, when computing alternate paths through the network, may preferentially select neighbors to perform alternate path calculations on historically higher scoring nodes before performing calculations on historically lower scoring nodes. Several different criteria may be used to stop the alternate path calculation process before considering all neighbors. The neighbors may be loop free neighbors or U-turn neighbors.
摘要翻译：替代路径计算过程可以在考虑了源节点的邻居中的一些并且不考虑其每个邻居的情况下终止，以减少执行备用路径计算所需的处理量。可以根据邻居历史上能够在网络上提供的备用路径的数量来排列邻居。历史成功或失败的影响可能随着时间的推移而降低，以便调整排名以反映网络地形的变化。给定的源节点在计算通过网络的备用路径时，可以优先选择邻居，以便在历史上较高的得分节点执行计算之前对历史上较高的评分节点执行备用路径计算。在考虑所有邻居之前，可以使用几种不同的标准来停止备用路径计算过程。邻居可以是无循环的邻居或U形圈邻居。

9. 发明授权

US08254263B2 Method and apparatus for simplifying the computation of alternate network paths 失效
标题翻译：用于简化备用网络路径计算的方法和装置
公开(公告)号：US08254263B2
公开(公告)日：2012-08-28
申请号：US11410747
申请日：2006-04-25
申请人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
发明人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
IPC分类号： H04L12/26
CPC分类号： H04L45/22 , H04J3/14 , H04L12/66 , H04L45/02
摘要： An alternate path calculation process may be terminated after considering some of a source node's neighbors and without considering each of its neighbors, to reduce the amount of processing required to perform the alternate path calculations. The neighbors may be ranked according to the number of alternate paths that the neighbor has historically been able to provide on the network. The influence of historical success or failure may degrade over time so that the rankings may be adjusted to reflect changes in network topography. A given source node, when computing alternate paths through the network, may preferentially select neighbors to perform alternate path calculations on historically higher scoring nodes before performing calculations on historically lower scoring nodes. Several different criteria may be used to stop the alternate path calculation process before considering all neighbors. The neighbors may be loop free neighbors or U-turn neighbors.
摘要翻译：替代路径计算过程可以在考虑了源节点的邻居中的一些并且不考虑其每个邻居的情况下终止，以减少执行备用路径计算所需的处理量。可以根据邻居历史上能够在网络上提供的备用路径的数量来排列邻居。历史成功或失败的影响可能随着时间的推移而降低，以便调整排名以反映网络地形的变化。给定的源节点在计算通过网络的备用路径时，可以优先选择邻居，以便在历史上较高的得分节点执行计算之前对历史上较高的评分节点执行备用路径计算。在考虑所有邻居之前，可以使用几种不同的标准来停止备用路径计算过程。邻居可以是无循环的邻居或U形圈邻居。

10. 发明申请

US20070248016A1 Method and apparatus for simplifying the computation of alternate network paths 失效
标题翻译：用于简化备用网络路径计算的方法和装置
公开(公告)号：US20070248016A1
公开(公告)日：2007-10-25
申请号：US11410747
申请日：2006-04-25
申请人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
发明人： Peter Ashwood Smith , Hong Zhang , Guoli Yin
IPC分类号： H04J3/14
CPC分类号： H04L45/22 , H04J3/14 , H04L12/66 , H04L45/02
摘要： An alternate path calculation process may be terminated after considering some of a source node's neighbors and without considering each of its neighbors, to reduce the amount of processing required to perform the alternate path calculations. The neighbors may be ranked according to the number of alternate paths that the neighbor has historically been able to provide on the network. The influence of historical success or failure may degrade over time so that the rankings may be adjusted to reflect changes in network topography. A given source node, when computing alternate paths through the network, may preferentially select neighbors to perform alternate path calculations on historically higher scoring nodes before performing calculations on historically lower scoring nodes. Several different criteria may be used to stop the alternate path calculation process before considering all neighbors. The neighbors may be loop free neighbors or U-turn neighbors.
摘要翻译：替代路径计算过程可以在考虑了源节点的邻居中的一些并且不考虑其每个邻居的情况下终止，以减少执行备用路径计算所需的处理量。可以根据邻居历史上能够在网络上提供的备用路径的数量来排列邻居。历史成功或失败的影响可能随着时间的推移而降低，以便调整排名以反映网络地形的变化。给定的源节点在计算通过网络的备用路径时，可以优先选择邻居，以便在历史上较高的得分节点执行计算之前对历史上较高的评分节点执行备用路径计算。在考虑所有邻居之前，可以使用几种不同的标准来停止备用路径计算过程。邻居可以是无循环的邻居或U形圈邻居。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式