CN107872402B - Global flow scheduling method and device and electronic equipment - Google Patents

Global flow scheduling method and device and electronic equipment Download PDF

Info

Publication number
CN107872402B
CN107872402B CN201711131802.6A CN201711131802A CN107872402B CN 107872402 B CN107872402 B CN 107872402B CN 201711131802 A CN201711131802 A CN 201711131802A CN 107872402 B CN107872402 B CN 107872402B
Authority
CN
China
Prior art keywords
service
load
preset
index
service 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.)
Active
Application number
CN201711131802.6A
Other languages
Chinese (zh)
Other versions
CN107872402A (en
Inventor
许国军
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.)
Beijing QIYI Century Science and Technology Co Ltd
Original Assignee
Beijing QIYI Century 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 Beijing QIYI Century Science and Technology Co Ltd filed Critical Beijing QIYI Century Science and Technology Co Ltd
Priority to CN201711131802.6A priority Critical patent/CN107872402B/en
Publication of CN107872402A publication Critical patent/CN107872402A/en
Application granted granted Critical
Publication of CN107872402B publication Critical patent/CN107872402B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1001Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1029Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers using data related to the state of servers by a load balancer
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/50Queue scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1001Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1001Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004Server selection for load balancing
    • H04L67/1012Server selection for load balancing based on compliance of requirements or conditions with available server resources

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Computer And Data Communications (AREA)

Abstract

The embodiment of the invention provides a method, a device and electronic equipment for global traffic scheduling, wherein the method comprises the following steps: acquiring index data of each service in current service resources; calculating the load index of the current service resource through a preset first algorithm according to the index data of each service; judging whether the load index of the current service resource is greater than or equal to a preset threshold value; when the load index of the current service resource is greater than or equal to the preset threshold value, acquiring load indexes of other service resources, and determining a flow scheduling scheme through a preset second algorithm, wherein the other service resources are service resources except the current service resource; and updating the service configuration of the service resource corresponding to the traffic scheduling scheme. By adopting the automatic scheduling method, the method can reduce the hysteresis of flow scheduling and reduce the workload of manpower.

Description

