CN115086898B - Traffic sharing method, system and storage device - Google Patents
Traffic sharing method, system and storage device Download PDFInfo
- Publication number
- CN115086898B CN115086898B CN202210678084.9A CN202210678084A CN115086898B CN 115086898 B CN115086898 B CN 115086898B CN 202210678084 A CN202210678084 A CN 202210678084A CN 115086898 B CN115086898 B CN 115086898B
- Authority
- CN
- China
- Prior art keywords
- flow
- sharing pool
- optimal solution
- package
- pool
- 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
- 238000000034 method Methods 0.000 title claims abstract description 54
- 238000003860 storage Methods 0.000 title claims abstract description 12
- 238000009826 distribution Methods 0.000 claims abstract description 13
- 235000012054 meals Nutrition 0.000 claims description 10
- 238000005516 engineering process Methods 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000001914 filtration Methods 0.000 description 3
- 230000014509 gene expression Effects 0.000 description 3
- 238000004519 manufacturing process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/24—Accounting or billing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M15/00—Arrangements for metering, time-control or time indication ; Metering, charging or billing arrangements for voice wireline or wireless communications, e.g. VoIP
- H04M15/70—Administration or customization aspects; Counter-checking correct charges
- H04M15/765—Linked or grouped accounts, e.g. of users or devices
- H04M15/7652—Linked or grouped accounts, e.g. of users or devices shared by users
Abstract
The present disclosure relates to the field of data processing technologies, and in particular, to a method, a system, and a storage device for traffic sharing. The method for sharing the flow comprises the following steps: creating a virtual traffic sharing pool; establishing a condition constraint model according to the residual flow of each virtual flow sharing pool and the equipment flow demand; solving an optimal solution for the condition constraint model by using a 0-1 programming method; performing package adjustment according to the optimal solution; determining a truly used flow sharing pool; and distributing the flow to the front-end equipment according to the optimal solution and package details. By the method, flow distribution can be automatically performed, manual participation is not needed, and labor cost and time are saved.
Description
Technical Field
The present disclosure relates to the field of data processing technologies, and in particular, to a method, a system, and a storage device for traffic sharing.
Background
With the development of society, more and more terminal devices are used, and more terminal devices need to use traffic for receiving and transmitting information, the traffic is not limited to traffic in which a mobile phone needs to use a SIM card, and a plurality of tablets, cameras and the like also need to install the SIM card to support the traffic.
In the existing flow sharing pool technology, each month of upgrading and distributing the flow pool needs to be manually inquired whether the residual flow of each flow sharing pool can meet the flow requirement of each application device and whether the devices need special flow requirements, so as to judge whether packages need to be added or deleted. The method is time-consuming and labor-consuming by the manual operation method, which is different from the flow requirements of different front-end devices facing a large number of front-end devices.
Disclosure of Invention
In view of the above problems, the present application provides a method for sharing flow, which is used to solve the technical problems in the prior art that the flow demand of a flow sharing pool is manually analyzed, a package is changed, and the like, which is time-consuming and laborious, and the change result is not necessarily optimal. The specific technical scheme is as follows:
a method of traffic sharing, comprising the steps of:
creating a virtual traffic sharing pool;
establishing a condition constraint model according to the residual flow of each virtual flow sharing pool and the equipment flow demand;
solving an optimal solution for the condition constraint model by using a 0-1 programming method;
performing package adjustment according to the optimal solution;
determining a truly used flow sharing pool;
and distributing the flow to the front-end equipment according to the optimal solution and package details.
Further, the package adjustment according to the optimal solution further includes the steps of:
judging whether the flow requirements of all the devices are still met after the old set meal is logged out, if yes, the old set meal is logged out;
judging whether the existing package meets the flow requirements of all the devices, and if not, applying for a new package.
Further, the determining the truly used flow sharing pool specifically further includes the steps of:
and processing the virtual flow sharing pool according to the optimal solution and the package details, removing the flow sharing pool corresponding to 0 in the optimal solution, reserving the flow sharing pool corresponding to 1 in the optimal solution, and determining the residual flow of the real flow sharing pool.
Further, the allocating the flow to the front-end device according to the optimal solution and the package details for each real flow sharing pool specifically further includes the steps of:
if only one device operates in a plurality of front-end devices at the same time, the corresponding flow sharing pool only provides flow for the operated devices;
if a plurality of front-end devices run simultaneously, the corresponding flow sharing pool distributes flow according to the ratio among the historical flow demand averages of the plurality of front-end devices;
if the front-end equipment has special flow requirements, flow distribution is carried out according to the ratio between the estimated required flow value of the special flow requirements and the average value of the normal flow requirements of other front-end equipment.
Further, the creating a virtual flow sharing pool specifically further includes the steps of:
and establishing a virtual flow sharing pool according to all flow packages of the service providers.
In order to solve the technical problems, the invention also provides a storage device, which comprises the following specific technical scheme:
a storage device having stored therein a set of instructions for performing: creating a virtual traffic sharing pool;
establishing a condition constraint model according to the residual flow of each virtual flow sharing pool and the equipment flow demand;
solving an optimal solution for the condition constraint model by using a 0-1 programming method;
performing package adjustment according to the optimal solution;
determining a truly used flow sharing pool;
and distributing the flow to the front-end equipment according to the optimal solution and package details.
Further, the set of instructions is further configured to perform: the package adjustment is performed according to the optimal solution, and the method further comprises the steps of:
judging whether the flow requirements of all the devices are still met after the old set meal is logged out, if yes, the old set meal is logged out;
judging whether the existing package meets the flow requirements of all the devices, and if not, applying for a new package.
Further, the set of instructions is further configured to perform: the method for determining the truly used flow sharing pool specifically further comprises the following steps:
and processing the virtual flow sharing pool according to the optimal solution and the package details, removing the flow sharing pool corresponding to 0 in the optimal solution, reserving the flow sharing pool corresponding to 1 in the optimal solution, and determining the residual flow of the real flow sharing pool.
Further, the set of instructions is further configured to perform: and distributing flow to the front-end equipment according to the optimal solution and package details and for each real flow sharing pool, and specifically further comprising the steps of:
if only one device operates in a plurality of front-end devices at the same time, the corresponding flow sharing pool only provides flow for the operated devices;
if a plurality of front-end devices run simultaneously, the corresponding flow sharing pool distributes flow according to the ratio among the historical flow demand averages of the plurality of front-end devices;
if the front-end equipment has special flow requirements, flow distribution is carried out according to the ratio between the estimated required flow value of the special flow requirements and the average value of the normal flow requirements of other front-end equipment.
Further, the set of instructions is further configured to perform:
the creating the virtual flow sharing pool specifically further comprises the steps of:
and establishing a virtual flow sharing pool according to all flow packages of the service providers.
In order to solve the technical problem, a flow sharing system is also provided. The specific technical scheme is as follows:
a system for traffic sharing, comprising: front-end equipment, a server and a user client;
the server is respectively connected with the front-end equipment and the user client;
the front-end equipment is used for applying for flow packages;
the server is used for running a method for sharing the traffic;
the user client is used for receiving the prompt information sent by the server.
The beneficial effects of the invention are as follows: a method of traffic sharing, comprising the steps of: creating a virtual traffic sharing pool; establishing a condition constraint model according to the residual flow of each virtual flow sharing pool and the equipment flow demand; solving an optimal solution for the condition constraint model by using a 0-1 programming method; performing package adjustment according to the optimal solution; determining a truly used flow sharing pool; and distributing the flow to the front-end equipment according to the optimal solution and package details. By the method, flow distribution can be automatically performed, manual participation is not needed, and labor cost and time are saved.
The foregoing summary is merely an overview of the present application, and is provided to enable one of ordinary skill in the art to make more clear the present application and to be practiced according to the teachings of the present application and to make more readily understood the above-described and other objects, features and advantages of the present application, as well as by reference to the following detailed description and accompanying drawings.
Drawings
The drawings are only for purposes of illustrating the principles, implementations, applications, features, and effects of the present application and are not to be construed as limiting the application.
In the drawings of the specification:
FIG. 1 is a flow chart of a method for traffic sharing according to an embodiment;
FIG. 2 is a flow chart II of a method for traffic sharing according to an embodiment;
FIG. 3 is a flow chart III of a method of traffic sharing according to an embodiment;
FIG. 4 is a flow chart diagram of a method for traffic sharing according to an embodiment;
FIG. 5 is a schematic block diagram of a memory device according to an embodiment;
fig. 6 is a schematic diagram of a system module for traffic sharing according to an embodiment.
Reference numerals referred to in the above drawings are explained as follows:
500. the memory device may be configured to store a plurality of data,
600. a system for the sharing of traffic that is to be shared,
601. the front-end equipment is provided with a front-end,
602. the server is provided with a server which,
603. and a user client.
Detailed Description
In order to describe the possible application scenarios, technical principles, practical embodiments, and the like of the present application in detail, the following description is made with reference to the specific embodiments and the accompanying drawings. The embodiments described herein are only used to more clearly illustrate the technical solutions of the present application, and are therefore only used as examples and are not intended to limit the scope of protection of the present application.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment of the present application. The appearances of the phrase "in various places in the specification are not necessarily all referring to the same embodiment, nor are they particularly limited to independence or relevance from other embodiments. In principle, in the present application, as long as there is no technical contradiction or conflict, the technical features mentioned in the embodiments may be combined in any manner to form a corresponding implementable technical solution.
Unless defined otherwise, technical terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which the present application pertains; the use of related terms herein is for the description of specific embodiments only and is not intended to limit the present application.
In the description of the present application, the term "and/or" is a representation for describing a logical relationship between objects, which means that there may be three relationships, e.g., a and/or B, representing: there are three cases, a, B, and both a and B. In addition, the character "/" herein generally indicates that the front-to-back associated object is an "or" logical relationship.
In this application, terms such as "first" and "second" are used merely to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any actual number, order, or sequence of such entities or operations.
Without further limitation, the use of the terms "comprising," "including," "having," or other like terms in this application is intended to cover a non-exclusive inclusion, such that a process, method, or article of manufacture that comprises a list of elements does not include additional elements but may include other elements not expressly listed or inherent to such process, method, or article of manufacture.
In the present application, the expressions "greater than", "less than", "exceeding", etc. are understood to exclude this number; the expressions "above", "below", "within" and the like are understood to include this number. Furthermore, in the description of the embodiments of the present application, the meaning of "a plurality of" is two or more (including two), and similarly, the expression "a plurality of" is also to be understood as such, for example, "a plurality of groups", "a plurality of" and the like, unless specifically defined otherwise.
As mentioned in the background art, the existing flow sharing pool technology needs to manually query whether the remaining flow of each flow sharing pool can meet the flow requirement of each application device and whether any device needs special flow requirements for each month for upgrading and distributing the flow pool, so as to determine whether to add or delete packages. This manual method is time consuming and laborious, and does not necessarily result in an optimal flow distribution strategy.
Therefore, in the present application, an automatic flow sharing method is provided to solve the above-mentioned technical problems.
Referring to fig. 1 to 4, a description will be given below of a specific embodiment of a flow sharing method:
as shown in fig. 1, a traffic sharing method includes steps S101 to S106.
In step S101, a virtual traffic sharing pool is created. In this embodiment, a virtual traffic sharing pool may be established for all traffic packages according to the service provider, where the traffic packages refer to all traffic packages existing in the service provider, and the virtual traffic sharing pool refers to a traffic sharing pool without a real traffic package. The subsequent real flow sharing pool is a flow package used by the real scene obtained by solving according to the subsequent condition constraint model, so that the real flow sharing pool can be obtained after the virtual flow sharing pool deletes the flow pool which is not used by the real scene.
In step S102, a conditional constraint model is built according to the remaining traffic and device traffic demand of each virtual traffic sharing pool. Wherein the conditional constraint model comprises: an objective function and conditional constraints, wherein each flow sharing pool residual flow and head end equipment flow demand and package fees may generate constraints, the objective function being to minimize package fees generated by the flow sharing pool.
In step S103, an optimal solution is solved for the conditional constraint model by using a 0-1 programming method. In the present embodiment, since the partial variable value is only 0 or 1, the optimal solution is solved using the 0-1 programming method.
In step S104, package adjustment is performed according to the optimal solution. Step S204 of fig. 2 specifically illustrates how package adjustment is performed according to the optimal solution.
In step S204, it is determined whether the flow requirements of all devices are still satisfied after the corresponding old set is logged out, if yes, the corresponding old set is logged out; judging whether the existing package meets the flow requirements of all the devices, and if not, applying for a new package. In practical application, the method specifically comprises the following steps: when part of old packages are cancelled, the flow requirements of all the devices can be met, and in order to save package cost, the old packages are cancelled; when all packages exist and the flow requirements of all devices cannot be met, a new package is applied.
The steps S201 to S203 and S205 to S206 are the same as the steps S101 to S103 and the steps S105 to S106, and will not be repeated.
In step S105, a truly used traffic sharing pool is determined. Step S305 of fig. 3 shows in particular how to determine the actually used traffic sharing.
In step S305, the virtual flow sharing pool is processed according to the optimal solution and the package details, the flow sharing pool corresponding to 0 in the optimal solution is removed, the flow sharing pool corresponding to 1 in the optimal solution is reserved, and the remaining flow of the real flow sharing pool is determined.
The steps S301 to S304 and S306 are the same as the steps S101 to S104 and S106, and will not be repeated.
In step S106, according to the optimal solution and package details, the flow is allocated to the front-end device for each real flow sharing pool. Step S406 of fig. 4 specifically illustrates how to allocate traffic to the head-end equipment for each real traffic sharing pool according to the optimal solution and package details.
In step S406, if only one device is running in the plurality of front-end devices at the same time, the corresponding traffic sharing pool only provides traffic to the running devices; if a plurality of front-end devices run simultaneously, the corresponding flow sharing pool distributes flow according to the ratio among the historical flow demand averages of the plurality of front-end devices; if the front-end equipment has special flow requirements, flow distribution is carried out according to the ratio between the estimated required flow value of the special flow requirements and the average value of the normal flow requirements of other front-end equipment.
By the method, flow distribution can be automatically performed, manual participation is not needed, and labor cost and time are saved.
The following describes the above method in one specific example:
and (3) establishing a model:
let front-end devices a, B, c..m. have flow demand averages x1, x2, x 3..xm; establishing a virtual flow sharing pool for all flow packages of an operator, wherein the flow residual quantity in the flow pool is y1, y2, y 3;
the objective function is to minimize the total package cost:
minZ＝∑ci*bi；
where bi is a 0-1 variable, bi=1 indicates that the corresponding package is applied, bi=0 indicates that the corresponding package is not applied, and ci is the cost per package;
establishing a conditional constraint equation:
flow constraint:
the flow rate allocated to the equipment by the flow pool is smaller than or equal to the residual flow rate yi x bi ≡sigma aij of the flow pool;
the traffic pool assigns a traffic to each device equal to the traffic demand xj= Σaijfor each device;
non-negative constraint: aij is greater than or equal to 0;
here a= [ a11, a12, ], a1m; a21 A22, a2m; ..; an1, an2, anm, aij represents that the ith traffic pool allocates traffic of size aij to the jth device, b= [ b1, b2, b3, & gt, bn ], c= [ c1, c2, c3, & gt, cn, y= [ y1, y2, y3,..yn ], x= [ x1, x2, x3,..xm ], where bi=0 or 1, bi=1 means that the corresponding package is applied, bi=0 means that the corresponding package is not applied, and ci is the cost per package; when the equation is established for the first time, y is the package flow of the application, and the subsequent y is the flow residual quantity in the flow pool updated in real time.
If a special flow demand t exists, replacing xj with xj+t according to the constraint equation of the condition added in practice.
In practical application, if other constraint conditions exist, the conditions can be added by themselves.
Model solving:
the thought of solving the 0-1 programming problem can be realized by adopting an exhaustion method to traverse all combinations of decision variables to obtain the optimal value of the objective function. The hidden enumeration method is to repeatedly construct a filtering condition, continuously delete a solution set worse than the current solution, take a result better than the current optimal solution as a new optimal solution, and construct a new filtering condition by the new optimal solution, so as to repeatedly calculate the optimal solution. The hidden enumeration method improves the exhaustion method through filtering conditions, and can quickly solve the optimal solution. The hidden enumeration method comprises the following steps:
1) Obtaining a feasible solution by using heuristics, and taking the target value of the feasible solution as a current best value Z0;
2) Increasing the filter condition Z > =z0;
3) Arranging Xi from small to large according to Ci; the minimization problem turns the objective function plus a negative sign z= -Z to a maximum problem.
Optimal solution:
if the optimal solution [ a, b ] is obtained by solving; firstly, according to the solved bi=1 application or bi=0, canceling the corresponding flow package, when bi=1, establishing a corresponding real flow sharing pool, and then carrying out flow distribution on the equipment according to the solved equation constraint in the a combined constraint equation, wherein if aij=0 indicates that the ith flow pool does not distribute flow to the jth equipment, and if aij is not equal to 0, the ith flow pool distributes flow with the size of aij to the jth equipment.
An embodiment of a storage device 500 is described below with reference to fig. 5, where the storage device 500 includes, but is not limited to: personal computers, servers, general purpose computers, special purpose computers, network devices, embedded devices, programmable devices, intelligent mobile terminals, and the like. The specific implementation mode is as follows:
a storage device 500 having stored therein a set of instructions for performing: creating a virtual traffic sharing pool;
establishing a condition constraint model according to the residual flow of each virtual flow sharing pool and the equipment flow demand;
solving an optimal solution for the condition constraint model by using a 0-1 programming method;
performing package adjustment according to the optimal solution;
determining a truly used flow sharing pool;
and distributing the flow to the front-end equipment according to the optimal solution and package details.
Further, the set of instructions is further configured to perform: the package adjustment is performed according to the optimal solution, and the method further comprises the steps of:
judging whether the flow requirements of all the devices are still met after the old set meal is logged out, if yes, the old set meal is logged out;
judging whether the existing package meets the flow requirements of all the devices, and if not, applying for a new package.
Further, the set of instructions is further configured to perform: the method for determining the truly used flow sharing pool specifically further comprises the following steps:
and processing the virtual flow sharing pool according to the optimal solution and the package details, removing the flow sharing pool corresponding to 0 in the optimal solution, reserving the flow sharing pool corresponding to 1 in the optimal solution, and determining the residual flow of the real flow sharing pool.
Further, the set of instructions is further configured to perform: and distributing flow to the front-end equipment according to the optimal solution and package details and for each real flow sharing pool, and specifically further comprising the steps of:
if only one device operates in a plurality of front-end devices at the same time, the corresponding flow sharing pool only provides flow for the operated devices;
if a plurality of front-end devices run simultaneously, the corresponding flow sharing pool distributes flow according to the ratio among the historical flow demand averages of the plurality of front-end devices;
if the front-end equipment has special flow requirements, flow distribution is carried out according to the ratio between the estimated required flow value of the special flow requirements and the average value of the normal flow requirements of other front-end equipment.
Further, the set of instructions is further configured to perform:
the creating the virtual flow sharing pool specifically further comprises the steps of:
and establishing a virtual flow sharing pool according to all flow packages of the service providers.
The flow distribution can be automatically performed through the storage device 500, so that manual participation is not needed, and the labor cost and the time are saved.
Referring now to fig. 6, a detailed description of a system 600 for traffic sharing is presented below:
a system 600 for traffic sharing, comprising: front end equipment 601, server 602, and user client 603; the server 602 is connected to the front-end device 601 and the user client 603, respectively; the front-end equipment 601 is configured to apply for a traffic package; the server 602 is configured to perform a method for traffic sharing as mentioned above; the user client 603 is configured to receive the prompt message sent by the server 602.
Wherein the front-end device 601 may be used to mount a SIM card such as a camera, tablet, etc. The user client 603 may be a mobile phone of the user, etc., which receives a corresponding short message to remind the user to log out some packages of the SIM card of the camera in charge of the user or apply for a new package.
The system 600 can automatically perform flow distribution without manual participation, thereby saving labor cost and time.
Finally, it should be noted that, although the foregoing embodiments have been described in the text and the accompanying drawings of the present application, the scope of the patent protection of the present application is not limited thereby. All technical schemes generated by replacing or modifying equivalent structures or equivalent flows based on the essential idea of the application and by utilizing the contents recorded in the text and the drawings of the application, and the technical schemes of the embodiments are directly or indirectly implemented in other related technical fields, and the like, are included in the patent protection scope of the application.
Claims (6)
1. A method of traffic sharing, comprising the steps of:
creating a virtual traffic sharing pool;
establishing a condition constraint model according to the residual flow of each virtual flow sharing pool and the equipment flow demand;
solving an optimal solution for the condition constraint model by using a 0-1 programming method;
performing package adjustment according to the optimal solution;
determining a truly used flow sharing pool;
distributing flow to the front-end equipment according to the optimal solution and package details;
the conditional constraint model includes: an objective function and a conditional constraint, wherein the residual flow of each flow sharing pool, the flow demand of the front-end equipment and the package cost are used for generating constraint conditions, and the objective function is used for minimizing the package cost generated by the flow sharing pool;
the method for determining the truly used flow sharing pool specifically further comprises the following steps:
processing the virtual flow sharing pool according to the optimal solution and package details, removing the flow sharing pool corresponding to 0 in the optimal solution, reserving the flow sharing pool corresponding to 1 in the optimal solution, and determining the residual flow of the real flow sharing pool;
and distributing flow to the front-end equipment according to the optimal solution and package details and for each real flow sharing pool, and specifically further comprising the steps of:
if only one device operates in a plurality of front-end devices at the same time, the corresponding flow sharing pool only provides flow for the operated devices; if a plurality of front-end devices run simultaneously, the corresponding flow sharing pool distributes flow according to the ratio among the historical flow demand averages of the plurality of front-end devices; if the front-end equipment has special flow requirements, flow distribution is carried out according to the ratio between the estimated required flow value of the special flow requirements and the average value of the normal flow requirements of other front-end equipment.
2. The method of traffic sharing according to claim 1, wherein said performing package adjustment according to said optimal solution further comprises the steps of:
judging whether the flow requirements of all the devices are still met after the old set meal is logged out, if yes, the old set meal is logged out;
judging whether the existing package meets the flow requirements of all the devices, and if not, applying for a new package.
3. A method of traffic sharing according to claim 1 or 2, characterized in that said creating a virtual traffic sharing pool, in particular further comprises the steps of:
and establishing a virtual flow sharing pool according to all flow packages of the service providers.
4. A storage device having stored therein a set of instructions for performing: creating a virtual traffic sharing pool;
establishing a condition constraint model according to the residual flow of each virtual flow sharing pool and the equipment flow demand;
solving an optimal solution for the condition constraint model by using a 0-1 programming method;
performing package adjustment according to the optimal solution;
determining a truly used flow sharing pool;
distributing flow to the front-end equipment according to the optimal solution and package details;
the conditional constraint model includes: an objective function and a conditional constraint, wherein the residual flow of each flow sharing pool, the flow demand of the front-end equipment and the package cost are used for generating constraint conditions, and the objective function is used for minimizing the package cost generated by the flow sharing pool;
the method for determining the truly used flow sharing pool specifically further comprises the following steps:
processing the virtual flow sharing pool according to the optimal solution and package details, removing the flow sharing pool corresponding to 0 in the optimal solution, reserving the flow sharing pool corresponding to 1 in the optimal solution, and determining the residual flow of the real flow sharing pool;
and distributing flow to the front-end equipment according to the optimal solution and package details and for each real flow sharing pool, and specifically further comprising the steps of:
if only one device operates in a plurality of front-end devices at the same time, the corresponding flow sharing pool only provides flow for the operated devices; if a plurality of front-end devices run simultaneously, the corresponding flow sharing pool distributes flow according to the ratio among the historical flow demand averages of the plurality of front-end devices; if the front-end equipment has special flow requirements, flow distribution is carried out according to the ratio between the estimated required flow value of the special flow requirements and the average value of the normal flow requirements of other front-end equipment.
5. The storage device of claim 4, wherein the set of instructions is further configured to perform: the package adjustment is performed according to the optimal solution, and the method further comprises the steps of:
judging whether the flow requirements of all the devices are still met after the old set meal is logged out, if yes, the old set meal is logged out;
judging whether the existing package meets the flow requirements of all the devices, and if not, applying for a new package.
6. A system for traffic sharing, comprising: front-end equipment, a server and a user client;
the server is respectively connected with the front-end equipment and the user client;
the front-end equipment is used for applying for flow packages;
the server for running the method of claim 1 or 2;
the user client is used for receiving the prompt information sent by the server.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210678084.9A CN115086898B (en) | 2022-06-15 | 2022-06-15 | Traffic sharing method, system and storage device |
| CN202311427745.1A CN117641273A (en) | 2022-06-15 | 2022-06-15 | Traffic sharing method, system and storage device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210678084.9A CN115086898B (en) | 2022-06-15 | 2022-06-15 | Traffic sharing method, system and storage device |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311427745.1A Division CN117641273A (en) | 2022-06-15 | 2022-06-15 | Traffic sharing method, system and storage device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115086898A CN115086898A (en) | 2022-09-20 |
| CN115086898B true CN115086898B (en) | 2023-12-29 |
Family
ID=83252560
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311427745.1A Pending CN117641273A (en) | 2022-06-15 | 2022-06-15 | Traffic sharing method, system and storage device |
| CN202210678084.9A Active CN115086898B (en) | 2022-06-15 | 2022-06-15 | Traffic sharing method, system and storage device |
Family Applications Before (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311427745.1A Pending CN117641273A (en) | 2022-06-15 | 2022-06-15 | Traffic sharing method, system and storage device |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN117641273A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8065676B1 (en) * | 2007-04-24 | 2011-11-22 | Hewlett-Packard Development Company, L.P. | Automated provisioning of virtual machines for a virtual machine buffer pool and production pool |
| CN104902516A (en) * | 2015-05-29 | 2015-09-09 | 广州供电局有限公司 | Method and system for configuring flow |
| CN108270582A (en) * | 2016-12-31 | 2018-07-10 | 中国移动通信集团湖北有限公司 | The treating method and apparatus of floating resources |
| CN111160686A (en) * | 2019-10-12 | 2020-05-15 | 南京行者易智能交通科技有限公司 | Driving plan generation method and device |
| CN112235474A (en) * | 2020-12-14 | 2021-01-15 | 深圳杰睿联科技有限公司 | Method, device and equipment for scheduling prepaid flow code number |
| CN112469081A (en) * | 2021-01-28 | 2021-03-09 | 北京树米网络科技有限公司 | Method and device for processing total flow data of shared flow pool |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8336054B2 (en) * | 2006-07-20 | 2012-12-18 | Hewlett-Packard Development Company, L. P. | System and method for allocating capacity of shared resources to a workload |
-
2022
- 2022-06-15 CN CN202311427745.1A patent/CN117641273A/en active Pending
- 2022-06-15 CN CN202210678084.9A patent/CN115086898B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8065676B1 (en) * | 2007-04-24 | 2011-11-22 | Hewlett-Packard Development Company, L.P. | Automated provisioning of virtual machines for a virtual machine buffer pool and production pool |
| CN104902516A (en) * | 2015-05-29 | 2015-09-09 | 广州供电局有限公司 | Method and system for configuring flow |
| CN108270582A (en) * | 2016-12-31 | 2018-07-10 | 中国移动通信集团湖北有限公司 | The treating method and apparatus of floating resources |
| CN111160686A (en) * | 2019-10-12 | 2020-05-15 | 南京行者易智能交通科技有限公司 | Driving plan generation method and device |
| CN112235474A (en) * | 2020-12-14 | 2021-01-15 | 深圳杰睿联科技有限公司 | Method, device and equipment for scheduling prepaid flow code number |
| CN112469081A (en) * | 2021-01-28 | 2021-03-09 | 北京树米网络科技有限公司 | Method and device for processing total flow data of shared flow pool |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115086898A (en) | 2022-09-20 |
| CN117641273A (en) | 2024-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106067858A (en) | Communication means between container, Apparatus and system | |
| CN109685429B (en) | Distribution capacity determining method and device, electronic equipment and storage medium | |
| CN107635219B (en) | Service package sharing method and device | |
| CN102110016B (en) | Method, device and system for obtaining database connection in a database cluster system | |
| CN105159736A (en) | Establishment method of SaaS software deployment scheme supporting performance analysis | |
| CN105763595A (en) | Method of improving data processing efficiency and server | |
| CN109348434B (en) | Scene information sending method, sending device and terminal equipment | |
| CN113240336A (en) | Task management system based on label | |
| CN107633358B (en) | Facility site selection and distribution method and device | |
| CN110011843A (en) | Alarm information processing method, electronic equipment and storage medium | |
| CN115086898B (en) | Traffic sharing method, system and storage device | |
| CN111796937A (en) | Resource allocation method based on memory, computer equipment and storage medium | |
| CN113037510A (en) | Charging method, charging device and computer readable storage medium | |
| CN110956384A (en) | Distribution task processing method and device, electronic equipment and readable storage medium | |
| CN116886626A (en) | Service data flow limiting method and device, computer equipment and storage medium | |
| CN113449895A (en) | Vehicle dispatching method and device | |
| CN103229485A (en) | Realization method and platform for service capability sharing | |
| CN110335027A (en) | A kind of tax item processing method, device, equipment and system | |
| CN114416298A (en) | Node matching method and device of server, computer equipment and storage medium | |
| CN113159998A (en) | Community service management method and device | |
| CN113554373A (en) | Method and device for managing ex-warehouse of three-dimensional warehouse | |
| CN111914296A (en) | Multi-platform authority unified management method, device, terminal and storage medium | |
| Tomasgard et al. | Stochastic optimization models for distributed communication networks | |
| CN117376423B (en) | Deep learning reasoning service scheduling method, system, equipment and storage medium | |
| CN109784816A (en) | Express delivery distribution method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |