EP3629553A1 - Method and device for service scheduling - Google Patents
Method and device for service scheduling Download PDFInfo
- Publication number
- EP3629553A1 EP3629553A1 EP18832346.3A EP18832346A EP3629553A1 EP 3629553 A1 EP3629553 A1 EP 3629553A1 EP 18832346 A EP18832346 A EP 18832346A EP 3629553 A1 EP3629553 A1 EP 3629553A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- cdn
- scheduling
- resource
- service scheduling
- substitute resource
- 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.)
- Granted
Links
Images
Classifications
-
- 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/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
-
- 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/60—Network streaming of media packets
- H04L65/61—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio
- H04L65/612—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio for unicast
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/04—Architecture, e.g. interconnection topology
- G06N3/0499—Feedforward networks
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
- G06N3/084—Backpropagation, e.g. using gradient descent
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
- G06N3/092—Reinforcement learning
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N7/00—Computing arrangements based on specific mathematical models
- G06N7/01—Probabilistic graphical models, e.g. probabilistic networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
- H04L41/083—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for increasing network speed
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/16—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using machine learning or artificial intelligence
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0817—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking functioning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/091—Measuring contribution of individual network components to actual service level
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/50—Testing arrangements
- H04L43/55—Testing of service level quality, e.g. simulating service usage
-
- 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/80—Actions related to the user profile or the type of traffic
- H04L47/803—Application aware
-
- 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/83—Admission control; Resource allocation based on usage prediction
-
- 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/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
-
- 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/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/101—Server selection for load balancing based on network conditions
-
- 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/2866—Architectures; Arrangements
- H04L67/289—Intermediate processing functionally located close to the data consumer application, e.g. in same machine, in same home or in same sub-network
-
- 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/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
-
- 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/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/62—Establishing a time schedule for servicing the requests
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/04—Architecture, e.g. interconnection topology
- G06N3/048—Activation functions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
Definitions
- a CDN management technician needs to schedule a portion of services in a whole CDN, that is, select a better substitute resource to transfer the portion of the services to the substitute resource for processing.
- the apparatus further includes:
- Step 101 a current first configuration status of a network resource in a whole CDN is obtained when a preset scheduling trigger event is detected.
- P is the scheduling trigger probability determined using the fault alarming model
- the management device may establish the fault alarming model according to recent historical fault alarm data of the whole CDN, and continuously update the fault alarming model based on fault alarm data generated in real time in the whole CDN.
- the historical fault alarm data is generated from a status parameter abnormality to actual service scheduling triggering through monitoring on each node server in the whole CDN.
- the management device may set a rule for transformation of a status parameter abnormality to actual service scheduling triggering (which is also referred to as a rule for transformation of a bottom-level machine indicator abnormality alarm to a high-level alarm) based on the historical fault alarm data.
- L represents a last layer of the hidden layer
- C represents a true error between an output value of the model and a standard value
- ⁇ L represents a calculated error at the last layer
- ⁇ l represents a calculated error at a first layer
- Q is a Hadamard product
- ⁇ a C represents a derivative of the error at the last layer which is output by a unit at the last layer
- ⁇ ' ( z L ) represents a derivative of an activation function which is input to the unit at the last layer
- ⁇ ' ( z l ) represents a derivative of the activation function which is input to the unit at the first layer.
- the apparatus further includes: an establishing module 408 configured to calculate and establish the fault alarming model in a Markov chain form according to historical fault alarm data of the whole CDN.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Artificial Intelligence (AREA)
- Software Systems (AREA)
- Evolutionary Computation (AREA)
- Mathematical Physics (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- General Health & Medical Sciences (AREA)
- Computational Linguistics (AREA)
- Biophysics (AREA)
- Biomedical Technology (AREA)
- Molecular Biology (AREA)
- Life Sciences & Earth Sciences (AREA)
- Health & Medical Sciences (AREA)
- Multimedia (AREA)
- Pure & Applied Mathematics (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Environmental & Geological Engineering (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Databases & Information Systems (AREA)
- Probability & Statistics with Applications (AREA)
- Algebra (AREA)
- Quality & Reliability (AREA)
- Medical Informatics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
- The present disclosure relates to network data transmission, and in particular, to a method and an apparatus for scheduling a service.
- A content delivery network (CDN) is a network formed by disposing a node server (which may be referred to as a network node) between a service provider and a consumer. Through the network, a user may obtain required content from the network node nearby, thereby alleviating network congestion and improving a speed at which the user accesses a website.
- When a network node continuously operates in an overload state, or a network fluctuates abnormally, a CDN management technician needs to schedule a portion of services in a whole CDN, that is, select a better substitute resource to transfer the portion of the services to the substitute resource for processing.
- During implementation of the present disclosure, the inventor found at least the following problems in existing technologies.
- During selection of a substitute resource, a technician needs to manually calculate a network resource configuration status, for example, a load status, a network status, a physical location, a service redundancy, and the like, of each network node, and then analyzes and processes the configuration status to select an optimal substitute resource. In this case, service scheduling is inefficient in that a large amount of manual work is required.
- In order to resolve the problem in the existing technologies, embodiments of the present disclosure provide a method and an apparatus for scheduling a service. The technical solutions are as follows.
- A first aspect of the present disclosure provides a method for scheduling a resource, which includes:
- obtaining a current first configuration status of a network resource in a whole CDN when a preset scheduling trigger event is detected;
- generating a substitute resource list according to the first configuration status using a trained service scheduling model, where at least one substitute resource and a weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list;
- selecting a first substitute resource in the substitute resource list according to the weight corresponding to each of the at least one substitute resource and a preset first selection policy; and
- performing service scheduling in the whole CDN based on the first substitute resource.
- Optionally, the method further includes:
- obtaining a current second configuration status of a network resource in a CDN test environment when a preset scheduling trigger event is detected in the CDN test environment, where the CDN test environment is a local CDN and/or a whole virtual CDN; and
- training an initial service scheduling model based on the second configuration status to adjust a parameter of the initial service scheduling model.
- Optionally, the training an initial service scheduling model based on the second configuration status to adjust a parameter of the initial service scheduling includes:
- generating a substitute resource list using the initial service scheduling model according to the second configuration status;
- selecting a second substitute resource in the substitute resource list according to the preset first selection policy, and performing service scheduling in the CDN test environment based on the second substitute resource;
- rating a third configuration status of a network resource in the CDN test environment after the service scheduling using a preset network rating standard; and
- adjusting the parameter of the initial service scheduling model using a back propagation algorithm according to a rating result.
- Optionally, after the performing service scheduling in the CDN test environment, the method further includes:
- rating a fourth configuration status of a network resource in the whole CDN after the service scheduling using the preset network rating standard; and
- adjusting a parameter of the service scheduling model using the back propagation algorithm according to a rating result.
- Optionally, the obtaining a current first configuration status of a network resource in a whole CDN when a preset scheduling trigger event is detected includes:
- determining a scheduling trigger probability using a trained fault alarming model when an abnormality is detected in a status parameter of a first network resource in the whole CDN; and
- generating a random number between 0 and 1, and obtaining the current first configuration status of the network resource in the whole CDN when the random number is less than or equal to the scheduling trigger probability.
- Optionally, the method further includes:
calculating and establishing a fault alarming model in a Markov chain form according to historical fault alarm data of the whole CDN. - A second aspect of the present disclosure provides an apparatus for scheduling a resource, which includes:
- an obtaining module configured to obtain a current first configuration status of a network resource in a whole CDN when a preset scheduling trigger event is detected;
- a generating module configured to generate a substitute resource list according to the first configuration status using a trained service scheduling model, where at least one substitute resource and a weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list;
- a selecting module configured to select a first substitute resource in the substitute resource list according to the weight corresponding to each of the at least one substitute resource and a preset first selection policy; and
- a scheduling module configured to perform service scheduling in the whole CDN based on the first substitute resource.
- Optionally, the obtaining module is further configured to obtain a current second configuration status of a network resource in a CDN test environment when a preset scheduling trigger event is detected in the CDN test environment, where the CDN test environment is a local CDN and/or a whole virtual CDN; and
the apparatus further includes a training module configured to train an initial service scheduling model based on the second configuration status to adjust a parameter of the initial service scheduling model. - Optionally, the training module is configured to:
- generate the substitute resource list using the initial service scheduling model according to the second configuration status;
- select a second substitute resource in the substitute resource list according to the preset first selection policy, and perform service scheduling in the CDN test environment based on the second substitute resource;
- rate a third configuration status of a network resource in the CDN test environment after the service scheduling using a preset network rating standard; and
- adjust the parameter of the initial service scheduling model using a back propagation algorithm according to a rating result.
- Optionally, the apparatus further includes:
- a rating module configured to: after the service scheduling is performed in the whole CDN, rate a fourth configuration status of a network resource in the whole CDN after the service scheduling using a preset network rating standard; and
- an adjusting module configured to adjust a parameter of the service scheduling model using a back propagation algorithm according to a rating result.
- Optionally, the obtaining module is configured to:
- determine a scheduling trigger probability using a trained fault alarming model when an abnormality is detected in a status parameter of a first network resource in the whole CDN; and
- generate a random number between 0 and 1, and obtain the current first configuration status of the network resource in the whole CDN when the random number is less than or equal to the scheduling trigger probability.
- Optionally, the apparatus further includes:
an establishing module configured to calculate and establish a fault alarming model in a Markov chain form according to historical fault alarm data of the whole CDN. - A third aspect of the present disclosure provides a management device, which includes a processor and a memory storing at least one instruction, at least one program, a code set or an instruction set that are loaded and executed by the processor to perform the method for scheduling a service according to the first aspect.
- A fourth aspect of the present disclosure provides a computer readable storage medium, where the computer readable storage medium stores at least one instruction, at least one program, a code set, or an instruction set that are loaded and executed by a processor to perform the method for scheduling a service according to the first aspect.
- Beneficial effects of the technical solutions in the embodiments of the present disclosure are as follows.
- In the embodiments of the present disclosure, the current first configuration status of a network resource in the whole CDN is obtained when the preset scheduling trigger event is detected, the substitute resource list is generated according to the first configuration status using the trained service scheduling model, where the at least one substitute resource and the weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list, the first substitute resource is selected in the substitute resource list according to the weight corresponding to each of the at least one substitute resource and the preset first selection policy, and the service scheduling is performed in the whole CDN based on the first substitute resource. In this way, through continuous learning on a service scheduling process and a service scheduling result feedback, the management device can understand and master selection of a substitute resource, so that inaccuracy, maintenance difficulty, cost fluctuation, and the like, which are caused by manually specifying a scheduling rule are avoided. In addition, during service scheduling, the management device directly selects an optimal substitute resource through the service scheduling model without a need of a large amount of manual work, so that efficiency of the service scheduling can be improved.
- To describe technical solutions in embodiments of the present disclosure more clearly, the following briefly describes accompanying drawings for describing the embodiments. Apparently, the accompanying drawings in the following description show merely some embodiments of the present disclosure, and a person of ordinary skill in the art may still derive other drawings from these accompanying drawings without creative efforts.
-
Fig. 1 is a flowchart of a method for scheduling a service according to an embodiment of the present disclosure; -
Fig. 2 is a flowchart of a method for training a service scheduling model according to an embodiment of the present disclosure; -
Fig. 3 is a schematic diagram of a deep reinforcement learning network architecture according to an embodiment of the present disclosure; -
Fig. 4 is a schematic structural diagram of an apparatus for scheduling a service according to an embodiment of the present disclosure; -
Fig. 5 is a schematic structural diagram of an apparatus for scheduling a service according to an embodiment of the present disclosure; -
Fig. 6 is a schematic structural diagram of an apparatus for scheduling a service according to an embodiment of the present disclosure; -
Fig. 7 is a schematic structural diagram of an apparatus for scheduling a service according to an embodiment of the present disclosure; and -
Fig. 8 is a schematic structural diagram of a management device according to an embodiment of the present disclosure. - To make objectives, technical solutions, and advantages of the present disclosure clearer, the following further describes the embodiments of the present disclosure in detail with reference to accompanying drawings.
- An embodiment of the present disclosure provides a method for scheduling a service. The method is performed by a management device in a whole CDN. The management device is configured to monitor a configuration status of a network resource in the whole CDN and perform service scheduling in the whole CDN based on the configuration status. The management device may be an independent server dedicated for management, or may be a node server supporting a network service in the whole CDN. The management device in this embodiment may be implemented by an independent device or may be jointly implemented by a device group consisting of a plurality of devices. The management device may include a processor, a memory, and a transceiver. The processor may be configured to process service scheduling in the following process, the memory may be configured to store data required and generated during the following processing, and the transceiver may be configured to receive and send relevant data during the following processing. In this embodiment, that the management device is an independent management device in the whole CDN is taken as an example, and other situations are similar.
- A processing process shown in
Fig. 1 is described in detail with reference to specific embodiments. Content may be as follows. - Step 101: a current first configuration status of a network resource in a whole CDN is obtained when a preset scheduling trigger event is detected.
- The whole CDN is an on-line whole resource environment providing a CDN acceleration service. A network resource may be a processing resource of a network node and/or a transmission resource of a transmission line. The configuration status of the network resource may include CPU utilization rate, a service redundancy, input and output values of each network node and bandwidth usage rate, a response time, and a packet loss rate of transmission lines between network nodes.
- During implementation, a CDN management technician may preset, in a management device, a scheduling trigger event for performing service scheduling. The scheduling trigger event may include fault prediction alarming for the whole CDN, occurrence of a human-registered fault, and arrival of a trigger time by a timed scheduling task, and the like. In this way, the management device may determine whether to perform service scheduling processing by monitoring in real time whether the scheduling trigger event occurs. When the preset scheduling trigger event is detected, a current first configuration status of a network resource in the whole CDN may be obtained first. Certainly, in a specific case, as a service scheduling rule varies, merely a configuration status of partial network resources associated with the service scheduling in the whole CDN may be obtained. For example, when a network node continuously operates in an overload state, and a service on the network node needs to be scheduled, merely configuration statuses of network resources on the network node and a nearby network node and on a transmission line between the network node and the nearby network node may be obtained. Subsequent obtaining of a configuration status of a network resource is specifically processed as described herein, and details are not enumerated again.
- Optionally, the service scheduling may be triggered in advance using a fault alarming model. Correspondingly, processing of
step 101 may be as follows: a scheduling trigger probability is determined using a trained fault alarming model when an abnormality is detected in a status parameter of a first network resource in the whole CDN, and a random number between 0 and 1 is generated, and the current first configuration status of the network resource in the whole CDN is obtained when the random number is less than or equal to the scheduling trigger probability. - During implementation, the fault alarming model for predicting a fault in the whole CDN may be preset in the management device. The fault alarming model may be used to predict a probability of fault occurrence and service scheduling based on a bottom-level machine indicator (that is, a status parameter of a network resource) in the whole CDN. If the probability is relatively high, scheduling is triggered at a relatively high probability. In particular, the management device may obtain a status parameter of a network device in the whole CDN, and the scheduling trigger probability may be determined using the trained fault alarming model when an abnormality is detected in the status parameter of the first network resource in the whole CDN. Then the random number between 0 and 1 may be generated. The random number is then compared to the scheduling trigger probability. When the random number is less than or equal to the scheduling trigger probability, the service scheduling is triggered, so that the management device may obtain the current first configuration status of the network resource in the whole CDN. The processing may be specifically implemented using the following formula:
- y=1 means to trigger service scheduling, and y=0 means not to trigger service scheduling. P is the scheduling trigger probability determined using the fault alarming model, and π(t) is a random number between 0 and 1 randomly generated at time t. If the random number is less than or equal to P, y=1. Otherwise, y=0.
- Optionally, the fault alarming model may be trained as follows: the fault alarming model is calculated and established in a Markov chain form according to historical fault alarm data of the whole CDN.
- During implementation, the management device may establish the fault alarming model according to recent historical fault alarm data of the whole CDN, and continuously update the fault alarming model based on fault alarm data generated in real time in the whole CDN. The historical fault alarm data is generated from a status parameter abnormality to actual service scheduling triggering through monitoring on each node server in the whole CDN. The management device may set a rule for transformation of a status parameter abnormality to actual service scheduling triggering (which is also referred to as a rule for transformation of a bottom-level machine indicator abnormality alarm to a high-level alarm) based on the historical fault alarm data. For example, on the basis of a time sequence, the high-level alarm is generated based on the bottom-level indicator abnormality alarm, and the high-level alarm is related to only a direct next-level alarm. Therefore, the Markov chain may be used for calculation:
- The Markov chain is a sequence of random variables with a Markov property that is used to describe a status sequence. Each status value depends on a finite number of previous states. A range of the random variables is represented by a set of all possible values of the random variables, and is referred to as "a status space". In particular, in this embodiment, a random variable X n represents a state at a time n, and X n+1 is merely a function of X n . Further, the management device may calculate the fault alarming model in the Markov chain form according to the historical fault alarm data of the whole CDN. In this way, through analysis on the status parameter of the network resource, an association relationship between a status parameter abnormality and service scheduling triggering is established. During detection of a change of the status parameter, a subsequent fault is predicted, so that pre-scheduling can be implemented, thereby ensuring service quality and user experience to a specific extent.
- Step 102: a substitute resource list is generated using the trained service scheduling model according to the first configuration status.
- At least one substitute resource and a weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list.
- During implementation, the management device may pre-store a service scheduling model after a large amount of learning and training. The service scheduling model may be a deep reinforcement learning model established in large-scale discrete state-action space, and iterative learning is performed through sample training. Traditional reinforcement learning is an algorithm for resolving a problem of the discrete state-action space. However, when discrete state space and action space are excessively large, it is quite difficult to effectively handle the cases through traditional reinforcement learning. The deep reinforcement learning model includes two machine learning methods: reinforcement learning and deep learning which are combined, and can support a learning task in the large-scale discrete state-action space, and is applicable to service scheduling in this embodiment. For specific model training, refer to the following descriptions.
- After obtaining the current first configuration status of the network resource in the whole CDN, the management device may obtain a status vector of the current whole network resource configuration based on the first configuration status, and then calls the trained service scheduling model, and uses the status vector as input of the service scheduling model to perform calculation using a forward propagation algorithm at a hidden layer of the service scheduling model, so that a substitute resource list (which may also be understood as a substitute resource probability list) may be obtained from an output layer of the service scheduling model. At least one substitute resource and a weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list. The weight herein may be understood as a selection weight corresponding to each substitute resource.
- Step 103: a first substitute resource is selected in the substitute resource list according to a weight corresponding to each of the at least one substitute resource and a preset first selection policy.
- During implementation, after obtaining the substitute resource list using the service scheduling model, the management device may select the first substitute resource in the substitute resource list according to a weight corresponding to each substitute resource recorded in the substitute resource list and the preset first selection policy, that is, select an optimal substitute resource. It should be noted that the preset first selection policy is used for training the service scheduling model, and a type of the first selection policy is not specifically limited herein. A management technician may select a selection policy according to an actual condition, for example, a greedy policy, that is, select, as the first substitute resource, a corresponding substitute resource with a highest weight in the substitute resource list, or may select N substitute resources with the highest weight first, and then randomly select the first substitute resource from the N substitute resources.
- Step 104: perform service scheduling in the whole CDN based on the first substitute resource.
- During implementation, after selecting the first substitute resource in the substitute resource list, the management device may perform service scheduling in the whole CDN based on the first substitute resource, that is, perform a corresponding service using the first substitute resource.
- Optionally, before performing service scheduling in the whole CDN using the service scheduling model, the management device may adjust a parameter of the service scheduling model first in a CDN test environment as follows: a current second configuration status of a network resource in the CDN test environment is obtained when a preset scheduling trigger event is detected in the CDN test environment, and an initial service scheduling model is trained based on the second configuration status to adjust the parameter of the initial service scheduling model.
- The CDN test environment is a local CDN and/or a whole virtual CDN.
- During implementation, the management device may establish a CDN test environment for training the service scheduling model. In the CDN test environment, the initial service scheduling model may be iteratively trained based on various scheduling trigger events to obtain a relatively mature service scheduling model. Specific processing may be as follows. When a preset scheduling trigger event is detected in the CDN test environment, the management device may obtain the current second configuration status of the network resource in the CDN test environment, and then train the initial service scheduling model based on the second configuration status to adjust the parameter of the initial service scheduling model.
- The CDN test environment may be a local CDN and/or a whole virtual CDN. On the one hand, the local CDN is intended to plan a small-scale test environment in the whole CDN environment, so that a negative impact generated by the service scheduling model during training can be controlled to be within a relatively range extent in the local network. Therefore, an impact on service quality and costs of the whole CDN can be effectively reduced. The local network may be divided according to a physical location of a network node, an operator to which a service belongs, or a user level, and the like. On the other hand, the whole virtual CDN may be a network environment virtualized according to a real whole CDN. The network environment can interact with a service scheduling system, and can simulate the real whole CDN to respond to a scheduling result according to the scheduling result. In addition, the scheduling trigger event may be simply simulated by a cellular automaton model.
- It is easily found that training the service scheduling model based on the whole virtual CDN has the following advantages compared to the local CDN. First, the local CDN is a real network environment, in which scheduling can be performed only after a scheduling trigger event occurs, so as to accumulate training data. In this case, model training requires a relatively long time period. However, for the whole virtual CDN, the scheduling trigger event may be simulated by a cellular automaton, so that a time period required for model training can be greatly shortened. Secondly, the local CDN is a subset environment planned in the whole CDN to reduce the negative impact of the service scheduling model on on-line service quality and costs during training. Although the subset environment can be used to control the negative impact to be within a relatively small range, the negative impact cannot be completely eliminated. In addition, since the local CDN is a subset environment of the whole CDN, data generated in the subset environment for model training is a local data set that may differ greatly from a global data set of the whole CDN in data distribution. In this case, over-fitting may occur on the trained service scheduling model, and therefore the trained service scheduling model cannot be generalized to an environment of the whole CDN. However, any processing in the virtual CDN does not affect the whole real CDN. In addition, the virtual CDN simulates the whole real CDN environment, so that a data limitation can be effectively avoided.
- Optionally, training of the service scheduling model may include the following steps as shown in
Fig. 2 . - Step 201: the substitute resource list is generated using the initial service scheduling model according to the second configuration status.
- During implementation, after obtaining the current second configuration status of the network resource in the CDN test environment, the management device may obtain a status vector of the current whole network resource configuration based on the second configuration status, and then calls the initial service scheduling model, and uses the status vector as input of the initial service scheduling model to perform calculation using a forward propagation algorithm at a hidden layer of the service scheduling model, so that a substitute resource list may be obtained from an output layer of the service scheduling model. At least one substitute resource and a weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list.
- A structure of the service scheduling model can refer to a deep reinforcement learning network architecture shown in
Fig. 3 . An input layer is a status vector, an output layer is a weight of a substitute resource, and a hidden layer is linear or nonlinear neurons calculation. The service scheduling model may be calculated based on an initialization parameter and a status vector input by the input layer through forward propagation calculation at the hidden layer, so that the output layer outputs a weight. A corresponding calculation formula may be as follows: represents an input weight sum of an ith unit at an (l+1)th layer, x1, x2,..., xn are input units, is a bias unit of an ith unit at an lth layer, and is a connection weight between a jth unit at an lth layer and an ith unit at an (l+1)th layer. represents an activation value of an ith unit at an (l+1)th layer (that is, the foregoing weight corresponding to the substitute resource), and f(·) is an activation function such as sigmoid or tanh. - Step 202: a second substitute resource is selected in the substitute resource list according to the preset first selection policy, and service scheduling is performed in the CDN test environment based on the second substitute resource.
- During implementation, after obtaining the substitute resource list using the service scheduling model, the management device may select the second substitute resource in the substitute resource list according to a weight corresponding to each substitute resource recorded in the substitute resource list and the preset first selection policy. Then, the management device may perform service scheduling based on the second substitute resource in the CDN test environment. It is worth mentioning that, in the training phase of the service scheduling model, accuracy of a weight of each substitute resource in the substitute resource list cannot be ensured. Therefore, the selected second substitute resource may not be an actual optimal substitute resource.
- Step 203: a third configuration status of a network resource in the CDN test environment after the service scheduling is rated using a preset network rating standard.
- During implementation, a management technician may establish a network quality rating standard based on multi-dimensional data such as a bandwidth status, a service capability, a user coverage, and a response time, and the like of a network node, and may further establish a network cost rating standard based on multi-dimensional data such as a planning status, a charging type, and a charging coefficient, and the like of a network node. In particular, quality may be first rated from a network resource perspective, for example, quality of an individual node server, quality of a service cluster, and the like, may be rated, and quality may be further rated from a user perspective, for example, a user response time, and the like. Then quality scores in the two dimensions are comprehensively analyzed. Then a cost score currently generated in the CDN is calculated using the charging unit (such as a single network node) according to different charging types and charging coefficients, and finally a network rating standard may be generated based on both the quality score and the cost score, and the network rating standard is stored in the management device.
- In this way, after the service scheduling is performed based on the second substitute resource, the management device may rate the third configuration status of the network resource in the CDN test environment after the service scheduling using the preset network rating standard.
- Step 204: the parameter of the preset service scheduling model is adjusted using a back propagation algorithm according to a rating result.
- During implementation, after obtaining the rating result of the configuration status of the network resource in the CDN test environment after the scheduling, the management device may adjust the parameter of the preset service scheduling model using the back propagation algorithm. The back propagation algorithm may be as follows:
- Formula 1, which is used to calculate an error generated in calculation at a last layer of the service scheduling model:
- Formula 2, which is used to calculate an error generated in calculation at each layer of the service scheduling model:
- Formula 3, which is used to calculate a gradient of a weight:
- Formula 4, which is used to calculate a gradient of a bias:
- L represents a last layer of the hidden layer, C represents a true error between an output value of the model and a standard value, δL represents a calculated error at the last layer, δl represents a calculated error at a first layer, Q is a Hadamard product, ∇ aC represents a derivative of the error at the last layer which is output by a unit at the last layer, σ'(zL ) represents a derivative of an activation function which is input to the unit at the last layer, and σ'(zl ) represents a derivative of the activation function which is input to the unit at the first layer.
- Optionally, similar to the training phase, after the service scheduling is performed in the whole CDN in
step 104, the scheduling result may be rated, and then the parameter is adjusted based on the rating result. Corresponding processing may be as follows: a fourth configuration status of a network resource in the whole CDN after the service scheduling is rated using a preset network rating standard, and the parameter of the service scheduling model is adjusted using the back propagation algorithm according to the rating result. - During implementation, after performing the service scheduling in the whole CDN based on the first substitute resource, the management device may obtain the fourth configuration status of the network resource in the whole CDN after the service scheduling, and then may rate the fourth configuration status based on the preset network rating standard. Then the parameter of the service scheduling model may be adjusted according to the rating result using the back propagation algorithm.
- In this way, in the service scheduling model, a complex problem in the whole CDN environment can be effectively represented with a high abstraction capability of a deep neural network, and the parameter of the model is updated according to a feedback of the network rating standard through the back propagation algorithm. Therefore, after learning for a specific time period, a global optimal solution can be selected through comprehensive consideration of a service scheduling problem. In the training phase, if scheduling is triggered, the configuration status of the network resource in the CDN test environment is set as input of the model, and a substitute resource list is output from the model based on a current parameter. Then a substitute resource is selected according to a specific selection policy, and then a serving status of the substitute resource is evaluated using the network rating standard and fed back to the model. After the model receives the feedback, the parameter of the model is adjusted according to the back propagation algorithm, so that subsequent scheduling can proceed toward a global optimal direction. When the training is performed for specific iteration times or a training result meets a predetermined condition, a service scheduling model with relatively good performance can be generated. Then the service scheduling model may be applied to the whole CDN environment, and learning is continued during subsequent operation. In other words, when a scheduling trigger event occurs, the service scheduling model may be used to select a substitute resource that is expected to have a positive impact on the future and that can continue executing the service, and the selected substitute resource may be evaluated using the network rating standard, so that the parameter of the service scheduling model may be further adjusted based on the rating result.
- In this embodiment of the present disclosure, the current first configuration status of the network resource in the whole CDN is obtained when the preset scheduling trigger event is detected, the substitute resource list is generated according to the first configuration status using the trained service scheduling model, where the at least one substitute resource and the weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list, the first substitute resource is selected in the substitute resource list according to the weight corresponding to each of the at least one substitute resource and the preset first selection policy, and the service scheduling is performed in the whole CDN based on the first substitute resource. In this way, through continuous learning on a service scheduling process and a service scheduling result feedback, selection of a substitute resource may be understood and mastered, so that inaccuracy, maintenance difficulty, and cost fluctuation, and the like caused by manually specifying a scheduling rule are avoided. In addition, during service scheduling, the management device directly selects an optimal substitute resource through the service scheduling model without a need of a large amount of manual work, so that t efficiency of the service scheduling can be improved.
- Based on the same technical concept, an embodiment of the present disclosure further provides an apparatus for scheduling a service. As shown in
Fig. 4 , the apparatus includes: - an obtaining
module 401 configured to obtain a current first configuration status of a network resource in a whole CDN when a preset scheduling trigger event is detected; - a
generating module 402 configured to generate a substitute resource list according to the first configuration status using a trained service scheduling model, where at least one substitute resource and a weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list; - a selecting
module 403 configured to select a first substitute resource in the substitute resource list according to the weight corresponding to each of the at least one substitute resource and a preset first selection policy; and - a
scheduling module 404 configured to perform service scheduling in the whole CDN based on the first substitute resource. - Optionally, the obtaining
module 401 is further configured to obtain a current second configuration status of a network resource in a CDN test environment when a preset scheduling trigger event is detected in the CDN test environment, where the CDN test environment is a local CDN and/or a whole virtual CDN. - As shown in
Fig. 5 , the apparatus further includes atraining module 405 configured to train an initial service scheduling model based on the second configuration status to adjust a parameter of the initial service scheduling model. - Optionally, the
training module 405 is configured to: - generate the substitute resource list using the initial service scheduling model according to the second configuration status;
- select a second substitute resource in the substitute resource list according to the first selection policy, and perform service scheduling in the CDN test environment based on the second substitute resource;
- rate a third configuration status of a network resource in the CDN test environment after the service scheduling using a preset network rating standard; and
- adjust the parameter of the initial service scheduling model using a back propagation algorithm according to a rating result.
- Optionally, as shown in
Fig. 6 , the apparatus further includes: - a
rating module 406 configured to: after the service scheduling is performed in the whole CDN, rate a fourth configuration status of a network resource in the whole CDN after the service scheduling using a preset network rating standard; and - an
adjusting module 407 configured to adjust a parameter of the service scheduling model using a back propagation algorithm according to a rating result. - Optionally, the obtaining
module 401 is configured to: - determine a scheduling trigger probability using a trained fault alarming model when an abnormality is detected in a status parameter of a first network resource in the whole CDN; and
- generate a random number between 0 and 1, and obtain the current first configuration status of the network resource in the whole CDN when the random number is less than or equal to the scheduling trigger probability.
- Optionally, as shown in
Fig. 7 , the apparatus further includes:
an establishingmodule 408 configured to calculate and establish the fault alarming model in a Markov chain form according to historical fault alarm data of the whole CDN. - In this embodiment of the present disclosure, the current first configuration status of the network resource in the whole CDN is obtained when the preset scheduling trigger event is detected, the substitute resource list is generated according to the first configuration status using the trained service scheduling model, where the at least one substitute resource and the weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list, the first substitute resource is selected in the substitute resource list according to the weight corresponding to each of the at least one substitute resource and the preset first selection policy, and the service scheduling is performed in the whole CDN based on the first substitute resource. In this way, through continuous learning on a service scheduling process and a service scheduling result feedback, selection of a substitute resource may be understood and mastered, so that inaccuracy, maintenance difficulty, and cost fluctuation, and the like caused by manually specifying a scheduling rule are avoided. In addition, during service scheduling, the management device directly selects an optimal substitute resource through the service scheduling model without a need of a large amount of manual work, so that efficiency of the service scheduling can be improved.
- It should be noted that, division of the foregoing functional modules are only described as an example when the apparatus for scheduling a service in the foregoing embodiments performs service scheduling. In an actual application, the foregoing functions may be allocated and implemented by different functional modules according to needs, that is, an internal structure of the apparatus is divided into different functional modules to implement all or some of the foregoing described functions. In addition, the apparatus for scheduling a service in the foregoing embodiments and the method for scheduling a service in the foregoing embodiments are based on the same concept. For a specific implementation process, refer to the method embodiments, and details are not described herein again.
-
FIG. 8 is a schematic structural diagram of a management device according to an embodiment of the present disclosure. Themanagement device 800 may vary greatly due to different configurations or performance, and may include one or more central processors 822 (for example, one or more processors) and amemory 832, and one or more storage media 830 (for example, one or more mass storage devices) thatstore application programs 842 ordata 844. Thememory 832 and thestorage medium 830 may be transient or persistent storages. The program stored in thestorage medium 830 may include one or more modules (not shown), and each module may include a series of instructions and operations for the server. Still further, thecentral processing unit 822 may be configured to: communicate with thestorage medium 830, and perform, on themanagement device 800, the series of instructions and operations in thestorage medium 830. - The
management device 800 may further include one or more power supplies 826, one or more wired or wireless network interfaces 850, one or more input/output interfaces 858, one ormore keyboards 856, and/or, one ormore operating systems 841, for example, WindowsServerTM, MacOSXTM, UnixTM, LinuxTM, and FreeBSDTM. - The
management device 800 may include a memory and one or more programs, where the one or more programs are stored in the memory, and themanagement device 800 is configured so that the one or more processors execute the one or more programs, which includes instructions for performing the above method for scheduling a service. - A person of ordinary skill in the art may understand that all or some of the steps of the foregoing embodiments may be implemented by using hardware, or may be implemented by a relevant hardware instructed by a program. The program may be stored in a computer readable storage medium. The storage medium may be a read-only memory, a magnetic disk, an optical disc, or the like.
- The foregoing descriptions are merely preferred embodiments of the present disclosure, but are not intended to limit the present disclosure. Any modification, equivalent replacement, or improvement made within the spirit and the principle of the present disclosure shall fall within the protection scope of the present disclosure.
Claims (13)
- A method for scheduling a service, comprising:obtaining a current first configuration status of a network resource in a whole content delivery network CDN when a preset scheduling trigger event is detected;generating a substitute resource list according to the first configuration status using a trained service scheduling model, wherein at least one substitute resource and a weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list;selecting a first substitute resource in the substitute resource list according to the weight corresponding to each of the at least one substitute resource and a preset first selection policy; andperforming service scheduling in the whole CDN based on the first substitute resource.
- The method according to claim 1, further comprising:obtaining a current second configuration status of a network resource in a CDN test environment when a preset scheduling trigger event is detected in the CDN test environment, wherein the CDN test environment is a local CDN and/or a whole virtual CDN; andtraining an initial service scheduling model based on the second configuration status to adjust a parameter of the initial service scheduling model.
- The method according to claim 2, wherein the training an initial service scheduling model based on the second configuration status to adjust a parameter of the initial service scheduling model comprises:generating a substitute resource list using the initial service scheduling model according to the second configuration status, selecting a second substitute resource in the substitute resource list according to the preset first selection policy, and performing service scheduling in the CDN test environment based on the second substitute resource; and rating a third configuration status of a network resource in the CDN test environment after the service scheduling using a preset network rating standard; andadjusting the parameter of the initial service scheduling model using a back propagation algorithm according to a rating result.
- The method according to claim 1, after the performing service scheduling in the CDN test environment, further comprising:rating a fourth configuration status of a network resource in the whole CDN after the service scheduling using a preset network rating standard; andadjusting a parameter of the service scheduling model using a back propagation algorithm according to a rating result.
- The method according to any of claims 1 to 4, wherein the obtaining a current first configuration status of a network resource in a whole CDN when a preset scheduling trigger event is detected comprises:determining a scheduling trigger probability using a trained fault alarming model when an abnormality is detected in a status parameter of a first network resource in the whole CDN; andgenerating a random number between 0 and 1, and obtaining the current first configuration status of the network resource in the whole CDN when the random number is less than or equal to the scheduling trigger probability.
- The apparatus according to claim 5, further comprising:
calculating and establishing the fault alarming model in a Markov chain form according to historical fault alarm data of the whole CDN. - An apparatus for scheduling a service, comprising:an obtaining module configured to obtain a current first configuration status of a network resource in a whole CDN when a preset scheduling trigger event is detected;a generating module configured to generate a substitute resource list according to the first configuration status using a trained service scheduling model, wherein at least one substitute resource and a weight corresponding to each of the at least one substitute resource are recorded in the substitute resource list;a selecting module configured to select a first substitute resource in the substitute resource list according to the weight corresponding to each of the at least one substitute resource and a preset first selection policy; anda scheduling module configured to perform service scheduling in the whole CDN based on the first substitute resource.
- The method according to claim 7, wherein the obtaining module is further configured to obtain a current second configuration status of a network resource in a CDN test environment when a preset scheduling trigger event is detected in the CDN test environment, wherein the CDN test environment is a local CDN and/or a whole virtual CDN; and
the apparatus further comprises a training module configured to train an initial service scheduling model based on the second configuration status to adjust a parameter of the initial service scheduling model. - The apparatus according to claim 8, wherein the training module is configured to:generate a substitute resource list using the initial service scheduling model according to the second configuration status;select a second substitute resource in the substitute resource list according to the preset first selection policy, and performing service scheduling in the CDN test environment based on the second substitute resource;rate a third configuration status of a network resource in the CDN test environment after the service scheduling using a preset network rating standard; andadjust the parameter of the initial service scheduling model using a back propagation algorithm according to a rating result.
- The apparatus according to claim 7, further comprising:a rating module configured to: after the service scheduling is performed in the whole CDN, rate a fourth configuration status of a network resource in the whole CDN after the service scheduling using a preset network rating standard; andan adjusting module configured to adjust a parameter of the service scheduling model using a back propagation algorithm according to a rating result.
- The apparatus according to any of claims 7 to 10, wherein the obtaining module is configured to:determine a scheduling trigger probability using a trained fault alarming model when an abnormality is detected in a status parameter of a first network resource in the whole CDN; andgenerate a random number between 0 and 1, and obtain the current first configuration status of the network resource in the whole CDN when the random number is less than or equal to the scheduling trigger probability.
- The apparatus according to claim 11, further comprising:
an establishing module configured to calculate and establish the fault alarming model in a Markov chain form according to historical fault alarm data of the whole CDN. - A management device, comprising a processor and a memory storing at least one instruction, at least one program, a code set, or an instruction set that are loaded and executed by the processor to perform the method for scheduling a service according to any of claims 1 to 6.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710576106.XA CN107231436B (en) | 2017-07-14 | 2017-07-14 | A method and device for performing service scheduling |
| PCT/CN2018/081867 WO2019011015A1 (en) | 2017-07-14 | 2018-04-04 | Method and device for service scheduling |
Publications (3)
| Publication Number | Publication Date |
|---|---|
| EP3629553A1 true EP3629553A1 (en) | 2020-04-01 |
| EP3629553A4 EP3629553A4 (en) | 2020-07-08 |
| EP3629553B1 EP3629553B1 (en) | 2022-01-26 |
Family
ID=59956825
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| EP18832346.3A Not-in-force EP3629553B1 (en) | 2017-07-14 | 2018-04-04 | Method and device for service scheduling |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US11128684B2 (en) |
| EP (1) | EP3629553B1 (en) |
| CN (1) | CN107231436B (en) |
| WO (1) | WO2019011015A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114006827A (en) * | 2021-09-27 | 2022-02-01 | 清华大学 | Training of time-triggered scheduling model, time-triggered scheduling method and device |
Families Citing this family (29)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107231436B (en) | 2017-07-14 | 2021-02-02 | 网宿科技股份有限公司 | A method and device for performing service scheduling |
| CN108306769B (en) * | 2018-01-31 | 2021-08-20 | 北京奇艺世纪科技有限公司 | CDN node deployment control method and system |
| EP3528435B1 (en) * | 2018-02-16 | 2021-03-31 | Juniper Networks, Inc. | Automated configuration and data collection during modeling of network devices |
| CN110276503B (en) * | 2018-03-14 | 2023-04-21 | 吉旗物联科技(上海)有限公司 | Method for automatically identifying cold chain vehicle task |
| CN109102515A (en) * | 2018-07-31 | 2018-12-28 | 浙江杭钢健康产业投资管理有限公司 | A kind of method for cell count based on multiple row depth convolutional neural networks |
| CN109388484B (en) * | 2018-08-16 | 2020-07-28 | 广东石油化工学院 | Multi-resource cloud job scheduling method based on Deep Q-network algorithm |
| CN110519365B (en) * | 2019-08-26 | 2022-07-01 | 网宿科技股份有限公司 | Method for changing equipment service and service changing system |
| CN113132437B (en) * | 2019-12-31 | 2024-01-23 | 中兴通讯股份有限公司 | CDN scheduling method, system, equipment and storage medium |
| CN113067714B (en) * | 2020-01-02 | 2022-12-13 | 中国移动通信有限公司研究院 | A content distribution network scheduling processing method, device and equipment |
| CN113391888B (en) * | 2020-03-12 | 2024-05-17 | 北京京东振世信息技术有限公司 | Service resource scheduling method, device, equipment and storage medium |
| CN111614484B (en) * | 2020-04-13 | 2021-11-02 | 网宿科技股份有限公司 | A method, system and central server for transferring and restoring node traffic |
| CN111652635A (en) * | 2020-05-14 | 2020-09-11 | 拉扎斯网络科技(上海)有限公司 | Resource strategy information recommendation, execution status data, and predictive model acquisition methods |
| CN111589109B (en) * | 2020-05-21 | 2023-09-26 | 网易(杭州)网络有限公司 | Data processing method and device, electronic equipment and storage medium |
| CN112016789B (en) * | 2020-07-15 | 2024-01-16 | 北京淇瑀信息科技有限公司 | Internet financial business processing methods, devices and electronic equipment |
| CN111950872A (en) * | 2020-07-30 | 2020-11-17 | 深圳市高德信通信股份有限公司 | CDN resource scheduling system |
| CN111953538A (en) * | 2020-07-31 | 2020-11-17 | 深圳市高德信通信股份有限公司 | CDN bandwidth scheduling system based on big data processing |
| CN112243025B (en) * | 2020-09-22 | 2023-10-17 | 网宿科技股份有限公司 | Node cost scheduling method, electronic equipment and storage media |
| CN112667398B (en) * | 2020-12-28 | 2023-09-01 | 北京奇艺世纪科技有限公司 | Resource scheduling method and device, electronic equipment and storage medium |
| CN114978915B (en) * | 2021-02-24 | 2024-01-19 | 北京金山云网络技术有限公司 | CDN node bandwidth planning method and device, electronic equipment and storage medium |
| CN115379243B (en) * | 2021-05-21 | 2024-02-27 | 北京字跳网络技术有限公司 | CDN scheduling method, device, equipment and storage medium |
| CN113839813B (en) * | 2021-09-14 | 2023-03-24 | 中国电信股份有限公司 | Equipment control strategy model training and equipment control method, medium and equipment |
| CN114244903B (en) * | 2021-11-01 | 2024-05-28 | 网宿科技股份有限公司 | Resource scheduling method, system, server and storage medium |
| CN114389942B (en) * | 2022-01-11 | 2024-06-04 | 北京金山云网络技术有限公司 | CDN configuration method and device, electronic equipment and storage medium |
| CN114629906B (en) * | 2022-03-14 | 2023-09-29 | 浙江大学 | A reliable cloud container cluster resource scheduling method and device based on deep reinforcement learning |
| CN114726922B (en) * | 2022-03-31 | 2023-11-21 | 联想(北京)有限公司 | Network resource scheduling method and device, electronic equipment and storage medium |
| CN115426319B (en) * | 2022-08-30 | 2024-09-06 | 商飞智能技术有限公司 | Network resource scheduling system |
| CN119210993A (en) * | 2023-06-26 | 2024-12-27 | 中兴通讯股份有限公司 | Method and device for scheduling target CDN network element and electronic equipment |
| CN119363621B (en) * | 2024-10-18 | 2025-11-21 | 中国移动通信集团浙江有限公司 | CDN heterogeneous cache node resource prediction method and device |
| CN119766756B (en) * | 2025-01-02 | 2025-07-15 | 北京领雾科技有限公司 | Distributed network resource dynamic allocation method and system based on multiple strategies |
Family Cites Families (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9549043B1 (en) * | 2004-07-20 | 2017-01-17 | Conviva Inc. | Allocating resources in a content delivery environment |
| US8214450B2 (en) | 2005-08-01 | 2012-07-03 | Limelight Networks, Inc. | Dynamic bandwidth allocation |
| US8103282B2 (en) * | 2005-09-28 | 2012-01-24 | Avaya Inc. | Methods and apparatus for allocating resources in a distributed environment based on network assessment |
| US20080215409A1 (en) * | 2007-01-03 | 2008-09-04 | Victorware, Llc | Iterative resource scheduling |
| US20090307215A1 (en) * | 2008-06-04 | 2009-12-10 | Tynt Multimedia, Inc. | Network resource annotation and search system |
| CN101694652B (en) * | 2009-09-30 | 2012-11-28 | 西安交通大学 | Network resource personalized recommendation method based on extremely fast neural network |
| US9002978B2 (en) * | 2011-07-08 | 2015-04-07 | Ming Li | Content delivery prediction and feedback systems |
| US9438487B2 (en) * | 2012-02-23 | 2016-09-06 | Ericsson Ab | Bandwith policy management in a self-corrected content delivery network |
| US9100464B2 (en) * | 2012-08-29 | 2015-08-04 | Ericsson Television Inc. | Regulating content streams from a weighted fair queuing scheduler using weights defined for user equipment nodes |
| US9467383B2 (en) * | 2012-06-19 | 2016-10-11 | Hewlett Packard Enterprise Development Lp | Iterative optimization method for site selection in global load balance |
| CN103051546B (en) * | 2012-12-12 | 2015-07-08 | 中国科学院计算技术研究所 | Delay scheduling-based network traffic conflict prevention method and delay scheduling-based network traffic conflict prevention system |
| CN103117876B (en) * | 2013-01-24 | 2018-10-26 | 中兴通讯股份有限公司 | The synchronous method and device of user state information |
| CN103167028A (en) * | 2013-02-21 | 2013-06-19 | 胡凤兵 | User convergence method capable of saving transmission bandwidth and increasing concurrency |
| CN103412875B (en) * | 2013-07-11 | 2016-09-28 | 广东工业大学 | CDN strategy adjusting method based on AHP decision model |
| WO2015092920A1 (en) * | 2013-12-20 | 2015-06-25 | 株式会社日立製作所 | Performance prediction method, performance prediction system and program |
| TWI603266B (en) * | 2014-03-03 | 2017-10-21 | 廣達電腦股份有限公司 | Resource adjustment methods and systems for virtual machines |
| JP6444494B2 (en) * | 2014-05-23 | 2018-12-26 | データロボット, インコーポレイテッド | Systems and techniques for predictive data analysis |
| CN104320487B (en) * | 2014-11-11 | 2018-03-20 | 网宿科技股份有限公司 | The HTTP scheduling system and method for content distributing network |
| CN104834722B (en) * | 2015-05-12 | 2018-03-02 | 网宿科技股份有限公司 | Content Management System based on CDN |
| CN106940801B (en) * | 2016-01-04 | 2019-10-22 | 中国科学院声学研究所 | A deep reinforcement learning recommendation system and method for wide area networks |
| CN105956661A (en) * | 2016-04-15 | 2016-09-21 | 中山大学 | System for realizing DANN online training on SDN network |
| CN106713265B (en) * | 2016-11-21 | 2019-05-28 | 清华大学深圳研究生院 | CDN node distribution method and device, CDN node distribution server and CDN network system |
| CN107231436B (en) * | 2017-07-14 | 2021-02-02 | 网宿科技股份有限公司 | A method and device for performing service scheduling |
-
2017
- 2017-07-14 CN CN201710576106.XA patent/CN107231436B/en not_active Expired - Fee Related
-
2018
- 2018-04-04 EP EP18832346.3A patent/EP3629553B1/en not_active Not-in-force
- 2018-04-04 WO PCT/CN2018/081867 patent/WO2019011015A1/en not_active Ceased
-
2019
- 2019-12-23 US US16/726,115 patent/US11128684B2/en not_active Expired - Fee Related
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114006827A (en) * | 2021-09-27 | 2022-02-01 | 清华大学 | Training of time-triggered scheduling model, time-triggered scheduling method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| US20200137131A1 (en) | 2020-04-30 |
| EP3629553A4 (en) | 2020-07-08 |
| US11128684B2 (en) | 2021-09-21 |
| CN107231436B (en) | 2021-02-02 |
| WO2019011015A1 (en) | 2019-01-17 |
| CN107231436A (en) | 2017-10-03 |
| EP3629553B1 (en) | 2022-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11128684B2 (en) | Method and apparatus for scheduling service | |
| US11334831B2 (en) | Predictive risk assessment in system modeling | |
| US10585773B2 (en) | System to manage economics and operational dynamics of IT systems and infrastructure in a multi-vendor service environment | |
| US9883037B1 (en) | Systems and methods in an electronic contact management system to estimate required staff levels for multi-skilled agents | |
| Zyrianoff et al. | Scalability of real-time iot-based applications for smart cities | |
| EP2040170B1 (en) | System configuration parameter set optimizing method, program, and device | |
| US20200265303A1 (en) | Behavior prediction with dynamic adaptation to environmental conditions | |
| WO2013030860A1 (en) | Predictive sequential calculation device | |
| CN113485801B (en) | Real-time DNN scheduling system and method based on neural network similarity modeling | |
| Pintye et al. | Enhancing machine learning-based autoscaling for cloud resource orchestration | |
| CN119513207B (en) | Task simulation method, device and computer equipment for virtual simulation platform | |
| CN120353678A (en) | Performance test method, device, electronic equipment and computer readable storage medium | |
| AU2021218217A1 (en) | Systems and methods for preventative monitoring using AI learning of outcomes and responses from previous experience. | |
| Upadhyay et al. | Scaled conjugate gradient backpropagation based sla violation prediction in cloud computing | |
| US20260065357A1 (en) | Selective data rejection for computationally efficient distributed analytics platform | |
| De Grande et al. | Time series-oriented load prediction model and migration policies for distributed simulation systems | |
| US20170330108A1 (en) | Information processing system, information processing method, and recording medium | |
| US12169737B1 (en) | Task orchestration system in a trustless computing environment | |
| Bidollahkhani et al. | Hoshmand: accelerated AI-driven scheduler emulating conventional task distribution techniques for cloud workloads | |
| Fang et al. | Graph-Aware Diffusion Policy for Fault-Tolerant Agentic AI Service Migration in Edge Computing Power Networks | |
| US12095627B2 (en) | Predict new system status based on status changes | |
| Akhtarian | Multi-Versioning and Microservices: A Strategy for Developing Reliable Software Systems | |
| Filianin et al. | Gymnasium Library Interface for Multi Access Edge Computing | |
| Bolodurina et al. | Development and research of model for ensuring reliability of operation of network infrastructure objects in cyber-physical system located in the cloud platform | |
| Ravikumaraiah | Enhanced Auto-scaling by using Dynamic scaling policy with Deep learning: LSTM |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 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: 20191223 |
|
| 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: 20200608 |
|
| RIC1 | Information provided on ipc code assigned before grant |
Ipc: H04L 12/26 20060101ALI20200602BHEP Ipc: G06N 3/08 20060101ALI20200602BHEP Ipc: H04L 12/801 20130101ALI20200602BHEP Ipc: H04L 12/24 20060101ALI20200602BHEP Ipc: H04L 12/803 20130101ALI20200602BHEP Ipc: H04L 29/08 20060101AFI20200602BHEP |
|
| 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: 20200904 |
|
| DAV | Request for validation of the european patent (deleted) | ||
| DAX | Request for extension of the european patent (deleted) | ||
| 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 |
|
| INTG | Intention to grant announced |
Effective date: 20211021 |
|
| GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
| 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 |
|
| 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: AT Ref legal event code: REF Ref document number: 1466174 Country of ref document: AT Kind code of ref document: T Effective date: 20220215 |
|
| 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: 602018030232 Country of ref document: DE |
|
| 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: 20220126 |
|
| REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1466174 Country of ref document: AT Kind code of ref document: T Effective date: 20220126 |
|
| 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: 20220126 |
|
| 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: 20220126 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: 20220126 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: 20220526 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: 20220426 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: 20220126 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: 20220126 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: 20220126 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: 20220426 |
|
| 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: 20220126 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: 20220126 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: 20220427 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: 20220126 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: 20220126 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20220526 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602018030232 Country of ref document: DE |
|
| 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: 20220126 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: 20220126 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: 20220126 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: 20220126 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: 20220126 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: 20220126 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 602018030232 Country of ref document: DE |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
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: 20220126 |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
| 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 |
|
| GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20220426 |
|
| 26N | No opposition filed |
Effective date: 20221027 |
|
| REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20220430 |
|
| 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: 20220126 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220404 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220430 Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220426 Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220430 Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20221103 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220430 |
|
| 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: 20220126 Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220430 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20220404 |
|
| 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: 20220126 |
|
| 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: 20220126 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: 20220126 |
|
| 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: 20180404 |
|
| 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: 20220126 |
|
| 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: 20220126 |