公开(公告)号：US07720010B2

公开(公告)日：2010-05-18

申请号：US11537298

申请日：2006-09-29

Applicant: Vincent Ribiere ,  Abhay Roy ,  Pascal Thubert ,  Patrick Wetterwald

Inventor： Vincent Ribiere ,  Abhay Roy ,  Pascal Thubert ,  Patrick Wetterwald

IPC: H04L12/28 ,  H04W4/00

CPC classification number: H04L45/025 ,  H04W8/005 ,  H04W48/08 ,  H04W76/10 ,  H04W88/16 ,  H04W92/24

Abstract: A system for providing a tree topology for a network having an interior gateway protocol. A first router receives a hello message from all connected routers in the network. The hello messages include tree topology information. The first router then uses the tree topology information to determine a parent of the router. The first router then establishes connections with directly connected routers at the same level in the tree topology. The first router also generates link messages that include all of the prefixes for children of the first router and broadcasts the link messages.

Abstract translation: 一种用于为具有内部网关协议的网络提供树形拓扑的系统。 第一个路由器从网络中的所有连接的路由器收到一条hello消息。 hello消息包括树形拓扑信息。 然后，第一个路由器使用树形拓扑信息来确定路由器的父节点。 然后，第一个路由器建立与树形拓扑中同一级别的直连路由器的连接。 第一个路由器还生成链路消息，其中包含第一个路由器的子节点的所有前缀，并广播链路消息。

公开(公告)号：US07668119B2

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

申请号：US11984049

申请日：2007-11-13

Applicant: Pascal Thubert ,  Thomas Berry ,  Vincent Jean Ribiere ,  Alvaro Enrique Retana ,  Russell Ivan White

Inventor： Pascal Thubert ,  Thomas Berry ,  Vincent Jean Ribiere ,  Alvaro Enrique Retana ,  Russell Ivan White

IPC: H04L12/28

CPC classification number: H04W40/246 ,  H04L45/025 ,  H04L45/34 ,  H04L45/46 ,  H04L45/48 ,  H04L45/7457 ,  H04W40/26 ,  H04W40/32

Abstract: 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.

Abstract translation: 每个移动专用节点在所识别的基于树的聚合组内具有分配的层级位置。 每个特别节点被配置为基于为所识别的聚合组中的所分配的分级位置，从可识别的聚合组的可识别的层级位置中识别出最佳匹配，来选择性地附接到多个可用的自组织节点之一。 每个自组织节点还被配置为基于确定不存在广告所标识的自组织节点的聚合组的任何可用的特定节点，或者包含所识别的聚合组的聚合组，选择性地附加到任何可用的自组织节点。 因此，聚合组的根节点可以从去往网络集群头的分组过滤组特定的路由信息​​，从而导致可扩展的路由协议不受添加节点的不利影响。

公开(公告)号：US20090300217A1

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

申请号：US12128454

申请日：2008-05-28

Applicant: ALPESH S. PATEL ,  Kent K. Leung ,  Pascal Thubert

Inventor： ALPESH S. PATEL ,  Kent K. Leung ,  Pascal Thubert

IPC: G06F15/16

CPC classification number: H04L61/2084 ,  H04L29/12066 ,  H04L29/12226 ,  H04L29/12311 ,  H04L29/12915 ,  H04L29/12933 ,  H04L61/1511 ,  H04L61/2015 ,  H04L61/203 ,  H04L61/6059 ,  H04L61/6068 ,  H04W8/26 ,  H04W80/04

Abstract: The present disclosure generally provides techniques for establishing a unique, ephemeral home address (hoa)/home agent address (ha′) address pair that may be limited to use in a session having a defined lifetime. Limiting the use of this dynamic address pair to a session lifetime and by preventing a mobile node from knowing the static address of a home agent may help protect the home agent from attacks.

