EP3758325B1 - Verfahren, knoten und system zur verkehrsbegrenzung - Google Patents

Verfahren, knoten und system zur verkehrsbegrenzung Download PDF

Info

Publication number
EP3758325B1
EP3758325B1 EP19894390.4A EP19894390A EP3758325B1 EP 3758325 B1 EP3758325 B1 EP 3758325B1 EP 19894390 A EP19894390 A EP 19894390A EP 3758325 B1 EP3758325 B1 EP 3758325B1
Authority
EP
European Patent Office
Prior art keywords
distributed node
quota
node
time period
traffic
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.)
Not-in-force
Application number
EP19894390.4A
Other languages
English (en)
French (fr)
Other versions
EP3758325A1 (de
EP3758325A4 (de
Inventor
Wenbo YE
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wangsu Science and Technology Co Ltd
Original Assignee
Wangsu Science and Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Wangsu Science and Technology Co Ltd filed Critical Wangsu Science and Technology Co Ltd
Publication of EP3758325A1 publication Critical patent/EP3758325A1/de
Publication of EP3758325A4 publication Critical patent/EP3758325A4/de
Application granted granted Critical
Publication of EP3758325B1 publication Critical patent/EP3758325B1/de
Not-in-force legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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/20—Traffic policing
    • 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/22—Traffic shaping
    • H04L47/225—Determination of shaping rate, e.g. using a moving window
    • 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • 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/29—Flow control; Congestion control using a combination of thresholds
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/78—Architectures of resource allocation
    • H04L47/781—Centralised allocation of resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/822—Collecting or measuring resource availability data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/70—Admission control; Resource allocation
    • H04L47/82—Miscellaneous aspects
    • H04L47/826—Involving periods of time
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources

Definitions

  • the present disclosure relates to the field of Internet traffic limiting technology, and in particular, to a method of limiting traffic and a system and a node of limiting traffic.
  • the centralized traffic limiting method is disadvantageous in that each traffic limiting decision of a distributed node requires interaction with a central node, resulting in a long decision path and slow decision making. Because the load of the distributed node changes all the time, and data at the time of decision implementation is different from the data at the time of decision making and delivery to the distributed node, the central node cannot make a decision according to real-time data, and is likely to make an incorrect decision, affecting the overall performance of the system.
  • a fixed service volume is allocated to each distributed node.
  • the decision making, though fast, is not accurate.
  • some distributed nodes are overloaded, but the overall service volume of the system does not reach an upper limit.
  • CN107204933A and CN101702669A each provides a traffic controlling method in related art.
  • embodiments of the present application provide a method of limiting traffic, a node and a system of limiting traffic.
  • the present invention is defined by the appended independent claims.
  • Dependent claims constitute embodiments of the invention.
  • the invention is only defined by the claims, the below embodiments, examples and aspects are only present for the sole purpose in aiding in understanding the background and advantages of the invention.
  • the traffic limitation decision is made by the distributed node autonomously, the decision path is short, and fast decision is achieved.
  • a corresponding decision quota can be allocated each distributed node according to the real-time service volume of each distributed node. That is, the larger the service volume is, the higher the allocated decision quota is.
  • a distributed node in a heavy-traffic area can receive and respond to access requests to the greatest extent, thereby improving the utilization of resources.
  • the method of limiting traffic is more accurate and can improve the service performance of the distributed system.
  • An embodiment of the present disclosure provides a method of limiting traffic.
  • the method can be applied to a network framework shown in FIG. 1 .
  • the network framework includes a central node and a plurality of distributed nodes, and each distributed node is connected to the central node.
  • the distributed node is a CDN node.
  • the distributed node is configured to receive an access request sent by a client and provide a service.
  • each distributed node first sends a service volume in a current preset time period to the central node according to a fixed period.
  • the central node determines a decision quota corresponding to each of the distributed nodes based on the service volumes sent by all the distributed nodes, and sends the corresponding decision quota to each of the distributed nodes.
  • Each of the distributed nodes receives the decision quota, and after receiving an access request, determines, based on the latest received decision quota, whether traffic limitation needs to be performed for the access request.
  • the traffic limitation decision is made by the distributed node autonomously, the decision path is short, and fast decision is achieved.
  • a corresponding decision quota can be allocated according to the real-time service volume of each distributed node. That is, the larger the service volume is, the higher the allocated decision quota is. In this way, a distributed node in a heavy-traffic area can receive and respond to access requests to the greatest extent, thereby improving the utilization of resources.
  • the method of limiting traffic is more accurate and can improve the service performance of the distributed system.
  • FIG. 2 is a flowchart of a method of limiting traffic according to an embodiment of the present application. Referring to FIG. 2 , the method specifically includes following steps.
  • Step 201 A distributed node sends a service volume in a current preset time period to a central node according to a fixed period.
  • Each distributed node in a distributed system sends a service volume in a current preset time period to a central node according to a same fixed period.
  • the fixed period may be set to any length, for example, one second or one minute.
  • the service volume in the current preset time period is a service volume within a period of time before the current time. For example, when the current time is t and the preset time period is 1 minute, the service volume in the current preset time period is a service volume during the period from t-1 to t.
  • a CDN node distributed node
  • the cache is directly used to respond, that is, serve the access request.
  • a back-to-source request is sent to a source station to request the content.
  • Embodiments of the present disclosure may perform traffic limitation for the scenario of serving the access request, and may also perform traffic limitation for the back-to-source scenario, that is, restricting the CDN node from sending a back-to-source request to the source station.
  • the service volume sent by the distributed node to the central node is a service volume generated in response to the access request.
  • the service volume sent by the distributed node to the central node is the service volume generated during the back-to-source process. That is to say, the service volume sent by the distributed node to the central node includes the service volume generated in response to the access request, or the service volume generated during the back-to-source process, that is, a back-to-source volume.
  • Performing traffic limitation for the back-to-source scenario can prevent the source station from bearing excessive access load and ensure the stability of the source station.
  • the service volume may be expressed by traffic, bandwidth, the number of connections, or the number of access requests.
  • the service volume in the preset time period includes one or more of traffic generated by the distributed node in the preset time period, an average bandwidth in the preset time period, the number of connections established in the preset time period, or the number of access requests in the preset time period.
  • the service volume in the preset time period is the number of connections established by the distributed node with the client within the preset time period.
  • the service volume in the preset time period is the number of access requests of the distributed node in the preset time period, wherein the number of access requests in the preset time period may be the number of access requests that have been responded to, or the sum of the number of access requests that have been responded to and the number of access requests that are currently being responded to, or the sum of the number of access requests that have been responded to, the number of access requests that are currently being responded to, and the number of access requests that have not been responded to.
  • the service volume in the preset time period includes one or more of the traffic generated by the distributed node in the preset time period (back-to-source traffic), and the average bandwidth (back-to-source bandwidth) in the preset time period or the number of connections established in the preset time period.
  • the back-to-source traffic generated by the distributed node in the preset time period may be the amount of content obtained by the distributed node in the preset time period during the back-to-source process.
  • the service volume in the preset time period is the number of connections established by the distributed node with the source station within the preset time period.
  • Step 202 The central node determines a decision quota of the distributed node based on the received service volume, and sends the decision quota to the distributed node.
  • Each distributed node periodically sends the latest service volume to the central node.
  • the central node calculates a traffic proportion of each distributed node according to the latest service volume, and then calculates a decision quota corresponding to each distributed node according to the traffic proportion of each distributed node.
  • the decision quota of the distributed node can be adjusted in real time according to the real-time service volume of the distributed node, and according to the decision quota, it is determined whether traffic limitation needs to be performed, thereby ensuring the accuracy of traffic limitation, and improving the service performance of the entire distributed system.
  • ECLi the decision quota corresponding to the i-th distributed node
  • LT represents an overall upper limit
  • ECi represents the service volume corresponding to the i-th distributed node
  • ECPi the traffic proportion of the i-th distributed node
  • ECPi ECi /(EC1+EC2+...+ECn).
  • the overall upper limit is a value pre-stored in the central node, indicating total load allowed by the distributed system.
  • the overall upper limit may be an overall upper limit of the service volume generated for serving the access request or an overall upper limit for the back-to-source volume.
  • the overall upper limit may be an overall upper limit of the service volume generated for serving the access request.
  • the overall upper limit is an overall upper limit for the back-to-source volume.
  • the overall upper limit is expressed in the same manner as the service volume reported by the distributed node to the central node. That is, if the service volume is expressed by traffic, the overall upper limit is also expressed by traffic; if the service volume is expressed by bandwidth, the overall upper limit is also expressed by bandwidth; if the service volume is expressed by the number of connections, the overall upper limit is also expressed by the number of connections; if the service volume is expressed by the number of access requests, the overall upper limit is also expressed by the number of access requests.
  • Step 203 The distributed node receives the decision quota sent by the central node.
  • Step 204 After receiving an access request, the distributed node determines whether traffic limitation needs to be performed for the access request.
  • the distributed node When traffic limitation is performed for the scenario of serving the access request, the distributed node, each time receiving an access request, determines whether needs to be performed for the access request. When traffic limitation is performed for the back-to-source scenario, the distributed node, after receiving the access request, determines whether a back-to-source request needs to be sent to the source station; and if yes, determines, based on the latest received decision quota, whether traffic limitation needs to be performed for the access request.
  • a specific process for the distributed node to determine, based on the latest received decision quota, whether traffic limitation needs to be performed for the access request is as follows: after receiving the access request, the distributed node compares a current service increment with the latest received decision quota, wherein the service increment is a difference between the service volume in the current preset time period and the service volume sent to the central node last time; and if the current service increment of the distributed node is less than the latest received decision quota, skips performing traffic limitation, or otherwise, performs traffic limitation for the access request.
  • the distributed node determines a time interval between a current time and a time at which a service volume is sent to the central node last time; if the time interval is less than a preset duration, performs traffic limitation for the access request; and if the time interval is greater than or equal to the preset duration, sends the service volume in the current preset time period to the central node, receives a new decision quota sent by the central node, and then determines, based on the latest received decision quota, whether traffic limitation is needed to be performed for the access request.
  • the preset duration is shorter than the fixed period according to which the distributed node periodically reports the service volume to the central node.
  • the fixed period according to which the distributed node periodically reports the service volume to the central node is 1 minute, and the preset duration may be set to 30s. After the distributed node receives the decision quota, the accuracy of the decision quota may decrease with time.
  • the central node recalculates the decision quota upon receiving a service volume sent by a distributed node, and delivers the new decision quota to the distributed node.
  • the following describes the method of limiting traffic of the distributed node by using the traffic limitation in the scenario of serving the access request as an example.
  • a traffic limitation response process is as follows:
  • the traffic limitation may be performed by rejecting the access request, that is, no back-to-source request is sent to the source station.
  • the traffic limitation may be performed by rejecting the access request and/or limiting a response rate to the access request.
  • a process of performing traffic limitation by rejecting the access request and limiting the response rate to the access request is as follows:
  • the access request is processed at a default response rate.
  • the preset response rate is less than the default response rate.
  • a backup central node may further be disposed.
  • the central node periodically synchronizes data to the backup central node.
  • the backup central node replaces the central node to provide services.
  • the central node and the backup central node are connected to a same access layer, and the access layer is connected to each of the distributed nodes.
  • the access layer is configured to receive data sent by each of the distributed nodes, and guide the data to the central node or the backup central node.
  • the access layer guides the received data to the central node.
  • the access layer guides the received data to the backup central node, thereby ensuring that the traffic limitation decision is normally made, and ensuring the service performance of the distributed system.
  • the traffic limitation decision is made by the distributed node autonomously, the decision path is short, and fast decision is achieved.
  • a corresponding decision quota can be allocated each distributed node according to the real-time service volume of each distributed node. That is, the larger the service volume is, the higher the allocated decision quota is.
  • a distributed node in a heavy-traffic area can receive and respond to access requests to the greatest extent, thereby improving the utilization of resources.
  • the method of limiting traffic is more accurate and can improve the service performance of the distributed system.
  • An embodiment of the present disclosure further provides a system of limiting traffic, including a distributed node and a central node, wherein
  • the service volume further includes a back-to-source volume; and correspondingly, the distributed node is configured to:
  • the service volume in the preset time period includes one or more of traffic generated by the distributed node in the preset time period, an average bandwidth in the preset time period, the number of connections established in the preset time period, or the number of access requests in the preset time period.
  • the distributed node is configured to:
  • the distributed node is configured to:
  • the distributed node is configured to:
  • the distributed node is configured to:
  • the distributed node is configured to:
  • the traffic limitation decision is made by the distributed node autonomously, the decision path is short, and fast decision is achieved.
  • a corresponding decision quota can be allocated each distributed node according to the real-time service volume of each distributed node. That is, the larger the service volume is, the higher the allocated decision quota is.
  • a distributed node in a heavy-traffic area can receive and respond to access requests to the greatest extent, thereby improving the utilization of resources.
  • the method of limiting traffic is more accurate and can improve the service performance of the distributed system.
  • system of limiting traffic provided by this embodiment and the embodiment of the method of limiting traffic belong to the same concept.
  • a specific implementation process of the system of limiting traffic may refer to the method embodiments for details, and details are not described herein again.
  • FIG. 4 is a schematic structural diagram of a node device according to an embodiment of the present disclosure.
  • the node device 400 may vary greatly due to different configurations or performance, and may include one or more central processing units (CPU) 422 (for example, one or more processors) and memories 432, and one or more storage media 430 (for example, one or more mass storage devices) storing an application program 442 or data 444.
  • the memory 432 and the storage medium 430 may be temporary or permanent storages.
  • the program stored in the storage medium 430 may include one or more modules (not shown), and each module may include a series of instructions and operations for the node device.
  • the central processing unit 422 may be configured to communicate with the storage medium 430, and execute, on the node device 400, a series of instructions and operations in the storage medium 430.
  • the node device 400 may further include one or more power supplies 424, one or more wired or wireless network interfaces 450, one or more input/output interfaces 458, one or more keyboards 454, and/or one or more operating systems 441, for example, Windows Server, Mac OS X, UnixTM, Linux, or FreeBSD.
  • the node device 400 may include a memory and at least one program, wherein the at least one program is stored in the memory, and is configured, to cause the at least one processor execute the at least one program, including instructions for performing the method of limiting traffic:
  • the program may be stored in a computer-readable storage medium.
  • the storage medium may include: a read-only memory, a magnetic disk, or an optical disc.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Telephonic Communication Services (AREA)
  • Computer And Data Communications (AREA)

Claims (15)

  1. Verfahren zum Begrenzen von Verkehr, wobei das Verfahren auf ein Inhaltsübergabenetzwerk, das einen zentralen Knoten und eine Vielzahl von verteilten Knoten umfasst, angewendet wird, das Folgendes umfasst:
    Senden (201) eines Dienstvolumens durch einen verteilten Knoten in einer aktuellen voreingestellten Zeitperiode gemäß einer festen Periode an einen zentralen Knoten; wobei das Dienstvolumen in der aktuellen voreingestellten Zeitperiode ein Dienstvolumen in einer Zeitperiode vor der aktuellen Zeit ist;
    Durchführen einer Berechnung durch den zentralen Knoten, um einen Verkehrsanteil jedes der Vielzahl von verteilten Knoten gemäß dem Dienstvolumen, das von jedem verteilten Knoten empfangen wird, zu bestimmen, und Durchführen einer Berechnung, um eine Entscheidungsquote, die jedem verteilten Knoten entspricht, gemäß dem Verkehrsanteil jedes verteilten Knotens zu bestimmen, und Senden der Entscheidungsquote an jeden entsprechenden verteilten Knoten; wobei die entsprechende Entscheidungsquote umso höher ist, je größer der Verkehrsanteil ist;
    Empfangen (203) der Entscheidungsquote, die vom zentralen Knoten gesendet wird, durch den verteilten Knoten;
    Bestimmen (204) durch den verteilten Knoten auf Basis der zuletzt empfangenen Entscheidungsquote nach Empfangen einer Zugriffsanforderung, ob für die Zugriffsanforderung eine Verkehrsbegrenzung durchgeführt werden muss.
  2. Verfahren nach Anspruch 1, wobei das Dienstvolumen ferner ein Zurück-zur-Quelle-Volumen umfasst und
    der Schritt des Bestimmens durch den verteilten Knoten auf Basis der zuletzt empfangenen Entscheidungsquote nach Empfangen der Zugriffsanforderung, ob für die Zugriffsanforderung eine Verkehrsbegrenzung durchgeführt werden muss, umfasst entsprechend Folgendes:
    nach Empfangen der Zugriffsanforderung Bestimmen durch den verteilten Knoten, ob eine Zurück-zur-Quelle-Anforderung an eine Quellstation gesendet werden muss; und
    wenn ja, Bestimmen auf Basis der zuletzt empfangenen Entscheidungsquote, ob für die Zugriffsanforderung eine Verkehrsbegrenzung durchgeführt werden muss.
  3. Verfahren nach Anspruch 1 oder 2, wobei das Dienstvolumen in der voreingestellten Zeitperiode mindestens eines von Verkehr, der vom verteilten Knoten in der voreingestellten Zeitperiode erzeugt wird, eine durchschnittliche Bandbreite in der voreingestellten Zeitperiode, die Anzahl von Verbindungen, die in der voreingestellten Zeitperiode aufgebaut werden, und die Anzahl von Zugriffsanforderungen in der voreingestellten Zeitperiode umfasst.
  4. Verfahren nach Anspruch 3, wobei das Dienstvolumen durch die Anzahl von Verbindungen repräsentiert wird, das Dienstvolumen in der voreingestellten Zeitperiode die Anzahl von Verbindungen ist, die vom verteilten Knoten mit dem Client in der voreingestellten Zeitperiode aufgebaut werden.
  5. Verfahren nach Anspruch 3, wobei das Dienstvolumen durch die Anzahl von Zugriffsanforderungen repräsentiert wird, das Dienstvolumen in der voreingestellten Zeitperiode die Anzahl von Zugriffsanforderungen des verteilten Knotens in der voreingestellten Zeitperiode ist;
    wobei die Anzahl von Zugriffsanforderungen in der voreingestellten Zeitperiode Folgendes ist:
    die Anzahl von Zugriffsanforderungen, auf die geantwortet wurde, oder
    die Summe der Anzahl von Zugriffsanforderungen, auf die geantwortet wurde, und der Anzahl von Zugriffsanforderungen, auf die gegenwärtig geantwortet wird, oder
    die Summe der Anzahl von Zugriffsanforderungen, auf die geantwortet wurde, der Anzahl von Zugriffsanforderungen, auf die gegenwärtig geantwortet wird, und der Anzahl von Zugriffsanforderungen, auf die nicht geantwortet wurde.
  6. Verfahren nach Anspruch 3, wobei, wenn das Dienstvolumen, das vom verteilten Knoten an den zentralen Knoten gesendet wird, ein Zurück-zur-Quelle-Volumen ist, das Dienstvolumen in der voreingestellten Zeitperiode mindestens eines von einem Zurück-zur-Quelle-Verkehr, der vom verteilten Knoten in der voreingestellten Zeitperiode erzeugt wird, einer durchschnittlichen Zurück-zur-Quelle-Bandbreite in der voreingestellten Zeitperiode und der Anzahl von Verbindungen, die in der voreingestellten Zeitperiode aufgebaut werden, umfasst.
  7. Verfahren nach Anspruch 1, wobei der Schritt des Bestimmens durch den verteilten Knoten auf Basis der zuletzt empfangenen Entscheidungsquote, ob für die Zugriffsanforderung eine Verkehrsbegrenzung durchgeführt werden muss, Folgendes umfasst:
    Vergleichen einer aktuellen Dienstzunahme mit der zuletzt empfangenen Entscheidungsquote durch den verteilten Knoten und
    wenn die aktuelle Dienstzunahme des verteilten Knotens kleiner ist als die zuletzt empfangene Entscheidungsquote, Überspringen der Durchführung einer Verkehrsbegrenzung oder andernfalls Durchführen einer Verkehrsbegrenzung für die Zugriffsanforderung.
  8. Verfahren nach Anspruch 7, wobei das Verfahren nach dem Bestimmen durch den verteilten Knoten, dass die aktuelle Dienstzunahme größer als oder gleich der zuletzt empfangenen Entscheidungsquote ist, ferner Folgendes umfasst:
    Bestimmen eines Zeitintervalls zwischen einer aktuellen Zeit und einer Zeit, zu der ein Dienstvolumen zuletzt an den zentralen Knoten gesendet wurde;
    wenn das Zeitintervall kleiner ist als eine voreingestellte Dauer, Durchführen einer Verkehrsbegrenzung für die Zugriffsanforderung; und
    wenn das Zeitintervall größer als oder gleich der voreingestellten Dauer ist, Senden des Dienstvolumens in der aktuellen voreingestellten Zeitperiode an den zentralen Knoten, Empfangen einer neuen Entscheidungsquote, die vom zentralen Knoten gesendet wird, und dann Bestimmen auf Basis der zuletzt empfangenen Entscheidungsquote, ob für die Zugriffsanforderung eine Verkehrsbegrenzung durchgeführt werden muss.
  9. Verfahren nach Anspruch 7 oder 8, wobei der Schritt des Durchführens einer Verkehrsbegrenzung für die Zugriffsanforderung durch den verteilten Knoten Folgendes umfasst:
    Zurückweisen der Zugriffsanforderung durch den verteilten Knoten oder
    Begrenzen einer Antwortrate auf die Zugriffsanforderung durch den verteilten Knoten.
  10. Verfahren nach Anspruch 7, wobei das Verfahren nach dem Bestimmen durch den verteilten Knoten, dass die aktuelle Dienstzunahme größer als oder gleich der zuletzt empfangenen Entscheidungsquote ist, ferner Folgendes umfasst:
    Antworten auf die Zugriffsanforderung durch den verteilten Knoten mit einer voreingestellten Antwortrate und
    Empfangen einer nächsten Zugriffsanforderung und Zurückweisen der nächsten Zugriffsanforderung durch den verteilten Knoten, wenn die aktuelle Dienstzunahme immer noch größer als oder gleich der zuletzt empfangenen Entscheidungsquote ist.
  11. Verfahren nach Anspruch 10, wobei das Verfahren nach dem Antworten durch den verteilten Knoten mit einer voreingestellten Antwortrate auf die Zugriffsanforderung ferner Folgendes umfasst:
    Empfangen der nächsten Zugriffsanforderung durch den verteilten Knoten und, wenn die aktuelle Dienstzunahme kleiner ist als die zuletzt empfangene Entscheidungsquote und eine aktuelle durchschnittliche Antwortrate größer ist als die voreingestellte Antwortrate, Antworten auf die nächste Zugriffsanforderung mit der voreingestellten Antwortrate, wobei die aktuelle durchschnittliche Antwortrate gleich einem Verhältnis von Verkehr, der in der aktuellen voreingestellten Zeitperiode erzeugt wird, zu der Anzahl von Zugriffsanforderungen in der aktuellen voreingestellten Zeitperiode ist; und
    Empfangen der nächsten Zugriffsanforderung durch den verteilten Knoten und, wenn die aktuelle Dienstzunahme kleiner ist als die zuletzt empfangene Entscheidungsquote und die aktuelle durchschnittliche Antwortrate kleiner als oder gleich der voreingestellten Antwortrate ist, Überspringen des Durchführens einer Verkehrsbegrenzung.
  12. Verteilte Knoten, die Folgendes umfasst:
    mindestens einen Prozessor und
    einen Speicher, der zum Speichern von Anweisungen, die von dem mindestens einen Prozessor ausführbar sind, kommunikativ mit dem mindestens einen Prozessor verbunden ist,
    wobei eine Ausführung der Anweisungen durch den mindestens einen Prozessor den mindestens einen Prozessor veranlasst, den Verarbeitungsprozess, der vom verteilten Knoten beim Verfahren zum Begrenzen von Verkehr nach einem der Ansprüche 1 bis 11 durchgeführt wird, durchzuführen.
  13. System zum Begrenzen von Verkehr, das eine Vielzahl von verteilten Knoten nach Anspruch 12 und einen zentralen Knoten umfasst, wobei der zentrale Knoten ferner dazu ausgelegt ist, eine Berechnung durchzuführen, um einen Verkehrsanteil jedes der Vielzahl von verteilten Knoten gemäß dem Dienstvolumen, das von jedem verteilten Knoten empfangen wird, zu bestimmen, eine Berechnung durchzuführen, um eine Entscheidungsquote, die jedem verteilten Knoten entspricht, gemäß dem Verkehrsanteil jedes verteilten Knotens zu bestimmen, und die Entscheidungsquote an jeden entsprechenden verteilten Knoten zu senden; wobei die entsprechende Entscheidungsquote umso höher ist, je größer der Verkehrsanteil ist.
  14. System nach Anspruch 13, wobei das Dienstvolumen in der voreingestellten Zeitperiode mindestens eines von Verkehr, der vom verteilten Knoten in der voreingestellten Zeitperiode erzeugt wird, eine durchschnittliche Bandbreite in der voreingestellten Zeitperiode, die Anzahl von Verbindungen, die in der voreingestellten Zeitperiode aufgebaut werden, die Anzahl von Zugriffsanforderungen in der voreingestellten Zeitperiode umfasst.
  15. Computerlesbares Speichermedium, auf dem ein Computerprogramm gespeichert ist, wobei das Computerprogramm von einem Prozessor ausgeführt wird, um den Verarbeitungsprozess, der vom verteilten Knoten beim Verfahren zum Begrenzen von Verkehr nach einem der Ansprüche 1 bis 11 durchgeführt wird, zu implementieren.
EP19894390.4A 2019-04-30 2019-06-06 Verfahren, knoten und system zur verkehrsbegrenzung Not-in-force EP3758325B1 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910364818.4A CN110138756B (zh) 2019-04-30 2019-04-30 一种限流方法及系统
PCT/CN2019/090339 WO2020220430A1 (zh) 2019-04-30 2019-06-06 一种限流方法及系统

Publications (3)

Publication Number Publication Date
EP3758325A1 EP3758325A1 (de) 2020-12-30
EP3758325A4 EP3758325A4 (de) 2021-01-27
EP3758325B1 true EP3758325B1 (de) 2022-03-23

Family

ID=67576039

Family Applications (1)

Application Number Title Priority Date Filing Date
EP19894390.4A Not-in-force EP3758325B1 (de) 2019-04-30 2019-06-06 Verfahren, knoten und system zur verkehrsbegrenzung

Country Status (4)

Country Link
US (1) US11316792B2 (de)
EP (1) EP3758325B1 (de)
CN (1) CN110138756B (de)
WO (1) WO2020220430A1 (de)

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111404824B (zh) * 2020-03-06 2023-05-19 抖音视界有限公司 用于转发请求的方法、装置、电子设备和计算机可读介质
CN112073329B (zh) * 2020-08-25 2023-01-24 北京五八信息技术有限公司 分布式限流方法、装置、电子设备和存储介质
CN112383486B (zh) * 2020-11-05 2024-12-03 北京同有飞骥科技股份有限公司 基于租约的分布式对象存储服务质量保证方法及系统
CN112702321B (zh) * 2020-12-15 2023-04-07 深圳市快付通金融网络科技服务有限公司 分布式交易限流方法、装置、设备及存储介质
CN112887218B (zh) * 2020-12-22 2022-10-21 新华三技术有限公司 一种报文转发方法及装置
CN112600932B (zh) * 2020-12-22 2023-04-07 百度在线网络技术（北京）有限公司 定量下发方法、控制台、下发节点、设备和介质
CN113328906B (zh) * 2021-04-22 2023-01-06 成都欧珀通信科技有限公司 一种流量实时监控方法、装置、存储介质及电子设备
CN113691596B (zh) * 2021-08-12 2023-06-30 北京奇艺世纪科技有限公司 一种网关控制方法、装置、电子设备及存储介质
CN113726683B (zh) * 2021-09-09 2023-08-15 海尔数字科技(青岛)有限公司 访问限流方法、装置、设备、存储介质及计算机程序产品
CN116418751B (zh) * 2021-12-30 2025-12-30 北京字跳网络技术有限公司 流量控制方法、装置、电子设备、介质及程序产品
CN114745338B (zh) * 2022-03-30 2024-09-06 Oppo广东移动通信有限公司 流量控制方法、装置、存储介质以及服务器
CN115242808B (zh) * 2022-07-13 2024-03-08 山东浪潮超高清智能科技有限公司 一种分布式系统限流控制系统和方法
CN116684355A (zh) * 2023-05-23 2023-09-01 北京奇艺世纪科技有限公司 一种分布式限流方法、装置、电子设备及存储介质

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7412245B2 (en) * 2005-11-01 2008-08-12 Alpha Networks Inc. Dynamic wireless meshing network for supporting load balance and flow control
US8265086B2 (en) * 2009-06-26 2012-09-11 Nokia Corporation Multi-path transport
CN101702669B (zh) * 2009-11-18 2012-04-11 网宿科技股份有限公司 带宽分配方法和系统
US9438487B2 (en) * 2012-02-23 2016-09-06 Ericsson Ab Bandwith policy management in a self-corrected content delivery network
US20150029851A1 (en) * 2013-07-26 2015-01-29 Telefonaktiebolaget L M Ericsson (Publ) Managing the traffic load of a delivery node
US9455932B2 (en) * 2014-03-03 2016-09-27 Ericsson Ab Conflict detection and resolution in an ABR network using client interactivity
US9336537B2 (en) * 2014-03-06 2016-05-10 Catalina Marketing Corporation System and method of providing a particular number of distributions of media content through a plurality of distribution nodes
CN103997522B (zh) * 2014-05-16 2018-01-23 广州金山网络科技有限公司 一种内容分发网络流量控制方法及终端
CN104219319B (zh) * 2014-09-15 2017-06-09 南京邮电大学 一种分布式网络流量自组织调度方法
CN105450780B (zh) * 2015-12-31 2019-01-18 深圳市网心科技有限公司 一种cdn系统及其回源方法
CN107204933B (zh) * 2016-03-16 2021-03-23 华为技术有限公司 分布式流量调节方法及装置
CN106101183A (zh) * 2016-05-30 2016-11-09 乐视控股（北京）有限公司 回源请求的中转方法和装置及回源系统
CN108574965B (zh) * 2017-03-09 2021-11-19 中国移动通信有限公司研究院 一种进行请求处理的方法及设备
GB2562307A (en) * 2017-05-12 2018-11-14 Sky Cp Ltd Media content delivery
CN107733972B (zh) * 2017-08-28 2020-09-08 阿里巴巴集团控股有限公司 一种短链接解析方法、装置及设备
CN108366020B (zh) * 2018-02-02 2020-09-18 网宿科技股份有限公司 一种发送数据资源的获取请求的方法和系统
CN108848038B (zh) * 2018-08-30 2021-01-29 华为技术有限公司 基于令牌桶的流量管理方法和令牌桶节点

Also Published As

Publication number Publication date
WO2020220430A1 (zh) 2020-11-05
EP3758325A1 (de) 2020-12-30
CN110138756B (zh) 2021-05-25
EP3758325A4 (de) 2021-01-27
CN110138756A (zh) 2019-08-16
US20200351207A1 (en) 2020-11-05
US11316792B2 (en) 2022-04-26

Similar Documents

Publication Publication Date Title
EP3758325B1 (de) Verfahren, knoten und system zur verkehrsbegrenzung
US10460241B2 (en) Server and cloud computing resource optimization method thereof for cloud big data computing architecture
US11216310B2 (en) Capacity expansion method and apparatus
US9571561B2 (en) System and method for dynamically expanding virtual cluster and recording medium on which program for executing the method is recorded
EP2894827B1 (de) Migrationsverwaltungsverfahren, vorrichtung und system für virtuelle maschine
US11949737B1 (en) Allocation of server resources in remote-access computing environments
CN119883651A (zh) 云平台算力资源性能监控与实时调度优化方法
US12436864B2 (en) Performance testing method and apparatus, and storage medium
CN116302578B (zh) 一种QoS约束的流应用延迟确保方法及系统
US20050038800A1 (en) Calculation of sevice performance grades in a multi-node environment that hosts the services
TW201627873A (zh) 用於在分散式計算中處理重發請求的方法與設備
US20210117237A1 (en) Method, devices and computer program products for resource usage
US12519849B2 (en) Techniques for scaling and managing database query processing
WO2025015094A1 (en) Dynamic task allocation and datastore scaling
CN117707760A (zh) 一种负载平衡方法、装置、设备及存储介质
CN118802795B (zh) 一种带宽调节方法、装置、设备、存储介质及产品
CN118802544B (zh) 网络切片配置更新方法、系统、设备、介质和程序产品
CN119806395B (zh) 分布式存储系统的数据管理方法、电子设备和存储介质
US12028271B2 (en) Prioritizing messages for server processing based on monitoring and predicting server resource utilization
US20250123895A1 (en) Execution node provisioning of a data store with fairness during oversubscription
EP4561078A1 (de) Netzwerkressourcenzuweisungsverfahren, vorrichtung und speichermedium
US20220200879A1 (en) Managing stateful workloads executing on temporarily available resources of a cloud computing system
KR20220064785A (ko) 컨테이너 프로파일 생성 장치 및 방법
CN117527699A (zh) 一种网络流量转发方法、装置、设备及存储介质
CN114598705A (zh) 消息负载均衡方法、装置、设备和介质

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: 20200616

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

A4 Supplementary search report drawn up and despatched

Effective date: 20210112

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/815 20130101ALI20201221BHEP

Ipc: H04L 12/853 20130101ALI20201221BHEP

Ipc: H04L 12/801 20130101ALI20201221BHEP

Ipc: H04L 12/813 20130101ALI20201221BHEP

Ipc: H04L 29/06 20060101AFI20201221BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
INTG Intention to grant announced

Effective date: 20211007

GRAJ Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted

Free format text: ORIGINAL CODE: EPIDOSDIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

INTC Intention to grant announced (deleted)
REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602019012901

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04L0029060000

Ipc: H04L0047100000

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: GRANT OF PATENT IS INTENDED

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 47/2416 20220101ALI20220113BHEP

Ipc: H04L 47/20 20220101ALI20220113BHEP

Ipc: H04L 47/22 20220101ALI20220113BHEP

Ipc: H04L 47/10 20220101AFI20220113BHEP

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

INTG Intention to grant announced

Effective date: 20220209

AK Designated contracting states

Kind code of ref document: B1

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602019012901

Country of ref document: DE

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1478227

Country of ref document: AT

Kind code of ref document: T

Effective date: 20220415

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG9D

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20220323

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220623

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220623

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1478227

Country of ref document: AT

Kind code of ref document: T

Effective date: 20220323

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220624

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220725

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220723

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602019012901

Country of ref document: DE

REG Reference to a national code

Ref country code: DE

Ref legal event code: R119

Ref document number: 602019012901

Country of ref document: DE

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20220630

26N No opposition filed

Effective date: 20230102

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220606

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220630

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220606

Ref country code: FR

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220630

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: DE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230103

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20220630

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

GBPC Gb: european patent ceased through non-payment of renewal fee

Effective date: 20230606

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

Ref country code: GB

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230606

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20190606

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20220323