CN116996442A - Traffic scheduling method, traffic scheduling device, electronic equipment and computer readable storage medium - Google Patents

Traffic scheduling method, traffic scheduling device, electronic equipment and computer readable storage medium Download PDF

Info

Publication number
CN116996442A
CN116996442A CN202310864933.4A CN202310864933A CN116996442A CN 116996442 A CN116996442 A CN 116996442A CN 202310864933 A CN202310864933 A CN 202310864933A CN 116996442 A CN116996442 A CN 116996442A
Authority
CN
China
Prior art keywords
access point
scheduled
bandwidth
scheduling
traffic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310864933.4A
Other languages
Chinese (zh)
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 Baidu Netcom Science and Technology Co Ltd
Original Assignee
Beijing Baidu Netcom 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 Baidu Netcom Science and Technology Co Ltd filed Critical Beijing Baidu Netcom Science and Technology Co Ltd
Priority to CN202310864933.4A priority Critical patent/CN116996442A/en
Publication of CN116996442A publication Critical patent/CN116996442A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L61/00—Network arrangements, protocols or services for addressing or naming
    • H04L61/45—Network directories; Name-to-address mapping
    • H04L61/4505—Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols
    • H04L61/4511—Network directories; Name-to-address mapping using standardised directories; using standardised directory access protocols using domain name system [DNS]

Landscapes

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

Abstract

The disclosure provides a traffic scheduling method, a traffic scheduling device, electronic equipment and a computer readable storage medium, and relates to the technical field of networks, in particular to the technical fields of data transmission, traffic scheduling and the like. The specific implementation scheme is as follows: responding to bandwidth data of an access point to be scheduled exceeding a preset service configuration threshold, and determining a flow scheduling strategy of the access point to be scheduled according to bandwidth data and cost data of a plurality of candidate access points; and scheduling at least part of traffic of the access point to be scheduled to at least one candidate access point in a plurality of candidate access points according to the traffic scheduling policy.

Description