Global flow scheduling method and device and electronic equipment
Technical Field
The present invention relates to the field of internet technologies, and in particular, to a method and an apparatus for global traffic scheduling, and an electronic device.
Background
With the development of internet technology, the range of internet coverage is becoming wider, and in Web services, in order to meet the access requirements of users in different areas, a distributed deployment mode is generally adopted to establish a plurality of data centers/computer rooms.
In the existing Web service, when a user accesses, the user can access to a corresponding machine room according to the IP address of the user. With the increase of the number of users, the number of services also rises sharply, and the dependence of the services on machine room facilities, hardware equipment, special lines and the like is stronger and more. These dependencies are inevitably subject to failure, which causes the services of some machines and some rooms to be unavailable. On the other hand, because the machine rooms are deployed in a distributed manner, for users in different regions, the accessed machine rooms are judged only according to the IP addresses, and there may be a case where service delay is high.
In the prior art, when the service has the above problem, a manual scheduling method is adopted to perform traffic scheduling switching.
However, the inventor finds that the prior art has at least the following problems in the process of implementing the invention:
the manual scheduling method is adopted, the processing process is long in flow, the response is slow, and the flow scheduling has long hysteresis.
Disclosure of Invention
The embodiment of the invention aims to provide a method, a device and electronic equipment for global traffic scheduling, so as to reduce the hysteresis of traffic scheduling. The specific technical scheme is as follows:
in a first aspect, an embodiment of the present invention provides a method for global traffic scheduling, where the method includes:
acquiring index data of each service in current service resources, wherein the index data comprises at least one of a CPU (Central processing Unit) state, a network state, an application load state and an access request error rate corresponding to the service;
calculating the load index of the current service resource through a preset first algorithm according to the index data of each service;
judging whether the load index of the current service resource is greater than or equal to a preset threshold value;
when the load index of the current service resource is greater than or equal to the preset threshold value, acquiring load indexes of other service resources, and determining a flow scheduling scheme through a preset second algorithm, wherein the other service resources are service resources except the current service resource;
and updating the service configuration of the service resource corresponding to the traffic scheduling scheme.
Optionally, the calculating the load index of the current service resource according to the index data of each service by using a preset first algorithm includes:
assembling the index data according to a preset rule, and adding the index data into a message queue;
processing the index data assembled in the message queue to obtain an index data group corresponding to the current service resource;
and calculating the load index of the current service resource according to the index data group.
Optionally, the calculating the load index of the current service resource according to the index data set includes:
storing the index data group to a preset position;
and reading the index data group stored in the preset position at regular time according to preset starting time, and calculating the load index of the current service resource.
Optionally, the determining whether the load index of the current service resource is greater than or equal to a preset threshold includes:
respectively judging whether the numerical value of each sub-item in the load index is greater than or equal to the numerical value of the corresponding reference item in the preset threshold, wherein each sub-item in the load index comprises the CPU occupancy rate and the network packet loss rate;
and if the numerical value of any sub-item in the load index is greater than or equal to the numerical value of the corresponding reference item in the preset threshold, judging that the load index is greater than or equal to the preset threshold.
Optionally, when the load index of the current service resource is greater than or equal to the preset threshold, obtaining load indexes of other service resources, and determining a traffic scheduling scheme through a preset second algorithm, includes:
when the load index of the current service resource is greater than or equal to the preset threshold value, acquiring the load indexes of the other service resources;
selecting a service which accords with a preset service rule from the current service resources as a service to be migrated;
respectively calculating the migration cost for migrating the service to be migrated to each other service resource according to the load indexes of the other service resources;
selecting the service resources with the migration cost according with the preset migration rule as target service resources;
correspondingly, the updating the service configuration of the service resource corresponding to the traffic scheduling scheme includes:
sending first migration information to the current service resource so that the current service resource deletes the service configuration corresponding to the service to be migrated;
and sending second migration information to the target service resource so that the target service resource establishes service configuration corresponding to the service to be migrated.
Optionally, the current service resource and the other service resources are different rooms or data centers.
In a second aspect, an embodiment of the present invention provides an apparatus for global traffic scheduling, where the apparatus includes:
the data acquisition module is used for acquiring index data of each service in the current service resource, wherein the index data comprises at least one of a CPU (central processing unit) state, a network state, an application load state and an access request error rate corresponding to the service;
the first calculation module is used for calculating the load index of the current service resource through a preset first algorithm according to the index data of each service;
the judging module is used for judging whether the load index of the current service resource is greater than or equal to a preset threshold value or not;
a second calculation module, configured to, when the load index of the current service resource is greater than or equal to the preset threshold, obtain load indexes of other service resources, and determine a traffic scheduling scheme through a preset second algorithm, where the other service resources are service resources other than the current service resource;
and the configuration updating module is used for updating the service configuration of the service resource corresponding to the flow scheduling scheme.
Optionally, the first computing module includes:
the assembling submodule is used for assembling the index data according to a preset rule and adding the index data into a message queue;
the processing submodule is used for processing the index data assembled in the message queue to obtain an index data group corresponding to the current service resource;
and the calculating submodule is used for calculating the load index of the current service resource according to the index data group.
Optionally, the calculation sub-module includes:
the storage unit is used for storing the index data group to a preset position;
and the timing calculation unit is used for regularly reading the index data group stored in the preset position according to preset starting time and calculating the load index of the current service resource.
Optionally, the determining module includes:
a sub-item comparison sub-module, configured to respectively determine whether a numerical value of each sub-item in the load index is greater than or equal to a numerical value of a corresponding reference item in the preset threshold, where each sub-item in the load index includes a CPU occupancy rate and a network packet loss rate;
and the result judgment submodule is used for judging that the load index is greater than or equal to the preset threshold value if the numerical value of any sub-item in the load index is greater than or equal to the numerical value of the corresponding reference item in the preset threshold value.
Optionally, the second computing module includes:
the index acquisition submodule is used for acquiring the load indexes of the other service resources when the load index of the current service resource is greater than or equal to the preset threshold;
the service selection submodule is used for selecting a service which accords with a preset service rule from the current service resources as a service to be migrated;
the cost calculation submodule is used for respectively calculating the migration cost for migrating the service to be migrated to each other service resource according to the load indexes of the other service resources;
the target selection submodule is used for selecting the service resources with the migration cost meeting the preset migration rule as target service resources;
accordingly, the configuration update module includes:
a configuration deletion submodule, configured to send first migration information to the current service resource, so that the current service resource deletes the service configuration corresponding to the service to be migrated;
and the configuration establishing submodule is used for sending second migration information to the target service resource so that the target service resource establishes service configuration corresponding to the service to be migrated.
Optionally, the current service resource and the other service resources are different rooms or data centers.
In a third aspect, an embodiment of the present invention provides an electronic device, including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete mutual communication through the communication bus;
the memory is used for storing a computer program;
the processor is configured to implement the method for global traffic scheduling according to any of the first aspect described above when executing a program stored in a memory.
In a fourth aspect, the present invention provides a computer-readable storage medium, having stored therein instructions, which, when executed on a computer, cause the computer to perform the method for global traffic scheduling according to any one of the above first aspects.
In a fifth aspect, an embodiment of the present invention provides a computer program product containing instructions, which when run on a computer, causes the computer to perform the method for global traffic scheduling according to any one of the above first aspects.
According to the method, the device and the electronic equipment for global traffic scheduling provided by the embodiment of the invention, index data of each service in current service resources is acquired; calculating the load index of the current service resource through a preset first algorithm according to the index data of each service; judging whether the load index of the current service resource is greater than or equal to a preset threshold value; when the load index of the current service resource is greater than or equal to the preset threshold value, acquiring load indexes of other service resources, and determining a flow scheduling scheme through a preset second algorithm, wherein the other service resources are service resources except the current service resource; and updating the service configuration of the service resource corresponding to the traffic scheduling scheme. By adopting the automatic scheduling method, the method can reduce the hysteresis of flow scheduling and reduce the workload of manpower. Of course, it is not necessary for any product or method of practicing the invention to achieve all of the above-described advantages at the same time.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below.
Fig. 1 is a schematic flowchart of a method for global traffic scheduling according to an embodiment of the present invention;
fig. 2 is another schematic flow chart of a method for global traffic scheduling according to an embodiment of the present invention;
fig. 3 is a schematic diagram of an apparatus for global traffic scheduling according to an embodiment of the present invention;
fig. 4 is a schematic diagram of an electronic device according to an embodiment of the invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention.
In the Web application service, because the number of users is large and the coverage of user areas is wide, the server generally adopts a mode of multiple data centers/machine rooms for distributed deployment. When the user accesses, the server side can access the user to the corresponding machine room according to the IP address of the user. On one hand, as the number of services increases, service resources may be unavailable for a short time due to hardware, networks, and the like; on the other hand, if the service resource to be accessed is determined only by the IP address, the service delay may be high.
In order to solve the above problem, an embodiment of the present invention provides a global traffic scheduling method, which is used for traffic scheduling between computer rooms/data centers, and referring to fig. 1, the method includes:
s101, index data of each service in the current service resource is obtained, wherein the index data comprises at least one of a CPU state, a network state, an application load state and an access request error rate corresponding to the service.
The method for global traffic scheduling according to the embodiments of the present invention may be implemented by a global traffic scheduling system, which is any system capable of executing the method for global traffic scheduling according to the embodiments of the present invention. For example:
the global traffic scheduling system may be a device comprising: a processor, a memory, a communication interface, and a bus; the processor, the memory and the communication interface are connected through a bus and complete mutual communication; the memory stores executable program code; the processor runs a program corresponding to the executable program code by reading the executable program code stored in the memory, so as to execute the method for global traffic scheduling according to the embodiment of the present invention.
The global traffic scheduling system may also be an application program, which is used to execute the method for global traffic scheduling according to the embodiment of the present invention when running.
The global traffic scheduling system may also be a storage medium for storing executable codes, where the executable codes are used to execute the method for global traffic scheduling according to the embodiment of the present invention.
The global traffic scheduling system collects index data of each service from each server (such as a load balancing server, a reverse proxy server, a back-end application server and the like) of the current service resource. The index data identifies the utilization rate of the server, the response time of the access request corresponding to the service, the load condition occupied by the service, and the like, and the specific index data can be the CPU state, the network state, the application load state, the access request error rate, and the like corresponding to the service. The service refers to a service provided by an operator for a user, such as a video service or a game service. The current service resources are machine rooms, data centers or load balancing servers and the like.
And S102, calculating the load index of the current service resource through a preset first algorithm according to the index data of each service.
And the global flow scheduling system analyzes and calculates the index data of each service by using a preset first algorithm, and determines the load index corresponding to the current service resource. The first preset algorithm is an algorithm for calculating the running condition of the service resource. For example, the total CPU utilization rate of the current service resource is calculated according to the CPU state corresponding to each service; calculating the delay or average delay of the access request of each service in the current service resource according to the network state of each service; calculating the total application load rate of the current service resource according to the load state occupied by each service; and calculating the packet loss rate or the average network packet loss rate of each service network in the current service resource according to the access request error rate of each service.
S103, judging whether the load index of the current service resource is greater than or equal to a preset threshold value.
The preset threshold is any value and is set according to specific conditions. For example, the preset threshold is that the total CPU utilization of the service resource is 100%, the average delay of the access request of each service in the service resource is 1000 milliseconds, the total application load rate of the service resource is 95%, the average network packet loss rate of each service in the service resource is 80%, and the like. Executing S104 when the load index of the current service resource is greater than or equal to a preset threshold value; and when the load index of the current service resource is smaller than the preset threshold value, waiting for the next detection period and returning to execute S101.
And S104, acquiring load indexes of other service resources, and determining a flow scheduling scheme through a preset second algorithm, wherein the other service resources are service resources except the current service resource.
In the embodiment of the invention, all service resources can be controlled by one global traffic scheduling system, and one global traffic scheduling system can be added for each machine room or each data center. In practical application, in order to simplify the interaction complexity between systems, a global traffic scheduling system is generally adopted, and index data of service resources are collected and reported uniformly. The preset second algorithm is any algorithm capable of selecting the specified service and determining the migration target of the specified service. And the global traffic scheduling system determines a traffic scheduling scheme of the service resource to be migrated by using a preset second algorithm, wherein the traffic scheduling scheme identifies the service to be migrated and a migration target corresponding to the service to be migrated.
And S105, updating the service configuration of the service resource corresponding to the flow scheduling scheme.
And the global flow scheduling system updates the service configuration of the service resource corresponding to the flow scheduling scheme, including updating the service configuration of the current service resource and updating the service configuration of the migration target.
In the embodiment of the invention, when the load index of the service resource is greater than or equal to the preset threshold value, a traffic scheduling scheme is determined, and traffic scheduling is finished according to the traffic scheduling scheme. And automatic flow scheduling is adopted, so that the problems of slow and trivial manual processing flow, low efficiency and the like are solved. When the network or service resources are abnormal, the service of the user can be automatically switched to other service resources under the condition that the user does not perceive.
Optionally, in the method for global traffic scheduling according to the embodiment of the present invention, the current service resource and the other service resources are different rooms or data centers.
In the embodiment of the invention, the service resource is the machine room or the data center, manual cross-machine room/data center scheduling service is not needed, automatic migration of user service of the cross-machine room/data center is realized, the efficiency of service scheduling among different machine rooms/data centers is greatly increased, and the service of the user can be automatically switched to other machine rooms/data centers under the condition that the user does not sense the service.
Optionally, step S102, calculating a load index of the current service resource according to the index data of each service through a preset first algorithm, where the method includes:
step one, assembling each index data according to a preset rule, and adding the index data into a message queue.
The global traffic scheduling system groups each index data according to a fixed format, for example, the index data of the same type of service is grouped into one group, for example, the index data of all video services are grouped into one group; or grouping the index data of the same attribute, such as grouping the CPU states corresponding to each service. And then packing the grouped index data and adding the packed index data into a message queue.
And step two, processing the index data assembled in the message queue to obtain an index data group corresponding to the current service resource.
The global flow scheduling system reads the index data assembled in the message queue and processes the index data to obtain an index data group, for example, the CPU utilization rate of each server corresponding to the current service resource is respectively calculated according to the CPU state corresponding to each service; and respectively calculating the application load rate of each server corresponding to the current service resource according to the application load state of each service.
And step three, calculating the load index of the current service resource according to the index data group.
The global flow scheduling system calculates the load index of the current service resource according to the index data group of the current service resource, for example, the total CPU utilization rate of the current service resource is calculated according to the CPU utilization rate of each server corresponding to the current service resource; and calculating the average network packet loss rate of the current service resource according to the network packet loss rate of each server corresponding to the current service resource.
The embodiment of the invention provides a method for calculating the load index of the current service resource, and provides a premise for subsequently judging the load index and the preset threshold value.
Optionally, calculating the load index of the current service resource according to the index data set includes:
step one, storing the index data group to a preset position.
The preset position is any storage position, such as a cache or a database. The global flow scheduling system stores the index data group to a preset position, and calculation and analysis of the index data group are facilitated subsequently.
And step two, reading the index data set stored in the preset position at regular time according to the preset starting time, and calculating the load index of the current service resource.
The preset starting time is any time and can be freely set according to the actual situation. For example, the global traffic scheduling system reads the index data set once every 1 minute or 30 seconds, and calculates the load index of the current service resource.
In the embodiment of the invention, the load index of the current service resource is calculated at regular time according to the starting time, the starting time can be freely set, and the execution interval can be conveniently and freely adjusted while the regular detection is realized.
Optionally, step S103, determining whether the load index of the current service resource is greater than or equal to a preset threshold, includes:
step one, respectively judging whether the numerical value of each sub-item in the load index is larger than or equal to the numerical value of the corresponding reference item in the preset threshold, wherein each sub-item in the load index comprises the CPU occupancy rate and the network packet loss rate.
The load index may include a plurality of sub-items, such as a total CPU occupancy of the service resource, an average network packet loss rate of the service resource, an average delay of an access request of each service in the service resource, and a total application load rate of the service resource. Correspondingly, the preset threshold comprises a plurality of reference items corresponding to the sub-items of the load index, and the numerical value of the reference item in the preset threshold can be freely set according to the type of the actual service and the requirement on the service quality. For example, the total CPU occupancy is 100%, 95%, or 90%, etc.; the average delay is 3 seconds, 1 second or 500 milliseconds, etc.; the average network packet loss rate is 90%, 80% or 75% and the like; the total application load rate is 100%, 95%, 90%, or the like.
And step two, if the numerical value of any sub item in the load index is greater than or equal to the numerical value of the corresponding reference item in the preset threshold, judging that the load index is greater than or equal to the preset threshold.
For example, the load metric includes three sub-terms: the total application load rate is 98%, the total CPU occupancy rate is 80% and the average network packet loss rate is 20%; three reference terms for the preset threshold are: the total application load rate is 95%, the total CPU occupancy rate is 95%, and the average network packet loss rate is 80%, and it can be obtained that the total application load rate in the load index is greater than the total application load rate in the preset threshold, so that it is determined that the load index is greater than or equal to the preset threshold.
In the embodiment of the present invention, the load indicator includes a plurality of sub-items, and when a value of any one of the sub-items is greater than or equal to a corresponding reference value in a preset threshold, it is determined that the load indicator is greater than or equal to the preset threshold, so as to initiate service migration. The load indexes comprise CPU occupancy rate and network packet loss rate, and the normal work of the current service resources is ensured by considering the load of the current service resources and the network condition.
Optionally, in S104, when the load index of the current service resource is greater than or equal to the preset threshold, obtaining load indexes of other service resources, and determining a traffic scheduling scheme through a preset second algorithm, where the method includes:
step one, when the load index of the current service resource is larger than or equal to a preset threshold value, acquiring the load indexes of other service resources.
And step two, selecting the service which accords with the preset business rule from the current service resources as the service to be migrated.
The global traffic scheduling system selects a service to be migrated that meets a preset service rule from current service resources, may select the service to be migrated randomly, and may also select the service to be migrated correspondingly according to index data of each service in the current service resources, for example, when an average network packet loss rate of the current service resources is greater than an average network packet loss rate in a preset threshold, first select a service with a high network packet loss rate to migrate.
When selecting the service meeting the preset business rule, the service with low instantaneity requirement can be selected preferentially. For example, for online game services and video services, video services can be selected for migration. The influence of the service migration delay on the service is reduced, and therefore the user experience is improved.
And step three, respectively calculating the migration cost for migrating the service to be migrated to each other service resource according to the load indexes of the other service resources.
The migration cost is positively correlated with the influence of the service to be migrated on the service resource load.
For example, first, a delay coefficient x, a load coefficient y, and a packet loss coefficient z are calculated:
Figure BDA0001469717090000111
the actual delay is a time delay of a service enjoyed by a user when the service resource provides the service to be migrated, and the threshold delay is a preset time delay threshold; actual load is the total load of the service resources after the migration of the service to be migrated is completed, and threshold load is a preset application load threshold; actual lost is a network packet loss rate when the service resource provides the service to be migrated, and threshold lost is a preset network packet loss rate.
The actual load is a predicted value, which is the sum of the current load of the service resource and the load generated by the service to be migrated, and is the calculated total load of the service resource after receiving the service to be migrated. the threshold load is set according to the maximum load value of the service resource, for example, the threshold load is 100%, 95%, 90% or less of the maximum load value of the service resource. y identifies the remaining load capacity of the service resource, the smaller y the greater the remaining load capacity of the service resource.
If any of the values x, y, and z is greater than 1, then the cost of migration is made infinite.
When the values of x, y and z are all less than 1, calculating the migration cost: the cost is ax + yb + cz, where a, b, and c are preset values, and are freely set according to the actual situation, for example, for a service with a high delay requirement, the value of a may be set to be larger; for services with high load requirements, the value of b can be set to be larger; for services with high packet loss requirements, the value of c can be set to be larger, and the like.
And step four, selecting the service resources with the migration cost meeting the preset migration rule as target service resources.
The global traffic scheduling system selects a service resource with a migration cost meeting a preset migration rule from other service resources, for example, selects a service resource with the minimum migration cost as a target service resource.
Correspondingly, S105, updating the service configuration of the service resource corresponding to the traffic scheduling scheme includes:
step one, sending first migration information to a current service resource so that the current service resource deletes service configuration corresponding to a service to be migrated.
And the global flow scheduling system sends first migration information to the current service resource, wherein the first migration information identifies the service to be migrated. And after receiving the first migration information, the current service resource correspondingly deletes the service configuration corresponding to the service to be migrated according to the service to be migrated identified in the first migration information.
And step two, sending second migration information to the target service resource so that the target service resource establishes service configuration corresponding to the service to be migrated.
And the global flow scheduling system sends second migration information to the target service resource, wherein the second migration information identifies the service to be migrated. And after receiving the second migration information, the target service resource correspondingly establishes service configuration corresponding to the service to be migrated according to the service to be migrated identified in the second migration information.
In the embodiment of the invention, the target service resource is determined according to the migration cost, so that the normal work of the target service resource is ensured, and the target service resource can provide higher quality of service for the service to be migrated. And sending first migration information to the current service resource, sending second migration information to the target service resource, and completing the migration of the current service resource of the service to be migrated to the target service resource.
Referring to fig. 2, fig. 2 is another schematic flow chart of a global traffic scheduling method according to an embodiment of the present invention, including:
s201, collecting index data of each service in the service resources.
And the user accesses the service resources through the client according to the domain name or the IP address of the service resources, and the service resources correspondingly provide corresponding services for the user. The data acquisition service acquires index data from servers such as an online load balancing server, a reverse proxy server, a back-end application server and the like, wherein the index data can comprise a CPU (central processing unit) state, a network state, an application load state, an access request error rate and the like corresponding to the service.
S202, assembling and delivering the index data to the message queue cluster.
The data collection service simply assembles the collected index data into a fixed format and delivers the assembled index data to a message queue cluster, such as a Kafka (high-throughput distributed publish-subscribe message system) cluster.
S203, processing and storing the index data in the message queue cluster.
The consumer service consumes, processes and filters the messages on the message queue cluster, and stores the messages into various storage media such as a cache or a database.
And S204, calculating the load index of the service resource.
And the timing calculation service carries out timing calculation according to the stored data to obtain the load index of the service resource. And if a certain sub-item in the load index exceeds the numerical value of the corresponding reference item in the preset threshold, triggering flow scheduling.
And S205, generating a traffic scheduling scheme.
And the scheduling service integrates the load indexes of the service resources and the preset critical value according to a preset second algorithm to calculate a proper flow scheduling scheme.
S206, updating the service configuration of the service resource.
The scheduling execution unit updates load balancing server configuration, reverse proxy server configuration, Domain Name System (DNS) service configuration, hypertext Transfer Protocol (HTTP) DNS service configuration, and the like in the service resource corresponding to the traffic scheduling scheme according to the traffic scheduling scheme. The execution result of the scheduling execution unit finally reflects various indexes of online service, for example, the access flow of a certain machine room or a certain data center user is reduced, and the access flow of another machine room or data center user is increased.
The global traffic scheduling method of the embodiment of the invention can realize the intellectualization of traffic scheduling, does not need manual intervention, does not cause delay feeling to users, and can solve the service abnormity caused by network abnormity in time. The overall state of the service is monitored in real time, and the traffic scheduling is carried out from the global level, so that the reliability and the availability of the service can be greatly improved. Diversified traffic scheduling schemes can be preset, and the problems that user traffic is hijacked and a large number of access failures are caused by downtime of a machine room or a server can be effectively avoided.
An embodiment of the present invention further provides a device for global traffic scheduling, and referring to fig. 3, the device includes:
a data obtaining module 301, configured to obtain index data of each service in a current service resource, where the index data includes at least one of a CPU state, a network state, an application load state, and an access request error rate corresponding to the service;
a first calculating module 302, configured to calculate a load index of a current service resource according to index data of each service through a preset first algorithm;
a judging module 303, configured to judge whether a load index of a current service resource is greater than or equal to a preset threshold;
a second calculating module 304, configured to obtain load indexes of other service resources when the load index of the current service resource is greater than or equal to a preset threshold, and determine a traffic scheduling scheme through a preset second algorithm, where the other service resources are service resources other than the current service resource;
a configuration updating module 305, configured to update the service configuration of the service resource corresponding to the traffic scheduling scheme.
In the embodiment of the invention, when the load index of the service resource is greater than or equal to the preset threshold value, a traffic scheduling scheme is determined, and traffic scheduling is finished according to the traffic scheduling scheme. And automatic flow scheduling is adopted, so that the problems of slow and trivial manual processing flow, low efficiency and the like are solved. When the network or service resources are abnormal, the service of the user can be automatically switched to other service resources under the condition that the user does not perceive.
Optionally, the first calculating module 302 includes:
the assembling submodule is used for assembling each index data according to a preset rule and adding the index data into the message queue;
the processing submodule is used for processing the index data assembled in the message queue to obtain an index data group corresponding to the current service resource;
and the calculating submodule is used for calculating the load index of the current service resource according to the index data group.
The embodiment of the invention provides a method for calculating the load index of the current service resource, and provides a premise for subsequently judging the load index and the preset threshold value.
Optionally, the calculation submodule includes:
the storage unit is used for storing the index data group to a preset position;
and the timing calculation unit is used for regularly reading the index data group stored in the preset position according to the preset starting time and calculating the load index of the current service resource.
In the embodiment of the invention, the load index of the current service resource is calculated at regular time according to the starting time, the starting time can be freely set, and the execution interval can be conveniently and freely adjusted while the regular detection is realized.
Optionally, the determining module 303 includes:
the sub-item comparison sub-module is used for respectively judging whether the numerical value of each sub-item in the load index is greater than or equal to the numerical value of the corresponding reference item in the preset threshold value, wherein each sub-item in the load index comprises the CPU occupancy rate and the network packet loss rate;
and the result judgment submodule is used for judging that the load index is greater than or equal to the preset threshold value if the numerical value of any sub-item in the load index is greater than or equal to the numerical value of the corresponding reference item in the preset threshold value.
In the embodiment of the present invention, the load indicator includes a plurality of sub-items, and when a value of any one of the sub-items is greater than or equal to a corresponding reference value in a preset threshold, it is determined that the load indicator is greater than or equal to the preset threshold, so as to initiate service migration. The load indexes comprise CPU occupancy rate and network packet loss rate, and the normal work of the current service resources is ensured by considering the load of the current service resources and the network condition.
Optionally, the second calculating module 304 includes:
the index acquisition submodule is used for acquiring the load indexes of other service resources when the load index of the current service resource is greater than or equal to a preset threshold value;
the service selection submodule is used for selecting a service which accords with a preset service rule from the current service resources as a service to be migrated;
the cost calculation submodule is used for respectively calculating the migration cost of the service to be migrated to each other service resource according to the load indexes of the other service resources;
the target selection submodule is used for selecting the service resources with the migration cost meeting the preset migration rule as target service resources;
accordingly, the configuration update module 305 includes:
the configuration deleting submodule is used for sending first migration information to the current service resource so that the current service resource deletes the service configuration corresponding to the service to be migrated;
and the configuration establishing submodule is used for sending second migration information to the target service resource so that the target service resource establishes service configuration corresponding to the service to be migrated.
In the embodiment of the invention, the target service resource is determined according to the migration cost, so that the normal work of the target service resource is ensured, and the target service resource can provide higher quality of service for the service to be migrated. And sending first migration information to the current service resource, sending second migration information to the target service resource, and completing the migration of the current service resource of the service to be migrated to the target service resource.
Optionally, in the method for global traffic scheduling according to the embodiment of the present invention, the current service resource and the other service resources are different rooms or data centers.
In the embodiment of the invention, the service resource is the machine room or the data center, so that the process of manually scheduling service across the machine room/the data center can be avoided, the automatic migration of the user service across the machine room/the data center can be realized, the efficiency of service scheduling among different machine rooms/data centers can be greatly increased, and the service of the user can be automatically switched to other machine rooms/data centers under the condition that the user does not sense the service.
An embodiment of the present invention further provides an electronic device, as shown in fig. 4, including a processor 401, a communication interface 402, a memory 403, and a communication bus 404, where the processor 401, the communication interface 402, and the memory 403 complete mutual communication through the communication bus 404,
a memory 403 for storing a computer program;
the processor 401, when executing the program stored in the memory 403, implements the following steps:
acquiring index data of each service in the current service resource, wherein the index data comprises at least one of a CPU (Central processing Unit) state, a network state, an application load state and an access request error rate corresponding to the service;
calculating the load index of the current service resource through a preset first algorithm according to the index data of each service;
judging whether the load index of the current service resource is greater than or equal to a preset threshold value or not;
when the load index of the current service resource is greater than or equal to a preset threshold value, acquiring load indexes of other service resources, and determining a flow scheduling scheme through a preset second algorithm, wherein the other service resources are service resources except the current service resource;
and updating the service configuration of the service resource corresponding to the traffic scheduling scheme.
In the embodiment of the invention, when the load index of the service resource is greater than or equal to the preset threshold value, a traffic scheduling scheme is determined, and traffic scheduling is finished according to the traffic scheduling scheme. And automatic flow scheduling is adopted, so that the problems of slow and trivial manual processing flow, low efficiency and the like are solved. When the network or service resources are abnormal, the service of the user can be automatically switched to other service resources under the condition that the user does not perceive.
Optionally, when the processor 401 is configured to execute the program stored in the memory 403, any one of the above-described methods for global traffic scheduling may also be implemented.
The communication bus mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the electronic equipment and other equipment.
The Memory may include a Random Access Memory (RAM) or a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the Integrated Circuit may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, or a discrete hardware component.
In yet another embodiment of the present invention, a computer-readable storage medium is further provided, which has instructions stored therein, and when the instructions are executed on a computer, the computer is caused to execute the method for global traffic scheduling described in any of the above embodiments.
In the embodiment of the invention, when the load index of the service resource is greater than or equal to the preset threshold value, a traffic scheduling scheme is determined, and traffic scheduling is finished according to the traffic scheduling scheme. And automatic flow scheduling is adopted, so that the problems of slow and trivial manual processing flow, low efficiency and the like are solved. When the network or service resources are abnormal, the service of the user can be automatically switched to other service resources under the condition that the user does not perceive.
In yet another embodiment, a computer program product containing instructions is provided, which when run on a computer causes the computer to perform the method of global traffic scheduling as described in any of the above embodiments.
In the embodiment of the invention, when the load index of the service resource is greater than or equal to the preset threshold value, a traffic scheduling scheme is determined, and traffic scheduling is finished according to the traffic scheduling scheme. And automatic flow scheduling is adopted, so that the problems of slow and trivial manual processing flow, low efficiency and the like are solved. When the network or service resources are abnormal, the service of the user can be automatically switched to other service resources under the condition that the user does not perceive.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
For the embodiments of the apparatus/electronic device/computer-readable storage medium/computer program product for global traffic scheduling, since they are substantially similar to the method embodiments for global traffic scheduling, the description is relatively simple, and the relevant points can be referred to the description of the method embodiments for global traffic scheduling.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.

