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

1. 发明授权

US07697505B2 Techniques for decreasing queries to discover routes in an interior gateway protocol 有权
标题翻译：用于减少查询以在内部网关协议中发现路由的技术
公开(公告)号：US07697505B2
公开(公告)日：2010-04-13
申请号：US11346781
申请日：2006-02-03
申请人： Russell White , Alvaro Retana , Donnie Savage
发明人： Russell White , Alvaro Retana , Donnie Savage
IPC分类号： H04L12/28
CPC分类号： H04L45/18 , H04L45/00 , H04L45/02 , H04L45/124 , H04L45/22 , H04L45/28
摘要： Techniques for recovering lost routes include receiving reported costs for transmitting data to a destination from neighboring nodes; and determining total costs as a sum of costs for transmitting data packets to the neighboring nodes and a corresponding reported cost. A selected neighboring node with a minimum total cost is determined as the next hop for the route to the destination. A feasible successor set of neighboring nodes which have reported costs less than the total cost of the selected neighboring node and excluding the selected neighboring node, and successor data about the feasible successor set, are determined. The successor data is sent to the neighboring nodes. A neighboring node that loses a route to the particular destination node is able to determine whether to query the sending node while recovering a lost route to the destination based on the successor data, thereby reducing network resource consumption.
摘要翻译：用于恢复丢失路由的技术包括从相邻节点接收向目的地发送数据的报告成本; 并将总成本确定为向相邻节点发送数据分组的成本的总和以及相应的报告成本。确定具有最小总成本的选择的相邻节点作为到目的地的路由的下一跳。确定报告成本小于所选择的相邻节点的总成本并且排除所选择的相邻节点的可行后继集合，以及关于可行后继集合的后继数据。后继数据被发送到相邻节点。丢失到特定目的地节点的路由的相邻节点能够基于后继数据来确定是否在向目的地恢复丢失路由的同时查询发送节点，从而减少网络资源消耗。

2. 发明申请

US20070183334A1 Techniques for decreasing queries to discover routes in an interior gateway protocol 有权
标题翻译：用于减少查询以在内部网关协议中发现路由的技术
公开(公告)号：US20070183334A1
公开(公告)日：2007-08-09
申请号：US11346781
申请日：2006-02-03
申请人： Russell White , Alvaro Retana , Donnie Savage
发明人： Russell White , Alvaro Retana , Donnie Savage
IPC分类号： H04J3/14 , H04L12/28
CPC分类号： H04L45/18 , H04L45/00 , H04L45/02 , H04L45/124 , H04L45/22 , H04L45/28
摘要： Techniques for recovering lost routes include receiving reported costs for transmitting data to a destination from neighboring nodes; and determining total costs as a sum of costs for transmitting data packets to the neighboring nodes and a corresponding reported cost. A selected neighboring node with a minimum total cost is determined as the next hop for the route to the destination. A feasible successor set of neighboring nodes which have reported costs less than the total cost of the selected neighboring node and excluding the selected neighboring node, and successor data about the feasible successor set, are determined. The successor data is sent to the neighboring nodes. A neighboring node that loses a route to the particular destination node is able to determine whether to query the sending node while recovering a lost route to the destination based on the successor data, thereby reducing network resource consumption.
摘要翻译：用于恢复丢失路由的技术包括从相邻节点接收向目的地发送数据的报告成本; 并将总成本确定为向相邻节点发送数据分组的成本的总和以及相应的报告成本。确定具有最小总成本的选择的相邻节点作为到目的地的路由的下一跳。确定报告成本小于所选择的相邻节点的总成本并且排除所选择的相邻节点的可行后继集合，以及关于可行后继集合的后继数据。后继数据被发送到相邻节点。丢失到特定目的地节点的路由的相邻节点能够基于后继数据来确定是否在向目的地恢复丢失路由的同时查询发送节点，从而减少网络资源消耗。

3. 发明授权

