Traffic sharing method, system and storage device

Abstract

The present application relates to the field of data processing technology, and in particular to a method, system, and storage device for traffic sharing. The traffic sharing method comprises the following steps: creating a virtual traffic sharing pool; establishing a conditional constraint model based on the remaining traffic and device traffic requirements of each virtual traffic sharing pool; applying the 0-1 planning method to the conditional constraint model to find an optimal solution; adjusting the package based on the optimal solution; determining the actual traffic sharing pool in use; and allocating traffic to front-end devices for each actual traffic sharing pool based on the optimal solution and package details. This method allows for automatic traffic allocation without manual intervention, saving both labor costs and time.

Description

Technical Field

[0001] This application is a divisional application. The application number of the original application is: 202210678084.9, the application date is: 2022.06.15, and the subject name of the original application is "A method, system and storage device for traffic sharing". Background Art

[0002] With the development of society, more and more terminal devices are being used. At the same time, more and more terminal devices need to use traffic to send and receive information. It is no longer limited to mobile phones that need to use SIM card traffic. Many tablets, cameras, etc. also need to install SIM cards to support their traffic use.

[0003] Existing traffic sharing pool technology requires manual monthly updates and allocations to determine whether the remaining traffic in each pool can meet the traffic needs of each application device, as well as whether any devices have special traffic requirements. This process is then used to determine whether packages need to be added or removed. Given the large number of front-end devices and their varying traffic requirements, this manual approach is time-consuming and labor-intensive. Summary of the Invention

[0004] In view of the above problems, this application provides a method for traffic sharing to solve the technical problems in the prior art, such as manually analyzing the traffic demand of the traffic sharing pool and making changes to the package, which is time-consuming and labor-intensive, and the results of the changes may not be optimal. The specific technical solution is as follows:

[0005] A method for traffic sharing, comprising the steps of:

[0006] Create a virtual traffic sharing pool;

[0007] Establish a conditional constraint model based on the remaining traffic of each virtual traffic sharing pool and the traffic demand of the device;

[0008] Applying the 0-1 programming method to the conditional constraint model to find the optimal solution;

[0009] Adjust the package according to the optimal solution;

[0010] Determine the actual traffic sharing pool used;

[0011] Allocate traffic to the front-end device for each real traffic sharing pool based on the optimal solution and package details.

[0012] Furthermore, the package adjustment according to the optimal solution further includes the steps of:

[0013] Determine whether the data traffic requirements of all devices are still met after the cancellation of the corresponding old package. If so, cancel the corresponding old package;

[0014] Determine whether the existing package meets the traffic requirements of all devices. If not, apply for a new package.

[0015] Furthermore, the determination of the actually used traffic sharing pool specifically includes the following steps:

[0016] The virtual traffic sharing pool is processed according to the optimal solution and package details, the traffic sharing pool corresponding to 0 in the optimal solution is removed, the traffic sharing pool corresponding to 1 in the optimal solution is retained, and the remaining traffic of the real traffic sharing pool is determined.

[0017] Furthermore, allocating traffic to the front-end device for each real traffic sharing pool according to the optimal solution and package details specifically includes the following steps:

[0018] If only one of the multiple front-end devices is running at the same time, the corresponding traffic sharing pool will only provide traffic to the running device;

[0019] If multiple front-end devices are running at the same time, the corresponding traffic sharing pool distributes traffic based on the ratio between the average historical traffic demands of the multiple front-end devices;

[0020] If there is a front-end device with special flow demand, flow distribution is performed based on the ratio between the estimated flow value of the special flow demand and the average flow demand of other front-end devices at ordinary times.

[0021] Furthermore, the creation of the virtual traffic sharing pool specifically includes the following steps:

[0022] A virtual traffic sharing pool is established based on all traffic packages of the service provider.

[0023] In order to solve the above technical problems, a storage device is also provided. The specific technical solution is as follows:

[0024] A storage device stores an instruction set, wherein the instruction set is used to execute: creating a virtual traffic sharing pool;

[0025] Establish a conditional constraint model based on the remaining traffic of each virtual traffic sharing pool and the traffic demand of the device;

[0026] Applying the 0-1 programming method to the conditional constraint model to find the optimal solution;