Claims (9)

1. A method for global traffic scheduling, the method comprising:
acquiring index data of each service in current service resources, wherein the index data comprises at least one of a CPU (central processing unit) state, a network state, an application load state and an access request error rate corresponding to the service, and the current service resources are machine rooms or data centers;
calculating the load index of the current service resource through a preset first algorithm according to the index data of each service;
judging whether the load index of the current service resource is greater than or equal to a preset threshold value;
when the load index of the current service resource is greater than or equal to the preset threshold value, acquiring load indexes of other service resources, wherein the other service resources are service resources except the current service resource, and the current service resource and the other service resources are different machine rooms or data centers;
selecting a service which accords with a preset service rule from the current service resources as a service to be migrated;
respectively calculating the migration cost for migrating the service to be migrated to each other service resource according to the load indexes of the other service resources; the migration cost calculation process comprises the following steps: calculating a delay coefficient x, a load coefficient y and a packet loss coefficient z:
Figure FDA0002957675050000011
the actual delay is a time delay of a service enjoyed by a user when a service resource receiving the service to be migrated provides the service to be migrated, and the threshold delay is a preset time delay threshold; the actual load is the total load of the service resources for receiving the service to be migrated after the migration of the service to be migrated is completed, and the threshold load is a preset application load threshold; actual lost is a network packet loss rate when a service resource receiving a service to be migrated provides the service to be migrated, and threshold lost is a preset network packet loss rate;
if any value in x, y and z is larger than 1, making the migration cost infinite;
when the values of x, y and z are all less than 1, calculating the migration cost: the cost is ax + yb + cz, where a, b, and c are preset values, and are freely set according to the actual situation, for example, for a service with a high delay requirement, the value of a may be set to be larger; for services with high load requirements, the value of b can be set to be larger; for services with high packet loss requirements, the value of c can be set to be larger;
selecting the service resource with the minimum migration cost as a target service resource;
sending first migration information to the current service resource so that the current service resource deletes the service configuration corresponding to the service to be migrated;
and sending second migration information to the target service resource so that the target service resource establishes service configuration corresponding to the service to be migrated.
2. The method according to claim 1, wherein the calculating the load indicator of the current service resource according to the indicator data of each service by a preset first algorithm comprises:
assembling the index data according to a preset rule, and adding the index data into a message queue;
processing the index data assembled in the message queue to obtain an index data group corresponding to the current service resource;
and calculating the load index of the current service resource according to the index data group.
3. The method of claim 2, wherein said calculating a load metric for the current service resource from the metric data set comprises:
storing the index data group to a preset position;
and reading the index data group stored in the preset position at regular time according to preset starting time, and calculating the load index of the current service resource.
4. The method of claim 1, wherein the determining whether the load indicator of the current service resource is greater than or equal to a preset threshold comprises:
respectively judging whether the numerical value of each sub-item in the load index is greater than or equal to the numerical value of the corresponding reference item in the preset threshold, wherein each sub-item in the load index comprises the CPU occupancy rate and the network packet loss rate;
and if the numerical value of any sub-item in the load index is greater than or equal to the numerical value of the corresponding reference item in the preset threshold, judging that the load index is greater than or equal to the preset threshold.
5. An apparatus for global traffic scheduling, the apparatus comprising:
the data acquisition module is used for acquiring index data of each service in current service resources, wherein the index data comprises at least one of a CPU (central processing unit) state, a network state, an application load state and an access request error rate corresponding to the service, and the current service resources are machine rooms or data centers;
the first calculation module is used for calculating the load index of the current service resource through a preset first algorithm according to the index data of each service;
the judging module is used for judging whether the load index of the current service resource is greater than or equal to a preset threshold value or not;
a second computing module, the second computing module comprising:
the index obtaining sub-module is used for obtaining load indexes of other service resources when the load index of the current service resource is larger than or equal to the preset threshold, wherein the other service resources are service resources except the current service resource, and the current service resource and the other service resources are different machine rooms or data centers;
the service selection submodule is used for selecting a service which accords with a preset service rule from the current service resources as a service to be migrated;
the cost calculation submodule is used for respectively calculating the migration cost for migrating the service to be migrated to each other service resource according to the load indexes of the other service resources; the migration cost calculation process comprises the following steps: calculating a delay coefficient x, a load coefficient y and a packet loss coefficient z:
Figure FDA0002957675050000031
the actual delay is a time delay of a service enjoyed by a user when a service resource receiving the service to be migrated provides the service to be migrated, and the threshold delay is a preset time delay threshold; the actual load is the total load of the service resources for receiving the service to be migrated after the migration of the service to be migrated is completed, and the threshold load is a preset application load threshold; actual lost is a network packet loss rate when a service resource receiving a service to be migrated provides the service to be migrated, and threshold lost is a preset network packet loss rate;
if any value in x, y and z is larger than 1, making the migration cost infinite;
when the values of x, y and z are all less than 1, calculating the migration cost: the cost is ax + yb + cz, where a, b, and c are preset values, and are freely set according to the actual situation, for example, for a service with a high delay requirement, the value of a may be set to be larger; for services with high load requirements, the value of b can be set to be larger; for services with high packet loss requirements, the value of c can be set to be larger;
the target selection submodule is used for selecting the service resource with the minimum migration cost as a target service resource;
a configuration update module, the configuration update module comprising:
a configuration deletion submodule, configured to send first migration information to the current service resource, so that the current service resource deletes the service configuration corresponding to the service to be migrated;
and the configuration establishing submodule is used for sending second migration information to the target service resource so that the target service resource establishes service configuration corresponding to the service to be migrated.
6. The apparatus of claim 5, wherein the first computing module comprises:
the assembling submodule is used for assembling the index data according to a preset rule and adding the index data into a message queue;
the processing submodule is used for processing the index data assembled in the message queue to obtain an index data group corresponding to the current service resource;
and the calculating submodule is used for calculating the load index of the current service resource according to the index data group.
7. The apparatus of claim 6, wherein the computation submodule comprises:
the storage unit is used for storing the index data group to a preset position;
and the timing calculation unit is used for regularly reading the index data group stored in the preset position according to preset starting time and calculating the load index of the current service resource.
8. The apparatus of claim 5, wherein the determining module comprises:
a sub-item comparison sub-module, configured to respectively determine whether a numerical value of each sub-item in the load index is greater than or equal to a numerical value of a corresponding reference item in the preset threshold, where each sub-item in the load index includes a CPU occupancy rate and a network packet loss rate;
and the result judgment submodule is used for judging that the load index is greater than or equal to the preset threshold value if the numerical value of any sub-item in the load index is greater than or equal to the numerical value of the corresponding reference item in the preset threshold value.
9. An electronic device, comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other via the communication bus;
the memory is used for storing a computer program;
the processor, when executing the program stored in the memory, is adapted to perform the method steps of any of claims 1-4.
CN201711131802.6A 2017-11-15 2017-11-15 Global flow scheduling method and device and electronic equipment Active CN107872402B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711131802.6A CN107872402B (en) 2017-11-15 2017-11-15 Global flow scheduling method and device and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711131802.6A CN107872402B (en) 2017-11-15 2017-11-15 Global flow scheduling method and device and electronic equipment