US07936667B2 Building backup tunnels for fast reroute in communications networks 有权
标题翻译：建立通信网络快速重路由的备份隧道
公开(公告)号：US07936667B2
公开(公告)日：2011-05-03
申请号：US12319298
申请日：2009-01-05
申请人： Donnie Savage , Alvaro Retana , Russ White
发明人： Donnie Savage , Alvaro Retana , Russ White
IPC分类号： H04L12/28 , H04L12/56 , G06F15/173
CPC分类号： H04L45/28 , H04L45/123 , H04L45/22
摘要： In one embodiment, a method includes identifying at a node, a destination for which a primary path is defined between the node and the destination, transmitting a request message to a neighbor node for routing information for a backup path between the node and the destination, receiving a reply message containing an address identifying the backup path, and building a backup tunnel to the address. The request message includes at least one node identified as a node to be avoided in the backup path and a request cost. An apparatus for building backup tunnels is also disclosed.
摘要翻译：在一个实施例中，一种方法包括在节点处标识在节点和目的地之间定义主路径的目的地，向邻居节点发送请求消息以路由用于节点和目的地之间的备份路径的信息，接收包含标识备份路径的地址的回复消息，并建立到该地址的备份隧道。请求消息包括被标识为在备份路径中要避免的节点的至少一个节点和请求成本。还公开了一种用于建立备用隧道的装置。

4. 发明申请

US20100172237A1 Building backup tunnels for fast reroute in communications networks 有权
标题翻译：建立通信网络快速重路由的备份隧道
公开(公告)号：US20100172237A1
公开(公告)日：2010-07-08
申请号：US12319298
申请日：2009-01-05
申请人： Donnie Savage , Alvaro Retana , Russ White
发明人： Donnie Savage , Alvaro Retana , Russ White
IPC分类号： G06F11/00
CPC分类号： H04L45/28 , H04L45/123 , H04L45/22
摘要： In one embodiment, a method includes identifying at a node, a destination for which a primary path is defined between the node and the destination, transmitting a request message to a neighbor node for routing information for a backup path between the node and the destination, receiving a reply message containing an address identifying the backup path, and building a backup tunnel to the address. The request message includes at least one node identified as a node to be avoided in the backup path and a request cost. An apparatus for building backup tunnels is also disclosed.
摘要翻译：在一个实施例中，一种方法包括在节点处标识在节点和目的地之间定义主路径的目的地，向邻居节点发送请求消息以路由用于节点和目的地之间的备份路径的信息，接收包含标识备份路径的地址的回复消息，并建立到该地址的备份隧道。请求消息包括被标识为在备份路径中要避免的节点的至少一个节点和请求成本。还公开了一种用于建立备用隧道的装置。

5. 发明申请

US20070237142A1 Techniques to support asymmetrical static/dynamic adjacency in routers 有权
标题翻译：支持路由器不对称静态/动态邻接的技术
公开(公告)号：US20070237142A1
公开(公告)日：2007-10-11
申请号：US11398825
申请日：2006-04-05
申请人： Yi Yang , Thuan Tran , Donnie Savage , Donald Slice , James Ng , Alvaro Retana
发明人： Yi Yang , Thuan Tran , Donnie Savage , Donald Slice , James Ng , Alvaro Retana
IPC分类号： H04L12/56
CPC分类号： H04L45/16 , H04L45/00 , H04L45/02
摘要： A static neighbor configured network device is configured with a static neighbor feature including a static neighbor list of network devices. The static neighbor configured network device is in a network segment that includes a dynamically configured network device. The static neighbor configured network device receives a multicast packet from the dynamically configured network device. It is determined if the dynamically configured network device is included in the static neighbor list of the static neighbor configured network device. The multicast packet is accepted if the dynamically configured network device is found in the neighbor list for the static neighbor configured network device. Also, adjacency for the static neighbor configured network device is not lost with any other currently adjacent network devices when the multicast packet is received.
摘要翻译：静态邻居配置的网络设备配置了静态邻居特性，包括网络设备的静态邻居列表。静态邻居配置的网络设备位于包含动态配置的网络设备的网段中。静态邻居配置的网络设备从动态配置的网络设备接收组播报文。确定动态配置的网络设备是否包含在静态邻居配置的网络设备的静态邻居列表中。如果在静态邻居配置的网络设备的邻居列表中找到动态配置的网络设备，则接收组播数据包。此外，当接收到多播分组时，静态邻居配置的网络设备的邻接不会与任何其他当前相邻的网络设备丢失。

