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

1. 发明申请

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.
摘要翻译：静态邻居配置的网络设备配置了静态邻居特性，包括网络设备的静态邻居列表。静态邻居配置的网络设备位于包含动态配置的网络设备的网段中。静态邻居配置的网络设备从动态配置的网络设备接收组播报文。确定动态配置的网络设备是否包含在静态邻居配置的网络设备的静态邻居列表中。如果在静态邻居配置的网络设备的邻居列表中找到动态配置的网络设备，则接收组播数据包。此外，当接收到多播分组时，静态邻居配置的网络设备的邻接不会与任何其他当前相邻的网络设备丢失。

2. 发明申请

US20070237095A1 System and method for improving network performance and security by controlling topology information 有权
标题翻译：通过控制拓扑信息提高网络性能和安全性的系统和方法
公开(公告)号：US20070237095A1
公开(公告)日：2007-10-11
申请号：US11400479
申请日：2006-04-05
申请人： Yi Yang , Donnie Savage , Timothy Gage , Thuan Tran , James Ng
发明人： Yi Yang , Donnie Savage , Timothy Gage , Thuan Tran , James Ng
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/54 , H04L45/02
摘要： A system for optimizing the performance of a network. In an illustrative embodiment, the system includes a memory containing one or more data structures data structures. A first module determines transit-only information. A second module selectively omits the transit-only information from the one or more data structures. In a more specific embodiment, the one or more data structures include one or more tables. The transit-only information includes interface Internet Protocol (IP) addresses associated with network interfaces that are transit-only interfaces. The route information may include network topology information. The one or more tables may include a network topology table. Plural routers positioned in the network incorporate one or more instances of the system. The routers may employ one or more routing protocols, such as include Enhanced Interior Gateway Routing Protocol (EIGRP) or Routing Information Protocol (RIP).
摘要翻译：用于优化网络性能的系统。在说明性实施例中，系统包括包含一个或多个数据结构数据结构的存储器。第一个模块确定只传输信息。第二模块选择性地省略来自一个或多个数据结构的仅传输信息。在更具体的实施例中，一个或多个数据结构包括一个或多个表。仅传输信息包括与作为仅传输接口的网络接口相关联的接口因特网协议（IP）地址。路由信息可以包括网络拓扑信息。一个或多个表可以包括网络拓扑表。位于网络中的多个路由器包含系统的一个或多个实例。路由器可以采用一个或多个路由协议，诸如包括增强型内部网关路由协议（EIGRP）或路由信息协议（RIP）。

3. 发明申请

US20070192451A1 Techniques for distributing information using multicast subsets 有权
标题翻译：使用多播子集分发信息的技术
公开(公告)号：US20070192451A1
公开(公告)日：2007-08-16
申请号：US11353544
申请日：2006-02-14
申请人： Thuan Tran , Yi Yang , Liem Nguyen , Russell White , Donnie Savage
发明人： Thuan Tran , Yi Yang , Liem Nguyen , Russell White , Donnie Savage
IPC分类号： G06F15/173
CPC分类号： H04L45/16 , H04L12/1836 , H04L12/1868 , H04L12/1886 , H04L45/02 , H04L45/245
摘要： Techniques for sending data in a packet-switched communications network include determining multiple subsets of adjacent network nodes of the network. The adjacent network nodes communicate without intervening network nodes with a particular network node through an interface on the particular network node. Each subset includes multiple adjacent network nodes. Subset definition data is sent through the interface. The subset definition data indicates which adjacent network nodes belong to which subset. Data for fewer than all adjacent network nodes in all subsets are sent by including, in a multicast data packet sent over the interface with a multicast destination address, subset identifier data that indicates a particular subset. When such data is received by a node, it is discarded unless the subset identifier matches the receiving node's subset identifier. Among other effects, this allows routing messages to be more efficiently sent to better performing neighboring network nodes.
摘要翻译：在分组交换通信网络中发送数据的技术包括确定网络的相邻网络节点的多个子集。相邻的网络节点通过特定网络节点上的接口与特定的网络节点通信而无需中间网络节点。每个子集包括多个相邻的网络节点。子集定义数据通过接口发送。子集定义数据指示哪些相邻网络节点属于哪个子集。通过在通过接口发送的多播数据分组中包括指示特定子集的子集标识符数据，包括在所有子集中比所有相邻网络节点少的数据。当节点接收到这样的数据时，除非子集标识符与接收节点的子集标识符相匹配，否则丢弃该数据。除此之外，这使得路由消息更有效地发送到更好地执行的相邻网络节点。