Publications (2)

Publication Number Publication Date
CN107872402A CN107872402A (en) 2018-04-03
CN107872402B true CN107872402B (en) 2021-04-09

Family

ID=61754077

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711131802.6A Active CN107872402B (en) 2017-11-15 2017-11-15 Global flow scheduling method and device and electronic equipment

Country Status (1)

Country Link
CN (1) CN107872402B (en)

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110971916B (en) * 2018-09-28 2022-02-08 武汉斗鱼网络科技有限公司 Live broadcast fluency monitoring method and system
CN111124657B (en) * 2018-10-31 2024-03-08 北京金山云网络技术有限公司 Resource management method, device, electronic equipment and storage medium
CN111338917B (en) * 2018-12-19 2023-03-28 贵州白山云科技股份有限公司 Dynamic control method and device for determining server service capability
CN111367651B (en) * 2018-12-26 2023-04-11 阿里巴巴集团控股有限公司 Service current limiting system, method and device and electronic equipment
CN111385328B (en) * 2018-12-29 2024-04-05 三六零科技集团有限公司 Service request processing method, system and electronic equipment
CN110247979B (en) * 2019-06-21 2021-08-17 北京邮电大学 Scheduling scheme determination method and device and electronic equipment
CN110365545B (en) * 2019-08-09 2022-08-09 北京达佳互联信息技术有限公司 Distribution rate processing method, device, server and storage medium
CN110519365B (en) * 2019-08-26 2022-07-01 网宿科技股份有限公司 Method for changing equipment service and service changing system
CN112261120B (en) * 2020-10-19 2022-02-15 广东电网有限责任公司电力调度控制中心 Cloud-side cooperative task unloading method and device for power distribution internet of things
CN112667398B (en) * 2020-12-28 2023-09-01 北京奇艺世纪科技有限公司 Resource scheduling method and device, electronic equipment and storage medium
CN112866030B (en) * 2021-02-03 2022-08-12 挂号网(杭州)科技有限公司 Flow switching method, device, equipment and storage medium
CN113377866A (en) * 2021-06-10 2021-09-10 全球能源互联网研究院有限公司 Load balancing method and device for virtualized database proxy service
CN113407347B (en) * 2021-06-30 2023-02-24 北京百度网讯科技有限公司 Resource scheduling method, device, equipment and computer storage medium
CN114598705B (en) * 2022-03-07 2023-08-15 北京百度网讯科技有限公司 Message load balancing method, device, equipment and medium