6. 发明授权

US07768995B2 Techniques for one-way synchronization of routing information among intermediate nodes 有权
标题翻译：中间节点之间路由信息单向同步的技术
公开(公告)号：US07768995B2
公开(公告)日：2010-08-03
申请号：US11497224
申请日：2006-08-01
申请人： Yi Yang , Thuan Van Tran , Alvaro Retana , Donnie Van Savage , James Ng , Russell White
发明人： Yi Yang , Thuan Van Tran , Alvaro Retana , Donnie Van Savage , James Ng , Russell White
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/02 , H04L45/021
摘要： Techniques for synchronizing routing data include determining whether conditions are satisfied for one-way transfer with an adjacent router. If it is determined that conditions are satisfied for one-way transfer of routing table data with the adjacent router, then a refresh-notice message is sent from the initiating router to the adjacent router. The refresh-notice message includes data that indicates a particular direction for transfer of routing table data. If the particular direction is inbound, then a copy of an adjacent routing table is received without sending a copy of the initiating router's own routing table. If the particular direction is outbound, then a copy of the own routing table is sent without receiving a copy of the adjacent routing table.
摘要翻译：用于同步路由数据的技术包括确定是否满足用于与相邻路由器的单向传输的条件。如果确定与相邻路由器的路由表数据的单向传输满足条件，则从启动路由器向相邻路由器发送刷新通知消息。刷新通知消息包括指示用于传送路由表数据的特定方向的数据。如果特定方向是入站的，则接收相邻路由表的副本而不发送启动路由器自己的路由表的副本。如果特定方向是出站的，则发送自己的路由表的副本而不接收相邻路由表的副本。

7. 发明授权

US07515551B2 Techniques for reducing adjacencies in a link-state network routing protocol 有权
标题翻译：降低链路状态网络路由协议邻接度的技术
公开(公告)号：US07515551B2
公开(公告)日：2009-04-07
申请号：US11037964
申请日：2005-01-18
申请人： David Anthony Cook , Russell White , Alvaro Retana , Yi Yang , Madhavi Chandra , Abhay Roy
发明人： David Anthony Cook , Russell White , Alvaro Retana , Yi Yang , Madhavi Chandra , Abhay Roy
IPC分类号： H04L12/56 , H04J1/16
CPC分类号： H04L45/26 , H04L45/02
摘要： A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.
摘要翻译：通过在路由器处建立链路状态数据来呈现一种通过网络支持数据分组的最短路径优先（SPF）路由的方法和装置。链路状态数据表示路由器与不同路由器之间的直接链路，并与不同节点建立邻接关系。初始链路状态数据存储在第一路由器。在存储初始链路状态数据之后，在第一路由器处接收到hello消息。 hello消息指示与一个网段上的不同第二路由器的直接连接。基于初始链路状态数据，确定与第二路由器建立邻接关系是否足够有价值。如果没有，则与第二路由器不响应于hello消息建立邻接关系。基于在第一路由器上存储的链路状态数据中指示的一个或多个相邻关系来确定穿过网络的数据分组的最短路径第一路由。

8. 发明申请