Abstract translation: 本公开通常提供用于建立唯一的即时住宅地址（hoa）/归属代理地址（ha'）地址对的技术，该地址对可被限制在具有定义的生存期的会话中使用。 将该动态地址对的使用限制为会话生存时间并且通过阻止移动节点知道归属代理的静态地址可以有助于保护归属代理免受攻击。

公开(公告)号：US07567577B2

公开(公告)日：2009-07-28

申请号：US11167239

申请日：2005-06-28

Applicant: Pascal Thubert ,  Vincent Jean Ribiere ,  Eric M. Levy-Abegnoli ,  Patrick Wetterwald

Inventor： Pascal Thubert ,  Vincent Jean Ribiere ,  Eric M. Levy-Abegnoli ,  Patrick Wetterwald

IPC: H04L12/56

CPC classification number: H04W40/248 ,  H04L45/02

Abstract: Each router in a network is configured for executing a link state routing protocol based on outputting a corresponding first link state advertisement message describing a connected link of the router and that specifies a first dynamic routing metric identifying a first cost of the connected link, and a corresponding variation metric identifying a statistical variation of the dynamic routing metric. Each router also is configured for selectively outputting a corresponding second link state advertisement message describing the connected link and that specifies the corresponding variation metric and an updated dynamic routing metric identifying an updated cost of the connected link relative to the first cost, the second link state advertisement message selectively output based on the updated dynamic routing metric differing from the first dynamic routing metric by more than the variation metric, or the router having received another link state advertisement from another router in the network.

Abstract translation: 网络中的每个路由器被配置为基于输出描述路由器的连接链路的对应的第一链路状态通告消息来执行链路状态路由协议，并且指定识别所连接链路的第一成本的第一动态路由度量，以及 标识动态路由度量的统计变化的相应变化度量。 每个路由器还被配置为选择性地输出描述连接的链路的相应的第二链路状态通告消息，并且其指定对应的变化度量以及更新的动态路由度量，该更新的动态路由度量标识相对于第一成本的连接链路的更新成本，第二链路状态 基于与第一动态路由度量不同的更新的动态路由度量多于变化度量选择性地输出广告消息，或者已经从网络中的另一路由器接收到另一链路状态广告的路由器。

公开(公告)号：US07519733B1

公开(公告)日：2009-04-14

申请号：US10844361

申请日：2004-05-13

Applicant: Pascal Thubert ,  Patrick Wetterwald

Inventor： Pascal Thubert ,  Patrick Wetterwald

IPC: G06F15/173

CPC classification number: H04L12/18 ,  H04L45/00 ,  H04L45/16 ,  H04L45/48

Abstract: Routers of a content network include routing entries that specify aggregation levels, enabling the routers to establish a tree-based topology within an aggregation realm for distribution of broadcast packets. Each router is configured to have a prescribed aggregation level within the aggregation realm, and identify a network-directed broadcast packet based on detecting a prescribed pluricast code at a corresponding prescribed prefix location relative to the prescribed aggregation level. Each router also is configured for storing a registration request within its routing entries, and propagating the registration request to other routers within the aggregation realm. Each registration request includes a bit mask according to one of the prescribed aggregation levels. Hence, client-based registration requests can be propagated throughout the aggregation realm for rules-based coalescence of subscriber groups throughout the aggregation realm.

Abstract translation: 内容网络的路由器包括指定聚合级别的路由条目，使得路由器能够在聚合域内建立基于树的拓扑，用于广播分组的分发。 每个路由器被配置为在聚合区域内具有规定的聚合级别，并且基于在相对于规定的聚集级别的相应的规定前缀位置检测到规定的多播代码来识别网络定向的广播分组。 每个路由器还被配置为在其路由条目中存储注册请求，并且将注册请求传播到聚合领域内的其他路由器。 每个注册请求包括根据规定聚合级别之一的位掩码。 因此，基于客户端的注册请求可以在整个聚合领域传播，用于整个聚合领域的用户组的基于规则的聚合。

公开(公告)号：US20080228940A1

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

申请号：US11716586

申请日：2007-03-12

Applicant: Pascal Thubert

Inventor： Pascal Thubert