Family Cites Families (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8959173B1 (en) * 2010-09-30 2015-02-17 Emc Corporation Non-disruptive load-balancing of virtual machines between data centers
CN102455942B (en) * 2010-12-02 2013-09-25 中标软件有限公司 Method and system for dynamic migration of WAN virtual machines
CN102546700B (en) * 2010-12-23 2015-07-01 中国移动通信集团公司 Resource scheduling and resource migration methods and equipment
US20130124916A1 (en) * 2011-11-16 2013-05-16 Microsoft Corporation Layout of mirrored databases across different servers for failover
EP2713270A4 (en) * 2011-12-29 2014-10-22 Huawei Tech Co Ltd Resource scheduling method and device
CN102866915B (en) * 2012-08-21 2015-08-26 华为技术有限公司 Virtual cluster integration method, device and system of virtual cluster
CN104113574B (en) * 2013-04-19 2017-04-12 中国科学院计算技术研究所 Safe transfer method and system of wide area network trusted virtual machine
CN103605578B (en) * 2013-12-09 2017-03-08 武汉理工大学 Load equilibration scheduling method based on virtual machine (vm) migration
CN103997526B (en) * 2014-05-21 2018-05-22 中国科学院计算技术研究所 A kind of expansible SiteServer LBS and method
CN104503826B (en) * 2015-01-04 2018-06-26 中国联合网络通信集团有限公司 The virtual machine mapping method and device of a kind of cloud computation data center
US9699244B2 (en) * 2015-11-11 2017-07-04 Weka.IO Ltd. Load balanced network file accesses
US10205677B2 (en) * 2015-11-24 2019-02-12 Cisco Technology, Inc. Cloud resource placement optimization and migration execution in federated clouds
US10432709B2 (en) * 2016-03-28 2019-10-01 Industrial Technology Research Institute Load balancing method, load balancing system, load balancing device and topology reduction method
CN107291752A (en) * 2016-04-01 2017-10-24 中国电信股份有限公司 Data Migration control method and system based on service-aware
CN107315637B (en) * 2016-04-26 2020-07-31 南京中兴新软件有限责任公司 Load balancing method and device of signal processing module
CN106970831B (en) * 2017-05-15 2019-06-11 金航数码科技有限责任公司 A kind of the resources of virtual machine dynamic scheduling system and method for facing cloud platform
CN107205030B (en) * 2017-05-31 2020-06-12 成都博视美达文化传播有限公司 Server resource scheduling method and system

Also Published As

Publication number Publication date
CN107872402A (en) 2018-04-03

Similar Documents

Publication Publication Date Title
CN107872402B (en) Global flow scheduling method and device and electronic equipment
CN110209492B (en) Data processing method and device
CN112256495A (en) Data transmission method and device, computer equipment and storage medium
CN108881512B (en) CTDB virtual IP balance distribution method, device, equipment and medium
CN111176803B (en) Service processing method, device, server and storage medium
CN111966289B (en) Partition optimization method and system based on Kafka cluster
CN109800204B (en) Data distribution method and related product
Nahir et al. Replication-based load balancing
CN107317764B (en) Traffic load balancing method, system, device and computer readable storage medium
US20160344582A1 (en) Call home cluster
CN113656168A (en) Method, system, medium and equipment for automatic disaster recovery and scheduling of traffic
CN112261133A (en) CDN node control method, device, server and storage medium
CN113596176A (en) Self-selection method and device of Internet of things center node, Internet of things equipment and system
CN112416594A (en) Micro-service distribution method, electronic equipment and computer storage medium
CN111212087A (en) Method, device, equipment and storage medium for determining login server
CN111385359A (en) Load processing method and device of object gateway
CN107426012B (en) Fault recovery method and device based on super-fusion architecture
CN108347465B (en) Method and device for selecting network data center
CN110808967B (en) Detection method for challenging black hole attack and related device
CN113254245A (en) Fault detection method and system for storage cluster
JP6063882B2 (en) Virtual machine placement system and method
CN113992378B (en) Security monitoring method and device, electronic equipment and storage medium
CN111092959B (en) Request processing method, system and related device for servers in cluster
CN110401708B (en) Session processing system and method based on server load state
CN112910988A (en) Resource acquisition method and resource scheduling device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant