会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 13. 发明申请
    • Techniques for determining network nodes to represent, multiple subnetworks for a routing protocol
    • 用于确定网络节点来表示路由协议的多个子网络的技术
    • US20060159095A1
    • 2006-07-20
    • US11036728
    • 2005-01-14
    • David CookRussell WhiteAlvaro Retana
    • David CookRussell WhiteAlvaro Retana
    • H04L12/28
    • H04L45/586H04L45/04H04L45/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.
    • 提出了一种方法和装置,用于确定网络节点,用于聚合用于通过网络路由数据分组的路由信息​​中的地址。 接收到链接数据和可达性数据。 链路数据表示网络的多个候选路由器和不同路由器或网段之间的每个候选路由器之间的直接链路。 可达性数据表示在链接数据中描述的每个链路上可以达到的一组或多个连续网络地址的集合。 基于链路数据和可达性数据,在候选路由器处确定连续网络地址的可能聚合的度量。 基于每个候选路由器可能聚合的测量,在候选路由器之间确定在网络中的路由器之间发送的路由信息​​中聚合地址的优选路由器。
    • 14. 发明申请
    • Arrangement for preventing count-to-infinity in flooding distance vector routing protocols
    • 用于防止洪泛距离矢量路由协议中的无穷大的排列
    • US20060007865A1
    • 2006-01-12
    • US10887919
    • 2004-07-12
    • Russell WhiteDavid CookAlvaro Retana
    • Russell WhiteDavid CookAlvaro Retana
    • H04L12/26H04L12/28
    • H04W40/246H04L45/02H04L45/32H04L45/54H04W40/02H04W84/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.
    • 网络中的每个路由器被配置为根据洪泛距离向量路由协议来生成路由器通告消息。 根据洪泛距离向量路由协议输出的每个路由器通告消息包括至少一个目的地的可达性信息,以及指示已经发起可达性信息的路由器的始发路由器标识符。 如果接收到路由器通告消息的任何路由器检测到始发路由器标识符和对应的分配的路由器标识符之间的匹配,则在从网络计算最佳路径期间忽略接收到的路由器通告消息。 如果始发路由器标识符识别另一个路由器,则路由器将接收的路由器通告消息洪泛到其他端口,并根据接收到的路由器通告消息输出自己的路由器通告消息,并从接收到的路由器通告消息中指定始发路由器标识符。
    • 15. 发明授权
    • Techniques for decreasing queries to discover routes in an interior gateway protocol
    • 用于减少查询以在内部网关协议中发现路由的技术
    • US07697505B2
    • 2010-04-13
    • US11346781
    • 2006-02-03
    • Russell WhiteAlvaro RetanaDonnie Savage
    • Russell WhiteAlvaro RetanaDonnie Savage
    • H04L12/28
    • H04L45/18H04L45/00H04L45/02H04L45/124H04L45/22H04L45/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.
    • 用于恢复丢失路由的技术包括从相邻节点接收向目的地发送数据的报告成本; 并将总成本确定为向相邻节点发送数据分组的成本的总和以及相应的报告成本。 确定具有最小总成本的选择的相邻节点作为到目的地的路由的下一跳。 确定报告成本小于所选择的相邻节点的总成本并且排除所选择的相邻节点的可行后继集合,以及关于可行后继集合的后继数据。 后继数据被发送到相邻节点。 丢失到特定目的地节点的路由的相邻节点能够基于后继数据来确定是否在向目的地恢复丢失路由的同时查询发送节点,从而减少网络资源消耗。
    • 16. 发明申请
    • Method and Apparatus for Automatic Sub-Division of Areas that Flood Routing Information
    • 洪水路由信息区域自动分区方法与装置
    • US20100008231A1
    • 2010-01-14
    • US12560890
    • 2009-09-16
    • Alvaro RetanaRussell White
    • Alvaro RetanaRussell White
    • G06F11/00
    • H04L45/32H04L45/04H04L45/20H04W40/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的汇总路由信息的类型数据。 随着移动自组织网络规模的扩大,这些技术允许自动优化共享路由信息域的扩展。
    • 17. 发明授权
    • Method and apparatus for automatic sub-division of areas that flood routing information
    • 自动划分洪水路由信息区域的方法和装置
    • US07609672B2
    • 2009-10-27
    • US11513099
    • 2006-08-29
    • Alvaro RetanaRussell White
    • Alvaro RetanaRussell White
    • H04W4/00
    • H04L45/32H04L45/04H04L45/20H04W40/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的汇总路由信息的类型数据。 随着移动自组织网络规模的扩大,这些技术允许自动优化共享路由信息域的扩展。
    • 18. 发明授权
    • Method and apparatus for automatic sub-division of areas that flood routing information
    • 自动划分洪水路由信息区域的方法和装置
    • US08699410B2
    • 2014-04-15
    • US12560890
    • 2009-09-16
    • Alvaro RetanaRussell White
    • Alvaro RetanaRussell White
    • H04W4/00
    • H04L45/32H04L45/04H04L45/20H04W40/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的汇总路由信息的类型数据。 随着移动自组织网络规模的扩大,这些技术允许自动优化共享路由信息域的扩展。
    • 19. 发明授权
    • Techniques for detecting loop-free paths that cross routing information boundaries
    • 用于检测交叉路由信息边界的无环路径的技术
    • US07889655B2
    • 2011-02-15
    • US11333221
    • 2006-01-17
    • Alvaro RetanaRussell WhiteAbhay RoySina Mirtorabi
    • Alvaro RetanaRussell WhiteAbhay RoySina Mirtorabi
    • G06F11/07
    • H04L45/18H04L45/00H04L45/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.
    • 用于检测跨越路由信息边界的路由中的循环的技术包括:在边界的一侧上的第一边缘节点处接收控制消息,所述控制消息连接到边界的另一侧上的不同的第二边缘节点。 控制消息指示可从第一边缘节点到达的特定节点的特定网络地址。 确定识别器数据,其指示第一集合中的节点是否可以到达第一边缘节点而不离开第一集合。 广告消息从第一边缘节点发送到第二边缘节点,其包括指示特定网络地址和识别器数据的路由数据。 基于识别器数据,第一集合中的测试边缘节点可以确定是否存在包括内部路径和到第一边缘节点的外部路径的环路。