[0027] Adjust the package according to the optimal solution;

[0028] Determine the actual traffic sharing pool used;

[0029] Allocate traffic to the front-end device for each real traffic sharing pool based on the optimal solution and package details.

[0030] Furthermore, the instruction set is further configured to execute: adjusting the package according to the optimal solution, further comprising the steps of:

[0031] Determine whether the data traffic requirements of all devices are still met after the cancellation of the corresponding old package. If so, cancel the corresponding old package;

[0032] Determine whether the existing package meets the traffic requirements of all devices. If not, apply for a new package.

[0033] Furthermore, the instruction set is further configured to execute: determining the actually used traffic sharing pool, specifically including the steps of:

[0034] The virtual traffic sharing pool is processed according to the optimal solution and package details, the traffic sharing pool corresponding to 0 in the optimal solution is removed, the traffic sharing pool corresponding to 1 in the optimal solution is retained, and the remaining traffic of the real traffic sharing pool is determined.

[0035] Furthermore, the instruction set is further configured to execute: allocating traffic to the front-end device for each real traffic sharing pool according to the optimal solution and package details, specifically including the steps of:

[0036] If only one of the multiple front-end devices is running at the same time, the corresponding traffic sharing pool will only provide traffic to the running device;

[0037] If multiple front-end devices are running at the same time, the corresponding traffic sharing pool distributes traffic based on the ratio between the average historical traffic demands of the multiple front-end devices;

[0038] If there is a front-end device with special flow demand, flow distribution is performed based on the ratio between the estimated flow value of the special flow demand and the average flow demand of other front-end devices at ordinary times.

[0039] Furthermore, the instruction set is further configured to execute:

[0040] The creation of the virtual traffic sharing pool specifically further includes the following steps:

[0041] A virtual traffic sharing pool is established based on all traffic packages of the service provider.

[0042] In order to solve the above technical problems, a traffic sharing system is also provided. The specific technical solution is as follows:

[0043] A traffic sharing system includes: a front-end device, a server, and a user client;

[0044] The server is connected to the front-end device and the user client respectively;

[0045] The front-end device is used to apply for a data package;

[0046] The server is used to execute the traffic sharing method mentioned above;

[0047] The user client is used to receive the prompt information sent by the server.

[0048] The present invention provides a traffic sharing method comprising the steps of: creating virtual traffic sharing pools; establishing a conditional constraint model based on the remaining traffic in each virtual traffic sharing pool and the traffic requirements of the device; applying a 0-1 programming method to the conditional constraint model to find an optimal solution; adjusting the package based on the optimal solution; determining the actual traffic sharing pool in use; and allocating traffic to front-end devices in each actual traffic sharing pool based on the optimal solution and package details. This method automates traffic allocation without manual intervention, saving both labor costs and time.

[0049] The above-mentioned records related to the content of the invention are only an overview of the technical solution of this application. In order to enable ordinary technicians in this field to understand the technical solution of this application more clearly, and then implement it according to the text of the specification and the contents recorded in the drawings, and to make the above-mentioned purposes and other purposes, features and advantages of this application easier to understand, the following is an explanation in combination with the specific implementation methods and drawings of this application. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] The accompanying drawings are only used to illustrate the principles, implementation methods, applications, characteristics and effects of the specific embodiments of this application and other related contents, and are not to be considered as limiting this application.

[0051] In the drawings of the specification:

[0052] Figure 1 A flow chart of a traffic sharing method according to a specific embodiment Figure 1 ;

[0053] Figure 2 A flow chart of a traffic sharing method according to a specific embodiment Figure 2 ;

[0054] Figure 3 A flow chart of a traffic sharing method according to a specific embodiment Figure 3 ;

[0055] Figure 4 A flow chart of a traffic sharing method according to a specific embodiment Figure 4 ;

[0056] Figure 5 A schematic diagram of a module of a storage device described in a specific embodiment;

[0057] Figure 6 This is a schematic diagram of a system module for traffic sharing described in a specific implementation method.

[0058] The reference numerals in the above drawings are described as follows:

[0059] 500, storage device,

[0060] 600. A traffic sharing system.

[0061] 601, front-end equipment,

