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

21. 发明授权

US08009591B2 Automatic overlapping areas that flood routing information 有权
标题翻译：自动重叠区域，洪泛路由信息
公开(公告)号：US08009591B2
公开(公告)日：2011-08-30
申请号：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/28
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.
摘要翻译：在一个实施例中，一种方法包括在本地路由器的第一通信链路上以在第一泛洪域中通信的多个路由器的每个路由器的一定详细级别接收所有路由信息。从第一个洪泛域中的特定路由器到本地路由器确定距离的度量。确定距离测量是否超过阈值。如果距离测量值超过阈值，则确定特定路由器具有小于特定级别细节的汇总路由信息。而且，通过本地路由器上的不同的第二通信链路发送某些路由信息。某些路由信息包括特定路由器的摘要信息，以及在第一洪泛域中通信的路由子集的特定级别的所有路由信息，该子集排除特定路由器。

22. 发明授权

US07978612B2 Two-hop relay for reducing distance vector routing information 有权
标题翻译：用于减少距离矢量路由信息的两跳中继
公开(公告)号：US07978612B2
公开(公告)日：2011-07-12
申请号：US12250446
申请日：2008-10-13
申请人： Alvaro Retana , Stanley Ratliff , Donnie Van Savage , Mihail L. Sichitiu , Russell White
发明人： Alvaro Retana , Stanley Ratliff , Donnie Van Savage , Mihail L. Sichitiu , Russell White
IPC分类号： H04L12/26 , H04L12/56 , G06F15/173
CPC分类号： H04Q3/66 , H04L45/02 , H04L45/123 , H04Q2213/13098 , H04Q2213/13141 , H04Q2213/13196 , H04Q2213/13352 , H04Q2213/13353 , H04Q2213/13389 , H04W40/24
摘要： In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol.
摘要翻译：在一个实施例中，使用二跳中继的方法包括从第一邻居接收距离矢量路由协议的更新消息。更新消息被发送到不同的邻居。通常，首先确定接收节点是否是协议中的第一邻居的中继节点。中继节点是优选地从第一邻居更新特定节点两跳的节点。在另一个实施例中，用作二跳中继的方法包括从每个邻居接收包括指示与邻居直接通信的节点的邻居数据的第一消息。确定少于所有邻居的中继集。来自第一节点的每个节点两跳仅使用邻居的中继集更新。继电器组在协议的第二个消息中发送。

23. 发明申请

US20100091823A1 Two-hop Relay for Reducing Distance Vector Routing Information 有权
标题翻译：用于减少距离矢量路由信息的两跳中继
公开(公告)号：US20100091823A1
公开(公告)日：2010-04-15
申请号：US12250446
申请日：2008-10-13
申请人： Alvaro Retana , Stanley Ratliff , Donnie Van Savage , Mihail L. Sichitiu , Russell White
发明人： Alvaro Retana , Stanley Ratliff , Donnie Van Savage , Mihail L. Sichitiu , Russell White
IPC分类号： H04B3/36
CPC分类号： H04Q3/66 , H04L45/02 , H04L45/123 , H04Q2213/13098 , H04Q2213/13141 , H04Q2213/13196 , H04Q2213/13352 , H04Q2213/13353 , H04Q2213/13389 , H04W40/24
摘要： In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol.
摘要翻译：在一个实施例中，使用二跳中继的方法包括从第一邻居接收距离矢量路由协议的更新消息。更新消息被发送到不同的邻居。通常，首先确定接收节点是否是协议中的第一邻居的中继节点。中继节点是优选地从第一邻居更新特定节点两跳的节点。在另一个实施例中，用作二跳中继的方法包括从每个邻居接收包括指示与邻居直接通信的节点的邻居数据的第一消息。确定少于所有邻居的中继集。来自第一节点的每个节点两跳仅使用邻居的中继集更新。继电器组在协议的第二个消息中发送。

24. 发明申请

US20080247392A1 Validating Internal Routing Protocol Information Passed Through an External Routing Protocol 有权
标题翻译：验证通过外部路由协议传递的内部路由协议信息
公开(公告)号：US20080247392A1
公开(公告)日：2008-10-09
申请号：US11696708
申请日：2007-04-04
申请人： Russell White , James Ng , Alvaro Retana , Brian Weis
发明人： Russell White , James Ng , Alvaro Retana , Brian Weis
IPC分类号： H04L12/56
CPC分类号： H04L45/50 , H04L45/04
摘要： In one embodiment, a method includes receiving authenticated site data that includes site ID data and address data. The site ID data indicates a unique site ID for each site among multiple sites for a first network that uses an internal routing protocol. Multiple edge sites of those sites are separate from each other and connected to a second network that is under separate administrative control of at least one different party. The address data indicates network addresses associated with each site of the plurality of sites. An external routing protocol message is discounted based on the authenticated site data.
摘要翻译：在一个实施例中，一种方法包括接收包括站点ID数据和地址数据的认证站点数据。站点ID数据指示使用内部路由协议的第一个网络的多个站点中每个站点的唯一站点ID。这些站点的多个边缘站点彼此分离并连接到处于至少一个不同方的单独管理控制下的第二网络。地址数据指示与多个站点中的每个站点相关联的网络地址。外部路由协议消息基于认证的站点数据进行打折。

25. 发明申请

US20080056157A1 Method and apparatus for automatic sub-division of areas that flood routing information 有权
标题翻译：自动划分洪水路由信息区域的方法和装置
公开(公告)号：US20080056157A1
公开(公告)日：2008-03-06
申请号：US11513099
申请日：2006-08-29
申请人： Alvaro Retana , Russell White
发明人： Alvaro Retana , Russell White
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/32 , H04L45/04 , H04L45/20 , H04W40/248
摘要： Techniques for sharing routing information over a network include determining whether the scale of a flooding domain exceeds a threshold. If so, then a router announcement message is sent over a particular link. The message indicates the local router is a flooding domain border router (FDBR). Summary routing information is determined with less than a certain level of detail used in the flooding domain for routers connected to the local router through links different from the particular link. The summary routing information is sent over the particular link in a link state message that includes type data that indicates summary routing information that crosses a FDBR. These techniques allow automatic favorable scaling of domains of shared routing information as the size of a mobile ad hoc network grows.
摘要翻译：通过网络共享路由信息的技术包括确定洪泛域的规模是否超过阈值。如果是，则通过特定链路发送路由器通告消息。该消息表示本地路由器是泛洪域边界路由器（FDBR）。对于通过不同于特定链路的链路连接到本地路由器的路由器的洪泛域中，小于一定程度的细节来确定汇总路由信息。汇总路由信息通过链路状态消息中的特定链路发送，该链路状态消息包括指示跨越FDBR的汇总路由信息的类型数据。随着移动自组织网络规模的扩大，这些技术允许自动优化共享路由信息域的扩展。

26. 发明申请

US20070165532A1 Techniques for detecting loop-free paths that cross routing information boundaries 有权
标题翻译：用于检测交叉路由信息边界的无环路径的技术
公开(公告)号：US20070165532A1
公开(公告)日：2007-07-19
申请号：US11333221
申请日：2006-01-17
申请人： Alvaro Retana , Russell White , Abhay Roy , Sina Mirtorabi
发明人： Alvaro Retana , Russell White , Abhay Roy , Sina Mirtorabi
IPC分类号： H04J1/16 , H04L12/56 , H04L12/28 , H04J3/14 , H04L12/26
CPC分类号： H04L45/18 , H04L45/00 , H04L45/04
摘要： Techniques for detecting loops in routes that cross route information boundaries include receiving a control message at a first edge node on one side of the boundary that is connected to a different second edge node on another side of the boundary. The control message indicates a particular network address of a particular node that is reachable from the first edge node. Distinguisher data is determined that indicates if a node in the first collection can reach the first edge node without leaving the first collection. An advertising message is sent from the first edge node to the second edge node that includes route data that indicates the particular network address and the distinguisher data. Based on the distinguisher data, a testing edge node in the first collection can determine whether there is a loop comprising both an internal path and an external path to the first edge node.
摘要翻译：用于检测跨越路由信息边界的路由中的循环的技术包括：在边界的一侧上的第一边缘节点处接收控制消息，所述控制消息连接到边界的另一侧上的不同的第二边缘节点。控制消息指示可从第一边缘节点到达的特定节点的特定网络地址。确定识别器数据，其指示第一集合中的节点是否可以到达第一边缘节点而不离开第一集合。广告消息从第一边缘节点发送到第二边缘节点，其包括指示特定网络地址和识别器数据的路由数据。基于识别器数据，第一集合中的测试边缘节点可以确定是否存在包括内部路径和到第一边缘节点的外部路径的环路。

27. 发明授权

US07733798B2 Evaluation of network data aggregation 有权
标题翻译：评估网络数据聚合
公开(公告)号：US07733798B2
公开(公告)日：2010-06-08
申请号：US11846072
申请日：2007-08-28
申请人： Russell White , Alvaro Retana , Bruce Pinsky , John Cavanaugh , Mosaddaq Turabi
发明人： Russell White , Alvaro Retana , Bruce Pinsky , John Cavanaugh , Mosaddaq Turabi
IPC分类号： H04L12/26
CPC分类号： H04L45/04 , H04L45/02 , H04L45/245 , Y02D50/30
摘要： In one embodiment, a method includes receiving topology data that indicates multiple communication links and multiple intermediate network nodes in communication based on the communication links. The intermediate network nodes include multiple leaf nodes that terminate communications and multiple transit nodes that facilitate the passage of information between leaf nodes. Aggregation point data is also received, which indicates all aggregation points on the intermediate network nodes. An aggregation point is an interface between a network node and a communication link, through which is output data that is a combination of data received through multiple different interfaces upstream of the interface. A set of paths is determined for which each path in the set connects a different pair of leaf nodes. A measure of aggregation is determined based on a number of aggregated paths of the set of paths. An aggregated path passes through an aggregation point.
摘要翻译：在一个实施例中，一种方法包括基于通信链路接收指示通信中的多个通信链路和多个中间网络节点的拓扑数据。中间网络节点包括终止通信的多个叶节点和便于叶节点之间的信息通过的多个传输节点。还收到聚合点数据，表示中间网络节点上的所有聚合点。聚合点是网络节点和通信链路之间的接口，通过该接口输出作为通过接口上游的多个不同接口接收的数据的组合的输出数据。确定一组路径，该集合中的每个路径连接不同的一对叶节点。基于路径集合的聚合路径的数量来确定聚合度量。聚合路径通过聚合点。

28. 发明授权

US07525949B1 Forwarding for network devices 有权
标题翻译：转发网络设备
公开(公告)号：US07525949B1
公开(公告)日：2009-04-28
申请号：US10140613
申请日：2002-05-07
申请人： Sanjeev Rampal , Alvaro Retana , Russell White , Jimmy Ervin , Hoe Trinh
发明人： Sanjeev Rampal , Alvaro Retana , Russell White , Jimmy Ervin , Hoe Trinh
IPC分类号： H04L12/66
CPC分类号： H04L45/54 , H04L45/02 , H04L45/66
摘要： Techniques for implementing forwarding in network devices are provided. Proxy addresses are used in place of next hop addresses so that a large routing table is not required. Pairs of proxy IP and MAC addresses can be used to allow this optimization to occur completely transparent to any other device in the network. One or more smaller tables can be utilized in place of a large routing table to more efficiently implement forwarding. Additionally, the technique can be utilized without requiring modification of other hardware devices in the network.
摘要翻译：提供了在网络设备中实现转发的技术。代理地址用于代替下一跳地址，因此不需要大的路由表。可以使用一对代理IP和MAC地址来实现对网络中任何其他设备的完美透明化。可以使用一个或多个较小的表来代替大的路由表以更有效地实现转发。此外，可以利用该技术，而不需要修改网络中的其他硬件设备。

29. 发明授权

US07333501B2 Techniques for determining network nodes to represent, multiple subnetworks for a routing protocol 有权
标题翻译：用于确定网络节点来表示路由协议的多个子网络的技术
公开(公告)号：US07333501B2
公开(公告)日：2008-02-19
申请号：US11036728
申请日：2005-01-14
申请人： David Anthony Cook , Russell White , Alvaro Retana
发明人： David Anthony Cook , Russell White , Alvaro Retana
IPC分类号： H04L12/28
CPC分类号： H04L45/586 , H04L45/04 , H04L45/46
摘要： A method and apparatus are presented for determining network nodes for aggregating addresses in routing information used for routing data packets over a network. Link data and reachability data are received. Link data indicates direct links between each of multiple candidate routers of a network and a different router or a network segment. Reachability data indicates a set of one or more contiguous network addresses that can be reached on each link described in the link data. A measure of possible aggregation of contiguous network addresses is determined at the candidate routers based on the link data and the reachability data. A preferred router to aggregate addresses in routing information sent between routers in the network is determined among the candidate routers based on the measure of possible aggregation at each candidate router.
摘要翻译：提出了一种方法和装置，用于确定网络节点，用于聚合用于通过网络路由数据分组的路由信息中的地址。接收到链接数据和可达性数据。链路数据表示网络的多个候选路由器和不同路由器或网段之间的每个候选路由器之间的直接链路。可达性数据表示在链接数据中描述的每个链路上可以达到的一组或多个连续网络地址的集合。基于链路数据和可达性数据，在候选路由器处确定连续网络地址的可能聚合的度量。基于每个候选路由器可能聚合的测量，在候选路由器之间确定在网络中的路由器之间发送的路由信息中聚合地址的优选路由器。

30. 发明申请

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

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式