公开(公告)号：US06779017B1

公开(公告)日：2004-08-17

申请号：US09473613

申请日：1999-12-29

Applicant: Marc Lamberton ,  Eric Levy-Abegnoli ,  Eric Montagnon ,  Pascal Thubert

Inventor： Marc Lamberton ,  Eric Levy-Abegnoli ,  Eric Montagnon ,  Pascal Thubert

IPC: G06F1516

CPC classification number: G06F9/505 ,  G06F2209/5016 ,  H04L29/06 ,  H04L29/12009 ,  H04L29/12783 ,  H04L61/35 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1029 ,  H04L67/1038

Abstract: Load balancing of client transactions, for the duration of a client session, in a Web site is implemented by a cluster of servers. An initial request in each client session is sent to the site load balancer, thus, greatly enhancing the capability of the site to accept new session requests. All subsequent requests from a client are forwarded directly to the server first selected so that the sessions cannot be later broken by the load balancer.

Abstract translation: 在客户端会话期间，在网站中的客户端事务的负载平衡由一组服务器实现。 每个客户端会话中的初始请求都将发送到站点负载平衡器，从而大大增强了站点接受新会话请求的能力。 来自客户端的所有后续请求将直接转发到首选的服务器，以便会话不能稍后被负载平衡器断开。

公开(公告)号：US06185189B2

公开(公告)日：2001-02-06

申请号：US09093971

申请日：1998-06-09

Applicant: Rene Brassier ,  Denis Esteve ,  Jean-Pierre Maree ,  Pascal Thubert

Inventor： Rene Brassier ,  Denis Esteve ,  Jean-Pierre Maree ,  Pascal Thubert

IPC: H04L1226

CPC classification number: H04L47/263 ,  H04L47/10 ,  H04L47/14 ,  H04L47/16 ,  Y02D50/10

Abstract: The Committed Information Rate (CIR) functionality is converted to an Adaptive Rate Base (ARB) mechanism. The solution is based on the interaction between a proactive setting of the Explicit Congestion Notifications (ECN) in the Frame Handler (FH) function of the switches and a converging Adaptive CIR algorithm in the Terminal Equipments. The result of this interaction is that when a logical bottleneck is in the process of settling in a switch, the CIR at the Terminating Equipment adapts itself to the throughput of the forming logical bottleneck. Henceforth, the logical bottleneck is exported at the boundary of the network within the Terminating Equipment. The end result is that the data sent by the data link control in the Terminating Equipment is paced so that the output matches that of the weakest point in the network, keeping it busy but not congested.

Abstract translation: 承诺信息速率（CIR）功能被转换为自适应速率基站（ARB）机制。 该解决方案基于交换机的帧处理器（FH）功能中的显式拥塞通知（ECN）的主动设置与终端设备中的收敛自适应CIR算法之间的交互。 这种交互的结果是当逻辑瓶颈处于交换机中时，终端设备的CIR会自适应形成逻辑瓶颈的吞吐量。 此后，逻辑瓶颈出口在终端设备内的网络边界。 最终的结果是终端设备中的数据链路控制发送的数据是以网络中最弱点的输出匹配，保持繁忙但不拥塞的方式进行。

公开(公告)号：US6011805A

公开(公告)日：2000-01-04

申请号：US801222

申请日：1997-02-19

Applicant: Denis Esteve ,  Jean-Pierre Marce ,  Pascal Thubert

Inventor： Denis Esteve ,  Jean-Pierre Marce ,  Pascal Thubert

IPC: H04L1/18 ,  G01R31/08 ,  G06F11/00 ,  G08C15/00 ,  H04L12/28

CPC classification number: H04L1/1803