IPC: G06F15/173

CPC classification number: H04L45/04 ,  H04L29/12207 ,  H04L29/12933 ,  H04L45/00 ,  H04L45/02 ,  H04L45/48 ,  H04L61/20 ,  H04L61/6068

Abstract: In one embodiment, a first router attaches to an attachment router based on detecting a first router advertisement message specifying an attachment prefix and a first tree information option. The first tree information option includes a first IP host address of a first clusterhead having established a first tree topology. The first router receives a second advertisement from a second router specifying a second address prefix, distinct from the attachment prefix and the first address prefix of the first router, and a second tree information option specifying a second IP host address of a second clusterhead having established a second distinct tree topology. If the first and second routers are at equal depths relative to the respective first and second clusterheads, routing information is shared, including first address prefix reachable via the first router, and a host route for reaching the first IP host address via the first router.

Abstract translation: 在一个实施例中，第一路由器基于检测到指定附件前缀的第一路由器通告消息和第一树信息选项来附接到附件路由器。 第一树信息选项包括已经建立第一树形拓扑的第一簇头的第一IP主机地址。 第一路由器从第二路由器接收指定与第一路由器的附件前缀和第一地址前缀不同的第二地址前缀的第二广告，以及指定已经建立的第二群头的第二IP主机地址的第二树信息选项 第二个不同的树形拓扑。 如果第一和第二路由器相对于相应的第一和第二簇头处于相同的深度，则路由信息被共享，包括经由第一路由器可到达的第一地址前缀以及经由第一路由器到达第一IP主机地址的主机路由。

公开(公告)号：US20080212494A1

公开(公告)日：2008-09-04

申请号：US11984049

申请日：2007-11-13

Applicant: Pascal Thubert ,  Thomas Berry ,  Vincent Jean Ribiere ,  Alvaro Enrique Retana ,  Russell Ivan White

Inventor： Pascal Thubert ,  Thomas Berry ,  Vincent Jean Ribiere ,  Alvaro Enrique Retana ,  Russell Ivan White

IPC: H04L12/28

CPC classification number: H04W40/246 ,  H04L45/025 ,  H04L45/34 ,  H04L45/46 ,  H04L45/48 ,  H04L45/7457 ,  H04W40/26 ,  H04W40/32

Abstract: 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.

Abstract translation: 每个移动专用节点在所识别的基于树的聚合组内具有分配的层级位置。 每个特别节点被配置为基于为所识别的聚合组中的所分配的分级位置，从可识别的聚合组的可识别的层级位置中识别出最佳匹配，来选择性地附接到多个可用的自组织节点之一。 每个自组织节点还被配置为基于确定不存在广告所标识的自组织节点的聚合组的任何可用的特定节点，或者包含所识别的聚合组的聚合组，选择性地附加到任何可用的自组织节点。 因此，聚合组的根节点可以从去往网络集群头的分组过滤组特定的路由信息​​，从而导致可扩展的路由协议不受添加节点的不利影响。

公开(公告)号：US07366111B2

公开(公告)日：2008-04-29

申请号：US11101394

申请日：2005-04-08

Applicant: Pascal Thubert ,  Patrick Wetterwald ,  Vincent Jean Ribiere ,  Eric M. Levy-Abegnoli

Inventor： Pascal Thubert ,  Patrick Wetterwald ,  Vincent Jean Ribiere ,  Eric M. Levy-Abegnoli

IPC: H04L12/28

CPC classification number: H04W40/24 ,  H04L45/48 ,  H04W8/082 ,  H04W48/16 ,  H04W80/04 ,  H04W84/18

Abstract: Mobile routers in a tree-based network topology with a single clusterhead in an ad hoc network establish connectivity based on each attached mobile router sending a neighbor advertisement message to an attachment mobile router via a corresponding egress interface. Any neighbor advertisement message received by a mobile router is used to identify specified network prefixes that are reachable via the source of the neighbor advertisement message. Each attached mobile router outputs to its attachment router another neighbor advertisement message that specifies the network prefix used by the mobile router, and the specified network prefixes from its attached mobile routers. The mobile router also identifies peer mobile routers having the same depth, and selectively shares limited routing information with the peer routers, enabling the mobile router to bypass the clusterhead and reach remote prefixes via the peer routers without burdening the tree.