US20080130500A1 Automatic Overlapping Areas that Flood Routing Information 有权
标题翻译：自动重叠区域洪水路由信息
公开(公告)号：US20080130500A1
公开(公告)日：2008-06-05
申请号：US11565608
申请日：2006-11-30
申请人： Alvaro Retana , Russell White , David Anthony Cook , Yi Yang , Madhavi Chandra
发明人： Alvaro Retana , Russell White , David Anthony Cook , Yi Yang , Madhavi Chandra
IPC分类号： H04L12/56 , G08C15/00
CPC分类号： H04L12/66
摘要： In one embodiment, a method includes receiving on a first communication link at a local router all routing information at a certain level of detail for each router of multiple routers communicating in a first flooding domain. A measure of distance is determined from a particular router in the first flooding domain to the local router. It is determined whether the measure of distance exceeds a threshold. If the measure of distance exceeds the threshold, then summary routing information with less than the certain level of detail is determined for the particular router. Also, certain routing information is sent over a different second communication link at the local router. The certain routing information includes the summary information for the particular router, and all routing information at the certain level of detail for a subset of routers communicating in the first flooding domain, which subset excludes the particular router.
摘要翻译：在一个实施例中，一种方法包括在本地路由器的第一通信链路上以在第一泛洪域中通信的多个路由器的每个路由器的一定详细级别接收所有路由信息。从第一个洪泛域中的特定路由器到本地路由器确定距离的度量。确定距离测量是否超过阈值。如果距离测量值超过阈值，则确定特定路由器具有小于特定级别细节的汇总路由信息。而且，通过本地路由器上的不同的第二通信链路发送某些路由信息。某些路由信息包括特定路由器的摘要信息，以及在第一洪泛域中通信的路由子集的特定级别的所有路由信息，该子集排除特定路由器。

9. 发明申请

US20060159082A1 Techniques for reducing adjacencies in a link-state network routing protocol 有权
公开(公告)号：US20060159082A1
公开(公告)日：2006-07-20
申请号：US11037964
申请日：2005-01-18
申请人： David Cook , Russell White , Alvaro Retana , Yi Yang , Madhavi Chandra , Abhay Roy
发明人： David Cook , Russell White , Alvaro Retana , Yi Yang , Madhavi Chandra , Abhay Roy
IPC分类号： H04L12/56 , H04L12/28
CPC分类号： H04L45/26 , H04L45/02
摘要： A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.

10. 发明申请

US20060007865A1 Arrangement for preventing count-to-infinity in flooding distance vector routing protocols 有权
标题翻译：用于防止洪泛距离矢量路由协议中的无穷大的排列
公开(公告)号：US20060007865A1
公开(公告)日：2006-01-12
申请号：US10887919
申请日：2004-07-12
申请人： Russell White , David Cook , Alvaro Retana
发明人： Russell White , David Cook , Alvaro Retana
IPC分类号： H04L12/26 , H04L12/28
CPC分类号： H04W40/246 , H04L45/02 , H04L45/32 , H04L45/54 , H04W40/02 , H04W84/18
摘要： Each router in a network is configured for generating router advertisement messages according to a flooding distance vector routing protocol. Each router advertisement message output according to the flooding distance vector routing protocol includes reachability information for at least one destination, and an originating router identifier indicating a router having originated the reachability information. If any router receiving the router advertisement message detects a match between the originating router identifier and the corresponding assigned router identifier, the received router advertisement message is disregarded during calculation of the best paths from the network. If the originating router identifier identifies another router, the router floods the received router advertisement message to other ports, and output its own router advertisement message based on the received router advertisement message and that specifies the originating router identifier from the received router advertisement message.
摘要翻译：网络中的每个路由器被配置为根据洪泛距离向量路由协议来生成路由器通告消息。根据洪泛距离向量路由协议输出的每个路由器通告消息包括至少一个目的地的可达性信息，以及指示已经发起可达性信息的路由器的始发路由器标识符。如果接收到路由器通告消息的任何路由器检测到始发路由器标识符和对应的分配的路由器标识符之间的匹配，则在从网络计算最佳路径期间忽略接收到的路由器通告消息。如果始发路由器标识符识别另一个路由器，则路由器将接收的路由器通告消息洪泛到其他端口，并根据接收到的路由器通告消息输出自己的路由器通告消息，并从接收到的路由器通告消息中指定始发路由器标识符。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式