Traffic scheduling method, traffic scheduling device, electronic equipment and computer readable storage medium
Technical Field
The present disclosure relates to the field of network technologies, and in particular, to the technical fields of data transmission, traffic scheduling, and the like. In particular, the disclosure relates to a traffic scheduling method, a traffic scheduling device, an electronic device, and a computer-readable storage medium.
Background
Currently, operators usually count bandwidth sizes at each access point, and calculate bandwidth peaks (e.g., bandwidth 95 peaks) at the end of a month as accounting time as charging points.
The cost of each access point is differentiated due to geographical reasons, etc., so that scheduling traffic to a low cost access point as much as possible results in cost savings.
Disclosure of Invention
The disclosure provides a traffic scheduling method, a traffic scheduling device, electronic equipment and a computer readable storage medium.
According to a first aspect of the present disclosure, there is provided a traffic scheduling method, the method comprising:
responding to bandwidth data of an access point to be scheduled exceeding a preset service configuration threshold, and determining a flow scheduling strategy of the access point to be scheduled according to bandwidth data and cost data of a plurality of candidate access points;
and scheduling at least part of traffic of the access point to be scheduled to at least one candidate access point in a plurality of candidate access points according to the traffic scheduling policy.
According to a second aspect of the present disclosure, there is provided a traffic scheduling apparatus comprising:
the policy generation module is used for determining the flow scheduling policy of the access point to be scheduled according to the bandwidth data and the cost data of a plurality of candidate access points in response to the fact that the bandwidth data of the access point to be scheduled exceeds a preset service configuration threshold;
and the policy execution module is used for scheduling at least part of traffic of the access points to be scheduled to at least one candidate access point in a plurality of candidate access points according to the traffic scheduling policy.
According to a third aspect of the present disclosure, there is provided an electronic device comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the traffic scheduling method.
According to a fourth aspect of the present disclosure, there is provided a non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the above-described traffic scheduling method.
According to a fifth aspect of the present disclosure, there is provided a computer program product comprising a computer program which, when executed by a processor, implements the above-described traffic scheduling method.
It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the disclosure, nor is it intended to be used to limit the scope of the disclosure. Other features of the present disclosure will become apparent from the following specification.
Drawings
The drawings are for a better understanding of the present solution and are not to be construed as limiting the present disclosure. Wherein:
Fig. 1 is a flow chart of a flow scheduling method according to an embodiment of the present disclosure;
FIG. 2 is a flow chart illustrating partial steps of another flow scheduling method provided by an embodiment of the present disclosure;
FIG. 3 is a flow chart illustrating partial steps of another flow scheduling method provided by an embodiment of the present disclosure;
FIG. 4 is a flow chart illustrating partial steps of another flow scheduling method provided by an embodiment of the present disclosure;
FIG. 5 is a flow chart illustrating partial steps of another flow scheduling method provided by an embodiment of the present disclosure;
FIG. 6 is a schematic diagram of one particular embodiment of another flow scheduling method provided by embodiments of the present disclosure;
fig. 7 is a graph of a real-time 95 peak change of an access point to be scheduled before and after performing a traffic scheduling policy in one specific implementation of another traffic scheduling method provided by an embodiment of the present disclosure;
fig. 8 is a schematic structural diagram of a flow scheduling device according to an embodiment of the present disclosure;
fig. 9 is a block diagram of an electronic device for implementing a traffic scheduling method of an embodiment of the present disclosure.
Detailed Description
Exemplary embodiments of the present disclosure are described below in conjunction with the accompanying drawings, which include various details of the embodiments of the present disclosure to facilitate understanding, and should be considered as merely exemplary. Accordingly, one of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In some related art, scheduling of traffic from one access point to another access point may be accomplished manually, taking into account bandwidth, cost, etc. of the various access points. The scheduling mode is reliable and has high freedom, but reduces the bandwidth cost and simultaneously brings labor cost.
The embodiment of the disclosure provides a flow scheduling method and device, electronic equipment and a computer readable storage medium, which aim to solve at least one of the technical problems in the prior art.
The traffic scheduling method provided by the embodiments of the present disclosure may be performed by an electronic device such as a terminal device or a server, where the terminal device may be a vehicle-mounted device, a user device (UserEquipment, UE), a mobile device, a user terminal, a cellular phone, a cordless phone, a Personal digital assistant (Personal DigitalAssistant, PDA), a handheld device, a computing device, a vehicle-mounted device, a wearable device, or the like, and the method may be implemented by a processor invoking computer readable program instructions stored in a memory. Alternatively, the method may be performed by a server.
Fig. 1 shows a flow chart of a flow scheduling method provided by an embodiment of the present disclosure. As shown in fig. 1, the traffic scheduling method provided by the embodiment of the present disclosure may include step S110 and step S120.
In step S110, in response to the bandwidth data of the access point to be scheduled exceeding a preset service configuration threshold, determining a traffic scheduling policy of the access point to be scheduled according to the bandwidth data and the cost data of the plurality of candidate access points;
in step S120, at least a portion of traffic of the access point to be scheduled is scheduled to at least one candidate access point of the plurality of candidate access points according to the traffic scheduling policy.
For example, the access point to be scheduled may be an access point providing network service for a company, the candidate access point may also be an access point providing network service for a company, the access point to be scheduled and the candidate access point may provide network service for the same company, that is, a server in the company may complete a service by connecting the access point to be scheduled or the candidate access point.
In some possible implementations, before step S110, bandwidth data of the access point to be scheduled may also be obtained through statistics of bandwidths of the nodes to be scheduled.
In some possible implementations, in step S110, the service configuration threshold may be a preset bandwidth data value, which may be obtained according to a budget corresponding to the access point to be scheduled, where the bandwidth data of the access point to be scheduled exceeds the service configuration threshold, which indicates that the network cost of the access point to be scheduled may exceed the budget corresponding to the access point to be scheduled, so that it is necessary to schedule the traffic of the access point to be scheduled, and schedule the traffic of the access point to be scheduled to other access points, so as to reduce the continuous increase of the network cost of the access point to be scheduled.
In some possible implementations, the bandwidth data of the candidate access points may also be obtained by statistics of the bandwidths of the candidate access points; the cost data for the candidate access point may include operator charging criteria for the candidate access point, which may be related to the network operator used by the candidate access point and the area in which the candidate access point is located.
In some possible implementations, determining the traffic scheduling policy of the access point to be scheduled may be to sort the bandwidth data and the cost data of the plurality of candidate access points according to the bandwidth data and the cost data of the plurality of candidate access points, and determining at least one scheduling access point from the plurality of candidate access points according to the sorting result.
The traffic scheduling policy may be to schedule all or part of the traffic accessing the access point to be scheduled to the scheduling access point.
In some possible implementations, the traffic scheduling policy may include a bandwidth value that the scheduled traffic needs to meet.
In some possible implementations, in step S120, the traffic that needs to be scheduled to the scheduling access point may be determined by the traffic bandwidth occupied by the plurality of traffic accessing the access point to be scheduled and the bandwidth value that needs to be satisfied by the scheduled traffic included in the traffic scheduling policy.
In some possible implementations, the traffic of the access point to be scheduled may be scheduled to the scheduling access point by modifying DNS (domain name system).
By scheduling the service of the access point to be scheduled to the scheduling access point, the number of the services accessing the access point to be scheduled is reduced, the traffic of the access point to be scheduled is also reduced, and the bandwidth of the access point to be scheduled is further reduced.
In some possible implementations, the network cost of the access point to be scheduled is calculated by collecting bandwidth values of the access point to be scheduled once every predetermined time, sorting (e.g., sorting from small to large) the bandwidth values collected during a settlement time (e.g., one month), and calculating the bandwidth value located at a specific position in the sorting result (e.g., the bandwidth value located at 95% of the sorting result) as the charging point.
Thus, reducing the bandwidth of the access point to be scheduled may reduce the network cost of the access point to be scheduled.
In the traffic scheduling method provided by the embodiment of the present disclosure, when bandwidth data of an access point to be scheduled exceeds a preset service configuration threshold, traffic of the access point to be scheduled is scheduled to a candidate access point, and when automatic traffic scheduling is implemented, traffic of the access point to be scheduled is reduced; by reducing the flow of the access point to be scheduled, the instantaneous bandwidth of the access point to be scheduled can be reduced, and the network cost of the access point to be scheduled is further reduced, so that the network cost of the access point to be scheduled is prevented from exceeding the budget.
The flow scheduling method provided by the embodiment of the present disclosure is specifically described below.
As described above, bandwidth data of an access point to be scheduled can be obtained through statistics of bandwidths of nodes to be scheduled.
Fig. 2 is a schematic flow chart of obtaining bandwidth data of an access point to be scheduled through statistics of bandwidths of nodes to be scheduled in a specific implementation, and as shown in fig. 2, obtaining bandwidth data of an access point to be scheduled through statistics of bandwidths of nodes to be scheduled may include step S210 and step S220.
In step S210, bandwidth values of access points to be scheduled are collected at intervals of a predetermined time;
in step S220, the bandwidth values collected in the preset time period are ranked, and the bandwidth value with the ranking position satisfying the preset condition in the ranking result is obtained as the current charging point.
In some possible implementations, in step S210, the collection interval may be consistent with the network cost every predetermined time, such as 5 minutes.
In some possible implementations, the collected bandwidth value of the access point to be scheduled may be obtained by collecting service bandwidths occupied by each of a plurality of services accessing the access point to be scheduled; namely, the bandwidth value of the access point to be scheduled can be obtained by adding the service bandwidths occupied by each service accessed to the access point to be scheduled.
In some possible implementations, in step S220, the predetermined period of time may be a period of time between a start time point of the settlement time at which the current time point is located and the current time point.
In some possible implementations, the bandwidth value of the access point to be scheduled, which is collected in the predetermined period of time, may be used as bandwidth data of the access point to be scheduled.
In some possible implementations, the obtaining, as the current charging point, the bandwidth value of the ordering location satisfying the preset condition in the ordering result may be consistent with a calculation rule of the charging point of the network cost, for example, may be that all bandwidth values collected in a preset time period are ordered from small to large, and the bandwidth value of the ordering result located at a specific location (for example, the bandwidth value located at 95% of the location of the ordering result) is taken as the current charging point.
In some possible implementations, determining whether bandwidth data of the access point to be scheduled exceeds a preset service configuration threshold may be determining whether a bandwidth value corresponding to the current charging point exceeds the preset service configuration threshold.
In some possible implementations, the bandwidth data of the candidate access points may also be obtained by statistics of bandwidths of the candidate access points in a similar manner, that is, bandwidth values of the candidate access points are collected at intervals of a predetermined time, and the bandwidth values collected during the predetermined time period are taken as the bandwidth data of the candidate access points.
In some possible implementation manners, statistics and acquisition of bandwidth data of the access points to be scheduled and the candidate access points can be achieved through a server, namely, traffic conditions of all the access points are counted through the server in real time, the bandwidth data of the access points to be scheduled and the candidate access points are acquired, and the bandwidth data of the access points to be scheduled and the candidate access points are summarized and reported to the platform at regular time.
As described above, the bandwidth data and the cost data of the plurality of candidate access points are ranked, and at least one scheduling access point is determined from the plurality of candidate access points according to the ranking result. The traffic scheduling policy may be to schedule all or part of the traffic accessing the access point to be scheduled to the scheduling access point.
In some possible implementations, candidate access points may be screened according to bandwidth data of the candidate access points, and an access point to which a part of traffic of the access point to be scheduled is scheduled may be determined from a screening result according to cost data.
Fig. 3 is a schematic flow chart of a specific implementation of an access point to which partial traffic of an access point to be scheduled is determined from a screening result according to cost data, where the specific implementation is shown in fig. 3, and may include step S310, step S320, and step S330.
In step S310, determining a bandwidth accessible point of the plurality of candidate access points according to the bandwidth data of the plurality of candidate access points;
in step S320, the bandwidth accessible points are ordered according to the cost data of the bandwidth accessible points, and the scheduling access points are determined from the bandwidth accessible points according to the ordering result;
in step S330, it is determined that the traffic scheduling policy is to schedule at least a portion of traffic of the access point to be scheduled to the scheduling access point.
In some possible implementations, in step S310, the bandwidth-accessible point may be a candidate access point whose bandwidth data does not exceed the traffic budget threshold corresponding to the access point.
The service budget threshold corresponding to the access point may be a preset bandwidth data value, which may be obtained according to the budget corresponding to the candidate access point, where the bandwidth data of the candidate access point exceeds the service budget threshold, which indicates that if the service is added to the candidate access point, the network cost of the candidate access point may exceed the budget corresponding to the candidate access point; the bandwidth data of the candidate access point does not exceed the traffic budget threshold, which means that if the candidate access point increases traffic, the network cost of the candidate access point may not exceed the budget corresponding to the candidate access point. Therefore, the service of the access point to be scheduled can be scheduled to the candidate access point of which the bandwidth data does not exceed the service budget threshold corresponding to the access point.
In some possible implementations, the number of bandwidth-accessible points may be multiple.
In some possible implementations, in step S320, the ordering of the bandwidth-accessible points according to the cost data of the bandwidth-accessible points may be ordering the bandwidth-accessible points in order of decreasing cost data.
Determining a scheduling access point from among the bandwidth accessible points according to the ordering result may be determining one or more bandwidth accessible points with the smallest cost data as the scheduling access point.
The bandwidth data are screened, and the cost data are used for sorting, so that the network cost of the dispatching access points can be reduced as much as possible on the basis that the network cost of the dispatching access points does not exceed the budget of the dispatching access points after the traffic medium of the access points to be dispatched is accessed, and the maximum cost reduction is realized.
In some possible implementations, in step S330, the traffic scheduling policy may include a bandwidth value that the scheduled traffic needs to satisfy.
In some possible implementations, the bandwidth value that the scheduled traffic needs to meet may be determined according to the bandwidth data of the access point to be scheduled and the traffic configuration threshold.
In some specific implementations, the bandwidth value that the scheduled traffic needs to meet may be determined according to the difference between the bandwidth value corresponding to the current charging point (the method for obtaining the current charging point of the access point to be scheduled is described above) and the service configuration threshold.
The current charging point is obtained by sorting all bandwidth values collected in a preset time period from small to large, and the bandwidth value in a specific position (such as the bandwidth value in 95% of the position of the sorting result) in the sorting result is taken as the current charging point, which is consistent with the method for calculating the network cost of the access point to be scheduled, so that the bandwidth value corresponding to the current charging point can represent the estimated network cost of the access point to be scheduled.
The bandwidth value which needs to be met by the scheduled flow is determined according to the difference value of the bandwidth value corresponding to the current charging point and the service configuration threshold, so that the bandwidth value corresponding to the current computing point obtained after the flow scheduling is ensured to be smaller than the service configuration threshold, namely the estimated network cost of the access point to be scheduled is ensured to be smaller than the service configuration threshold, and the service configuration threshold is determined according to the budget of the access point to be scheduled, and therefore the estimated network cost of the access point to be scheduled is ensured to be smaller than the budget of the access point to be scheduled.
In some possible implementations, the traffic scheduling policy may be determined by a traffic bandwidth occupied by a plurality of traffic accessing the access point to be scheduled and a bandwidth value that the scheduled traffic included in the traffic scheduling policy needs to satisfy.
Fig. 4 shows a flow diagram of a specific implementation of determining a traffic scheduling policy by a traffic bandwidth occupied by a plurality of traffic accessing an access point to be scheduled and a bandwidth value that needs to be satisfied by a scheduled traffic included in the traffic scheduling policy, and may include step S410 and step S420 as shown in fig. 4.
In step S410, determining a high bandwidth service from the plurality of services of the access point to be scheduled according to the service bandwidths occupied by the plurality of services of the access point to be scheduled;
in step S420, it is determined that the traffic scheduling policy is to schedule traffic corresponding to the high bandwidth traffic of the access point to be scheduled to the scheduling access point.
In some possible implementations, in step S410, the service bandwidths occupied by the multiple services of the access point to be scheduled are ordered in order from large to small, and one or more services are selected from the multiple services of the access point to be scheduled in order of ordering, where the sum of the service bandwidths of the one or more services is equal to or greater than the difference value between the bandwidth value corresponding to the current charging point and the service configuration threshold, and the one or more services are determined to be high bandwidth services.
In some possible implementations, in step S420, in the case that the number of high bandwidth services is plural and the number of scheduling access points is plural, determining the traffic scheduling policy to schedule the traffic corresponding to the high bandwidth service of the access point to be scheduled to the scheduling access point may be to schedule the corresponding service bandwidth to the scheduling access point with lower cost than the higher cost service under the condition that the network cost of the scheduling access point does not exceed its budget after the service is scheduled to the scheduling access point, thereby further reducing the sum of the network costs of all access points and reducing the network cost.
In some possible implementations, candidate access points may be ordered according to cost data and bandwidth data to determine scheduling access points.
Fig. 5 shows a flow diagram of one specific implementation of ranking candidate access points according to cost data and bandwidth data, and determining a scheduling access point, as shown in fig. 4, may include step S510 and step S520.
In step S510, the plurality of candidate access points are ranked according to the bandwidth data and the cost data of the plurality of candidate access points, and the scheduling access point is determined from the candidate access points according to the ranking result;
in step S520, it is determined that the traffic scheduling policy is to schedule at least a portion of traffic of the access point to be scheduled to the scheduling access point.
In some possible implementations, in step S510, ranking the plurality of candidate access points according to the bandwidth data and the cost data of the plurality of candidate access points may be ranking the plurality of candidate access points from small to large according to the bandwidth data, and obtaining a first ranking of each candidate access point; sorting the plurality of candidate access points from small to large according to the cost data, and obtaining a second ranking of each candidate access point; a ranking of each candidate access point in the ranking result is determined based on the first ranking and the second ranking of each candidate access point.
Determining the scheduling access point from the candidate access points according to the ranking results may be determining one or more candidate access points with the top ranking in the ranking results as scheduling access points.
In some possible implementations, in step S520, determining the traffic scheduling policy to schedule at least a portion of the traffic of the access point to be scheduled to the scheduling access point may be as described above for step S330.
The sequencing result of sequencing the plurality of candidate access points according to the bandwidth data and the cost data is the sequencing result obtained on the basis of integrating the bandwidth data and the cost data, so that the scheduling access points are the candidate access points, the bandwidth data is very small, the cost data is relatively low, namely, the service of the node to be scheduled is scheduled to the scheduling access points, the bandwidth data of the scheduling access points has a very high probability and does not exceed the corresponding service budget threshold value, and the sum of network cost of all the access points can be reduced due to relatively low cost data of the scheduling access points, so that the network cost is reduced.
As described above, traffic of an access point to be scheduled can be scheduled to a scheduling access point by modifying DNS.
In some possible implementations, at least a portion of traffic (specifically, traffic corresponding to high bandwidth traffic) of the access point to be scheduled may be modified by modifying DNS according to a traffic scheduling policy, so as to schedule traffic of the modified DNS and IP to at least one candidate access point (i.e., the scheduling access point) of the plurality of candidate access points.
The DNS and IP are modified without affecting other attributes of the traffic, so that the traffic corresponding to the high-bandwidth service of the access point to be scheduled can be rapidly and safely scheduled to the scheduling access point, and the bandwidth of the access point to be scheduled is reduced.
The flow scheduling method provided by the embodiment of the disclosure is specifically described in the following by using a specific embodiment.
Fig. 6 is a schematic diagram of a specific embodiment of a traffic scheduling method according to an embodiment of the present disclosure. As shown in fig. 6, the data acquisition module of the platform receives and stores bandwidth data reported by each access point (such as access point a, access point B and access point C in fig. 6), calculates a real-time 95 peak value of each access point according to the stored data while receiving the reported bandwidth, determines an access point to be scheduled according to the real-time 95 peak value of each access point and the size relation of the service configuration threshold value of each access point, determines a scheduling access point according to bandwidth data and cost data of other access points, generates a traffic scheduling policy for scheduling traffic of the access point to be scheduled to the access point, wherein the real-time 95 peak value does not exceed the corresponding service configuration threshold value and is low in cost, and completes executing the traffic scheduling policy by modifying DNS.
Fig. 7 shows a graph of a real-time 95 peak change of an access point to be scheduled before and after executing a traffic scheduling policy, where the horizontal axis of the coordinate axis is time and the vertical axis is a real-time 95 peak, as shown in fig. 7, at a certain moment, the real-time 95 peak of the access point to be scheduled exceeds a service configuration threshold (i.e., a dashed line in fig. 7), and after scheduling, the traffic of the access point to be scheduled is scheduled by using the traffic scheduling policy provided by the embodiment of the present disclosure, and after scheduling, the real-time 95 peak of the access point to be scheduled does not exceed the service configuration threshold, that is, the network cost of the access point to be scheduled does not exceed a budget after scheduling, thereby realizing control of the network cost of the access point to be scheduled.
Based on the same principle as the method shown in fig. 1, fig. 8 shows a schematic structural diagram of a flow scheduling device provided by an embodiment of the present disclosure, and as shown in fig. 8, the flow scheduling device 80 may include:
the policy generation module 810 is configured to determine a traffic scheduling policy of the access point to be scheduled according to bandwidth data and cost data of a plurality of candidate access points in response to the bandwidth data of the access point to be scheduled exceeding a preset service configuration threshold;
The policy execution module 820 is configured to schedule at least a portion of traffic of the access point to be scheduled to at least one candidate access point of the plurality of candidate access points according to a traffic scheduling policy.
In the traffic scheduling device provided by the embodiment of the present disclosure, when bandwidth data of an access point to be scheduled exceeds a preset service configuration threshold, traffic of the access point to be scheduled is scheduled to a candidate access point, and the traffic of the access point to be scheduled is reduced while automatic traffic scheduling is implemented; by reducing the flow of the access point to be scheduled, the instantaneous bandwidth of the access point to be scheduled can be reduced, and the network cost of the access point to be scheduled is further reduced, so that the network cost of the access point to be scheduled is prevented from exceeding the budget.
In some possible implementations, the policy generation module 810 includes: a screening unit, configured to determine bandwidth accessible points in the plurality of candidate access points according to bandwidth data of the plurality of candidate access points; the bandwidth data of the bandwidth accessible point does not exceed the service budget threshold corresponding to the bandwidth accessible point; the ordering unit is used for ordering the bandwidth accessible points according to the cost data of the bandwidth accessible points, and determining the scheduling access points from the bandwidth accessible points according to the ordering result; and the generating unit is used for determining the traffic scheduling strategy to schedule at least part of traffic of the access point to be scheduled to the scheduling access point.
In some possible implementations, the policy generation module 810 includes: the ordering unit is used for ordering the plurality of candidate access points according to the bandwidth data and the cost data of the plurality of candidate access points, and determining a scheduling access point from the candidate access points according to the ordering result; and the generating unit is used for determining the traffic scheduling strategy to schedule at least part of traffic of the access point to be scheduled to the scheduling access point.
In some possible implementations, the bandwidth data of the access point to be scheduled includes service bandwidths occupied by a plurality of services of the access point to be scheduled; the policy generation module 810 includes: an access point screening unit, configured to determine at least one scheduling access point from the plurality of candidate access points according to bandwidth data and cost data of the plurality of candidate access points; a service screening unit, configured to determine a high bandwidth service from multiple services of an access point to be scheduled according to service bandwidths occupied by multiple services of the access point to be scheduled; and the generating unit is used for determining a traffic scheduling policy to schedule traffic corresponding to the high-bandwidth service of the access point to be scheduled to the scheduling access point.
In some possible implementations, the policy enforcement module 820 is configured to: and according to the traffic scheduling strategy, at least part of traffic of the access points to be scheduled is subjected to domain name and internet protocol modification in a domain name system modification mode, so that traffic of the domain name and internet protocol modification is scheduled to at least one candidate access point in the plurality of candidate access points.
In some possible implementations, the traffic scheduling device further includes: the acquisition module is used for acquiring the bandwidth value of the access point to be scheduled at intervals of preset time; the charging module is used for sequencing the bandwidth values acquired in a preset time period, and acquiring the bandwidth values of which the sequencing positions meet preset conditions in the sequencing result as current charging points; the strategy generation module is used for: and determining a flow scheduling strategy of the access point to be scheduled according to the bandwidth data and the cost data of the plurality of candidate access points in response to the fact that the current charging point exceeds a preset service configuration threshold.
It will be appreciated that the above modules of the traffic scheduling apparatus in the embodiments of the present disclosure have functions of implementing the corresponding steps of the traffic scheduling method in the embodiment shown in fig. 1. The functions can be realized by hardware, and can also be realized by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the functions described above. The modules may be software and/or hardware, and each module may be implemented separately or may be implemented by integrating multiple modules. For the functional description of each module of the above flow scheduling device, reference may be specifically made to the corresponding description of the flow scheduling method in the embodiment shown in fig. 1, which is not repeated herein.
In the technical scheme of the disclosure, the acquisition, storage, application and the like of the related user personal information all conform to the regulations of related laws and regulations, and the public sequence is not violated.
According to embodiments of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.
The electronic device includes: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform a traffic scheduling method as provided by embodiments of the present disclosure.
Compared with the prior art, the electronic equipment schedules the traffic of the access point to be scheduled to the candidate access point under the condition that the bandwidth data of the access point to be scheduled exceeds the preset service configuration threshold, and reduces the traffic of the access point to be scheduled while realizing automatic scheduling of the traffic; by reducing the flow of the access point to be scheduled, the instantaneous bandwidth of the access point to be scheduled can be reduced, and the network cost of the access point to be scheduled is further reduced, so that the network cost of the access point to be scheduled is prevented from exceeding the budget.
The readable storage medium is a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform a traffic scheduling method as provided by embodiments of the present disclosure.
Compared with the prior art, the readable storage medium schedules the traffic of the access point to be scheduled to the candidate access point under the condition that the bandwidth data of the access point to be scheduled exceeds the preset service configuration threshold, and reduces the traffic of the access point to be scheduled while realizing automatic scheduling of the traffic; by reducing the flow of the access point to be scheduled, the instantaneous bandwidth of the access point to be scheduled can be reduced, and the network cost of the access point to be scheduled is further reduced, so that the network cost of the access point to be scheduled is prevented from exceeding the budget.
The computer program product comprises a computer program which, when executed by a processor, implements a traffic scheduling method as provided by embodiments of the present disclosure.
Compared with the prior art, the method has the advantages that under the condition that the bandwidth data of the access point to be scheduled exceeds the preset service configuration threshold, the traffic of the access point to be scheduled is scheduled to the candidate access point, and the traffic of the access point to be scheduled is reduced while the automatic scheduling of the traffic is realized; by reducing the flow of the access point to be scheduled, the instantaneous bandwidth of the access point to be scheduled can be reduced, and the network cost of the access point to be scheduled is further reduced, so that the network cost of the access point to be scheduled is prevented from exceeding the budget.
Fig. 9 shows a schematic block diagram of an example electronic device 900 that may be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein.
As shown in fig. 9, the apparatus 900 includes a computing unit 901 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 902 or a computer program loaded from a storage unit 908 into a Random Access Memory (RAM) 903. In the RAM903, various programs and data required for the operation of the device 900 can also be stored. The computing unit 901, the ROM902, and the RAM903 are connected to each other by a bus 904. An input/output (I/O) interface 905 is also connected to the bus 904.
Various components in device 900 are connected to I/O interface 905, including: an input unit 906 such as a keyboard, a mouse, or the like; an output unit 907 such as various types of displays, speakers, and the like; a storage unit 908 such as a magnetic disk, an optical disk, or the like; and a communication unit 909 such as a network card, modem, wireless communication transceiver, or the like. The communication unit 909 allows the device 900 to exchange information/data with other devices through a computer network such as the internet and/or various telecommunications networks.
The computing unit 901 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 901 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 901 performs the respective methods and processes described above, such as a traffic scheduling method. For example, in some embodiments, the traffic scheduling method may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as the storage unit 908. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device 900 via the ROM902 and/or the communication unit 909. When the computer program is loaded into RAM903 and executed by the computing unit 901, one or more steps of the traffic scheduling method described above may be performed. Alternatively, in other embodiments, the computing unit 901 may be configured to perform the traffic scheduling method by any other suitable means (e.g. by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server may be a cloud server, a server of a distributed system, or a server incorporating a blockchain.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps recited in the present disclosure may be performed in parallel, sequentially, or in a different order, provided that the desired results of the disclosed aspects are achieved, and are not limited herein.
The above detailed description should not be taken as limiting the scope of the present disclosure. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present disclosure are intended to be included within the scope of the present disclosure.

Claims (15)

1. A traffic scheduling method, comprising:
responding to bandwidth data of an access point to be scheduled exceeding a preset service configuration threshold, and determining a flow scheduling strategy of the access point to be scheduled according to bandwidth data and cost data of a plurality of candidate access points;
and scheduling at least part of traffic of the access point to be scheduled to at least one candidate access point in a plurality of candidate access points according to the traffic scheduling policy.
2. The method of claim 1, wherein the determining the traffic scheduling policy for the access point to be scheduled based on bandwidth data and cost data for a plurality of candidate access points comprises:
determining bandwidth accessible points in the candidate access points according to the bandwidth data of the candidate access points; the bandwidth data of the bandwidth accessible point does not exceed the service budget threshold corresponding to the bandwidth accessible point;
sorting the bandwidth accessible points according to the cost data of the bandwidth accessible points, and determining a scheduling access point from the bandwidth accessible points according to the sorting result;
and determining the flow scheduling strategy to schedule at least part of the flows of the access points to be scheduled to the scheduling access points.
3. The method of claim 1, wherein the determining the traffic scheduling policy for the access point to be scheduled based on bandwidth data and cost data for a plurality of candidate access points comprises:
sorting the candidate access points according to bandwidth data and cost data of the candidate access points, and determining a scheduling access point from the candidate access points according to sorting results;
and determining the flow scheduling strategy to schedule at least part of the flows of the access points to be scheduled to the scheduling access points.
4. The method of claim 1, wherein the bandwidth data of the access point to be scheduled comprises traffic bandwidths occupied by a plurality of traffic of the access point to be scheduled;
the determining the traffic scheduling policy of the access point to be scheduled according to the bandwidth data and the cost data of the plurality of candidate access points comprises:
determining at least one scheduling access point from the plurality of candidate access points according to bandwidth data and cost data of the plurality of candidate access points;
determining high-bandwidth service from the multiple services of the access point to be scheduled according to the service bandwidths occupied by the multiple services of the access point to be scheduled;
and determining the traffic scheduling policy to schedule traffic corresponding to the high-bandwidth service of the access point to be scheduled to the scheduling access point.
5. The method of claim 1, wherein the scheduling at least a portion of traffic of the access point to be scheduled to at least one of the candidate access points in accordance with the traffic scheduling policy comprises:
and according to the traffic scheduling policy, at least part of traffic of the access point to be scheduled is subjected to domain name and internet protocol modification by modifying a domain name system, so that traffic of which the domain name and the internet protocol are modified is scheduled to at least one of a plurality of candidate access points.
6. The method of claim 1, wherein the determining, in response to the bandwidth data of the access point to be scheduled exceeding a preset service configuration threshold, the traffic scheduling policy of the access point to be scheduled further comprises, before determining the bandwidth data and the cost data of the plurality of candidate access points:
acquiring the bandwidth value of the access point to be scheduled at intervals of preset time;
sequencing bandwidth values acquired in a preset time period, and acquiring bandwidth values with sequencing positions meeting preset conditions in sequencing results as current charging points;
the responding to the bandwidth data of the access point to be scheduled exceeding the preset service configuration threshold value, and determining the flow scheduling strategy of the access point to be scheduled according to the bandwidth data and the cost data of a plurality of candidate access points comprises the following steps:
and determining the flow scheduling strategy of the access point to be scheduled according to the bandwidth data and the cost data of a plurality of candidate access points in response to the fact that the current charging point exceeds a preset service configuration threshold.
7. A traffic scheduling device, comprising:
the policy generation module is used for determining the flow scheduling policy of the access point to be scheduled according to the bandwidth data and the cost data of a plurality of candidate access points in response to the fact that the bandwidth data of the access point to be scheduled exceeds a preset service configuration threshold;
And the policy execution module is used for scheduling at least part of traffic of the access points to be scheduled to at least one candidate access point in a plurality of candidate access points according to the traffic scheduling policy.
8. The apparatus of claim 7, wherein the policy generation module comprises:
a screening unit, configured to determine bandwidth accessible points in the plurality of candidate access points according to bandwidth data of the plurality of candidate access points; the bandwidth data of the bandwidth accessible point does not exceed the service budget threshold corresponding to the bandwidth accessible point;
the ordering unit is used for ordering the bandwidth accessible points according to the cost data of the bandwidth accessible points, and determining a scheduling access point from the bandwidth accessible points according to an ordering result;
and the generating unit is used for determining that the flow scheduling strategy is to schedule at least part of the flows of the access points to be scheduled to the scheduling access points.
9. The apparatus of claim 7, wherein the policy generation module comprises:
the ordering unit is used for ordering the plurality of candidate access points according to the bandwidth data and the cost data of the plurality of candidate access points, and determining a scheduling access point from the candidate access points according to the ordering result;
And the generating unit is used for determining that the flow scheduling strategy is to schedule at least part of the flows of the access points to be scheduled to the scheduling access points.
10. The apparatus of claim 7, wherein the bandwidth data of the access point to be scheduled comprises traffic bandwidths occupied by a plurality of traffic of the access point to be scheduled;
the policy generation module comprises:
an access point screening unit, configured to determine at least one scheduling access point from a plurality of candidate access points according to bandwidth data and cost data of the plurality of candidate access points;
a service screening unit, configured to determine a high bandwidth service from a plurality of services of the access point to be scheduled according to service bandwidths occupied by the plurality of services of the access point to be scheduled;
and the generating unit is used for determining the flow scheduling policy to schedule the flow corresponding to the high-bandwidth service of the access point to be scheduled to the scheduling access point.
11. The apparatus of claim 7, wherein the policy enforcement module is to: and according to the traffic scheduling policy, at least part of traffic of the access point to be scheduled is subjected to domain name and internet protocol modification by modifying a domain name system, so that traffic of which the domain name and the internet protocol are modified is scheduled to at least one of a plurality of candidate access points.
12. The apparatus of claim 7, wherein the traffic scheduling apparatus further comprises:
the acquisition module is used for acquiring the bandwidth value of the access point to be scheduled at intervals of preset time;
the charging module is used for sequencing the bandwidth values acquired in a preset time period, and acquiring the bandwidth values of which the sequencing positions meet preset conditions in the sequencing result as current charging points;
the strategy generation module is used for: and determining the flow scheduling strategy of the access point to be scheduled according to the bandwidth data and the cost data of a plurality of candidate access points in response to the fact that the current charging point exceeds a preset service configuration threshold.
13. An electronic device, comprising:
at least one processor; and
a memory communicatively coupled to the at least one processor; wherein,,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-6.
14. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 1-6.
15. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any of claims 1-6.
CN202310864933.4A 2023-07-13 2023-07-13 Traffic scheduling method, traffic scheduling device, electronic equipment and computer readable storage medium Pending CN116996442A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310864933.4A CN116996442A (en) 2023-07-13 2023-07-13 Traffic scheduling method, traffic scheduling device, electronic equipment and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310864933.4A CN116996442A (en) 2023-07-13 2023-07-13 Traffic scheduling method, traffic scheduling device, electronic equipment and computer readable storage medium

Publications (1)

Publication Number Publication Date
CN116996442A true CN116996442A (en) 2023-11-03

Family

ID=88531243

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310864933.4A Pending CN116996442A (en) 2023-07-13 2023-07-13 Traffic scheduling method, traffic scheduling device, electronic equipment and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN116996442A (en)

Similar Documents

Publication Publication Date Title
CN110611891B (en) Short message sending method and device
CN109981744B (en) Data distribution method and device, storage medium and electronic equipment
CN114298322B (en) Federal learning method and apparatus, system, electronic device, and computer readable medium
CN112965823B (en) Control method and device for call request, electronic equipment and storage medium
CN114500339B (en) Node bandwidth monitoring method and device, electronic equipment and storage medium
CN114911598A (en) Task scheduling method, device, equipment and storage medium
CN116307546A (en) Task intelligent decision system based on robot community
CN113342665B (en) Task allocation method and device, electronic equipment and computer readable medium
CN114253710A (en) Processing method of computing request, intelligent terminal, cloud server, equipment and medium
CN113419865A (en) Cloud resource processing method, related device and computer program product
CN113360266A (en) Task processing method and device
CN111478779B (en) Method and device for determining unlimited set meal and computing equipment
CN109194703B (en) Processing method of communication load between cloud platform hosts, electronic device and medium
CN116996442A (en) Traffic scheduling method, traffic scheduling device, electronic equipment and computer readable storage medium
CN115328612A (en) Resource allocation method, device, equipment and storage medium
CN114051057B (en) Cloud equipment queuing time determination method and device, electronic equipment and medium
CN113434270B (en) Data resource scheduling method and device, electronic equipment and storage medium
CN113900731B (en) Request processing method, device, equipment and storage medium
CN114862223A (en) Robot scheduling method, device, equipment and storage medium
CN109739513B (en) Dynamic scheduling method and device for service requests under multi-edge cloud
CN116614379B (en) Bandwidth adjustment method and device for migration service and related equipment
CN105704773B (en) A kind of method, mobile communication system and mobile terminal switching mobile telecommunication channel
CN115242648B (en) Expansion and contraction capacity discrimination model training method and operator expansion and contraction capacity method
CN115086300B (en) Video file scheduling method and device
CN114006902B (en) Cloud mobile phone restarting method, device, equipment and storage medium

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