Abstract: To assure a complete transmission of frames in communication protocol such as the X25 LAPB a timer is used. The integrity of the transmission is obtained by retransmitting Iframe that are not received. Thus, each frame that is sent is controlled by a timer, called Retry Timer or T1 Timer. A short T1 Timer may cause a de-synchronization of the protocol then a connection loss. The invention aims to avoid this problem. The principle is based on the fact that the T1 Timer value is defined not only according to the speed but also to the workload of the LINK (51). The invention aims to add automatically to the initial value of the T1 Timer a queue delay. This queue delay corresponds to the delay between the enqueue of a buffer pointer (11) and the transmission of this buffer (41) on the Link. Thus, T1 Timer becomes auto-adaptive. The invention consists in performing two actions. The first action is to measure dynamically the queue delay. For this purpose, a transmit scheduler (40) sets a marker (46) in a transmit queue (30). When the transmit scheduler dequeues this marker, it updates the Queue delay in a register (60) and re-enqueues the marker. The second action is to adapt dynamically the T1 Timer. After sending a frame, if the T1 Timer expires without reception of an acknowledgment, then T1 timer is started with another value corresponding the queue delay measured above. And if the timer expires again then the LAPB (10) starts a confirmation mechanism in order to retransmit the Iframe that is not received.

Abstract translation: 为了确保通信协议（如X25 LAPB）中的帧的完整传输，使用定时器。 传输的完整性是通过重传未收到的iframe来获得的。 因此，发送的每个帧由称为重试定时器或T1定时器的定时器控制。 短T1定时器可能导致协议的去同步，然后连接丢失。 本发明旨在避免这个问题。 原理是基于T1定时器值不仅根据速度定义，而且还根据LINK（51）的工作量来定义。 本发明的目的是自动添加T1定时器的初始值一个队列延迟。 该队列延迟对应于缓冲区指针（11）的入队和链路上该缓冲区（41）的传输之间的延迟。 因此，T1 Timer变为自适应。 本发明在于执行两个动作。 第一个动作是动态地测量队列延迟。 为此，发送调度器（40）在发送队列（30）中设置标记（46）。 当发送调度程序出队这个标记时，它会更新寄存器（60）中的队列延迟并重新排队该标记。 第二个动作是动态地适应T1定时器。 发送帧后，如果T1定时器在不接收到确认的情况下到期，则T1定时器将以与上面测量的队列延迟相对应的另一个值启动。 并且如果定时器再次到期，则LAPB（10）启动确认机制，以便重新发送未被接收的Iframe。

公开(公告)号：US20170013621A1

公开(公告)日：2017-01-12

申请号：US15275542

申请日：2016-09-26

Applicant: Pascal Thubert ,  Jean-Philippe Vasseur ,  Patrick Wetterwald

Inventor： Pascal Thubert ,  Jean-Philippe Vasseur ,  Patrick Wetterwald

IPC: H04W72/04 ,  H04L12/26

CPC classification number: H04W72/0446 ,  H04J3/1694 ,  H04L43/067 ,  H04L43/0876 ,  H04L45/32 ,  H04W40/023

Abstract: In one embodiment, a network of nodes is configured to communicate according to a configuration of a vertical ladder topology as well as monitoring communication in the network, and/or selectively controls whether or not provisioned particular links will be used. One embodiment colors nodes of the network (e.g., a wireless deterministic network) along different paths through the network and marks packets with the color of each traversed node to track a path taken by a packet. One embodiment sends a particular packet through the network and marks over which links the packet traverses and aggregates these traversed links of other copies of the particular packet. One embodiment controls whether or not the provisioned time slots are used based on flooding a control packet through the network with enable or disable information for each of these links.

Abstract translation: 在一个实施例中，节点网络被配置为根据垂直梯形拓扑的配置以及监视网络中的通信进行通信，和/或选择性地控制是否使用所提供的特定链路。 一个实施例沿着通过网络的不同路径来颜色网络的节点（例如，无线确定性网络），并且以每个遍历节点的颜色标记分组以跟踪由分组采取的路径。 一个实施例通过网络发送特定数据包，并标记数据包穿过哪个链接并聚合特定数据包的其他副本的这些遍历链接。 一个实施例控制是否基于通过网络淹没控制分组来使用所提供的时隙，而对于这些链路中的每一个，启用或禁用信息。

公开(公告)号：US20150092595A1

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

申请号：US14043974

申请日：2013-10-02

Applicant: Patrick Wetterwald ,  Jean-Philippe Vasseur ,  Pascal Thubert

Inventor： Patrick Wetterwald ,  Jean-Philippe Vasseur ,  Pascal Thubert

IPC: H04W40/04 ,  H04W72/04

CPC classification number: H04W40/04 ,  H04L45/12 ,  H04L45/22 ,  H04L45/28 ,  H04W40/34 ,  H04W40/38 ,  H04W72/0446 ,  Y02D70/144 ,  Y02D70/32

