公开(公告)号：US20140219256A1

公开(公告)日：2014-08-07

申请号：US14127920

申请日：2012-06-20

Applicant: Pascal Viger ,  Patrice Nezou ,  Julien Sevvin

Inventor： Pascal Viger ,  Patrice Nezou ,  Julien Sevvin

IPC: H04W28/26

CPC classification number: H04W28/26 ,  H04W72/02 ,  H04W72/04 ,  H04W74/00 ,  H04W74/02

Abstract: A method of accessing a communication medium used by a plurality of communication terminals, comprising the following steps, performed by a first communication terminal belonging to a group of communication terminals from the plurality of communication terminals: detecting 410 an upcoming reservation, by a second communication terminal of the group, of an occupancy time interval of the communication medium, determining 420 a timeslot in the occupancy time interval, and transmitting 460 data over the communication medium during the determined timeslot. The method provides improvements in the communications of communication terminals sharing a communication medium.

Abstract translation: 一种访问由多个通信终端使用的通信介质的方法，包括以下步骤：由属于多个通信终端的一组通信终端的第一通信终端执行：通过第二通信检测410即将到来的预约 在通信介质的占用时间间隔中确定420占用时间间隔中的时隙，并且在确定的时隙期间通过通信介质发送460个数据。 该方法提供了共享通信介质的通信终端的通信的改进。

公开(公告)号：US10009924B2

公开(公告)日：2018-06-26

申请号：US14118735

申请日：2012-05-14

Applicant: Patrice Nezou ,  Julien Sevin ,  Pascal Viger

Inventor： Patrice Nezou ,  Julien Sevin ,  Pascal Viger

IPC: H04W74/08 ,  H04L12/413

CPC classification number: H04W74/0816 ,  H04L12/413 ,  H04W74/085

Abstract: The invention is directed to the optimization of an access to a medium in wireless networks which can be accessed by a plurality of nodes, each node of the plurality of nodes using a medium access mechanism of the Carrier Sense Multiple Access with Collision Avoidance type based on a computation of a backoff value. A specific value is associated with each node of a set of nodes of the plurality of nodes, the specific value of a node being known by the other nodes of the set of nodes. According to the invention, a backoff value is determined for each node of the set of nodes, in each node of the set of nodes, the backoff value associated with a node being determined as a function of the specific value associated with that node.

公开(公告)号：US20100095002A1

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

申请号：US12441372

申请日：2007-09-13

Applicant: Pascal Viger ,  Patrice Nezou

Inventor： Pascal Viger ,  Patrice Nezou

IPC: G06F15/173

CPC classification number: H04L47/724 ,  H04L47/70 ,  H04L47/782 ,  H04L47/829

Abstract: Disclosed is a method of resource reservation in the context of the transmission of a data content on a transmission path between a source device and a sink device belonging to a communications network. Said network comprises plurality of subnets interconnected by at least one interconnection device possessing at least two communications interfaces connected to said subnets.

Abstract translation: 公开了在属于通信网络的源设备和宿设备之间的传输路径上传输数据内容的上下文中的资源预留的方法。 所述网络包括由至少一个互连设备互连的多个子网，所述至少一个互连设备具有连接到所述子网的至少两个通信接口。

公开(公告)号：US20140153514A1

公开(公告)日：2014-06-05

申请号：US14118735

申请日：2012-05-14

Applicant: Patrice Nezou ,  Julien Sevin ,  Pascal Viger

Inventor： Patrice Nezou ,  Julien Sevin ,  Pascal Viger

IPC: H04W74/08

CPC classification number: H04W74/0816 ,  H04L12/413 ,  H04W74/085

Abstract: The invention is directed to the optimization of an access to a medium in wireless networks which can be accessed by a plurality of nodes, each node of the plurality of nodes using a medium access mechanism of the Carrier Sense Multiple Access with Collision Avoidance type based on a computation of a backoff value. A specific value is associated with each node of a set of nodes of the plurality of nodes, the specific value of a node being known by the other nodes of the set of nodes. According to the invention, a backoff value is determined (505, 510) for each node of the set of nodes, in each node of the set of nodes, the backoff value associated with a node being determined as a function of the specific value associated with that node.

Abstract translation: 本发明涉及对可由多个节点访问的无线网络中的介质的访问的优化，所述多个节点中的每个节点使用基于所述多个节点的具有冲突避免类型的载波侦听多路访问的介质访问机制 退避值的计算。 特定值与多个节点中的一组节点的每个节点相关联，节点的特定值由该组节点的其他节点所知。 根据本发明，在该组节点的每个节点中，针对节点集合中的每个节点确定退避值（505,510），与节点相关联的退避值被确定为相关联的特定值的函数 与该节点。