[0062] 602, server,

[0063] 603. User client. DETAILED DESCRIPTION

[0064] In order to explain in detail the possible application scenarios, technical principles, specific solutions that can be implemented, and the purpose and effects of this application, the following is a detailed description of the specific embodiments listed in conjunction with the accompanying drawings. The embodiments described herein are only used to more clearly illustrate the technical solutions of this application and are therefore only examples and are not intended to limit the scope of protection of this application.

[0065] References to "embodiments" herein mean that the specific features, structures, or characteristics described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the word "embodiment" in various places in the specification does not necessarily refer to the same embodiment, nor does it particularly limit its independence or relevance to other embodiments. In principle, in this application, as long as there are no technical contradictions or conflicts, the various technical features mentioned in the embodiments can be combined in any manner to form a corresponding implementable technical solution.

[0066] Unless otherwise defined, the technical terms used herein have the same meanings as those generally understood by those skilled in the art to which this application belongs; the use of relevant terms herein is only for describing specific embodiments and is not intended to limit this application.

[0067] In the description of this application, the term "and / or" is used to describe a logical relationship between objects, indicating that three relationships can exist. For example, A and / or B means: A exists, B exists, and both A and B exist. In addition, the character " / " in this document generally indicates that the objects before and after are in a logical "or" relationship.

[0068] In this application, terms such as "first" and "second" are merely used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual quantity, priority or sequence relationship between these entities or operations.

[0069] Without further limitations, in this application, the words "include", "comprise", "have" or other similar expressions used in the sentences are intended to cover non-exclusive inclusion. These expressions do not exclude the presence of additional elements in the process, method or product including the elements, so that the process, method or product including a series of elements may include not only those defined elements, but also other elements not explicitly listed, or elements inherent to such process, method or product.

[0070] In this application, expressions such as "greater than," "less than," and "exceed" are understood to exclude the number itself; expressions such as "above," "below," and "within" are understood to include the number itself. In addition, in the description of the embodiments of this application, "multiple" means two or more (including two), and similar expressions related to "multiple" are also understood in this way, such as "multiple groups" and "multiple times," unless otherwise specifically limited.

[0071] As mentioned in the background, existing traffic sharing pool technology requires manual monthly updates and allocations to determine whether the remaining traffic in each pool can meet the traffic needs of each application device, and whether any devices have special traffic requirements. This process is then used to determine whether to add or remove packages. This manual process is time-consuming and labor-intensive, and it doesn't always result in the optimal traffic allocation strategy.

[0072] Therefore, this application proposes an automated traffic sharing method to solve the above-mentioned technical problems.

[0073] See below Figures 1 to 4 , a specific implementation method of a traffic sharing method is described:

[0074] like Figure 1 As shown, a traffic sharing method includes steps S101 to S106.

[0075] In step S101, a virtual traffic sharing pool is created. In this embodiment, a virtual traffic sharing pool can be established based on all traffic packages of the service provider. The traffic packages here refer to all existing traffic packages of the service provider, and the virtual traffic sharing pool refers to the traffic sharing pool without real traffic packages. The subsequent real traffic sharing pool is the traffic packages used in the real scenario obtained after solving the subsequent condition constraint model. Therefore, after deleting the traffic pools not used in the real scenario from the virtual traffic sharing pool, the real traffic sharing pool can be obtained.

[0076] In step S102, a conditional constraint model is established based on the remaining traffic and device traffic requirements of each virtual traffic sharing pool. The conditional constraint model includes an objective function and conditional constraints. The remaining traffic of each traffic sharing pool, the traffic requirements of the front-end devices, and the package fee can all generate constraints. The objective function is to minimize the package fee generated by the traffic sharing pool.

[0077] In step S103, the 0-1 programming method is used to solve the optimal solution of the conditional constraint model. In this embodiment, since some variables can only take values ​​of 0 or 1, the 0-1 programming method is used to solve the optimal solution.

[0078] In step S104, the package is adjusted according to the optimal solution. Figure 2 Step S204 specifically shows how to adjust the package according to the optimal solution.