Abstract: In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, “locally reconfiguring” refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.

Abstract translation: 在一个实施例中，通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径，所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。 初始路径在本地（例如，不接触路径计算引擎）被重新配置为绕过创建新路径的至少一个中间节点，新路径满足度量的要求。 注意，“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体（例如，网络管理系统，操作支持系统））确定替换路径时确定替换路径。 在一个实施例中，不在初始路径上的网络节点替换初始路径上的节点，同时使用在初始路径中使用的相同的接收和发送时隙。

公开(公告)号：US20150023327A1

公开(公告)日：2015-01-22

申请号：US14020932

申请日：2013-09-09

Applicant: Pascal Thubert ,  Norman William Finn ,  Jean-Philippe Vasseur ,  Patrick Wetterwald

Inventor： Pascal Thubert ,  Norman William Finn ,  Jean-Philippe Vasseur ,  Patrick Wetterwald

IPC: H04W72/04

CPC classification number: H04W72/0446 ,  H04J3/1694 ,  H04L43/067 ,  H04L43/0876 ,  H04L45/32 ,  H04W40/023

Abstract: One embodiment includes: forwarding a particular packet through an Available Routing Construct (ARC) chain topology network. In one embodiment, this forwarding includes: sending the particular packet by each particular non-edge node on an arc of the plurality of arcs receiving the particular packet to each sibling on the arc that did not send the particular packet to said particular non-edge node, while not sending the particular packet if it was received from both siblings of said particular edge node; and sending the particular packet to a respective child node on a second arc of the plurality of arcs by each particular edge node of two edge nodes on the arc after receiving the particular packet. In one embodiment, the network is a wireless deterministic network with pre-assigned time slots for receiving and subsequently sending a same particular packet by each node of the network.

Abstract translation: 一个实施例包括：通过可用路由构造（ARC）链拓扑网络转发特定分组。 在一个实施例中，该转发包括：将接收特定分组的多个弧的圆弧上的每个特定非边缘节点的特定分组发送到没有将特定分组发送到所述特定非边缘的弧上的每个兄弟 节点，而如果从所述特定边缘节点的两个兄弟节点接收到，则不发送特定分组; 以及在接收到特定分组之后，通过弧上的两个边缘节点的每个特定边缘节点将特定分组发送到多个弧的第二弧上的相应子节点。 在一个实施例中，网络是具有预分配时隙的无线确定性网络，用于由网络的每个节点接收和随后发送相同的特定分组。

公开(公告)号：US20150023314A1

公开(公告)日：2015-01-22

申请号：US13954846

申请日：2013-07-30

Applicant: Pascal Thubert ,  Jean-Philippe Vasseur ,  Patrick Wetterwald

Inventor： Pascal Thubert ,  Jean-Philippe Vasseur ,  Patrick Wetterwald

IPC: H04L5/00

CPC classification number: H04L5/0055 ,  H04L1/00 ,  H04L1/18 ,  H04L1/1854 ,  H04L1/188 ,  H04L1/1893 ,  H04L1/1896 ,  H04L5/00 ,  H04L5/0005 ,  H04L5/0073 ,  H04L2001/125 ,  H04W72/02 ,  H04W72/0446 ,  H04W72/0453 ,  H04W72/121

Abstract: One embodiment includes signaling, by a first network node to a transmission unit owner node, identifying one or more remaining wireless time slot-frequency pairings of a current transmission unit assigned to the first network node that will not be used by the first network node during the current transmission unit. The transmission unit owner node reassigns one or more of the remaining wireless time slot-frequency pairings to a second network node in the network to use during the current transmission unit. One embodiment includes communicating information between a first network node and a second network node using a particular time slot-frequency pairing, including a particular frame time from the second network node to the first network node, a particular acknowledgement time from the first network node to the second network node, and a particular acknowledgment of the acknowledgment time from the second network node to the first network node.

Abstract translation: 一个实施例包括由第一网络节点向传输单元所有者节点发送信令，识别分配给第一网络节点的当前传输单元的剩余无线时隙 - 频率配对，该第一网络节点将不被第一网络节点使用 当前的传输单元。 传输单元所有者节点将剩余无线时隙 - 频率配对中的一个或多个重新分配给网络中在当前传输单元期间使用的第二网络节点。 一个实施例包括使用包括从第二网络节点到第一网络节点的特定帧时间的特定时隙频率配对在第一网络节点和第二网络节点之间传送信息，从第一网络节点到 第二网络节点以及从第二网络节点到第一网络节点的确认时间的特定确认。

