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

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

公开(公告)号：US20120044811A1

公开(公告)日：2012-02-23

申请号：US12859692

申请日：2010-08-19

申请人： Russell White ,  Ian Michael Charles Shand

发明人： Russell White ,  Ian Michael Charles Shand

IPC分类号： H04L12/26

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/1283 ,  H04L45/34 ,  H04L45/64

摘要： In one embodiment, each node in a computer network determines a shortest looping ring back to the node through each of its neighbors. Each of these rings may then be marked in a particular direction, ensuring that any ring that shares a link with another ring is marked in such a way that the shared link is in the same direction in each of the rings that share the link. The links that are marked in the particular direction may be stored as part of a first topology. Conversely, the opposite direction on the links (e.g., bidirectional links or parallel unidirectional links) may be stored as a second topology that is link-disjoint from the first topology.

摘要翻译： 在一个实施例中，计算机网络中的每个节点通过其每个邻居来确定回节点的最短循环环。 然后可以将这些环中的每一个以特定方向标记，确保与另一个环共享链接的任何环以这样的方式被标记，使得共享链路在共享链路的每个环中处于相同的方向。 在特定方向上标记的链接可以存储为第一拓扑的一部分。 相反，链路上相反的方向（例如，双向链路或并行单向链路）可以被存储为与第一拓扑链接不相交的第二拓扑。

公开(公告)号：US08964566B2

公开(公告)日：2015-02-24

申请号：US12859692

申请日：2010-08-19

申请人： Russell White ,  Ian Michael Charles Shand

发明人： Russell White ,  Ian Michael Charles Shand

IPC分类号： H04L12/26 ,  H04L12/703 ,  H04L12/751 ,  H04L12/735 ,  H04L12/721 ,  H04L12/715

CPC分类号： H04L45/28 ,  H04L45/02 ,  H04L45/1283 ,  H04L45/34 ,  H04L45/64

摘要： In one embodiment, each node in a computer network determines a shortest looping ring back to the node through each of its neighbors. Each of these rings may then be marked in a particular direction, ensuring that any ring that shares a link with another ring is marked in such a way that the shared link is in the same direction in each of the rings that share the link. The links that are marked in the particular direction may be stored as part of a first topology. Conversely, the opposite direction on the links (e.g., bidirectional links or parallel unidirectional links) may be stored as a second topology that is link-disjoint from the first topology.

摘要翻译： 在一个实施例中，计算机网络中的每个节点通过其每个邻居来确定回节点的最短循环环。 然后可以将这些环中的每一个以特定方向标记，确保与另一个环共享链接的任何环以这样的方式被标记，使得共享链路在共享链路的每个环中处于相同的方向。 在特定方向上标记的链接可以存储为第一拓扑的一部分。 相反，链路上相反的方向（例如，双向链路或并行单向链路）可以被存储为与第一拓扑链接不相交的第二拓扑。

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

公开(公告)号：US20090080436A1

公开(公告)日：2009-03-26

申请号：US11862161

申请日：2007-09-26

申请人： Russell White ,  James L. Ng ,  Donnie V. Savage

发明人： Russell White ,  James L. Ng ,  Donnie V. Savage

IPC分类号： H04L12/28

CPC分类号： H04L45/02 ,  H04L45/025

摘要： A router identifies transit links and non-transit links. Only the non-transit links are advertised as routes to adjacent routers, thereby protecting the transit links from edge traffic which terminates on a network on one of the transit links. In another aspect of the invention, an administrative whitelist supplements the routes which identify the transit link network routes. In another aspect of the invention, a method for advertising routes identifies entries in a router table as broadcast or point-to-point. Only the router table entries for point-to-point links which are not transit or broadcast links that are not for a neighboring router are advertised, whereas the point-to-point transit links or broadcast transit links are advertised as transit links if an administrative whitelist is enabled.

摘要翻译： 路由器识别过境链路和非过境链路。 只有非转接链路作为到相邻路由器的路由通告，从而保护转接链路免受终止于其中一个转接链路上的网络上的边缘业务。 在本发明的另一方面，管理白名单补充标识中继链路网络路由的路由。 在本发明的另一方面，广告路由的方法将路由器表中的条目标识为广播或点到点。 仅通告不用于相邻路由器的不转发或广播链路的路由器表条目，而点对点转接链路或广播转发链路则作为传输链路通告，如果管理 白名单启用。

公开(公告)号：US20060240865A1

公开(公告)日：2006-10-26

申请号：US11448338

申请日：2006-06-07

申请人： Russell White

发明人： Russell White

IPC分类号： H04M1/00

CPC分类号： A63B24/0021 ,  A63B24/0062 ,  A63B69/0028 ,  A63B69/16 ,  A63B71/0622 ,  A63B71/0686 ,  A63B2024/0025 ,  A63B2024/0071 ,  A63B2071/0625 ,  A63B2071/063 ,  A63B2220/12 ,  A63B2220/13 ,  A63B2220/17 ,  A63B2220/20 ,  A63B2220/30 ,  A63B2220/34 ,  A63B2220/836 ,  A63B2225/20 ,  A63B2225/50 ,  A63B2244/20 ,  G01C3/08 ,  G01C21/10 ,  G01C22/002 ,  G01C22/006 ,  G06F1/163 ,  G06F3/011 ,  H04B1/3822 ,  H04M1/21 ,  H04M1/7253 ,  H04M1/72558 ,  H04M1/72563 ,  H04M2250/02 ,  H04M2250/06 ,  H04M2250/12 ,  H04W84/10

摘要： An athletic performance monitoring system and method are disclosed that assist a user in monitoring an athletic endeavor. A system that incorporates teachings of the present disclosure may include, for example, a local area wireless transceiver capable of receiving a signal from a motion sensor. A performance engine may be communicatively coupled to the local area wireless transceiver. In operation, the performance engine may utilize the signal from the motion sensor to generate a performance metric like average speed or distance traveled. The system may also include an output mechanism such as an audio device capable of presenting the performance metric to a user in an audible message while also being capable of playing an audio representation of music to the user.

摘要翻译： 公开了一种运动性能监测系统和方法，其帮助用户监测运动的努力。 结合本公开的教导的系统可以包括例如能够从运动传感器接收信号的局域无线收发器。 性能引擎可以通信地耦合到本地无线收发器。 在操作中，性能引擎可以利用来自运动传感器的信号来产生诸如平均速度或行驶距离的性能度量。 该系统还可以包括诸如音频设备的输出机制，该音频设备能够在可听消息中向用户呈现性能度量，同时还能够向用户播放音乐的音频表示。

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

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