Abstract translation: 基于树状网络拓扑中的移动路由器，在自组织网络中具有单个集群头，基于每个附加的移动路由器通过相应的出口接口建立到附件移动路由器发送邻居通告消息的连接。 由移动路由器接收到的任何邻居通告消息用于识别经由邻居广播消息的源可达的指定网络前缀。 每个连接的移动路由器向其附接路由器输出另一个邻居通告消息，其指定移动路由器使用的网络前缀，以及来自其附接的移动路由器的指定的网络前缀。 移动路由器还识别具有相同深度的对等移动路由器，并且选择性地与对等路由器共享有限的路由信息​​，使得移动路由器能够绕过群集头并且经由对等路由器到达远程前缀，而不加重树。

公开(公告)号：US20080080473A1

公开(公告)日：2008-04-03

申请号：US11542186

申请日：2006-10-03

Applicant: Pascal Thubert ,  Eric Levy-Abegnoli ,  Francois Le Faucheur

Inventor： Pascal Thubert ,  Eric Levy-Abegnoli ,  Francois Le Faucheur

IPC: H04B7/212

CPC classification number: G06F13/4045

Abstract: In one embodiment, a node (e.g., a router) performs reservations for data flows, each on a corresponding selected (reserved) path having adequate reservation availability. Also, the node forwards data from data flows, each over a corresponding selected (forwarded) path having adequate load availability, wherein forwarded paths are decoupled from reserved paths for the data flows.

Abstract translation: 在一个实施例中，节点（例如，路由器）对数据流执行预留，每个在相应的所选（保留）路径上具有足够的预留可用性。 此外，节点从数据流中转发数据，每个数据流都通过具有足够负载可用性的相应的所选（转发）路径，其中转发的路径与用于数据流的保留路径分离。

公开(公告)号：US20080043638A1

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

申请号：US11506169

申请日：2006-08-17

Applicant: Vincent Ribiere ,  Pascal Thubert ,  Patrick Wetterwald

Inventor： Vincent Ribiere ,  Pascal Thubert ,  Patrick Wetterwald

IPC: H04L12/28 ,  H04L12/56

CPC classification number: H04W72/1242 ,  H04L47/10 ,  H04L47/14 ,  H04L47/2416 ,  H04L47/2441 ,  H04L47/28 ,  H04W28/14 ,  H04W28/18 ,  H04W74/0875 ,  H04W88/04 ,  H04W88/08

Abstract: In one embodiment, a method includes receiving an inbound data packet over a wireless link at a wireless intermediate network node. The inbound data packet indicates the packet was transmitted by a node at an edge of the mesh. The inbound data packet is associated with a low priority minimum wait interval and a low priority maximum wait interval for reducing contention on the wireless link. An outbound data packet based on the first data packet is transmitted over the wireless link after a wait time. The wait time is based on a high priority minimum wait interval and a high priority maximum wait interval for reducing contention. The low priority minimum wait interval is greater than the high priority minimum wait interval. These techniques allow long packet queues at the edge but quickly clear packets already forwarded by the mesh.

Abstract translation: 在一个实施例中，一种方法包括在无线中间网络节点处通过无线链路接收入站数据分组。 入站数据包指示分组由网格边缘的节点发送。 入站数据分组与低优先级最小等待间隔和低优先级最大等待间隔相关联，以减少无线链路上的争用。 在等待时间之后，通过无线链路发送基于第一数据分组的出站数据分组。 等待时间基于高优先级最小等待间隔和用于减少争用的高优先级最大等待间隔。 低优先级最小等待间隔大于高优先级最小等待间隔。 这些技术允许在边缘的长数据包队列，但是快速清除已经由网格转发的数据包。