公开(公告)号：US08850066B2

公开(公告)日：2014-09-30

申请号：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 ,  H04L29/12 ,  H04W8/26 ,  H04W80/04

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'）地址对的技术，该地址对可被限制在具有定义的生存期的会话中使用。 将该动态地址对的使用限制为会话生存时间并且通过阻止移动节点知道归属代理的静态地址可以有助于保护归属代理免受攻击。

公开(公告)号：US20140078927A1

公开(公告)日：2014-03-20

申请号：US13620677

申请日：2012-09-14

Applicant: Pascal THUBERT ,  Patrice BELLAGAMBA ,  Dirk ANTEUNIS

Inventor： Pascal THUBERT ,  Patrice BELLAGAMBA ,  Dirk ANTEUNIS

IPC: H04L12/28 ,  H04L12/56

CPC classification number: H04L45/18 ,  H04L12/4637 ,  H04L45/22 ,  H04L45/28 ,  H04L45/50 ,  H04L45/507 ,  H04L45/64 ,  H04L2012/421

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, at least one of the first, second, or third network nodes are implemented as a ring-based network having a prescribed ring topology; and establishing loop-free label switched paths for reaching the destination network node via the routing arcs of the loop-free routing topology, the label switched paths independent and distinct from any attribute of the prescribed ring topology.

Abstract translation: 在一个实施例中，一种方法包括在计算网络中创建包括用于到达目的地网络节点的多个路由弧的无环路由拓扑，每个路由弧包括作为路由电弧的第一端的第一网络节点， 第二网络节点作为路由电弧的第二端，以及至少第三网络节点，被配置为经由路由选择电弧的第一或第二端中的任何一个路由沿着路由电弧的任何网络业务，至少 第一，第二或第三网络节点之一被实现为具有规定的环形拓扑的基于环的网络; 以及建立无循环标签交换路径，用于经由无环路由拓扑的路由弧到达目的网络节点，标签交换路径与规定的环形拓扑的任何属性独立且不同。

公开(公告)号：US08578054B2

公开(公告)日：2013-11-05

申请号：US12044526

申请日：2008-03-07

Applicant: Pascal Thubert ,  Jean-Philippe Vasseur ,  Vincent Jean Ribiere

Inventor： Pascal Thubert ,  Jean-Philippe Vasseur ,  Vincent Jean Ribiere

IPC: G06F15/173

CPC classification number: H04L47/125 ,  H04L45/128 ,  H04L45/22 ,  H04L45/64 ,  H04W40/28

Abstract: In one embodiment, a reactive routing computer network may be partitioned into diverse logical topologies, and a source node may transmit route request (RREQ) messages toward a destination node on each logical topology. In response, the source node may receive route reply (RREP) messages indicating routes to the destination node in each logical topology. The source node may thus select a route for each logical topology to reach the destination node, accordingly. In another embodiment, if partitioned logical topologies do not produce two or more routes or as a standalone embodiment, the source node may transmit RREQ messages toward the destination node without any corresponding logical topology. The destination node receives RREQ messages, and two or more routes from the source node to the destination node may be determined (e.g., by the destination or source node) based on the received RREQ messages at the destination node and path selection criteria.

Abstract translation: 在一个实施例中，可以将反应性路由计算机网络划分成不同的逻辑拓扑，并且源节点可以向每个逻辑拓扑上的目的地节点发送路由请求（RREQ）消息。 作为响应，源节点可以在每个逻辑拓扑中接收指示到目的地节点的路由的路由回复（RREP）消息。 因此，源节点可以相应地为每个逻辑拓扑选择到达目的地节点的路由。 在另一个实施例中，如果分区逻辑拓扑不产生两个或更多个路由或者作为独立实施例，则源节点可以向目的地节点发送RREQ消息而没有任何对应的逻辑拓扑。 目的地节点接收RREQ消息，并且可以基于目的地节点处的接收到的RREQ消息和路径选择标准来确定从源节点到目的地节点的两条或更多路由（例如，由目的地或源节点）。