公开(公告)号：US08837472B2

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

申请号：US12632663

申请日：2009-12-07

Applicant: Pascal Viger ,  Stéphane Baron

Inventor： Pascal Viger ,  Stéphane Baron

IPC: H04L12/54 ,  H04L12/66 ,  H04L12/701 ,  H04J3/06 ,  H04L12/46

CPC classification number: H04L12/4633 ,  H04J3/06 ,  H04L12/66 ,  H04L45/00

Abstract: A method is disclosed for transmitting a multi-channel data stream comprising frames comprising a plurality of channels, the transmitting being done via a multi-transport tunnel from a first tunnel end-point to a second tunnel end-point, the multi-transport tunnel implementing at least one first carrier supporting a transport protocol with acknowledgement and at least one second carrier supporting a transport protocol without acknowledgement.More specifically, the invention proposes to introduce a delay in the sending of data ( >) via the first carrier as compared with the sending of data ( >) via the second carrier. Thus the invention guarantees the order of arrival of channels that are associated with a same piece of synchronization but are transmitted on distinct first and second carriers and come from the separation of a same multi-channel data frame.

Abstract translation: 公开了一种用于发送包括包括多个信道的帧的多信道数据流的方法，所述发射是经由多传输隧道从第一隧道端点到第二隧道端点完成的，所述多传输隧道 至少一个支持具有确认的传输协议的第一载波和至少一个支持传输协议的第二载波，而不需要确认。 更具体地，本发明提出了通过第二载体与数据发送（“不太重要>>”）相比，经由第一载波发送数据发送的延迟（<<高重要性>>）。 因此，本发明保证与同一同步相关联但是在不同的第一和第二载波上发送的信道的到达顺序来自相同的多信道数据帧的分离。

公开(公告)号：US08086691B2

公开(公告)日：2011-12-27

申请号：US11434168

申请日：2006-05-16

Applicant: Pascal Viger ,  Frédéric Maze

Inventor： Pascal Viger ,  Frédéric Maze

IPC: G06F15/16

CPC classification number: H04N1/00209 ,  H04L63/101 ,  H04L67/04 ,  H04L67/06 ,  H04L67/104 ,  H04L67/1063 ,  H04L67/1068 ,  H04L67/26 ,  H04L67/2842 ,  H04N1/00132 ,  H04N1/00137 ,  H04N1/00148 ,  H04N1/00164 ,  H04N1/00244 ,  H04N1/32101 ,  H04N21/4788 ,  H04N21/632 ,  H04N2201/0084 ,  H04N2201/3226 ,  H04N2201/3247

Abstract: In order to share digital data in a peer to peer communication network, a partial version of the data is firstly transmitted to destination stations, and: a collection of data is created in which an identifier is associated with each data item and to each data identifier there is allocated a label indicating whether the complete version of the data item is available on the network; the existence of the collection is notified to at least one destination station; and, on the reception of information on availability on the network of the complete versions of the data of the collection: the collection is updated; and the updating of the shared collection is notified to the destination station or stations.

Abstract translation: 为了在对等通信网络中共享数字数据，首先将数据的部分版本发送到目的站，并且：创建数据的集合，其中标识符与每个数据项和每个数据标识符相关联 分配了指示网络上数据项的完整版本是否可用的标签; 收集的存在通知至少一个目的地站; 并在接收有关网络上可用性信息的完整版本的数据收集：收集更新; 并将共享集合的更新通知给目标站或站。

公开(公告)号：US07966491B2

公开(公告)日：2011-06-21

申请号：US10857884

申请日：2004-06-02

Applicant: Eric Nassor ,  Frédéric Maze ,  Pascal Viger

Inventor： Eric Nassor ,  Frédéric Maze ,  Pascal Viger

IPC: H04L9/32

CPC classification number: H04L63/08 ,  H04L67/104 ,  H04L67/1063 ,  H04L69/329

Abstract: A central server in a network of a hybrid peer to peer type, receives a request from a client for obtaining a digital document, where the request contains a reference of the digital document. The server selects a peer system of the network likely to contain the digital document, and generates an access key for controlling access to the digital document by the client, where the access key is generated by an encrypting method using a private key of the central server, a current time when the encrypting method is executed and an address of the client on the network. The server then sends a message to the client, where the message has the reference of the digital document, an address of the selected peer system on the network and the generated access key.

Abstract translation: 混合对等类型的网络中的中央服务器，从客户端接收用于获取数字文档的请求，其中请求包含数字文档的引用。 服务器选择可能包含数字文档的网络的对等系统，并且生成用于控制客户机对数字文档的访问的访问密钥，其中通过使用中央服务器的私钥的加密方法生成访问密钥 ，执行加密方法的当前时间和网络上客户端的地址。 然后，服务器向客户端发送消息，其中消息具有数字文档的引用，网络上所选择的对等系统的地址和生成的访问密钥。

公开(公告)号：US20100290479A1

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

申请号：US12778374

申请日：2010-05-12

Applicant: Stéphane Baron ,  Pascal Viger

Inventor： Stéphane Baron ,  Pascal Viger

IPC: H04L12/56

CPC classification number: H04L12/4625 ,  H04L12/4641 ,  H04L12/4675

Abstract: In order to parameterize, within a communication network, a bridge to be put in communication with at least one element to be connected to said bridge, said bridge comprising at least one created port, a parameter representing a predetermined waiting period and corresponding to a time for detection by said bridge, during a phase of listening to the data received by said at least one created port, of the presence of any communication loop within said network, is determined; a filtering of said at least one created port is activated, said filtering being adapted to prevent the sending and reception by said at least one created port of inter-bridge management messages; the bridge is configured with said parameter thus determined; a new port of said bridge is created with a view to setting up communication with said at least one element; and said filtering is deactivated.

Abstract translation: 为了在通信网络内参数化要与要连接到所述桥接器的至少一个元件通信的桥接器，所述桥接器包括至少一个创建端口，表示预定等待时段的参数并对应于时间 用于在由所述至少一个创建端口收听的数据的阶段期间由所述网桥进行检测，确定所述网络内任何通信环路的存在; 对所述至少一个创建端口的过滤被激活，所述过滤适于阻止所述至少一个创建的桥间管理消息端口的发送和接收; 桥被配置有如此确定的所述参数; 创建所述桥的新端口，以便建立与所述至少一个元件的通信; 并且所述滤波被去激活。

公开(公告)号：US07734751B2

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

申请号：US10781772

申请日：2004-02-20

Applicant: Ioana Donescu ,  Pascal Viger ,  Frédéric Maze ,  Eric Nassor

Inventor： Ioana Donescu ,  Pascal Viger ,  Frédéric Maze ,  Eric Nassor

IPC: G06F15/173

CPC classification number: H04L63/104 ,  H04L67/104 ,  H04L67/1059 ,  H04L67/1076 ,  H04L69/329

Abstract: A method of allocating at least one service by a first peer (E) to a second peer (D), the peers being linked by means of a computer communication network, the first and second peers belonging respectively to a first and second group of peers adapted to share data, comprises the following steps: evaluating (E63) a distance (d0) between the first peer (E) and the second peer (D); and selecting (E65) a service allocated by the first peer (E) according to the value (d0) of the distance.

Abstract translation: 一种通过第一对等体（E）向第二对等体（D）分配至少一个服务的方法，所述对等体借助于计算机通信网络链接，所述第一和第二对等体分别属于第一和第二组对等体 适于共享数据，包括以下步骤：评估（E63）第一对等端（E）与第二对等端（D）之间的距离（d0）; 以及根据所述距离的值（d0）来选择（E65）由所述第一对等体（E）分配的服务。

公开(公告)号：US08812633B2

公开(公告)日：2014-08-19

申请号：US12566976

申请日：2009-09-25

Applicant: Pascal Viger ,  Stéphane Baron

Inventor： Pascal Viger ,  Stéphane Baron

IPC: G06F15/177

CPC classification number: H04L12/4633 ,  H04L29/12264 ,  H04L29/12424 ,  H04L29/12452 ,  H04L61/2046 ,  H04L61/2535 ,  H04L61/2546

Abstract: A method is proposed for providing a remedy to the problem of address conflict when setting up a communications tunnel between a first tunnel end-point of a first communications sub-network and a second tunnel end-point of a second communications sub-network distinct from said first sub-network, in proposing an efficient method for the dynamic management of the address spaces of each sub-network, implemented by a tunnel end-point upon detection of a request for linking two sub-networks by a tunnel.

Abstract translation: 提出了一种在第一通信子网的第一隧道端点与不同于第一通信子网的第二通信子网的第二隧道端点建立通信隧道时，为地址冲突问题提供补救的方法。 所述第一子网提出了一种在通过隧道检测到链接两个子网络的请求时，由隧道端点实现的每个子网的地址空间的动态管理的有效方法。