[0079] In step S204, it is determined whether the data traffic requirements of all devices can still be met after the cancellation of the corresponding old package. If so, the corresponding old package is cancelled; it is determined whether the existing package can meet the data traffic requirements of all devices. If not, a new package is applied. In actual application, specifically: when the data traffic requirements of all devices can still be met by canceling some old packages, the old packages should be cancelled to save package fees; when all existing packages cannot meet the data traffic requirements of all devices, a new package should be applied.

[0080] Steps S201 to S203 and S205 to S206 are the same as steps S101 to S103 and S105 to S106, and their description is omitted.

[0081] In step S105 , the actually used traffic sharing pool is determined. Figure 3 Step S305 specifically shows how to determine the actual used traffic sharing.

[0082] In step S305, the virtual traffic sharing pool is processed according to the optimal solution and package details, the traffic sharing pool corresponding to 0 in the optimal solution is removed, the traffic sharing pool corresponding to 1 in the optimal solution is retained, and the remaining traffic of the real traffic sharing pool is determined.

[0083] Steps S301 to S304 and S306 are the same as steps S101 to S104 and S106, and their description is omitted.

[0084] In step S106, traffic is allocated to the front-end device for each real traffic sharing pool according to the optimal solution and package details. Figure 4 Step S406 specifically shows how to allocate traffic to the front-end device for each real traffic sharing pool based on the optimal solution and package details.

[0085] In step S406, if only one of multiple front-end devices is running at the same time, the corresponding traffic sharing pool only provides traffic to the running device; if multiple front-end devices are running at the same time, the corresponding traffic sharing pool distributes traffic based on the ratio between the average historical traffic demands of the multiple front-end devices; if there is a front-end device with special traffic demands, traffic is distributed based on the ratio between the estimated demand traffic value of the special traffic demand and the average normal traffic demands of other front-end devices.

[0086] Through the above method, traffic distribution can be automatically performed without manual intervention, which saves both labor costs and time.

[0087] The above method is described below with a specific embodiment:

[0088] Model building:

[0089] Assume there are front-end devices A, B, C, ..., M, and their average traffic demand is x1, x2, x3, ..., xm. A virtual traffic sharing pool is established for all traffic packages of the operator, and the remaining traffic in the pool is y1, y2, y3, ..., yn.

[0090] The objective function is to minimize the total cost of the package:

[0091] minZ=∑ci*bi;

[0092] Here bi is a 0-1 variable, bi=1 means applying for the corresponding package, bi=0 means not applying for the corresponding package, and ci is the cost of each package;

[0093] Establish the conditional constraint equation:

[0094] Traffic constraints:

[0095] The flow rate allocated to the device by the flow pool is less than or equal to the remaining flow rate of the flow pool yi*bi≥∑aij;

[0096] The flow rate allocated to each device by the flow pool is equal to the flow demand of each device xj = ∑aij;

[0097] Non-negative constraint: aij ≥ 0;

[0098] Here, a = [a11, a12, ..., a1m; a21, a22, ..., a2m; ...; an1, an2, ..., anm], aij means that the i-th traffic pool allocates a traffic of size aij to the j-th device, b = [b1, b2, b3, ..., bn], c = [c1, c2, c3, ..., cn], y = [y1, y2, y3, ..., yn], x = [x1, x2, x3, ..., xm], here bi = 0 or 1, bi = 1 means applying for the corresponding package, bi = 0 means not applying for the corresponding package, ci is the fee for each package; when the equation is first established, y is the applied package traffic, and subsequently y is the remaining traffic in the traffic pool updated in real time.

[0099] If there is a special flow requirement t, then add the conditional constraint equation based on the actual situation and let xj+t replace xj.

[0100] If there are other constraints in actual applications, you can add them yourself.

[0101] Model solution:

[0102] To solve the 0-1 programming problem, we can use the exhaustive method to traverse all combinations of decision variables and find the optimal value of the objective function. The implicit enumeration method is to repeatedly construct filtering conditions, continuously delete the solution set that is worse than the current solution, and take the result that is better than the current optimal solution as the new optimal solution. Then, we construct new filtering conditions based on the new optimal solution, and repeat this process until the optimal solution is found. The implicit enumeration method improves the exhaustive method by filtering conditions, and can find the optimal solution more quickly. The steps of the implicit enumeration method are as follows:

