-
1.发明申请Ad hoc network formation and management based on aggregation of ad hoc nodes according to an aggregation hierarchy 审中-公开基于聚合层次结构的自组织节点聚合的自组织网络形成与管理公开(公告)号：US20070153707A1
公开(公告)日：2007-07-05
申请号：US11324270
申请日：2006-01-04
申请人： Pascal Thubert , Thomas Berry , Vincent Ribiere , Alvaro Retana , Russell White
发明人： Pascal Thubert , Thomas Berry , Vincent Ribiere , Alvaro Retana , Russell White
CPC分类号： H04W40/246 , H04L45/025 , H04L45/34 , H04L45/46 , H04L45/48 , H04L45/7457 , H04W40/26 , H04W40/32
摘要： Each mobile ad hoc node has an assigned hierarchy position within an identified tree-based aggregation group. Each ad hoc node is configured for selectively attaching to one of a plurality of available ad hoc nodes based on identifying a best match, for the assigned hierarchy position within the identified aggregation group, from among identifiable hierarchy positions of identifiable aggregation groups. Each ad hoc node also is configured for selectively attaching to any available ad hoc node based on a determined absence of any available ad hoc node advertising the identified aggregation group of the ad hoc node, or an aggregation group containing the identified aggregation group. Hence, a root node of an aggregation group can filter group-specific routing information from packets destined toward a network clusterhead, resulting in a scalable routing protocol that is not adversely affected by added nodes.
摘要翻译： 每个移动专用节点在所识别的基于树的聚合组内具有分配的层级位置。 每个特别节点被配置为基于为所识别的聚合组中的所分配的分级位置，从可识别的聚合组的可识别的层级位置中识别出最佳匹配，来选择性地附接到多个可用的自组织节点之一。 每个自组织节点还被配置为基于确定不存在广告所标识的自组织节点的聚合组的任何可用的特定节点，或者包含所识别的聚合组的聚合组，选择性地附加到任何可用的自组织节点。 因此，聚合组的根节点可以从去往网络集群头的分组过滤组特定的路由信息，从而导致可扩展的路由协议不受添加节点的不利影响。
-
2.发明授权公开(公告)号：US07768995B2
公开(公告)日：2010-08-03
申请号：US11497224
申请日：2006-08-01
申请人： Yi Yang , Thuan Van Tran , Alvaro Retana , Donnie Van Savage , James Ng , Russell White
发明人： Yi Yang , Thuan Van Tran , Alvaro Retana , Donnie Van Savage , James Ng , Russell White
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.
摘要翻译： 用于同步路由数据的技术包括确定是否满足用于与相邻路由器的单向传输的条件。 如果确定与相邻路由器的路由表数据的单向传输满足条件，则从启动路由器向相邻路由器发送刷新通知消息。 刷新通知消息包括指示用于传送路由表数据的特定方向的数据。 如果特定方向是入站的，则接收相邻路由表的副本而不发送启动路由器自己的路由表的副本。 如果特定方向是出站的，则发送自己的路由表的副本而不接收相邻路由表的副本。
-
3.发明授权公开(公告)号：US07515551B2
公开(公告)日：2009-04-07
申请号：US11037964
申请日：2005-01-18
申请人： David Anthony Cook , Russell White , Alvaro Retana , Yi Yang , Madhavi Chandra , Abhay Roy
发明人： David Anthony Cook , Russell White , Alvaro Retana , Yi Yang , Madhavi Chandra , Abhay Roy
摘要： A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.
摘要翻译： 通过在路由器处建立链路状态数据来呈现一种通过网络支持数据分组的最短路径优先（SPF）路由的方法和装置。 链路状态数据表示路由器与不同路由器之间的直接链路，并与不同节点建立邻接关系。 初始链路状态数据存储在第一路由器。 在存储初始链路状态数据之后，在第一路由器处接收到hello消息。 hello消息指示与一个网段上的不同第二路由器的直接连接。 基于初始链路状态数据，确定与第二路由器建立邻接关系是否足够有价值。 如果没有，则与第二路由器不响应于hello消息建立邻接关系。 基于在第一路由器上存储的链路状态数据中指示的一个或多个相邻关系来确定穿过网络的数据分组的最短路径第一路由。
-
公开(公告)号：US20080130500A1
公开(公告)日：2008-06-05
申请号：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
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.
摘要翻译： 在一个实施例中，一种方法包括在本地路由器的第一通信链路上以在第一泛洪域中通信的多个路由器的每个路由器的一定详细级别接收所有路由信息。 从第一个洪泛域中的特定路由器到本地路由器确定距离的度量。 确定距离测量是否超过阈值。 如果距离测量值超过阈值，则确定特定路由器具有小于特定级别细节的汇总路由信息。 而且，通过本地路由器上的不同的第二通信链路发送某些路由信息。 某些路由信息包括特定路由器的摘要信息，以及在第一洪泛域中通信的路由子集的特定级别的所有路由信息，该子集排除特定路由器。
-
公开(公告)号：US20060159082A1
公开(公告)日：2006-07-20
申请号：US11037964
申请日：2005-01-18
申请人： David Cook , Russell White , Alvaro Retana , Yi Yang , Madhavi Chandra , Abhay Roy
发明人： David Cook , Russell White , Alvaro Retana , Yi Yang , Madhavi Chandra , Abhay Roy
摘要： A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.
-
6.发明申请Arrangement for preventing count-to-infinity in flooding distance vector routing protocols 有权用于防止洪泛距离矢量路由协议中的无穷大的排列公开(公告)号：US20060007865A1
公开(公告)日：2006-01-12
申请号：US10887919
申请日：2004-07-12
申请人： Russell White , David Cook , Alvaro Retana
发明人： Russell White , David Cook , Alvaro Retana
摘要： 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.
摘要翻译： 网络中的每个路由器被配置为根据洪泛距离向量路由协议来生成路由器通告消息。 根据洪泛距离向量路由协议输出的每个路由器通告消息包括至少一个目的地的可达性信息，以及指示已经发起可达性信息的路由器的始发路由器标识符。 如果接收到路由器通告消息的任何路由器检测到始发路由器标识符和对应的分配的路由器标识符之间的匹配，则在从网络计算最佳路径期间忽略接收到的路由器通告消息。 如果始发路由器标识符识别另一个路由器，则路由器将接收的路由器通告消息洪泛到其他端口，并根据接收到的路由器通告消息输出自己的路由器通告消息，并从接收到的路由器通告消息中指定始发路由器标识符。
-
公开(公告)号：US07940776B2
公开(公告)日：2011-05-10
申请号：US11762547
申请日：2007-06-13
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。 邻接发现消息不被转发并且包括修复地址。 修复地址指示本地路由器，但不通过直接链路通告。 出站路由更新消息被发送到不同的第二邻居路由器。 出站路由更新消息被转发，并包括指示修复地址可达的可达性数据。 基于有效载荷中指示的目的地，转发在本地路由器处接收并定向到修复地址的入站隧道分组的有效载荷。
-
8.发明授权Techniques for decreasing queries to discover routes in an interior gateway protocol 有权用于减少查询以在内部网关协议中发现路由的技术公开(公告)号：US07697505B2
公开(公告)日：2010-04-13
申请号：US11346781
申请日：2006-02-03
申请人： Russell White , Alvaro Retana , Donnie Savage
发明人： Russell White , Alvaro Retana , Donnie Savage
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.
摘要翻译： 用于恢复丢失路由的技术包括从相邻节点接收向目的地发送数据的报告成本; 并将总成本确定为向相邻节点发送数据分组的成本的总和以及相应的报告成本。 确定具有最小总成本的选择的相邻节点作为到目的地的路由的下一跳。 确定报告成本小于所选择的相邻节点的总成本并且排除所选择的相邻节点的可行后继集合，以及关于可行后继集合的后继数据。 后继数据被发送到相邻节点。 丢失到特定目的地节点的路由的相邻节点能够基于后继数据来确定是否在向目的地恢复丢失路由的同时查询发送节点，从而减少网络资源消耗。
-
9.发明申请公开(公告)号：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的汇总路由信息的类型数据。 随着移动自组织网络规模的扩大，这些技术允许自动优化共享路由信息域的扩展。
-
10.发明授权Method and apparatus for automatic sub-division of areas that flood routing information 有权自动划分洪水路由信息区域的方法和装置公开(公告)号：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的汇总路由信息的类型数据。 随着移动自组织网络规模的扩大，这些技术允许自动优化共享路由信息域的扩展。
-
-
-
-
-
-
-
-
-
搜索结果
45 条记录 (耗时 0.03 秒)
