Techniques for one-way synchronization of routing information among intermediate nodes
    11.
    发明申请
    Techniques for one-way synchronization of routing information among intermediate nodes 有权
    中间节点之间路由信息单向同步的技术

    公开(公告)号:US20080031236A1

    公开(公告)日:2008-02-07

    申请号:US11497224

    申请日:2006-08-01

    IPC分类号: 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.

    摘要翻译: 用于同步路由数据的技术包括确定是否满足用于与相邻路由器的单向传输的条件。 如果确定与相邻路由器的路由表数据的单向传输满足条件,则从启动路由器向相邻路由器发送刷新通知消息。 刷新通知消息包括指示用于传送路由表数据的特定方向的数据。 如果特定方向是入站的,则接收相邻路由表的副本而不发送启动路由器自己的路由表的副本。 如果特定方向是出站的,则发送自己的路由表的副本而不接收相邻路由表的副本。

    Fast re-routing in distance vector routing protocol networks
    12.
    发明授权
    Fast re-routing in distance vector routing protocol networks 有权
    在距离矢量路由协议网络中快速重路由

    公开(公告)号:US07940776B2

    公开(公告)日:2011-05-10

    申请号:US11762547

    申请日:2007-06-13

    IPC分类号: H04L12/56

    摘要: In one embodiment, a method includes sending an adjacency discovery message 1 from a local router over a direct link to a first neighbor router. An adjacency discovery message is not forwarded and includes a repair address. The repair address indicates the local router but is not advertised as reachable over the direct link. An outbound routing update message is sent to a different second neighbor router. The outbound routing update message is forwarded and includes reachability data that indicates the repair address is reachable. A payload of an inbound tunneled packet received at the local router and directed to the repair address is forwarded based on a destination indicated in the payload.

    摘要翻译: 在一个实施例中,一种方法包括通过到第一邻居路由器的直接链路从本地路由器发送邻接发现消息1。 邻接发现消息不被转发并且包括修复地址。 修复地址指示本地路由器,但不通过直接链路通告。 出站路由更新消息被发送到不同的第二邻居路由器。 出站路由更新消息被转发,并包括指示修复地址可达的可达性数据。 基于有效载荷中指示的目的地,转发在本地路由器处接收并定向到修复地址的入站隧道分组的有效载荷。

    Fast Re-routing in Distance Vector Routing Protocol Networks
    13.
    发明申请
    Fast Re-routing in Distance Vector Routing Protocol Networks 有权
    距离矢量路由协议网络中的快速重路由

    公开(公告)号:US20080310433A1

    公开(公告)日:2008-12-18

    申请号:US11762547

    申请日:2007-06-13

    IPC分类号: H04L12/56

    摘要: In one embodiment, a method includes sending an adjacency discovery message 1 from a local router over a direct link to a first neighbor router. An adjacency discovery message is not forwarded and includes a repair address. The repair address indicates the local router but is not advertised as reachable over the direct link. An outbound routing update message is sent to a different second neighbor router. The outbound routing update message is forwarded and includes reachability data that indicates the repair address is reachable. A payload of an inbound tunneled packet received at the local router and directed to the repair address is forwarded based on a destination indicated in the payload.

    摘要翻译: 在一个实施例中,一种方法包括通过到第一邻居路由器的直接链路从本地路由器发送邻接发现消息1。 邻接发现消息不被转发并且包括修复地址。 修复地址指示本地路由器,但不通过直接链路通告。 出站路由更新消息被发送到不同的第二邻居路由器。 出站路由更新消息被转发,并包括指示修复地址可达的可达性数据。 基于有效载荷中指示的目的地,转发在本地路由器处接收并定向到修复地址的入站隧道分组的有效载荷。

    Arrangement for preventing count-to-infinity in flooding distance vector routing protocols
    14.
    发明申请
    Arrangement for preventing count-to-infinity in flooding distance vector routing protocols 有权
    用于防止洪泛距离矢量路由协议中的无穷大的排列

    公开(公告)号:US20060007865A1

    公开(公告)日:2006-01-12

    申请号:US10887919

    申请日:2004-07-12

    IPC分类号: H04L12/26 H04L12/28

    摘要: 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.

    摘要翻译: 网络中的每个路由器被配置为根据洪泛距离向量路由协议来生成路由器通告消息。 根据洪泛距离向量路由协议输出的每个路由器通告消息包括至少一个目的地的可达性信息,以及指示已经发起可达性信息的路由器的始发路由器标识符。 如果接收到路由器通告消息的任何路由器检测到始发路由器标识符和对应的分配的路由器标识符之间的匹配,则在从网络计算最佳路径期间忽略接收到的路由器通告消息。 如果始发路由器标识符识别另一个路由器,则路由器将接收的路由器通告消息洪泛到其他端口,并根据接收到的路由器通告消息输出自己的路由器通告消息,并从接收到的路由器通告消息中指定始发路由器标识符。

    Techniques for decreasing queries to discover routes in an interior gateway protocol
    15.
    发明授权
    Techniques for decreasing queries to discover routes in an interior gateway protocol 有权
    用于减少查询以在内部网关协议中发现路由的技术

    公开(公告)号:US07697505B2

    公开(公告)日:2010-04-13

    申请号:US11346781

    申请日:2006-02-03

    IPC分类号: H04L12/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.

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

    Method and Apparatus for Automatic Sub-Division of Areas that Flood Routing Information
    16.
    发明申请
    Method and Apparatus for Automatic Sub-Division of Areas that Flood Routing Information 有权
    洪水路由信息区域自动分区方法与装置

    公开(公告)号:US20100008231A1

    公开(公告)日:2010-01-14

    申请号:US12560890

    申请日:2009-09-16

    IPC分类号: G06F11/00

    摘要: 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的汇总路由信息的类型数据。 随着移动自组织网络规模的扩大,这些技术允许自动优化共享路由信息域的扩展。

    Method and apparatus for automatic sub-division of areas that flood routing information
    17.
    发明授权
    Method and apparatus for automatic sub-division of areas that flood routing information 有权
    自动划分洪水路由信息区域的方法和装置

    公开(公告)号:US07609672B2

    公开(公告)日:2009-10-27

    申请号:US11513099

    申请日:2006-08-29

    IPC分类号: H04W4/00

    摘要: 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的汇总路由信息的类型数据。 随着移动自组织网络规模的扩大,这些技术允许自动优化共享路由信息域的扩展。

    Evaluation of Network Data Aggregation
    18.
    发明申请
    Evaluation of Network Data Aggregation 有权
    网络数据聚合评估

    公开(公告)号:US20090059925A1

    公开(公告)日:2009-03-05

    申请号:US11846072

    申请日:2007-08-28

    IPC分类号: H04L12/28

    摘要: 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.

    摘要翻译: 在一个实施例中,一种方法包括基于通信链路接收指示通信中的多个通信链路和多个中间网络节点的拓扑数据。 中间网络节点包括终止通信的多个叶节点和便于叶节点之间的信息通过的多个传输节点。 还收到聚合点数据,表示中间网络节点上的所有聚合点。 聚合点是网络节点和通信链路之间的接口,通过该接口输出作为通过接口上游的多个不同接口接收的数据的组合的输出数据。 确定一组路径,该集合中的每个路径连接不同的一对叶节点。 基于路径集合的聚合路径的数量来确定聚合度量。 聚合路径通过聚合点。

    Techniques for determining network nodes to represent, multiple subnetworks for a routing protocol
    19.
    发明申请
    Techniques for determining network nodes to represent, multiple subnetworks for a routing protocol 有权
    用于确定网络节点来表示路由协议的多个子网络的技术

    公开(公告)号:US20060159095A1

    公开(公告)日:2006-07-20

    申请号:US11036728

    申请日:2005-01-14

    IPC分类号: H04L12/28

    摘要: 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.

    摘要翻译: 提出了一种方法和装置,用于确定网络节点,用于聚合用于通过网络路由数据分组的路由信息​​中的地址。 接收到链接数据和可达性数据。 链路数据表示网络的多个候选路由器和不同路由器或网段之间的每个候选路由器之间的直接链路。 可达性数据表示在链接数据中描述的每个链路上可以达到的一组或多个连续网络地址的集合。 基于链路数据和可达性数据,在候选路由器处确定连续网络地址的可能聚合的度量。 基于每个候选路由器可能聚合的测量,在候选路由器之间确定在网络中的路由器之间发送的路由信息​​中聚合地址的优选路由器。

    Method and apparatus for automatic sub-division of areas that flood routing information
    20.
    发明授权
    Method and apparatus for automatic sub-division of areas that flood routing information 有权
    自动划分洪水路由信息区域的方法和装置

    公开(公告)号:US08699410B2

    公开(公告)日:2014-04-15

    申请号:US12560890

    申请日:2009-09-16

    IPC分类号: H04W4/00

    摘要: 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的汇总路由信息的类型数据。 随着移动自组织网络规模的扩大,这些技术允许自动优化共享路由信息域的扩展。