4. 发明授权

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.
摘要翻译：在一个实施例中，一种方法包括在节点处标识在节点和目的地之间定义主路径的目的地，向邻居节点发送请求消息以路由用于节点和目的地之间的备份路径的信息，接收包含标识备份路径的地址的回复消息，并建立到该地址的备份隧道。请求消息包括被标识为在备份路径中要避免的节点的至少一个节点和请求成本。还公开了一种用于建立备用隧道的装置。

5. 发明授权

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.
摘要翻译：用于恢复丢失路由的技术包括从相邻节点接收向目的地发送数据的报告成本; 并将总成本确定为向相邻节点发送数据分组的成本的总和以及相应的报告成本。确定具有最小总成本的选择的相邻节点作为到目的地的路由的下一跳。确定报告成本小于所选择的相邻节点的总成本并且排除所选择的相邻节点的可行后继集合，以及关于可行后继集合的后继数据。后继数据被发送到相邻节点。丢失到特定目的地节点的路由的相邻节点能够基于后继数据来确定是否在向目的地恢复丢失路由的同时查询发送节点，从而减少网络资源消耗。

6. 发明申请

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.
摘要翻译：在一个实施例中，一种方法包括在节点处标识在节点和目的地之间定义主路径的目的地，向邻居节点发送请求消息以路由用于节点和目的地之间的备份路径的信息，接收包含标识备份路径的地址的回复消息，并建立到该地址的备份隧道。请求消息包括被标识为在备份路径中要避免的节点的至少一个节点和请求成本。还公开了一种用于建立备用隧道的装置。

7. 发明申请

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.
摘要翻译：用于恢复丢失路由的技术包括从相邻节点接收向目的地发送数据的报告成本; 并将总成本确定为向相邻节点发送数据分组的成本的总和以及相应的报告成本。确定具有最小总成本的选择的相邻节点作为到目的地的路由的下一跳。确定报告成本小于所选择的相邻节点的总成本并且排除所选择的相邻节点的可行后继集合，以及关于可行后继集合的后继数据。后继数据被发送到相邻节点。丢失到特定目的地节点的路由的相邻节点能够基于后继数据来确定是否在向目的地恢复丢失路由的同时查询发送节点，从而减少网络资源消耗。

8. 发明申请

US20050195835A1 Router configured for outputting update messages specifying a detected attribute change of a connected active path according to a prescribed routing protocol 有权
标题翻译：路由器被配置为根据规定的路由协议输出指定连接的活动路径的检测到的属性改变的更新消息
公开(公告)号：US20050195835A1
公开(公告)日：2005-09-08
申请号：US10790204
申请日：2004-03-02
申请人： Donnie Savage , Donald Slice , Roy Brooks , Matthew Birkner
发明人： Donnie Savage , Donald Slice , Roy Brooks , Matthew Birkner
IPC分类号： H04L12/56
CPC分类号： H04L45/28 , H04L43/00 , H04L45/02 , H04L45/12 , H04L45/124 , H04L45/125 , H04L45/18 , H04L45/22 , H04L45/245 , Y02D50/30
摘要： A first router is configured for monitoring prescribed attributes of an active path connected to the first router, and supplying an update message to a second router, according to a prescribed routing protocol such as Enhanced Interior Gateway Routing Protocol (EIGRP), that specifies a detected change by the first router in at least one of the prescribed attributes of the connected active path. Hence, the second router, in response to receiving the update message, can update an internal topology table based on the detected change in the active path connected to the first router, and selectively adjust an internal routing table based on the detected change relative to queuing policies for prescribed data flows.
摘要翻译：第一路由器被配置为用于监视连接到第一路由器的活动路径的规定属性，并且根据规定的路由协议（诸如增强型内部网关路由协议（EIGRP））向第二路由器提供更新消息，其指定检测到的由连接的主动路径的规定属性中的至少一个更改第一路由器。因此，第二路由器响应于接收到更新消息，可以基于检测到的连接到第一路由器的活动路径的变化来更新内部拓扑表，并且基于检测到的相对于排队的改变来选择性地调整内部路由表规定数据流的政策。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式