[0103] 1) Use the heuristic method to find a feasible solution and use its target value as the current best value Z0;

[0104] 2) Add the filter condition Z>=Z0;

[0105] 3) Arrange Xi from small to large according to Ci; the minimization problem is converted into a maximum problem by adding a negative sign Z=-Z to the objective function.

[0106] Detailed explanation of the optimal solution:

[0107] If the optimal solution [a, b] is obtained, first apply for the corresponding traffic package according to the solved bi=1 or cancel it according to bi=0. When bi=1, establish the corresponding real traffic sharing pool, and then allocate traffic to the devices according to the solved a combined with the constraints in the constraint equation. If aij=0, it means that the i-th traffic pool does not allocate traffic to the j-th device. If aij is not equal to 0, it means that the i-th traffic pool allocates traffic of size aij to the j-th device.

[0108] See below Figure 5A specific embodiment of a storage device 500 is described below. The storage device 500 includes, but is not limited to, a personal computer, a server, a general-purpose computer, a dedicated computer, a network device, an embedded device, a programmable device, a smart mobile terminal, etc. The specific embodiment is as follows:

[0109] A storage device 500 stores therein an instruction set, wherein the instruction set is used to execute: creating a virtual traffic sharing pool;

[0110] Establish a conditional constraint model based on the remaining traffic of each virtual traffic sharing pool and the traffic demand of the device;

[0111] Applying the 0-1 programming method to the conditional constraint model to find the optimal solution;

[0112] Adjust the package according to the optimal solution;

[0113] Determine the actual traffic sharing pool used;

[0114] Allocate traffic to the front-end device for each real traffic sharing pool based on the optimal solution and package details.

[0115] Furthermore, the instruction set is further configured to execute: adjusting the package according to the optimal solution, further comprising the steps of:

[0116] Determine whether the data traffic requirements of all devices are still met after the cancellation of the corresponding old package. If so, cancel the corresponding old package;

[0117] Determine whether the existing package meets the traffic requirements of all devices. If not, apply for a new package.

[0118] Furthermore, the instruction set is further configured to execute: determining the actually used traffic sharing pool, specifically including the steps of:

[0119] The virtual traffic sharing pool is processed according to the optimal solution and package details, the traffic sharing pool corresponding to 0 in the optimal solution is removed, the traffic sharing pool corresponding to 1 in the optimal solution is retained, and the remaining traffic of the real traffic sharing pool is determined.

[0120] Furthermore, the instruction set is further configured to execute: allocating traffic to the front-end device for each real traffic sharing pool according to the optimal solution and package details, specifically including the steps of:

[0121] If only one of the multiple front-end devices is running at the same time, the corresponding traffic sharing pool will only provide traffic to the running device;

[0122] If multiple front-end devices are running at the same time, the corresponding traffic sharing pool distributes traffic based on the ratio between the average historical traffic demands of the multiple front-end devices;

[0123] If there is a front-end device with special flow demand, flow distribution is performed based on the ratio between the estimated flow value of the special flow demand and the average flow demand of other front-end devices at ordinary times.

[0124] Furthermore, the instruction set is further configured to execute:

[0125] The creation of the virtual traffic sharing pool specifically further includes the following steps:

[0126] A virtual traffic sharing pool is established based on all traffic packages of the service provider.

[0127] The storage device 500 can automatically distribute traffic without manual intervention, thus saving both labor costs and time.

[0128] See below Figure 6 , a specific implementation of a traffic sharing system 600 is described:

[0129] A traffic sharing system 600 includes: a front-end device 601, a server 602 and a user client 603; the server 602 is connected to the front-end device 601 and the user client 603 respectively; the front-end device 601 is used to apply for a traffic package; the server 602 is used to run the traffic sharing method mentioned above; the user client 603 is used to receive prompt information sent by the server 602.

[0130] The front-end device 601 can be used to install SIM cards, such as cameras, tablets, etc. The user client 603 can be the user's mobile phone, etc., which will receive a corresponding text message to remind the user to cancel some packages of the SIM card of the camera he is responsible for or apply for a new package.

[0131] The system 600 can automatically distribute traffic without manual intervention, thus saving both labor costs and time.

