CN112202578B - Scheduling method, device and system based on 95 polling and computer equipment - Google Patents
Scheduling method, device and system based on 95 polling and computer equipment Download PDFInfo
- Publication number
- CN112202578B CN112202578B CN202011386105.7A CN202011386105A CN112202578B CN 112202578 B CN112202578 B CN 112202578B CN 202011386105 A CN202011386105 A CN 202011386105A CN 112202578 B CN112202578 B CN 112202578B
- Authority
- CN
- China
- Prior art keywords
- charging group
- time period
- preset time
- charging
- group
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
- H04L12/1432—Metric aspects
- H04L12/1439—Metric aspects time-based
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
- H04L12/1432—Metric aspects
- H04L12/1435—Metric aspects volume-based
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/14—Charging, metering or billing arrangements for data wireline or wireless communications
- H04L12/1485—Tariff-related aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application relates to a scheduling method, a device, a system and computer equipment based on 95 polling, wherein the method comprises the following steps: acquiring current time and a preset time period; judging whether the current time belongs to a preset time period or not; if yes, the switch is controlled to execute a first strategy, the first strategy comprises the total length of messages needing to be transmitted by a first charging group and a second charging group in a preset time period, the second charging group comprises an apportionment charging group and a bottom-guaranteed charging group, the total length of the messages transmitted by the apportionment charging group is equal to the maximum bandwidth occupation value, the total length of the messages transmitted by the bottom-guaranteed charging group is equal to the bottom-guaranteed bandwidth occupation value, the total length of the messages transmitted by the first charging group is the rest messages, the problem of high expense in a 95 charging scene is solved, and under the condition that the current charging rule is met, peak flow is apportioned to avoid the proportion of charging statistics, so that the cost is greatly saved.
Description
Technical Field
The present application relates to the field of internet technologies, and in particular, to a scheduling method, apparatus, system and computer device based on 95 polling.
Background
With the development of society and scientific progress, networks are more and more important for people, but the construction and operation of the networks require a large amount of cost. Therefore, in order to guarantee the network development speed and maintain the stable operation of the network, the operator needs to charge a certain fee to the company or the individual using the network, and pay the fee to the operator as the capital of the operation, that is, the traffic consumption counted by the user according to the charging rule.
Polling is a process by which a base station allocates bandwidth to a terminal, which may be for a single terminal or a group of terminals. The 95 charging rule is one of the charging rules of the operator, that is, peak flow of 5% of time per month may not be calculated, and a large amount of bandwidth resources are required for CDN delivery service, which may cause large flow consumption due to a user request, thereby requiring a high fee to be paid to the operator.
At present, no effective solution is provided for the problem of high expense in a 95 charging scene in the related art.
Disclosure of Invention
The embodiment of the application provides a scheduling method, a device, a system and computer equipment based on 95 polling, so as to at least solve the problem of high expense in a 95 charging scene in the related art.
In a first aspect, an embodiment of the present application provides a scheduling method based on 95 polling, which is applied to a management server, where the management server is in communication connection with an SDN switch, the SDN switch includes a first charging group and a second charging group, and both the first charging group and the second charging group are in communication connection with an operator network; the method comprises the following steps:
acquiring current time and a preset time period;
judging whether the current time belongs to the preset time period or not;
if the current time belongs to the preset time period, controlling the switch to execute a first strategy, wherein the first strategy comprises the total length of the messages which need to be transmitted in the preset time period by the first charging group and the second charging group, the second charging group comprises an apportionment charging group and a bottom-guaranteed charging group, the total length of the messages transmitted by the apportionment charging group is equal to the maximum bandwidth occupation value, the total length of the messages transmitted by the bottom-guaranteed charging group is equal to the bottom-guaranteed bandwidth occupation value, and the total length of the messages transmitted by the first charging group is the remaining length of the messages.
In some of these embodiments, the method further comprises:
and if the current time does not belong to the preset time period, controlling the switch to execute a second strategy, wherein the second strategy comprises messages which need to be transmitted in other time excluding the preset time period by the first charging group and the second charging group, the second charging group comprises the bottom-guaranteed charging group, the total length of the messages transmitted by the bottom-guaranteed charging group is equal to the bandwidth bottom-guaranteed occupied value, and the first charging group transmits the rest of the messages.
In some embodiments, obtaining the preset time period comprises:
acquiring the occurrence time of a flow consumption peak value of a user;
and determining the preset time period according to the occurrence time of the flow consumption peak value.
In some embodiments, before controlling the switch to execute the first policy, the method further comprises:
acquiring a message reported by the SDN switch and a message length corresponding to the message;
and according to the message length, marking the message with the total length equal to the maximum bandwidth occupation value as the apportionment charging group for transmission, marking the message with the total length equal to the bandwidth guaranteed occupation value as the guaranteed charging group for transmission, and marking the rest messages as the first charging group for transmission.
In some embodiments, before the packet with the total length equal to the maximum bandwidth occupation value is marked to be transmitted by the split charging group, the method further includes:
and acquiring the maximum bandwidth occupation value of the apportionment charging group and the guaranteed bandwidth occupation value of the guaranteed charging group in the SDN switch.
In some embodiments, the preset time period is at least one period, and the charging group of the SDN switch is greater than or equal to the number of the preset time period.
In a second aspect, an embodiment of the present application provides a scheduling apparatus based on 95 polling, which is applied to a management server, where the management server is in communication connection with an SDN switch, the SDN switch includes a first charging group and a second charging group, and both the first charging group and the second charging group are in communication connection with an operator network; the device comprises: the device comprises an acquisition module, a judgment module and a control module;
the acquisition module is used for acquiring the current time and a preset time period;
the judging module is used for judging whether the current time belongs to the preset time period or not;
the control module is configured to control the switch to execute a first policy if the current time belongs to the preset time period, where the first policy includes total lengths of messages that need to be transmitted in the preset time period by the first charging group and the second charging group, the second charging group includes an apportionment charging group and a bottom-guaranteed charging group, the total length of the messages transmitted by the apportionment charging group is equal to a maximum bandwidth occupation value, the total length of the messages transmitted by the bottom-guaranteed charging group is equal to a maximum bandwidth occupation value, and the total length of the messages transmitted by the first charging group is a remaining length of the messages.
In a third aspect, an embodiment of the present application provides a scheduling system based on 95 polling, where the system includes an SDN controller, and an SDN switch connected to the SDN controller through an API interface;
the SDN switch is connected between a server cluster of a resource provider and an operator network, and comprises a first charging group and a second charging group, and the first charging group and the second charging group are both in communication connection with the operator network;
the SDN controller is configured to obtain a current time and a preset time period, and determine whether the current time belongs to the preset time period, and if the current time belongs to the preset time period, the SDN controller controls the switch to execute a first policy through the API interface, where the first policy includes a total length of a packet that needs to be transmitted in the preset time period by the first charging group and the second charging group, the second charging group includes an apportionment charging group and a bottom-guaranteeing charging group, the total length of the packet transmitted by the apportionment charging group is equal to a maximum bandwidth occupation value, the total length of the packet transmitted by the bottom-guaranteeing charging group is equal to a maximum bandwidth occupation value, and the total length of the packet transmitted by the first charging group is a remaining packet length.
In a fourth aspect, an embodiment of the present application provides a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the scheduling method based on 95 polling according to the first aspect when executing the computer program.
In a fifth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the scheduling method based on 95 polling according to the first aspect.
Compared with the related art, the scheduling method, device, system and computer equipment based on 95 polling provided by the embodiment of the application are applied to a management server, the management server is in communication connection with an SDN switch, the SDN switch comprises a first charging group and a second charging group, and the first charging group and the second charging group are both in communication connection with an operator network; the method comprises the following steps: acquiring current time and a preset time period; judging whether the current time belongs to the preset time period or not; if the current time belongs to the preset time period, controlling the switch to execute a first strategy, wherein the first strategy comprises the total length of messages which need to be transmitted in the preset time period respectively by the first charging group and the second charging group, the second charging group comprises an apportionment charging group and a bottom-guaranteed charging group, the total length of the messages transmitted by the apportionment charging group is equal to the maximum occupied bandwidth value, the total length of the messages transmitted by the bottom-guaranteed charging group is equal to the bottom-guaranteed occupied bandwidth value, and the total length of the messages transmitted by the first charging group is the length of the rest messages.
The details of one or more embodiments of the application are set forth in the accompanying drawings and the description below to provide a more thorough understanding of the application.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a flowchart one of a scheduling method based on 95 polling according to an embodiment of the present application;
FIG. 2 is a flowchart of a scheduling method based on 95 polling according to an embodiment of the present application;
fig. 3 is a flowchart of a scheduling method based on 95 polling according to an embodiment of the present application;
fig. 4 is a block diagram of a scheduling apparatus based on 95 polling according to an embodiment of the present application;
FIG. 5 is a schematic diagram of a scheduling system based on 95 polling according to an embodiment of the present application;
fig. 6 is a schematic diagram of an internal structure of a computer device according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be described and illustrated below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments provided in the present application without any inventive step are within the scope of protection of the present application.
It is obvious that the drawings in the following description are only examples or embodiments of the present application, and that it is also possible for a person skilled in the art to apply the present application to other similar contexts on the basis of these drawings without inventive effort. Moreover, it should be appreciated that in the development of any such actual implementation, as in any engineering or design project, numerous implementation-specific decisions must be made to achieve the developers' specific goals, such as compliance with system-related and business-related constraints, which may vary from one implementation to another.
Reference in the specification to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the specification. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of ordinary skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments without conflict.
Unless defined otherwise, technical or scientific terms referred to herein shall have the ordinary meaning as understood by those of ordinary skill in the art to which this application belongs. Reference to "a," "an," "the," and similar words throughout this application are not to be construed as limiting in number, and may refer to the singular or the plural. The present application is directed to the use of the terms "including," "comprising," "having," and any variations thereof, which are intended to cover non-exclusive inclusions; for example, a process, method, system, article, or apparatus that comprises a list of steps or modules (elements) is not limited to the listed steps or elements, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus. The term "plurality" as referred to herein means two or more. "and/or" describes an association relationship of associated objects, meaning that three relationships may exist, for example, "A and/or B" may mean: a exists alone, A and B exist simultaneously, and B exists alone. Reference herein to the terms "first," "second," "third," and the like, are merely to distinguish similar objects and do not denote a particular ordering for the objects.
The scheduling method based on 95 polling is applicable to 95 charging rule scenes of operators. The internet data service is that an operator establishes a standardized telecommunication professional computer room environment by using the existing internet communication line and bandwidth resources, and provides all-round services in the aspects of server hosting, renting, related value addition and the like for enterprises and governments, and in order to guarantee the network development speed and maintain the stable network operation, the operator needs to charge a certain fee to companies or individuals using the network, and the fee is paid to the operator as the operating capital, namely the user pays the fee to the operator according to the flow consumption counted by the charging rule, wherein the 95 charging rule is the charging rule.
The 95 charging in the internet data service scene is: in a natural month, the effective bandwidth values of every 5 minutes are arranged in a descending order, then the points with the highest bandwidth value of 5 percent are removed, and the remaining highest bandwidth value is the charging value of the 95 bandwidth peak value. Taking 30 days a month as an example, the defaults are valid value-taking points: 1 bandwidth point of value taking every 5 minutes, 12 points of value taking every hour, and the number of the value taking points per month is 12 × 24 × 30= 8640; all the points are sorted in descending order according to the bandwidth value, the first 5% of the points 8640 × 5% =432 points are removed, namely, the 433 th point is a charging point. There is no effective way in the related art to save traffic consumption cost in the 95 billing scenario by traffic scheduling. After extensive consideration and summary, the inventors have found that peak flow at 5% of the time per month may not be accounted for, and how to fully utilize this 5% of the time becomes a key to cost savings.
The embodiment provides a scheduling method based on 95 polling, which is applied to a management server, wherein the management server is in communication connection with an SDN switch, the SDN switch is connected between a server cluster of a resource provider and an operator network, and the operator network charges according to flow transmitted by the SDN switch; in the embodiment of the application, the SDN switch includes a first charging group and a second charging group, and both the first charging group and the second charging group are in communication connection with an operator network. Fig. 1 is a flowchart of a scheduling method based on 95 polling according to an embodiment of the present application, as shown in fig. 1, the scheduling method includes the following steps:
step S101, acquiring current time and a preset time period;
step S102, judging whether the current time belongs to a preset time period or not;
as described above, the 95 billing policy is: and eliminating the first five percent of flow statistic points in the statistic period, taking the maximum value in the remaining 95 percent of flow statistic points as a charging point, wherein the statistic period is one month. Through a great deal of practice and observation, the inventor finds that the peak time periods of traffic usage are the same or similar for each day of a month, and therefore the first 5% of each day can be found, so that each billing group transmits as much traffic as possible within its corresponding 5% of the time. In this embodiment of the present application, the same or similar time period used for the peak flow rate every day may be used as the preset time period, where the preset time period may be one hour as the time range, or may be half an hour as the time range. For example, the preset time period may be 19.00-20.00, 20.00-21.00, 21.00-22.00, 22.00-23.00, etc., and the preset time period may be one or more of them, taking one hour as a time range.
Step S103, if the current time belongs to a preset time period, the switch is controlled to execute a first strategy, wherein the first strategy comprises the total length of messages needing to be transmitted in the preset time period by a first charging group and a second charging group, the second charging group comprises an apportionment charging group and a bottom-guaranteeing charging group, the total length of the messages transmitted by the apportionment charging group is equal to the maximum occupied bandwidth value, the total length of the messages transmitted by the bottom-guaranteeing charging group is equal to the bottom-guaranteeing occupied bandwidth value, and the total length of the messages transmitted by the first charging group is the remaining length of the messages.
The total length of the message transmitted by the apportionment charging group in the preset time is the uplink flow of the apportionment charging group in the preset time, and when the preset time is unit time, the total length of the transmitted message is the uplink flow rate of the apportionment charging group. The maximum bandwidth occupation value is the maximum value of the flow which can be transmitted by the apportionment charging group in a preset time period, and the bandwidth guaranteed-base occupation value is the flow value corresponding to guaranteed-base charging of the guaranteed-base charging group; the message is a data unit exchanged and transmitted in the network, that is, a data block to be sent by the station at one time, and the message contains complete data information to be sent, and the lengths of the data information are not consistent; the traffic in the network refers to the amount of data transmitted on the network, and it can be further understood that the length value of the message is equivalent to the traffic value.
Specifically, 5% of 24 hours is close to 1 hour, and if in an actual environment, the peak time period of the flow usage is 19.00 to 23.00, one hour may be used as the time range of the preset time period, and further 19.00 to 23.00 correspond to 4 hours, that is, 4 preset time periods: 19.00-20.00, 20.00-21.00, 21.00-22.00, 22.00-23.00, each preset time period corresponds to one apportioned charging group for maximum flow transmission, so that in each preset time period, the second charging group comprises 1 apportioned charging group and 3 guaranteed charging groups, and the second charging group can be A, B, C and a group D. In a preset time period of 19.00-20.00, the group A can be an apportioned charging group, and the group B, C and the group D can be guaranteed-based charging groups; in a preset time period of 20.00-21.00, the group B is an apportioned charging group, and the group A, C and the group D are guaranteed-base charging groups; in a preset time period of 21.00-22.00, the C group is an apportionment charging group, and the A, B group and the D group are guaranteed-based charging groups; in a preset time period of 22.00-23.00, the group D is an apportionment charging group, and the group C is a guaranteed base charging group, A, B. It should be noted that the traffic transmitted by the first accounting group is the remaining traffic, and further, during the peak period 19.00-23.00 of traffic usage, the first accounting group may be defined as group E, which is used to transmit the remaining traffic excluding A, B, C and group D.
For example, the current time is 19.30, the current time belongs to a preset time period of 19.00-20.00, which corresponds to the group a as an apportionment charging group, the traffic is full, B, C and the group D as a guaranteed-base charging group, in order to reduce the cost, only the guaranteed-base traffic needs to be run, and the remaining traffic is transmitted by the first charging group (group E). If 19.00-20.00 a day a month, the group A reaches the maximum bandwidth occupation value in one hour, and the flow of the group A runs full, the flow in the hour of 19.00-20.00 is not charged when the group A is counted, and the flow of 19.00-20.00 is the maximum time period of the flow of the group A, so that the cost is greatly saved.
It should be further noted that the total length of the current time corresponding to the apportioned charging group is less than or equal to 24 hours by 5%, that is, less than or equal to 1.2 hours. The current time corresponding to the apportioned charging group is not necessarily continuous, and may be composed of 2 segments or 3 segments, which is not limited herein.
Through the steps S101 to S103, whether the current time belongs to the preset time period is determined, if yes, the SDN switch is controlled to execute the first policy, the apportionment charging group is controlled by the first policy to control that the traffic reaches the maximum bandwidth occupation value in the preset time period, and based on the 95 charging policy, the apportionment charging group is not included in the calculation of the charges at the traffic charging point in the preset time period, so that the apportionment charging group running full of bandwidth achieves the maximum utilization rate in the calculation of the charges that are not included, thereby solving the problem of high expenses in the 95 charging scene in the related art.
In some of these embodiments, the 95-poll based scheduling method further includes the steps of: and if the current time does not belong to the preset time period, controlling the switch to execute a second strategy, wherein the second strategy comprises a first charging group and messages which need to be transmitted by the second charging group in other time excluding the preset time period, the second charging group comprises a bottom-guaranteed charging group, the total length of the messages transmitted by the bottom-guaranteed charging group is equal to the bandwidth bottom-guaranteed occupied value, and the first charging group transmits the rest messages.
Specifically, if the current time period does not belong to the preset time period, for example, 19.00-20.00, 20.00-21.00, 21.00-22.00, and 22.00-23.00 are all preset time periods, if the current time is 5 o' clock, the current time does not belong to the preset time period, the second charging group only includes the guaranteed-base charging group, and referring to the above example, A, B, C and the D group are both guaranteed-base charging groups, and only the guaranteed-base traffic needs to be run, and the second charging group, that is, the E group, is used for transmitting the traffic remaining after excluding A, B, C and the D group. Referring to the above example, the traffic of group A runs to the maximum occupation value of bandwidth between 19.00 and 20.00, and the traffic runs to the guaranteed occupation value of bandwidth in other time periods. After the duration lasts for 1 month, the first 5% of the flow charging points corresponding to the group A are all the flow charging points between 19.00 and 20.00, and after the flow charging points between 19.00 and 20.00 are removed, the maximum flow charging point of the group A is equal to the bandwidth bottom-keeping occupation value, namely, the group A only needs to pay basic cost, so that the cost is saved.
In some of these embodiments, obtaining the preset time period comprises: acquiring the occurrence time of a flow consumption peak value of a user; determining a preset time period according to the occurrence time of the flow consumption peak value;
for example, the peak in traffic consumption for a user often occurs at late peak, late peak 19: 00-23: 00, about 4 hours, and further may be based on the peak flow consumption 19: 00-23: 00, determining the preset time periods of 19.00-20.00, 20.00-21.00, 21.00-22.00 and 22.00-23.00, thereby ensuring that the preset time period determined according to the flow consumption peak value of the user is more real and reliable.
In some embodiments, fig. 2 is a flowchart of a scheduling method based on 95 polling according to an embodiment of the present application, and as shown in fig. 2, before the control switch executes the first policy, the scheduling method further includes:
step S201, obtaining a message reported by an SDN switch and a message length corresponding to the message;
the SDN switch analyzes the flow flowing into the SDN switch, extracts application characteristics in the message through message decomposition, and analyzes information such as application composition, flow direction and the like of the flow by combining quintuple information of the message. The five-tuple information is a set formed by five quantities of source IP address, source port, destination IP address, destination port and transport layer protocol. The quintuple information can be used as an identifier of the message, meanwhile, the message contains the message length, and the SDN switch can obtain the length corresponding to the message by analyzing the message.
Step S202, according to the length of the message, the message with the total length equal to the maximum bandwidth occupation value is marked as the apportionment charging group for transmission, the message with the total length equal to the bandwidth bottom-preserving occupation value is marked as the bottom-preserving charging group for transmission, and the rest messages are marked as the first charging group for transmission.
Optionally, marking the message with the total length close to (slightly larger or slightly smaller than) the maximum bandwidth occupation value as being transmitted by the apportionment charging group, that is, the total length is in the close range of the maximum bandwidth occupation value; and marking the message with the total length close to (slightly smaller than) the bandwidth guaranteed bottom occupation value as being transmitted by a guaranteed bottom charging group, namely the total length is in the close range of the bandwidth guaranteed bottom occupation value.
In some embodiments, the step of marking the packet with the total length equal to the maximum bandwidth occupation value as transmitted by the apportionment charging group and the step of marking the packet with the total length equal to the guaranteed bandwidth occupation value as transmitted by the guaranteed bandwidth charging group according to the length of the packet may further include:
and the SDN switch monitors the current flow values of the first charging group and the second charging group in real time and transmits the monitored flow values to the management server.
If the current time belongs to the preset time period, the management server determines a first difference value between the maximum bandwidth occupation value of the apportioned charging group and the current flow value of the apportioned charging group, and marks the message with the length accumulation equal to the first difference value as the apportioned charging group for transmission; determining a second difference value between the bandwidth bottom-guaranteeing occupancy value of the bottom-guaranteeing charging group and the current flow value of the bottom-guaranteeing charging group, and marking the message with the length accumulation equal to the second difference value as the bottom-guaranteeing charging group for transmission; and marking the rest messages as being transmitted by the first charging group.
If the current time does not belong to the preset time period, the management server determines a second difference value between the bandwidth bottom-guaranteeing occupancy value of the bottom-guaranteeing charging group and the current flow value of the bottom-guaranteeing charging group, and marks the message with the length accumulation equal to the second difference value as the bottom-guaranteeing charging group for transmission; and marking the rest messages as being transmitted by the first charging group.
In some embodiments, fig. 3 is a flowchart of a scheduling method based on 95 polling according to an embodiment of the present application, and as shown in fig. 3, before a packet with a total length equal to a maximum bandwidth occupancy value is marked to be transmitted by an apportioned charging group, the scheduling method further includes:
step S301, acquiring a maximum bandwidth occupation value of an apportionment charging group and a guaranteed-base bandwidth occupation value of a guaranteed-base charging group in the SDN switch;
the SDN switch respectively calculates the maximum bandwidth occupation value of the apportionment charging group and the guaranteed-base charging group according to the number of the apportionment charging group and the guaranteed-base charging group respectively including the charging group, and transmits the maximum bandwidth occupation value and the guaranteed-base charging group to the management server. The management server may be an SDN controller.
In some embodiments, the preset time period is at least one period, and the charging group of the SDN switch is greater than or equal to the number of the preset time periods.
For example, if the preset time period is 19.00-20.00, 20.00-21.00, 21.00-22.00, and 22.00-23.00, the charging group of the SDN switch may be 5 groups (A, B, C, D and E group), the second charging group includes A, B, C and D group, and the first charging group includes E group. If the current time belongs to the preset time period of 19.00-20.00, in the second charging group: the group A is an apportionment charging group, and the group B, C and the group D are a guaranteed-base charging group; if the current time belongs to the preset time period of 20.00-21.00, in the second charging group: the group B is an apportionment charging group, and the group A, C and the group D are guaranteed-base charging groups; if the current time belongs to the preset time period of 21.00-22.00, in the second charging group: the group C is an apportionment charging group, and the group A, B and the group D are a guaranteed-base charging group; if the current time belongs to the preset time period of 22.00-23.00, in the second charging group: the group D is an apportionment charging group, and the group A, B and the group C are guaranteed-base charging groups; if the current time does not belong to the preset time period, in the second charging group: A. b, C and group D are both guaranteed-base billing groups.
If the preset time periods are 20.00-21.00 and 21.00-22.00, the charging group of the SDN switch may be 3 groups (A, B and C group), the second charging group includes A, B groups, and the first charging group includes C group. If the current time belongs to the preset time period of 20.00-21.00, in the second charging group: the group A can be an apportionment charging group, and the group B is a guaranteed-base charging group; if the current time belongs to the preset time period of 21.00-22.00, in the second charging group: the group B can be an apportionment charging group, and the group A is a guaranteed-base charging group; if the current time does not belong to the preset time period, in the second charging group: A. the B groups are guaranteed-base charging groups.
It should be noted that the steps illustrated in the above-described flow diagrams or in the flow diagrams of the figures may be performed in a computer system, such as a set of computer-executable instructions, and that, although a logical order is illustrated in the flow diagrams, in some cases, the steps illustrated or described may be performed in an order different than here.
The present embodiment further provides a scheduling apparatus based on 95 polling, which is used to implement the foregoing embodiments and preferred embodiments, and the description of the apparatus is omitted here. As used hereinafter, the terms "module," "unit," "subunit," and the like may implement a combination of software and/or hardware for a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
The dispatching device based on 95 polling is applied to a management server, the management server is in communication connection with an SDN switch, the SDN switch is connected between a server cluster of a resource provider and an operator network, and the operator network charges according to the bandwidth of flow transmitted by the SDN switch; in the embodiment of the application, the SDN switch includes a first charging group and a second charging group, and both the first charging group and the second charging group are in communication connection with an operator network.
In some embodiments, fig. 4 is a block diagram of a scheduling apparatus based on 95 polling according to an embodiment of the present application, and as shown in fig. 4, the scheduling apparatus based on 95 polling includes: an acquisition module 41, a judgment module 42 and a control module 43;
an obtaining module 41, configured to obtain a current time and a preset time period;
a judging module 42, configured to judge whether the current time belongs to a preset time period;
a control module 43, configured to control the switch to execute a first policy if the current time belongs to a preset time period, where the first policy includes total lengths of messages that need to be transmitted in the preset time period by a first charging group and a second charging group, the second charging group includes an apportionment charging group and a bottom-guaranteed charging group, the total length of the messages transmitted by the apportionment charging group is equal to a maximum bandwidth occupation value, the total length of the messages transmitted by the bottom-guaranteed charging group is equal to a bottom-guaranteed bandwidth occupation value, and the total length of the messages transmitted by the first charging group is a remaining length of the messages.
In some embodiments, the obtaining module 41, the determining module 42, and the control module 43 are further configured to implement steps in the scheduling method based on 95 polling provided in the foregoing embodiments, and are not described herein again.
The above modules may be functional modules or program modules, and may be implemented by software or hardware. For a module implemented by hardware, the modules may be located in the same processor; or the modules can be respectively positioned in different processors in any combination.
Fig. 5 is a schematic structural diagram of a scheduling system based on 95 round robin according to an embodiment of the present application, and as shown in fig. 5, the scheduling system based on 95 round robin includes an SDN controller and an SDN switch connected to the SDN controller through an API interface;
the SDN switch is connected between a server cluster of a resource provider and an operator network, and comprises a first charging group and a second charging group, and the first charging group and the second charging group are both in communication connection with the operator network;
the SDN controller is used for acquiring current time and a preset time period, judging whether the current time belongs to the preset time period or not, and controlling the switch to execute a first strategy through an API (application program interface) if the current time belongs to the preset time period, wherein the first strategy comprises the total length of messages needing to be transmitted in the preset time period by a first charging group and a second charging group, the second charging group comprises an apportionment charging group and a bottom-guaranteeing charging group, the total length of the messages transmitted by the apportionment charging group is equal to the maximum bandwidth occupation value, the total length of the messages transmitted by the bottom-guaranteeing charging group is equal to the bottom-guaranteeing bandwidth occupation value, and the total length of the messages transmitted by the first charging group is the remaining length of the messages;
the SDN controller controls the collection of real-time data of the switch and the instruction issuing through the API interface.
In some embodiments, the SDN controller and the SDN switch are further configured to implement steps in the scheduling method based on 95 polling provided in the foregoing embodiments, and details are not described here again.
In one embodiment, a computer device is provided, which may be a terminal. The computer device includes a processor, a memory, a network interface, a display screen, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a scheduling method based on 95 polling. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
In an embodiment, fig. 6 is a schematic internal structural diagram of a computer device according to an embodiment of the present application, and as shown in fig. 6, there is provided a computer device, which may be a server, and in an embodiment of the present application, the computer device may be a management server, and its internal structural diagram may be as shown in fig. 6. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of an operating system and computer programs in the non-volatile storage medium. The database of the computer device is used for storing data. The network interface of the computer device is used for communicating with an external terminal through network connection, and in the embodiment of the application, the network interface may be an API interface. The computer program is executed by a processor to implement a scheduling method based on 95 polling.
Those skilled in the art will appreciate that the architecture shown in fig. 6 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a computer device is provided, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and the processor executes the computer program to implement the steps of the scheduling method based on 95 polling provided by the above embodiments.
In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, which when executed by a processor implements the steps in the scheduling method based on 95 polling provided by the above embodiments.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware instructions of a computer program, which can be stored in a non-volatile computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.
Claims (9)
1. A scheduling method based on 95 polling is applied to a management server, and is characterized in that the management server is in communication connection with an SDN switch, the SDN switch comprises a first charging group and a second charging group, and the first charging group and the second charging group are both in communication connection with an operator network; the method comprises the following steps:
acquiring the current time and a preset time period, wherein the acquiring of the preset time period comprises the following steps: acquiring the occurrence time of a flow consumption peak value of a user, and determining the preset time period according to the occurrence time of the flow consumption peak value; determining the preset time period according to the occurrence time of the flow consumption peak value includes: taking a time period with the same or similar flow consumption peak value in the unit time as the preset time period;
judging whether the current time belongs to the preset time period or not;
if the current time belongs to the preset time period, controlling the switch to execute a first strategy, wherein the first strategy comprises the total length of the messages which need to be transmitted in the preset time period by the first charging group and the second charging group, the second charging group comprises an apportionment charging group and a bottom-guaranteed charging group, the total length of the messages transmitted by the apportionment charging group is equal to the maximum bandwidth occupation value, the total length of the messages transmitted by the bottom-guaranteed charging group is equal to the bottom-guaranteed bandwidth occupation value, and the total length of the messages transmitted by the first charging group is the remaining length of the messages.
2. The method of claim 1, wherein the method further comprises:
and if the current time does not belong to the preset time period, controlling the switch to execute a second strategy, wherein the second strategy comprises messages which need to be transmitted in other time excluding the preset time period by the first charging group and the second charging group, the second charging group comprises the bottom-guaranteed charging group, the total length of the messages transmitted by the bottom-guaranteed charging group is equal to the bandwidth bottom-guaranteed occupied value, and the first charging group transmits the rest of the messages.
3. The 95-poll based scheduling method of claim 1, wherein before controlling the switch to execute the first policy, the method further comprises:
acquiring a message reported by the SDN switch and a message length corresponding to the message;
and according to the message length, marking the message with the total length equal to the maximum bandwidth occupation value as the apportionment charging group for transmission, marking the message with the total length equal to the bandwidth guaranteed occupation value as the guaranteed charging group for transmission, and marking the rest messages as the first charging group for transmission.
4. The method of claim 3, wherein a packet with a total length equal to a maximum bandwidth occupancy value is marked as being transmitted by the split charging group, and the method further comprises:
and acquiring the maximum bandwidth occupation value of the apportionment charging group and the guaranteed bandwidth occupation value of the guaranteed charging group in the SDN switch.
5. The scheduling method based on 95 polling of claim 2, wherein the preset time period is at least one period, and the charging group of the SDN switch is greater than or equal to the number of the preset time period.
6. A scheduling device based on 95 polling is applied to a management server, and is characterized in that the management server is in communication connection with an SDN switch, the SDN switch comprises a first charging group and a second charging group, and the first charging group and the second charging group are both in communication connection with an operator network; the device comprises: the device comprises an acquisition module, a judgment module and a control module;
the acquiring module is configured to acquire a current time and a preset time period, where acquiring the preset time period includes: acquiring the occurrence time of a flow consumption peak value of a user, and determining the preset time period according to the occurrence time of the flow consumption peak value; determining the preset time period according to the occurrence time of the flow consumption peak value includes: taking a time period with the same or similar flow consumption peak value in the unit time as the preset time period;
the judging module is used for judging whether the current time belongs to the preset time period or not;
the control module is configured to control the switch to execute a first policy if the current time belongs to the preset time period, where the first policy includes total lengths of messages that need to be transmitted in the preset time period by the first charging group and the second charging group, the second charging group includes an apportionment charging group and a bottom-guaranteed charging group, the total length of the messages transmitted by the apportionment charging group is equal to a maximum bandwidth occupation value, the total length of the messages transmitted by the bottom-guaranteed charging group is equal to a maximum bandwidth occupation value, and the total length of the messages transmitted by the first charging group is a remaining length of the messages.
7. A scheduling system based on 95 polling, the system comprising an SDN controller, an SDN switch interfacing with the SDN controller through an API;
the SDN switch is connected between a server cluster of a resource provider and an operator network, and comprises a first charging group and a second charging group, and the first charging group and the second charging group are both in communication connection with the operator network;
the SDN controller is configured to obtain a current time and a preset time period, and determine whether the current time belongs to the preset time period, and if the current time belongs to the preset time period, the SDN controller controls the switch to execute a first policy through the API interface, where the first policy includes a total length of a message that needs to be transmitted in the preset time period by the first charging group and the second charging group, the second charging group includes an apportionment charging group and a bottom-guaranteeing charging group, the total length of the message transmitted by the apportionment charging group is equal to a maximum bandwidth occupation value, the total length of the message transmitted by the bottom-guaranteeing charging group is equal to a maximum bandwidth occupation value, and the total length of the message transmitted by the first charging group is a remaining message length; wherein acquiring the preset time period comprises: acquiring the occurrence time of a flow consumption peak value of a user, and determining the preset time period according to the occurrence time of the flow consumption peak value; determining the preset time period according to the occurrence time of the flow consumption peak value includes: and taking the time period with the same or similar flow consumption peak value in the unit time as the preset time period.
8. A computer device comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the 95-poll based scheduling method of any of claims 1 to 5 when executing the computer program.
9. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, implements the 95-poll based scheduling method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011386105.7A CN112202578B (en) | 2020-12-01 | 2020-12-01 | Scheduling method, device and system based on 95 polling and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011386105.7A CN112202578B (en) | 2020-12-01 | 2020-12-01 | Scheduling method, device and system based on 95 polling and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112202578A CN112202578A (en) | 2021-01-08 |
| CN112202578B true CN112202578B (en) | 2021-03-09 |
Family
ID=74034369
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011386105.7A Active CN112202578B (en) | 2020-12-01 | 2020-12-01 | Scheduling method, device and system based on 95 polling and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112202578B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114978915B (en) * | 2021-02-24 | 2024-01-19 | 北京金山云网络技术有限公司 | CDN node bandwidth planning method and device, electronic equipment and storage medium |
| CN113132151A (en) * | 2021-03-10 | 2021-07-16 | 上海翌旭网络科技有限公司 | Method for reducing bandwidth total cost of CDN (content delivery network) by fully utilizing free points of multiple machine rooms |
| CN114615097B (en) * | 2022-03-02 | 2023-09-19 | 北京云享智胜科技有限公司 | Method and device for determining client paid bandwidth ratio and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111355609A (en) * | 2020-02-18 | 2020-06-30 | 山西知脉信息技术有限公司 | Method for adjusting bandwidth resource redundancy of internet data center |
| CN111901131A (en) * | 2020-09-29 | 2020-11-06 | 杭州优云科技有限公司 | Flow charging scheduling method, storage medium and computer |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013060387A1 (en) * | 2011-10-28 | 2013-05-02 | Telefonaktiebolaget L M Ericsson (Publ) | Processing usage information for machine-to-machine communication |
-
2020
- 2020-12-01 CN CN202011386105.7A patent/CN112202578B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111355609A (en) * | 2020-02-18 | 2020-06-30 | 山西知脉信息技术有限公司 | Method for adjusting bandwidth resource redundancy of internet data center |
| CN111901131A (en) * | 2020-09-29 | 2020-11-06 | 杭州优云科技有限公司 | Flow charging scheduling method, storage medium and computer |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112202578A (en) | 2021-01-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112202578B (en) | Scheduling method, device and system based on 95 polling and computer equipment | |
| CN105491557B (en) | System and method for realizing capability opening and capability opening platform | |
| US20180270073A1 (en) | Method and apparatus for charging operations in a communication network | |
| US11546806B2 (en) | Communication system | |
| US20120213072A1 (en) | Data rate aware scheduling in advanced wireless networks | |
| Alfoudi et al. | An efficient resource management mechanism for network slicing in a LTE network | |
| CN105992282B (en) | Method and device for adjusting quality of service parameters | |
| JP2002518884A (en) | Communication network | |
| US20140337435A1 (en) | Device and Method for the Dynamic Load Management of Cloud Services | |
| JP7177729B2 (en) | Manage wireless transmission capacity | |
| CN110740430B (en) | Resource charging method and system, AF (automatic frequency control) and policy and charging function entity | |
| Shi et al. | CoAST: Collaborative application-aware scheduling of last-mile cellular traffic | |
| CN1925365B (en) | System and method for bandwidth distributing and dispatching of wireless broad band network | |
| CN104753812A (en) | Systems and methods for cooperative applications in communication systems | |
| EP2547145A1 (en) | Method and equipment for controlling quality of service of user terminal device | |
| CN108076443B (en) | Flow distribution method in online charging system and online charging system | |
| CN114828050B (en) | Method, device, equipment and medium for determining service capacity | |
| CN101129028B (en) | Estimation of bandwidth requirements in a communications network with access controls | |
| US20080172236A1 (en) | Method and system for controlling prepaid data services | |
| EP2388978B1 (en) | Methods and devices for determining network link load | |
| Zhou et al. | A controlled preemption scheme for emergency applications in cellular networks | |
| WO2023274508A1 (en) | Conflict detection of specific intents in an intent-based network | |
| CN113453285A (en) | Resource adjusting method, device and storage medium | |
| CN105338575A (en) | Control method, device and server | |
| KR101506448B1 (en) | Method And Apparatus for Managing Machine to Machine Traffic |
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 |