EP3646557A1 - Method of quic communication via multiple paths - Google Patents
Method of quic communication via multiple pathsInfo
- Publication number
- EP3646557A1 EP3646557A1 EP18749456.2A EP18749456A EP3646557A1 EP 3646557 A1 EP3646557 A1 EP 3646557A1 EP 18749456 A EP18749456 A EP 18749456A EP 3646557 A1 EP3646557 A1 EP 3646557A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- gateway
- paths
- communicating device
- connection identifier
- quic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000004891 communication Methods 0.000 title claims abstract description 60
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000004590 computer program Methods 0.000 claims description 11
- 230000004044 response Effects 0.000 claims description 3
- 238000013500 data storage Methods 0.000 claims 1
- 230000006870 function Effects 0.000 description 11
- 230000002776 aggregation Effects 0.000 description 7
- 238000004220 aggregation Methods 0.000 description 7
- 230000005540 biological transmission Effects 0.000 description 7
- 238000013508 migration Methods 0.000 description 7
- 230000005012 migration Effects 0.000 description 7
- 230000008901 benefit Effects 0.000 description 6
- 208000027744 congestion Diseases 0.000 description 6
- 238000013459 approach Methods 0.000 description 3
- 230000008859 change Effects 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 230000001413 cellular effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 101150012579 ADSL gene Proteins 0.000 description 1
- 102100020775 Adenylosuccinate lyase Human genes 0.000 description 1
- 108700040193 Adenylosuccinate lyases Proteins 0.000 description 1
- 206010001488 Aggression Diseases 0.000 description 1
- VYZAMTAEIAYCRO-UHFFFAOYSA-N Chromium Chemical compound [Cr] VYZAMTAEIAYCRO-UHFFFAOYSA-N 0.000 description 1
- 230000001133 acceleration Effects 0.000 description 1
- 230000016571 aggressive behavior Effects 0.000 description 1
- 208000012761 aggressive behavior Diseases 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 239000000872 buffer Substances 0.000 description 1
- 230000001143 conditioned effect Effects 0.000 description 1
- 230000010485 coping Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005538 encapsulation Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000004377 microelectronic Methods 0.000 description 1
- 238000011017 operating method Methods 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 230000035755 proliferation Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 229920006395 saturated elastomer Polymers 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/436—Interfacing a local distribution network, e.g. communicating with another STB or one or more peripheral devices inside the home
- H04N21/4363—Adapting the video stream to a specific local network, e.g. a Bluetooth® network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/2854—Wide area networks, e.g. public data networks
- H04L12/2856—Access arrangements, e.g. Internet access
- H04L12/2869—Operational details of access network equipments
- H04L12/2898—Subscriber equipments
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/66—Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/10—Architectures or entities
- H04L65/102—Gateways
- H04L65/1033—Signalling gateways
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/1066—Session management
- H04L65/1069—Session establishment or de-establishment
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/14—Session management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L69/164—Adaptation or special uses of UDP protocol
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/18—Multiprotocol handlers, e.g. single devices capable of handling multiple protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client
- H04N21/61—Network physical structure; Signal processing
- H04N21/6106—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client
- H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
- H04N21/647—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless
- H04N21/64707—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless for transferring content from a first network to a second network, e.g. between IP and wireless
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L69/163—In-band adaptation of TCP data exchange; In-band control procedures
Definitions
- the present invention relates to the field of telecommunications, including communication networks capable of implementing the IP (Internet Protocol). More particularly, the present invention relates to the provision of services in "value added" IP networks, that is to say networks capable of performing differentiated processing according to the nature of the traffic carried in the network.
- the invention applies to any type of client device ("User Equipment” in English), such as a fixed or mobile terminal, or a "connected TV", or a set-top box, or STB in English), or a media server, said client device being located behind a residential gateway (that is to say a home gateway or located in a company).
- client device User Equipment
- the invention applies when a first residential gateway is located behind a second residential gateway; in this case, the first residential gateway will be considered a client device.
- a client device of any type will often be referred to as the "terminal" below.
- Terminals such as smartphones (“smartphones”) and personal computers ("personal computers” or PCs in English) are now able to activate and operate multiple logical interfaces related to one or more physical interfaces .
- Such terminals are called “multi-interfaces” (“multi-interface” or MIF in English).
- MIF multi-interface
- IP addresses can then be assigned to a MIF terminal. These addresses are used when it connects to different types of networks such as a fixed network, a mobile network or a WLAN (initials of the words "Wireless Local Area Network” meaning “Local Wireless Network”, whose Wi-Fi networks are an iconic example), simultaneously or delayed. These IP addresses can: • belong to the same family of addresses or to different families of addresses (IPv4, IPv6 or both),
- MIF "MIF" characteristic is volatile because the ability to use multiple interfaces depends on the conditions of connection to the network (s), the location of the device, or other factors.
- a device may become MIF in the process of establishing a simple call (i.e., a call established along a single path with a given caller), or even after establishing a call simple.
- a device does not know a priori if it is possible for him to use several different paths to establish a communication with a given correspondent; more specifically, the device acquires this information (if any) only after a phase in which it attempts to establish a communication using multiple paths with the correspondent.
- a “multipath communication” is a communication established between two devices simultaneously using one or more paths between these two devices.
- the establishment and maintenance of such communication is based on the use of a dedicated protocol, such as MPTCP (Multi-Path TCP), which may possibly be defined as an extension of a previously defined transport protocol. , such as TCP (initials of the words “Transmission Control Protocol” meaning “Transmission Control Protocol”).
- MPTCP Multi-Path TCP
- TCP transmission Control Protocol
- a multipath communication is an aggregate of one or more simple communications taking the same path or different paths (partially or completely disjoint).
- link aggregation refers to the grouping of several links associated with as many (logical) interfaces as if it were a single link associated with a single interface, in particular with the aim of increasing the throughput beyond the limits of a single link, but also to apply the same operating procedures to all the links thus aggregated (notion of "fate sharing" in English).
- service offerings relating to a terminal having a hybrid access are based on the introduction into the network of functions making it possible to aggregate all the network communications of a terminal (for example: WLAN and 3G, or ADSL , WLAN and 4G).
- Link aggregation also allows other interfaces to take over if a network link goes down (redundancy principle). Link aggregation applies to any type of traffic carried along these links, including IP traffic.
- Link aggregation can also be used to split traffic across multiple links.
- the distribution of traffic between links that are aggregated depends on various parameters; the distribution of traffic may thus depend on the traffic engineering policy (for example, privileging the routing of a particular traffic on a link whose characteristics in terms of robustness or availability are compatible with the nature of said traffic), or the Quality of Service (QoS) policy, which can for example privilege certain links in a context of traffic prioritization.
- the traffic engineering policy for example, privileging the routing of a particular traffic on a link whose characteristics in terms of robustness or availability are compatible with the nature of said traffic
- QoS Quality of Service
- link aggregation makes no assumptions about the configuration of the remote machine.
- a source machine can request a link aggregation function without the remote machine using such a function.
- Backup mode this mode consists in using secondary paths in the event of unavailability of the primary paths, and this, in order to improve the network availability and, consequently, the robustness and the reliability of the communications IP established on the different links;
- associative mode (“bonding" in English): this mode is to use the resources associated with all or part of the available paths, the IP flows associated with the same application can be divided between several paths; the choice to use all the paths, or only a part of them, can for example be conditioned by the nature of the traffic or the availability or reliability characteristics associated with each path, which can vary greatly from one path to another; all the paths selected for this associative mode are considered to be primary paths; and
- this mode is similar to the associative mode, except that the flows of a given application are not distributed among several paths, but are sent on a single path.
- the transport protocols mainly used by software applications to communicate on the Internet are TCP (mentioned above) and UDP (initials of the words "User Datagram Protocol” meaning “User Datagram Protocol”).
- the transport functions are defined as the list of services offered by a protocol used to multiplex connections at the transport layer. This list contains, for example, the orderly data transmission, reliable transmission, congestion control, or integrity check.
- a working group, called "Transport Services" (TAPS) was created by the Internet Engineering Task Force (IETF) to help developers define the interfaces to invoke the different services offered by transport protocols specified by IETF.
- TCP Stream Control Transmission Protocol
- SCTP Stream Control Transmission Protocol
- DCCP Datagram Congestion Control Protocol
- UDP-lite is a simplified version of UDP that has been proposed for applications that do not require all the features offered by UDP (for example, integrity checking).
- DTLS Datagram Transport Layer Security
- TLS protocols have been defined to meet the application-level encryption requirements at the transport layer.
- TCP extensions are intended to satisfy new application constraints (for example, increase resilience in the event of an IP address change), but also to coping with new IP network conditions (for example, increasing the throughput of TCP connections), and new user requirements (for example, improving security or reducing the time it takes to establish the session).
- the QUIC protocol Quick UDP Internet Connection
- QUIC Quick UDP Internet Connection
- IETF draft-tsvwg-quic-protocol-02, January 2016 is an IETF-based protocol in process of being UDP-based, and which aims to reduce the latency generally observed during the recovery of HTTP connections.
- the QUIC protocol was originally proposed by Google, which integrated it into its "Chrome" web browser.
- a QUIC connection makes it possible to multiplex different channels, called "streams", in the same connection.
- the QUIC protocol makes it possible to relieve the operating system of the constraints imposed by the transport layer, such as the cyclic redundancy check intended to verify the integrity of the communication.
- QUIC In the QUIC protocol, most packet headers are encrypted to improve the security and robustness of the communication. Unlike TLS (the initials for Transport Layer Security), QUIC not only encrypts the valuable data exchanged, but also the control information. connection. QUIC information sent in the clear is limited to the bare minimum (for example, the version number or a login ID).
- UDP makes it possible to accommodate the presence of intermediate devices ("middleboxes" in English), such as firewalls or NAT, on the path taken by a communication QUIC.
- the QUIC protocol aims to limit the handshake procedure to zero RTT (Round Trip Time), which means that the useful data can be sent immediately, that is to say as soon as the first one is sent.
- packet of a QUIC connection without the QUIC client having to wait for its correspondent's response.
- a specific "stream” is dedicated to the encryption of handshake exchanges and the negotiation of QUIC options.
- QUIC signaling integrates information to control congestion and recover lost packets in a mode of operation comparable to that of TCP.
- a QUIC client has the ability to send frames called "WINDOW UPDATE” which allow to adjust the limit of "offset" for a given "stream", which allows to improve the packet transmission efficiency, like the TCP window characteristic window size control function ("the offset” is a parameter that allows a QUIC receiver to calibrate the size of the receive window).
- the receiver sends WINDOW UPDATE frames that increase the value of the offset to allow the sender to send more data on that data.
- QUIC includes a connection control mode that makes it possible to manage the size of buffers allocated by a QUIC client to all of the characteristic "streams" of a connection.
- the protocol does not rely on transport addresses (source IP address, source port number, destination IP address, destination port number ), but on an identifier called CID (Connection IDentifier, or login ID). This identifier is generated randomly by a QUIC client.
- CID Connection IDentifier, or login ID
- QUIC does not distinguish the migration of a connection to a new path, or the simultaneous use of a set of known paths
- a terminal using QUIC does not have the ability to dynamically discover multiple paths when this terminal is located in a residential or enterprise local area network (LAN);
- a terminal using QUIC which would have discovered by any means the availability of several paths does not have the possibility of forcing the packets sent by this terminal to follow one of these paths which would be chosen by the terminal;
- traffic distribution policies via multiple paths as activated by a QUIC terminal may not be optimal for the operator; for example, the typical distribution policy in a hybrid access environment (that is, an environment that allows a device to exploit the resources of multiple wired and wireless access networks) is to not use radio resources only if the primary link (fixed access, usually) is saturated; a terminal using QUIC is not aware of these policies; moreover, in the context of hybrid access, the delegation of management of the terminal traffic distribution policy may lead to saturation of some radio cells while the fixed network can be used for the flow of traffic;
- a terminal attached to an access network is unable to use the resources associated with that network if only IPv6 prefixes are allocated to establish communications on that network while the remote server with which a QUIC call is established is not accessible only with the use of IPv4 addresses; in fact, the IPv4 and IPv6 protocols are incompatible by design, and it is therefore impossible to establish a QUIC communication between a terminal that only has an IPv6 address and a server that is accessible only to an IPv4 address. .
- said gateway associates a respective connection identifier C_ID # i with each of said paths Pi, and
- the gateway when the gateway receives from the communicating device a data packet, the gateway transmits this data packet on one of the paths Pi taking into account the connection identifier C_ID # i associated with this path Pi.
- a QUIC communication will benefit from the resources associated with multiple paths, even if these multiple paths are not visible from the endpoints of the communication.
- establishing a multi-path QUIC communication will have improved robustness and performance, which will improve the use of resources in the network, but also improve the quality of experience. as perceived by the client (thanks in particular to the ability to aggregate the bandwidth likely to be used by the QUIC communication, or the ability to switch the traffic to another path in case of failure for example).
- network operators will be able to better control certain functions (notably the management of multipath communications for a deterministic traffic distribution) which will enable them to optimize the use of network resources at their disposal, and therefore to offer QUIC connectivity with added value.
- said method first comprises the following steps:
- said communicating device discovers said plurality of paths Pi
- the communicating device sends to said gateway one or more messages specifying a respective connection identifier C_ID # i for each of said respective paths Pi.
- the gateway when the gateway receives from the communicating device a data packet comprising a connection identifier C_ID # i, the gateway transmits this data packet on the path Pi associated with this connection identifier C_ID # i.
- a QUIC client can force the selection of a specific path to route certain packets, if necessary despite the decision to select paths executed by a node further down the network and able to establish a path.
- QUIC communication on multiple paths; a QUIC client can thus influence the traffic distribution policy between several paths, even if the traffic distribution decision is executed by a node located further down the network.
- said gateway sends to said communicating device a message containing the list of known paths Pi of the gateway.
- a QUIC client can dynamically discover the existence of multiple paths (not visible locally).
- connection identifier QUIC allows the traceability of the QUIC connections during the attachment of the client QUIC to new networks. This is why, according to other particular characteristics, when said gateway receives from said communicating device a data packet comprising a connection identifier C_ID # 0, the gateway transmits this data packet on one of said paths Pi, replacing said connection identifier C_ID # 0 by said connection identifier C_ID # i associated with this path Pi if the connection identifiers C_ID # 0 and C_ID # i are different from each other.
- said gateway when said data packet received from said communicating device is sent in response to a message sent by its correspondent, said gateway transmits this data packet to the correspondent on the path on which said message reached the gateway.
- the gateway knows in this case on which way it must transmit said packet of data received from the communicating device.
- said communicating device and / or said gateway send to the correspondent of the communicating device a message comprising the list of known paths of the communicating device and / or the gateway.
- said correspondent is informed of the paths that he can use to send data to the communicating device. This is particularly useful for communicating to the correspondent of the addresses to be used to send data to the communicating device without the latter having used one of these addresses beforehand to communicate with this correspondent.
- said gateway implements a traffic distribution policy comprising traffic distribution rules between the different available networks.
- the quality of customer experience is improved without the QUIC customers adopting an aggressive behavior compared to the (x) network (s) of access, that is to say a behavior that would result in phagocyting all the resources of the access network for the sole benefit of the QUIC communications and to the detriment of other applications likely to use these same resources.
- said gateway sends the communicating device a message describing the traffic distribution policy to be observed.
- a QUIC client can dynamically discover the traffic distribution policies executed by a node located further in the network, observe these policies, and optionally inform its correspondent.
- the invention relates to various devices.
- the communicating devices involved in a communication may be any devices compatible with the IP protocol.
- a communicating device may be of any type, for example a client-device (terminal) or a content server. It can have one or more IP addresses assigned to each of its physical or logical interfaces. It may also have only one interface, in which case the home gateway, to which the client device is connected, is a relay device connected to one or more networks and compatible with the protocol QUIC.
- said communicating device further comprises means for receiving from said gateway, and taking into account, a message containing the list of known paths Pi of the gateway.
- said residential gateway further comprises means for:
- said residential gateway further comprises means for:
- connection identifier C_ID # 0 by said connection identifier C_ID # i associated with this path Pi if these connection identifiers C ID # 0 and C ID # i are different from each other.
- the invention also relates to a computer program downloadable from a communications network and / or stored on a computer readable medium and / or executable by a microprocessor.
- This computer program is notable in that it includes instructions for performing the steps of one of the communication methods succinctly set forth above, when executed on a computer.
- FIG. 1 schematically represents a conventional QUIC connection comprising several "streams" (channels),
- FIG. 2 represents a gateway connected to a plurality of paths and able to associate a respective connection identifier with each of said paths
- FIG. 3 schematically represents a procedure for discovering multiple paths according to a first embodiment of the invention
- FIG. 4 shows the sending by a terminal of three packets within the same connection QUIC according to an example of said first embodiment
- FIG. 5 represents a communication QUIC between a client C and a server S according to a second embodiment of the invention
- FIG. 6 represents an exemplary format for an UPDATE CID frame for updating the connection identifier QUIC
- FIG. 7 represents, according to a variant of said update procedure, the replacement of the identifier of a QUIC connection between a client C and a server S,
- FIG. 8 represents an exemplary format for an MP POLICY frame used to notify a traffic distribution policy to a correspondent
- FIG. 9 represents a QUIC communication between a client T1 and a server S, according to a first variant of use of the MP POLICY frame,
- FIG. 10 shows a QUIC communication between a client T1 and a server S, according to a second variant of use of the MP POLICY frame
- FIG. 11 represents a network-assisted multiple-path QUIC communication.
- a residential gateway denoted CPE (initials of the English words "Customer Premises Equipment") connected to one or more networks N1, N2, N3, and so on, by one or more paths P1, P2, is considered. P3, and so on.
- the CPE associates a connection identifier C_ID # 1 with a path connecting it to the network N1, a connection identifier C_ID # 2 to a path connecting it to the network N2, a connection identifier C_ID # 3 to a path connecting it to the N3 network, and so on.
- these connection identifiers are not necessarily all different from each other; in some cases, the same connection identifier may be used for all packets sent or sent by the CPE on each of the paths as part of the same communication QUIC.
- the CPE can, for example, serve as an intermediate in a QUIC communication between a server S and a terminal T1 (single-interface, or multi-interface) located behind the CPE.
- a T1 terminal located behind a CPE and able to implement a multipath discovery procedure is considered. This discovery procedure is shown schematically in FIG.
- the terminal T1 can send messages, called DISCOVER_PATH (); such a message can be sent on all or only certain active network interfaces of the terminal.
- a given path Pi can be identified by:
- a physical address for example a MAC (Medium Access Control) address
- the ADVERT PATHS (Pi) message can be sent by a CPE following a request from a terminal behind the CPE, or spontaneously, ie without the CPE having been explicitly requested by a terminal.
- the CPE can send an ADVERT PATHS (Pi) message:
- the terminal T1 sends one or more MAP messages (C_ID # i, Pi).
- the MAP () message also optionally makes it possible to announce the characteristics of the traffic (in particular, the IP addresses and the source and destination port numbers), in order to be able to identify a QUIC connection capable of routing said traffic.
- the MAP () message can be sent before or after the establishment of a QUIC connection with a correspondent of the terminal T1.
- the CPE Following receipt of one or more MAP messages (C_ID # i, Pi), the CPE installs the associations as indicated by the terminal T1. If an association is already present for this terminal and for the same connection identifier, the CPE replaces it with a new instruction received from the terminal T1.
- the CPE uses a stable identifier, such as a MAC address, to identify the associations of the same terminal. Associations can have a limited life.
- the CPE can complete the characteristic information of an association by information received from the correspondent of the terminal T1.
- the CPE may indicate to the terminal T1 another connection identifier to be used in the event, for example, of a conflict between a C_ID # i identifier and an identifier already chosen by another terminal.
- Other login credentials policies can be executed by the CPE.
- the allocation of the connection identifier by the CPE is intended to facilitate the identification of QUIC connections. Indeed, the CPE anticipates receipt of QUIC packets by installing traffic templates according to the previously known connection identifier. It should be noted in this regard that this possibility for an entity other than a client or a server to allocate a connection identifier is not known in the state of the art.
- the CPE sends the terminal T1 an acknowledgment message MAP_ACK () which provides an inventory of the installed associations.
- the CPE can also return the other known associations for this terminal.
- the CPE In order to allow the CPE to distribute the traffic via the multiple paths according to a known policy of the terminal T1, the latter must naturally use the appropriate identifier in accordance with the associations previously programmed on the CPE.
- the CPE may divide the traffic received from a terminal between several available paths without said terminal having communicated to the CPE traffic distribution instructions, or even that the terminal is informed of the existence of multiple paths.
- the CPE executes a traffic distribution algorithm according to preconfigured policies.
- FIG. 4 illustrates, by way of example, the sending by a terminal T1 of three packets within the same connection QUIC; each of these packets is identified by a dedicated connection identifier C_ID # i.
- the CPE consults its association table to determine the path to use to send the packet to its destination.
- a packet whose connection identifier is C_ID # 1 is transmitted via the network N1
- a packet whose connection identifier is C_ID # 2 is transmitted via the network N2
- a packet whose identifier of connection is C_ID # 3 is transmitted via the N3 network.
- the transmitted packets are associated with the same connection identifier (noted C_ID # a in Figure 4); this identifier can be generated by the CPE, but also, alternatively, by the terminal T1 or by its correspondent.
- connection identifiers QUIC may be created by one or the other of the participants in a communication QUIC.
- a client C located behind a CPE.
- This client C sends data packets including a connection identifier QUIC noted C_ID # 0 generated by the client C.
- connection identifiers C_ID # i alias
- the CPE sets up associations between connection identifiers C_ID # i (alias) and the respective paths Pi, for example by configuring an association table in a database.
- an alias may be generated by the CPE, but also, alternatively, by the client C or by the server S. For example, if said first packet is received by the CPE from the server S on a path Pi , and that this packet includes a connection identifier C_ID # i, the CPE preferably associates this alias C_ID # i to this path Pi.
- any two alias C_ID # i and C_ID # j, with i different from j, may have identical or different values between them.
- the CPE then transmits said first packet to its recipient (server S or client C).
- the CPE transmits this packet to the server S on one of the paths Pi, after consultation of its association table and modification in this packet (if any) of the value of the connection identifier QUIC, ie replacement of C_ID # 0 by the alias C_ID # i associated with the path Pi (if C_ID # i is different from C_ID # 0).
- the CPE can notably implement this procedure of rewriting the original QUIC connection identifier C_ID # 0 in order to contribute to the preservation of the confidentiality of the data exchanged between the client C and the server S.
- the CPE can decide to update the connection identifier if it connects to a new network, or if the data is distributed via multiple paths known to the CPE and / or the server S. These aliases are then preferably known than the CPE and the server S.
- CJD QUIC connection identifier
- the migration of CJD may be initiated by the CPE, the client or the server;
- CJD migration can occur at any time during a QUIC connection; thus, CJD migration can take place just before a connection is migrated to a new path (or network attachment), or just after a connection is migrated to a new path (or new network attachment) ); and
- the client or the server sends a frame of type "CIDJJPDATE".
- An example format for this CIDJJPDATE frame is shown in FIG. 6.
- This frame is sent in a QUIC message whose identifier is that of the QUIC connection already established between the participants.
- This frame can be sent together with other data, or sent in a dedicated QUIC message.
- the message QUIC which contains a frame CIDJJPDATE by a correspondent, it performs the standard QUIC validations to ensure that the message comes from a legitimate terminal. Once the message has been validated, the correspondent extracts the information contained in the frame CIDJJPDATE.
- traffic distribution can be configured on the CPE, in order to allow it to distribute the traffic between the different available networks; these policies can be configured by a service provider or a user; an example of a policy is to use the radio resources only in the event of unavailability of a fixed access network or when the available resources (maximum) of the main access network (typically the wired network) no longer allow to dispose of the characteristic traffic of a given application; traffic distribution policies are critical, as improper use of available resources can lead to rapid consumption of the available quota on a given access link, or even a significant increase in the amount of the bill to be paid by the user; Controlling a traffic distribution policy is also critical for an operator because it helps to minimize the risk of congestion of certain links (for example, the excessive use of a cellular connection by a multi-interface CPE may congest a cell to the detriment of single-interface mobile terminals).
- the CPE can adjust its traffic distribution
- the CPE can communicate to the terminal / client the traffic distribution policy to be observed, by means of the MAP primitive (C_ID # i, Pi, POLICY).
- the POLICY object can include, for example:
- a traffic distribution ratio for example, 10% for P1, 80% for P2, 10% for P3
- the terminal / customer must comply with the traffic distribution policy as indicated by the CPE. Since the traffic distribution policy does not only concern outgoing traffic but also incoming traffic, a new frame, called MP POLICY, is used to notify a correspondent of the terminal / client.
- MP POLICY a new frame
- a terminal / client capable of exchanging data via multiple paths may include an MP POLICY frame in a QUIC message sent to its correspondent.
- This frame makes it possible to announce to the correspondent the list of known paths of the terminal / client (in particular, the addresses to be used to send data to the terminal / client without the latter having used one of these addresses beforehand to communicate with this terminal. corresponding), as well as, optionally, the policy of distribution of incoming traffic (from the correspondent to the terminal / customer).
- FIG. 8 A possible format for this MP POLICY frame is shown in FIG. 8. In this figure:
- the "Sub-type” field can indicate for example the following values: o "0": list the multiple paths known to the issuer; the field “Data” must then include a list of known paths of the transmitter of the frame; for example, the "Data” field may include a list of IP addresses (or ports) to be used to send packets to the same terminal under the same multipath connection; o "1”: traffic distribution policy between the different multiple paths; the available paths can be used simultaneously; o "2”: a maximum volume of data is to be sent by path; the "Data” field specifies the volume and the path concerned;
- o "3" indicates a usage ratio per path; the "Data” field specifies this policy, for example 10% for P1, 80% for P2, and 10% for P3; o "4": Indicates that the best RTT algorithm should be used.
- the MP POLICY frame can be sent by one of the participants, or by all participants in a QUIC connection. It can be sent at any time from a QUIC connection. It can be sent together with other control data or useful data. One or more frames MP POLICY can be included in the same QUIC message. An MP POLICY frame can be used to signal that a path is no longer available.
- a QUIC correspondent who receives an MP POLICY frame saves a copy of the contents of the frame in his QUIC connection table.
- this table contains login identifiers (C_ID). If the frame mentions other IP addresses (or ports), the correspondent can use this information to communicate via multiple paths, that is to say to send packets having as destination address (destination port) one addresses indicated in the MP POLICY frame.
- the traffic distribution policies indicated in the MP POLICY frame inform the correspondent of the approach to follow to send the data of the same connection QUIC to the various available paths.
- FIG. 9 represents a QUIC communication between a terminal T1 and a server S, according to a first variant in which the terminal T1 announces to the server S the list of available paths using an MP POLICY frame.
- the frame is sent via the path that passes through the N1 network.
- the server can send the data of this same connection via the other paths to the terminal T1 (N2 or N3) without the terminal T1 having used these paths to communicate with S.
- FIG. 10 represents a QUIC communication between a terminal T1 and a server S, according to a second variant in which an MP POLICY frame is inserted by the CPE.
- the content of the MP POLICY frame can be controlled and possibly modified by the CPE.
- This variant makes it possible to increase the list of multiple paths and to indicate the policy of distribution of traffic in coherence with that of the operator, in particular in the case where the CPE is operated by the operator.
- the CPE can remove the connection identifier from the public (ie unencrypted) header, if another connection identifier is included in the encrypted portion of the message QUIC.
- connection identifier QUIC used by a terminal is encrypted
- a new identifier called "Provider Connection Identifier”, and noted PCJD can be exploited by a operator to control the use of different access networks accessible from a CPE to establish QUIC connections.
- a device called "QUIC Provider Proxy” (denoted P in FIG. 11) is introduced into the operator's network to control the routing of the data along the various multiple paths, but also to remove said PCJD identifier before routing the data to their final destination.
- Provider Connection Identifier information is:
- the MP POLICY frame defined above can be used both by the CPE and by the "QUIC Provider Proxy" device to announce the different paths as well as the traffic distribution policy to be applied for both the uplink and the downlink, as required.
- FIG. 11 shows how the "QUIC Provider Proxy" (P) device makes it possible to use the resources of the various multiple paths without altering the connection identifier QUIC chosen by a terminal T1 located behind this CPE.
- the QUIC packets sent by T1 are intercepted by the CPE, which injects a unique identifier PC_ID # a and an MP POLICY frame on the various available paths.
- this device On receipt of these packets by a "QUIC Provider Proxy” device, this device saves the information contained in the MP POLICY frame in the local connection table, then removes the PC_ID # a and MP POLICY objects from the packets before sending them to their destination. final destination.
- the invention can be implemented within nodes of communications networks, for example terminals, routers or residential gateways, by means of software and / or hardware components.
- the present invention also relates to a computer system.
- This computer system conventionally comprises a central processing unit controlling by signals a memory, as well as a input unit and an output unit.
- this computer system may be used to execute a computer program including instructions for implementing any of the communication methods of the invention.
- This invention also relates to a computer program as briefly described above.
- This computer program may be stored on a computer readable medium and may be executable by a microprocessor.
- This program can use any programming language, and be in the form of source code, object code, or intermediate code between source code and object code, such as in a partially compiled form, or in any another desirable form.
- the invention also relates to an immovable information carrier, or partially or totally removable, comprising instructions of a computer program as briefly described above.
- This information carrier can be any entity or device capable of storing the program.
- the information carrier may comprise storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or a magnetic recording medium, such as a hard disk, or a USB flash drive ("USB flash drive").
- the information medium may be a transmissible medium such as an electrical or optical signal, which may be conveyed via an electrical or optical cable, by radio or by other means.
- the computer program according to the invention can in particular be downloaded to an Internet type network.
- the information carrier may be an integrated circuit in which the program is incorporated, the circuit being adapted to execute or to be used in the execution of any of the communication methods according to the invention.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Computer Security & Cryptography (AREA)
- Business, Economics & Management (AREA)
- General Business, Economics & Management (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR1755872A FR3067550A1 (en) | 2017-06-27 | 2017-06-27 | METHOD OF COMMUNICATING QUIC VIA MULTIPLE ROADS |
PCT/FR2018/051561 WO2019002754A1 (en) | 2017-06-27 | 2018-06-26 | Method of quic communication via multiple paths |
Publications (1)
Publication Number | Publication Date |
---|---|
EP3646557A1 true EP3646557A1 (en) | 2020-05-06 |
Family
ID=60182661
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP18749456.2A Pending EP3646557A1 (en) | 2017-06-27 | 2018-06-26 | Method of quic communication via multiple paths |
Country Status (5)
Country | Link |
---|---|
US (1) | US11088942B2 (en) |
EP (1) | EP3646557A1 (en) |
CN (1) | CN110999252B (en) |
FR (1) | FR3067550A1 (en) |
WO (1) | WO2019002754A1 (en) |
Families Citing this family (27)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9607336B1 (en) * | 2011-06-16 | 2017-03-28 | Consumerinfo.Com, Inc. | Providing credit inquiry alerts |
FR3067545A1 (en) * | 2017-06-21 | 2018-12-14 | Orange | METHOD FOR ACTIVATING PROCESSES APPLIED TO A DATA SESSION |
FR3067550A1 (en) * | 2017-06-27 | 2018-12-14 | Orange | METHOD OF COMMUNICATING QUIC VIA MULTIPLE ROADS |
FR3079987A1 (en) * | 2018-04-06 | 2019-10-11 | Orange | METHOD OF PROCESSING A TRANSACTION BETWEEN A SOURCE TERMINAL AND A DESTINATION TERMINAL, BANKING SERVICE SYSTEM, TERMINAL AND CORRESPONDING COMPUTER PROGRAM. |
CA3099038A1 (en) * | 2018-05-09 | 2019-11-14 | Netsurion Llc | Multi-path user datagram protocol |
US11245753B2 (en) * | 2018-08-17 | 2022-02-08 | Fastly, Inc. | User space redirect of packet traffic |
US10791485B2 (en) * | 2018-10-16 | 2020-09-29 | Cisco Technology, Inc. | Systems and methods for quick user datagram protocol internet connection (QUIC) with multipath |
CN112738004B (en) * | 2019-10-14 | 2021-11-16 | 上海哔哩哔哩科技有限公司 | Communication method and system based on QUIC transmission protocol |
US11412375B2 (en) | 2019-10-16 | 2022-08-09 | Cisco Technology, Inc. | Establishing untrusted non-3GPP sessions without compromising security |
US11985062B2 (en) * | 2020-02-14 | 2024-05-14 | Interdigital Patent Holdings, Inc. | Methods and apparatuses for enabling multi-host multipath secure transport with QUIC |
CN115152274A (en) * | 2020-02-28 | 2022-10-04 | 联想(新加坡)私人有限公司 | Access to traffic steering using multiple steering connections over different access networks |
US11570239B2 (en) * | 2020-04-20 | 2023-01-31 | Cisco Technology, Inc. | Distributed resilient load-balancing for multipath transport protocols |
CN111865940B (en) * | 2020-07-01 | 2022-10-11 | 四川速宝网络科技有限公司 | Transmission optimization method and device |
CN114205425A (en) * | 2020-09-02 | 2022-03-18 | 中国移动通信有限公司研究院 | Message transmission method, device, equipment and readable storage medium |
CN114928616A (en) * | 2021-02-03 | 2022-08-19 | 上海哔哩哔哩科技有限公司 | Transmission method and system of peer-to-peer network |
CN112994974A (en) * | 2021-02-09 | 2021-06-18 | 北京金山云网络技术有限公司 | Cluster node detection method, device, cluster, equipment and medium |
CN113114701B (en) * | 2021-04-30 | 2023-02-28 | 网络通信与安全紫金山实验室 | QUIC data transmission method and device |
US11811880B2 (en) | 2021-06-22 | 2023-11-07 | Adaptiv Networks Inc. | Edge link redundancy |
CN113676741B (en) * | 2021-07-19 | 2024-04-12 | Oppo广东移动通信有限公司 | Data transmission method and device, storage medium and electronic equipment |
CN113783942B (en) * | 2021-08-24 | 2023-01-31 | 中国科学院计算技术研究所 | MPQUIC data packet fast transmission method and system based on priority classification queue |
US11924299B2 (en) | 2021-09-15 | 2024-03-05 | Cisco Technology, Inc. | QUIC and anycast proxy resiliency |
CN115866075A (en) * | 2021-09-27 | 2023-03-28 | 华为技术有限公司 | Data transmission method and equipment |
CN114143386A (en) * | 2021-11-23 | 2022-03-04 | 广州三七极创网络科技有限公司 | Communication method, system, equipment and storage medium based on QUIC protocol |
US12069103B2 (en) | 2022-02-23 | 2024-08-20 | Cisco Technology, Inc. | Implementing policy based on unique addresses or ports |
WO2023179891A1 (en) * | 2022-03-23 | 2023-09-28 | Lenovo (Singapore) Ltd. | Sending data using steering in a selected quic connection |
CN115277560B (en) * | 2022-09-28 | 2023-01-17 | 鹏城实验室 | Heterogeneous network fusion transmission method and system based on MPTCP and MPQUIC |
CN117938550B (en) * | 2024-03-21 | 2024-05-24 | 北京火山引擎科技有限公司 | Path verification method and device in content distribution network |
Family Cites Families (32)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6904037B2 (en) * | 1996-11-05 | 2005-06-07 | Cisco Technology, Inc. | Asymmetric implementation of DSVD for voice/data internet access |
US6003088A (en) * | 1997-08-29 | 1999-12-14 | International Business Machines Corporation | Blocking IP datagrams in a multi-path channel point-to-point environment |
US6018770A (en) * | 1997-10-13 | 2000-01-25 | Research In Motion Limited | System and method for managing packet-switched connections |
US7003571B1 (en) * | 2000-01-31 | 2006-02-21 | Telecommunication Systems Corporation Of Maryland | System and method for re-directing requests from browsers for communication over non-IP based networks |
FR2895621A1 (en) * | 2005-12-23 | 2007-06-29 | France Telecom | METHOD AND GATEWAY CONNECTING IP COMMUNICATION ENTITIES THROUGH A RESIDENTIAL GATEWAY |
US7639625B2 (en) * | 2007-03-02 | 2009-12-29 | Cisco Technology, Inc. | Tracing connection paths through transparent proxies |
US8792487B2 (en) * | 2007-08-21 | 2014-07-29 | Cisco Technology, Inc. | Communication path selection |
WO2010044714A1 (en) * | 2008-10-16 | 2010-04-22 | Telefonaktiebolaget L M Ericsson (Publ) | A residential gateway providing backup interface to external network |
CN101895458B (en) * | 2009-05-18 | 2013-05-15 | 电信科学技术研究院 | Method and system for releasing packet data network connection, and data gateway |
US8730870B2 (en) * | 2009-10-29 | 2014-05-20 | At&T Intellectual Property I, L.P. | Systems and methods for wireless transmission of packet-based data to one or more residential gateways |
US8811152B2 (en) * | 2009-10-29 | 2014-08-19 | At&T Intellectual Property I, L.P. | System and method to support secondary channel connection from residential gateway to service provider network |
WO2011081588A1 (en) * | 2010-01-04 | 2011-07-07 | Telefonaktiebolaget L M Ericsson (Publ) | Method and apparatus for secure routing of data packets |
WO2011118196A1 (en) * | 2010-03-26 | 2011-09-29 | パナソニック株式会社 | Mobile wireless system, access point device, and handover processing method |
US8824480B2 (en) * | 2012-01-31 | 2014-09-02 | Alcatel Lucent | Method and apparatus for end-host based mobility, multi-homing and multipath protocols |
US20140169330A1 (en) * | 2012-12-14 | 2014-06-19 | Telefonaktiebolaget L M Ericsson (Publ) | Network Gateway Selection at Multipath Communication |
US9634919B2 (en) * | 2014-06-27 | 2017-04-25 | Cisco Technology, Inc. | Multipath data stream optimization |
FR3024004A1 (en) * | 2014-07-21 | 2016-01-22 | Orange | TCP COMMUNICATION METHOD VIA MULTIPLE PATHS BETWEEN TWO TERMINALS |
EP3016347B1 (en) * | 2014-10-27 | 2019-02-13 | Cisco Technology, Inc. | Multipath provisioning of l4-l7 traffic in a network |
US10117117B2 (en) * | 2015-02-13 | 2018-10-30 | British Telecommunications Public Limited Company | Restoration of network access |
US10069719B2 (en) * | 2015-06-16 | 2018-09-04 | Samsung Electronics Co., Ltd. | Method and apparatus for multipath media delivery |
US10129372B2 (en) * | 2015-12-08 | 2018-11-13 | Nicira, Inc. | Transferring multiple data sets using a multipath connection |
US10097465B2 (en) * | 2015-12-08 | 2018-10-09 | Nicira Inc. | Data transfer between endpoints using a multipath connection |
US10200277B2 (en) * | 2015-12-08 | 2019-02-05 | Nicira, Inc. | Influencing path selection during a multipath connection |
WO2017198285A1 (en) * | 2016-05-16 | 2017-11-23 | Telefonaktiebolaget Lm Ericsson (Publ) | Transporting udp packets over an mptcp connection |
FR3053197A1 (en) * | 2016-06-24 | 2017-12-29 | Orange | METHOD FOR UDP COMMUNICATION VIA MULTIPLE PATHS BETWEEN TWO TERMINALS |
FR3053196A1 (en) * | 2016-06-24 | 2017-12-29 | Orange | METHOD FOR UDP COMMUNICATION VIA MULTIPLE PATHS BETWEEN TWO TERMINALS |
US10742541B2 (en) * | 2016-07-26 | 2020-08-11 | Nokia Of America Corporation | Systems and methods for multi-path communication over multiple radio access technologies |
CN109314662B (en) * | 2016-11-11 | 2020-09-11 | 华为技术有限公司 | Data transmission method and device |
CN106792936B (en) * | 2016-12-08 | 2020-04-03 | 上海华为技术有限公司 | PGW switching method and communication equipment for maintaining service continuity |
FR3067550A1 (en) * | 2017-06-27 | 2018-12-14 | Orange | METHOD OF COMMUNICATING QUIC VIA MULTIPLE ROADS |
CN109218186B (en) * | 2017-07-05 | 2021-02-23 | 华为技术有限公司 | Multipath data transmission processing method and network equipment |
FR3072527B1 (en) * | 2017-10-17 | 2019-10-18 | Sagemcom Broadband Sas | MANAGEMENT OF THE CONNECTION WITH OTHER RESIDENTIAL BRIDGES OF A RESIDENTIAL GATEWAY IMPLEMENTING THE AGGREGATION OF LINKS |
-
2017
- 2017-06-27 FR FR1755872A patent/FR3067550A1/en not_active Withdrawn
-
2018
- 2018-06-26 US US16/626,731 patent/US11088942B2/en active Active
- 2018-06-26 EP EP18749456.2A patent/EP3646557A1/en active Pending
- 2018-06-26 CN CN201880053554.4A patent/CN110999252B/en active Active
- 2018-06-26 WO PCT/FR2018/051561 patent/WO2019002754A1/en unknown
Also Published As
Publication number | Publication date |
---|---|
CN110999252B (en) | 2022-04-12 |
WO2019002754A1 (en) | 2019-01-03 |
FR3067550A1 (en) | 2018-12-14 |
US20200120015A1 (en) | 2020-04-16 |
CN110999252A (en) | 2020-04-10 |
US11088942B2 (en) | 2021-08-10 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2019002754A1 (en) | Method of quic communication via multiple paths | |
EP3476095B1 (en) | Method for multi-path udp communication method between two terminals | |
EP3476096B1 (en) | Udp communication method between two terminals via multiple paths | |
EP3284224B1 (en) | Method for emulating a multipath connection | |
EP3318023B1 (en) | Method of optimizing the loading of a network connections hub | |
EP3162027B1 (en) | Multi-path tcp communication method between two terminals | |
EP3257204A1 (en) | Method for selecting network connection hubs | |
EP3127295B1 (en) | Method of communication by multiple paths between two terminals | |
EP3172887A1 (en) | Method for multipath tcp communication between two terminals | |
EP3732829B1 (en) | Method of routing data from an initialized session between terminal and server | |
EP3991391A1 (en) | Method for managing communication between terminals in a communication network, and devices for implementing the method | |
EP4142265B1 (en) | Method for tcp communication via multiple paths between two terminals | |
WO2024068725A1 (en) | Method for managing data traffic between a source entity and a recipient entity, and corresponding entity and computer program |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: UNKNOWN |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
17P | Request for examination filed |
Effective date: 20200121 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
AX | Request for extension of the european patent |
Extension state: BA ME |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: ORANGE |
|
DAV | Request for validation of the european patent (deleted) | ||
DAX | Request for extension of the european patent (deleted) | ||
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
17Q | First examination report despatched |
Effective date: 20201215 |
|
RAP3 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: ORANGE |