[0132] Finally, it should be noted that although the above embodiments have been described in the specification and drawings of this application, this does not limit the scope of patent protection of this application. All technical solutions generated by replacing or modifying equivalent structures or equivalent processes based on the essential concepts of this application using the contents recorded in the specification and drawings of this application, as well as directly or indirectly implementing the technical solutions of the above embodiments in other related technical fields, are included in the scope of patent protection of this application.

Claims

1. A method for traffic sharing, characterized in that: Including steps: Create a virtual traffic sharing pool; Establish a conditional constraint model based on the remaining traffic of each virtual traffic sharing pool and the traffic demand of the device; Applying the 0-1 programming method to the conditional constraint model to find the optimal solution; Adjust the package according to the optimal solution; Determine the actual traffic sharing pool used; Allocate traffic to the front-end device from each real traffic sharing pool according to the optimal solution and package details; The method further includes allocating traffic to the front-end device from each real traffic sharing pool according to the optimal solution and package details: If only one of the multiple front-end devices is running at the same time, the corresponding traffic sharing pool will only provide traffic to the running device; If multiple front-end devices are running at the same time, the corresponding traffic sharing pool distributes traffic based on the ratio between the average historical traffic demands of the multiple front-end devices; If there is a front-end device with special traffic demand, traffic allocation is performed based on the ratio between the estimated traffic value of the special traffic demand and the average traffic demand of other front-end devices at ordinary times; and the package adjustment based on the optimal solution also includes the steps of: Determine whether the traffic requirements of all devices are still met after canceling the corresponding old package. If so, cancel the corresponding old package.

2. A traffic sharing method according to claim 1, characterized in that: The determining of the actually used traffic sharing pool specifically further includes the steps of: The virtual traffic sharing pool is processed according to the optimal solution and package details, the traffic sharing pool corresponding to 0 in the optimal solution is removed, the traffic sharing pool corresponding to 1 in the optimal solution is retained, and the remaining traffic of the real traffic sharing pool is determined.

3. A traffic sharing method according to any one of claims 1 to 2, characterized in that: The creation of the virtual traffic sharing pool specifically further includes the following steps: A virtual traffic sharing pool is established based on all traffic packages of the service provider.

4. A storage device storing an instruction set, characterized in that: The instruction set is used to execute: creating a virtual traffic sharing pool; Establish a conditional constraint model based on the remaining traffic of each virtual traffic sharing pool and the traffic demand of the device; Applying the 0-1 programming method to the conditional constraint model to find the optimal solution; Adjust the package according to the optimal solution; Determine the actual traffic sharing pool used; Allocate traffic to the front-end device from each real traffic sharing pool according to the optimal solution and package details; the instruction set is also used to execute: adjusting the package according to the optimal solution, further comprising the steps of: Determine whether the data traffic requirements of all devices are still met after the cancellation of the corresponding old package. If so, cancel the corresponding old package; The instruction set is further configured to execute: allocating traffic to the front-end device from each real traffic sharing pool according to the optimal solution and package details, specifically including the steps of: If only one of the multiple front-end devices is running at the same time, the corresponding traffic sharing pool will only provide traffic to the running device; If multiple front-end devices are running at the same time, the corresponding traffic sharing pool distributes traffic based on the ratio between the average historical traffic demands of the multiple front-end devices; If there is a front-end device with special flow demand, flow distribution is performed based on the ratio between the estimated flow value of the special flow demand and the average flow demand of other front-end devices at ordinary times.

5. A storage device according to claim 4, characterized in that: The instruction set is further configured to execute: determining the actually used traffic sharing pool, specifically including the steps of: The virtual traffic sharing pool is processed according to the optimal solution and package details, the traffic sharing pool corresponding to 0 in the optimal solution is removed, the traffic sharing pool corresponding to 1 in the optimal solution is retained, and the remaining traffic of the real traffic sharing pool is determined.

6. A traffic sharing system, characterized in that: include: Front-end equipment, servers and user clients; The server is connected to the front-end device and the user client respectively; The front-end device is used to apply for a data package; The server is configured to execute the method according to any one of claims 1 to 3; The user client is used to receive the prompt information sent by the server.

Images