公开(公告)号：US07940776B2

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

申请号：US11762547

申请日：2007-06-13

申请人： Alvaro Retana ,  Yi Yang ,  Stewart Bryant ,  Ian Michael Charles Shand ,  Russell White

发明人： Alvaro Retana ,  Yi Yang ,  Stewart Bryant ,  Ian Michael Charles Shand ,  Russell White

IPC分类号： H04L12/56

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/026 ,  H04L45/58

摘要： 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。 邻接发现消息不被转发并且包括修复地址。 修复地址指示本地路由器，但不通过直接链路通告。 出站路由更新消息被发送到不同的第二邻居路由器。 出站路由更新消息被转发，并包括指示修复地址可达的可达性数据。 基于有效载荷中指示的目的地，转发在本地路由器处接收并定向到修复地址的入站隧道分组的有效载荷。

公开(公告)号：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.

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

公开(公告)号：US20100008231A1

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

申请号：US12560890

申请日：2009-09-16

申请人： Alvaro Retana ,  Russell White

发明人： Alvaro Retana ,  Russell White

IPC分类号： G06F11/00

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

公开(公告)号：US07609672B2

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

申请号：US11513099

申请日：2006-08-29

申请人： Alvaro Retana ,  Russell White

发明人： Alvaro Retana ,  Russell White

IPC分类号： H04W4/00

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

公开(公告)号：US20080310433A1

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

申请号：US11762547

申请日：2007-06-13

申请人： Alvaro Retana ,  Yi Yang ,  Stewart Bryant ,  Ian Michael Charles Shand ,  Russell White

发明人： Alvaro Retana ,  Yi Yang ,  Stewart Bryant ,  Ian Michael Charles Shand ,  Russell White

IPC分类号： H04L12/56

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/026 ,  H04L45/58

摘要： 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。 邻接发现消息不被转发并且包括修复地址。 修复地址指示本地路由器，但不通过直接链路通告。 出站路由更新消息被发送到不同的第二邻居路由器。 出站路由更新消息被转发，并包括指示修复地址可达的可达性数据。 基于有效载荷中指示的目的地，转发在本地路由器处接收并定向到修复地址的入站隧道分组的有效载荷。

公开(公告)号：US20060159095A1

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

申请号：US11036728

申请日：2005-01-14

申请人： David Cook ,  Russell White ,  Alvaro Retana

发明人： David 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.

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

公开(公告)号：US08699410B2

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

申请号：US12560890

申请日：2009-09-16

申请人： Alvaro Retana ,  Russell White

发明人： Alvaro Retana ,  Russell White

IPC分类号： H04W4/00

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

公开(公告)号：US07889655B2

公开(公告)日：2011-02-15

申请号：US11333221

申请日：2006-01-17

申请人： Alvaro Retana ,  Russell White ,  Abhay Roy ,  Sina Mirtorabi

发明人： Alvaro Retana ,  Russell White ,  Abhay Roy ,  Sina Mirtorabi

IPC分类号： G06F11/07

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.

摘要翻译： 用于检测跨越路由信息边界的路由中的循环的技术包括：在边界的一侧上的第一边缘节点处接收控制消息，所述控制消息连接到边界的另一侧上的不同的第二边缘节点。 控制消息指示可从第一边缘节点到达的特定节点的特定网络地址。 确定识别器数据，其指示第一集合中的节点是否可以到达第一边缘节点而不离开第一集合。 广告消息从第一边缘节点发送到第二边缘节点，其包括指示特定网络地址和识别器数据的路由数据。 基于识别器数据，第一集合中的测试边缘节点可以确定是否存在包括内部路径和到第一边缘节点的外部路径的环路。

公开(公告)号：US07782858B2

公开(公告)日：2010-08-24

申请号：US11696708

申请日：2007-04-04

申请人： Russell White ,  James Ng ,  Alvaro Retana ,  Brian Weis

发明人： Russell White ,  James Ng ,  Alvaro Retana ,  Brian Weis

IPC分类号： H04L12/28 ,  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。 这些站点的多个边缘站点彼此分离并连接到处于至少一个不同方的单独管理控制下的第二网络。 地址数据指示与多个站点中的每个站点相关联的网络地址。 外部路由协议消息基于认证的站点数据进行打折。

公开(公告)号：US20080043635A1

公开(公告)日：2008-02-21

申请号：US11877104

申请日：2007-10-23

申请人： Alvaro Retana ,  David Cook ,  Russell White ,  Yi Yang ,  Madhavi Chandra

发明人： Alvaro Retana ,  David Cook ,  Russell White ,  Yi Yang ,  Madhavi Chandra

IPC分类号： H04L12/28

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/021 ,  H04L45/028 ,  H04L45/32

摘要： An apparatus for communicating packets in a network environment is provided that includes a first network element that includes a first neighbor list, the first network element being coupled to a second network element and a third network element. The first network element is operable to receive a second neighbor list from the second network element and a third neighbor list from the third network element. The first network element is further operable to determine one or more overlaps provided by the second and third neighbor lists when compared to the first neighbor list, the first network element relaying an update that it receives based on the one or more overlaps.

摘要翻译： 提供了一种用于在网络环境中传送分组的装置，其包括包括第一邻居列表的第一网络元件，所述第一网络元件耦合到第二网络元件和第三网络元件。 第一网络元件可操作以从第二网络元件接收第二邻居列表，并从第三网络元件接收第三邻居列表。 当与第一邻居列表相比较时，第一网络元件还可操作以确定由第二和第三邻居列表提供的一个或多个重叠，第一网络元件基于一个或多个重叠中继其接收的更新。