CN114448873B - Flow distribution method, system, device and medium based on link pricing strategy - Google Patents
Flow distribution method, system, device and medium based on link pricing strategy Download PDFInfo
- Publication number
- CN114448873B CN114448873B CN202210156066.4A CN202210156066A CN114448873B CN 114448873 B CN114448873 B CN 114448873B CN 202210156066 A CN202210156066 A CN 202210156066A CN 114448873 B CN114448873 B CN 114448873B
- Authority
- CN
- China
- Prior art keywords
- link
- user
- price
- flow
- network
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/38—Flow based routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/11—Identifying congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a flow distribution method, a system, a device and a medium based on a link pricing strategy, wherein the method comprises the following steps: counting the flow number borne by each link at the current moment; judging the current congestion condition according to the flow number borne by the link, and calculating and updating the link price at the next moment according to the congestion condition; publishing pricing rules of the link and pricing rules of the route to a user; a user acquires information issued by a network controller, calculates the price of flow routes from service source ends to destination ends under all paths according to the updated link price, selects an optimal flow distribution scheme and submits a selection result to the network controller; and forwarding the user flow according to the user flow distribution result and updating the link state and the distribution strategy. The invention guides the user to distribute the flow more easily and tend to distribute the flow to the link with lighter congestion degree through the link pricing strategy, thereby achieving the win-win purpose of improving the service quality for the user and realizing the load balance for the network.
Description
Technical Field
The present invention relates to the field of network control and management, traffic scheduling and network load balancing, and in particular, to a method, a system, an apparatus and a medium for traffic allocation based on a link pricing policy.
Background
The application of the internet is rapidly developed, the network brings convenience to human beings, and meanwhile, the continuously increased network flow leads the existing problems of more and more shortage of network bandwidth resources, network congestion and the like to emerge endlessly. Therefore, the network traffic is scientifically planned and flexibly scheduled, so that the improvement of the network resource utilization rate is guaranteed, and the method has important application value.
One of the main tasks of a network system is to balance the traffic load to meet a given quality of service requirement (QoS). In order to meet QoS requirements, the system needs to estimate the available bandwidth of each path according to the network conditions and reasonably distribute the traffic load to the paths. Otherwise, load imbalance may occur, resulting in degraded network performance.
The performance influence caused by the bottleneck of the route, namely the 'short board effect' of the traffic route, is not considered in the existing traffic scheduling algorithm, and the performance of the traffic route depends on the performance of the bottleneck link. And the centralized traffic scheduling and load balancing algorithm has high computational complexity and is difficult to acquire the network traffic demand in time.
Disclosure of Invention
To solve at least one of the technical problems in the prior art to some extent, an object of the present invention is to provide a method, a system, a device and a medium for allocating traffic based on a link pricing policy.
The technical scheme adopted by the invention is as follows:
a flow distribution method based on a link pricing strategy comprises the following steps:
the network controller periodically counts the flow number f borne by each link at the current moment e ；
The network controller judges the current congestion situation according to the flow number carried by the link, and calculates and updates the link price C at the next moment according to the congestion situation e ；
The network controller publishes pricing rules of the link and pricing rules of the route to a user;
a user acquires information issued by a network controller, calculates the price of flow routes from service source ends to destination ends under all paths according to the updated link price, selects an optimal flow distribution scheme and submits a selection result to the network controller;
and the network controller forwards the user flow according to the received user flow distribution result and updates the link state and the distribution strategy.
Further, the flow number f e The formula expression of (1) is:
wherein, the first and the second end of the pipe are connected with each other,
represents the traffic value transmitted by user U on link e, and U = {1, 2.. Multidata, n } represents the set of users in the network.
Further, the flow number is calculated according to the throughput demand of the user, and the specific calculation mode is as follows:
having a non-negative throughput demand γ for user u u The user needs to convert gamma u Source end s of unit flow u To the destination terminal t u (ii) a Source end s u To the destination terminal t u Is represented by the transmission path set
Indicates that user u is on the path
The user can allocate any non-negative value on any path in the path set
Until the flow demand is satisfied, i.e.
The path of traffic transmission consists of multiple links, so the stream transmitted by user u on link e is represented as
Further, the link price C e The calculation formula of (a) is as follows:
C e ＝q e (f e )C e0
wherein w e Is the capacity of the link e, q e (f e ) Is the link utilization, C e0 Is the price of use of link e, fixed relative to e;
the pricing rule is a mechanism for promoting a user to disperse traffic routing to a network node with a lower congestion degree so as to realize network load balancing, that is, the larger the user traffic carried by the same network link is, the higher the price of the unit link is.
Further, the selecting an optimal flow allocation scheme includes:
seeking to meet a user's throughput demand γ u Source end s of u To the destination terminal t u Set of paths between
Calculating the route price of each path in the path set according to the updated link price, and taking the highest link price in the paths as the route unit price of the whole path;
and selecting the path with the lowest price as the optimal flow distribution scheme.
Further, the expression of the routing unit price is as follows:
the pricing rule of the route unit price is determined by the link section with the highest link price, namely, the link section with the highest congestion degree.
Further, the selecting an optimal flow rate allocation scheme further includes:
when the user selects the flow distribution scheme, if the redistributed price is lower than the original price, the flow distribution scheme is reselected; otherwise, the original allocation scheme is not changed.
The other technical scheme adopted by the invention is as follows:
a traffic distribution system based on link pricing policies, comprising:
a flow statistic module for the network controller to periodically count the flow f borne by each link at the current time e ；
The price calculation module is used for judging the current congestion condition by the network controller according to the flow quantity borne by the link, and calculating and updating the next moment according to the congestion conditionLink price C e ；
The rule publishing module is used for publishing the pricing rule of the link and the pricing rule of the route to a user by the network controller;
the scheme selection module is used for acquiring information issued by the network controller, calculating the price of flow routes from each service source end to a destination end under all paths according to the updated link price, selecting an optimal flow distribution scheme and submitting a selection result to the network controller;
and the link updating module is used for forwarding the user flow and updating the link state and the distribution strategy by the network controller according to the received user flow distribution result.
The other technical scheme adopted by the invention is as follows:
a traffic distribution apparatus based on a link pricing policy, comprising:
at least one processor;
at least one memory for storing at least one program;
when executed by the at least one processor, cause the at least one processor to implement the method described above.
The invention adopts another technical scheme that:
a computer readable storage medium in which a processor executable program is stored, which when executed by a processor is for performing the method as described above.
The invention has the beneficial effects that: the invention utilizes the pricing of the link to reflect the congestion degree of the link, guides the user to adjust the flow distribution in real time based on the optimal response algorithm, and routes the flow to the link with lower service carrying capacity so as to improve the self service quality, reduce the bottleneck of the route and relieve the network congestion.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the following description is made on the drawings of the embodiments of the present invention or the related technical solutions in the prior art, and it should be understood that the drawings in the following description are only for convenience and clarity of describing some embodiments in the technical solutions of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flowchart of a traffic allocation method based on a link pricing policy according to an embodiment of the present invention;
fig. 2 is a diagram of a network architecture under control of a network controller for the method of fig. 1.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention. For the step numbers in the following embodiments, they are set for convenience of illustration only, the order between the steps is not limited at all, and the execution order of each step in the embodiments can be adapted according to the understanding of those skilled in the art.
In the description of the present invention, it should be understood that the orientation or positional relationship referred to in the description of the orientation, such as the upper, lower, front, rear, left, right, etc., is based on the orientation or positional relationship shown in the drawings, and is only for convenience of description and simplification of description, and does not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and thus, should not be construed as limiting the present invention.
In the description of the present invention, the meaning of a plurality of means is one or more, the meaning of a plurality of means is two or more, and larger, smaller, larger, etc. are understood as excluding the number, and larger, smaller, inner, etc. are understood as including the number. If the first and second are described for the purpose of distinguishing technical features, they are not to be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated or implicitly indicating the precedence of the technical features indicated.
In the description of the present invention, unless otherwise explicitly limited, terms such as arrangement, installation, connection and the like should be understood in a broad sense, and those skilled in the art can reasonably determine the specific meanings of the above terms in the present invention in combination with the specific contents of the technical solutions.
Referring to fig. 2, fig. 2 is a network topology diagram of an embodiment of the present invention. As shown in fig. 2, an application scenario of a traffic distribution method based on a link pricing policy in the embodiment of the present invention includes a network controller, two hosts, five switches, and a server.
In this embodiment, it is assumed that both host 1 and host 2 need to transmit 1M traffic from the source end to the server end. Source end s u To the destination terminal t u Is represented by the transmission path set
Then
Indicates that host u is on the path
Up-allocated flows, assuming the initial flow allocation of host 1 as
The user can assign any non-negative value to any path in the path set
Until the flow demand is satisfied, i.e.
The path of traffic transmission consists of many segments of links, so the stream transmitted by host u on link e is represented as
Assume the bandwidth capacity w of the links L1-L5 e All 5M, usage price of network C e0 All are 50 yuan.
The process steps for carrying out the process of the invention are described in detail below with reference to FIG. 1.
S1, a network controller periodically counts the flow number f borne by each link at the current moment e ：
Wherein the content of the first and second substances,
representing the traffic value transmitted by host U on link e, U = {1, 2.. Multidata, n } represents the set of users in the network, then
S2, the network controller judges the current congestion situation according to the flow number borne by the link, and calculates and updates the link price C at the next moment according to the congestion situation e The link price calculation process is as follows:
C e ＝q e (f e )C e0
wherein, w e Is the capacity of link e. q. q.s e (f e ) Is the link utilization, C e0 Is the price of the use of the link e, fixed relative to e. The pricing rule is a mechanism for promoting a user to disperse traffic routing to a network node with a lower congestion degree so as to realize network load balancing, namely, the larger the user traffic borne by the same network link is, the higher the price of the unit link is.
Thus, the price of the links is C 1 = 5-membered, C 2 = 5-membered, C 3 = 5-membered, C 4 =10 yuan, C 5 ＝15 yuan;
and S3, the network controller publishes the pricing rule of the link and the pricing rule of the route to a user.
S4, the user obtains the information issued by the network controller, calculates the price of the flow route from each service source end to the destination end under all paths by using the updated link price, then independently selects the flow distribution scheme with low price, and submits the selection result to the network controller, and the specific steps are as follows:
s401, searching gamma meeting user requirements u (s) of u ，t u ) Set of paths between
S402, calculating the route price of each path in the path set according to the updated link price, and taking the highest link price in the paths as the route unit price of the whole path, namely:
the pricing rule of the unit price of the route depends on a section of link with the highest link price, namely, a section of link with the highest congestion degree, and the influence of "bottleneck" is mainly considered here, namely, the service quality of a section of path depends on the service quality of the bottleneck link of the path.
Thus, for host 1, C (L1，L2) = 5-membered, C (L3，L5) =15 yuan;
s403, selecting the path with the lowest price as the optimal flow distribution strategy, and selecting the host 1 to route all the flows to the paths (L3, L5) with lower prices, namely
S5, the network controller forwards the user flow according to the received user flow distribution result and updates a link state and a distribution strategy;
and S6, repeating the steps S1-S5.
From the above embodiments, the method provided by the present invention enables the host 1 to route the traffic to the path with a lighter congestion degree, so that the congestion degree of the host 2 on the original path is also reduced, and load balancing and social benefit maximization are achieved.
In summary, compared with the prior art, the method of the embodiment of the invention has the following beneficial effects:
1. the method for guiding the user to autonomously perform flow distribution based on the link pricing strategy provided by the invention utilizes the link pricing to reflect the congestion degree of the link, guides the user to adjust the flow distribution in real time based on an optimal response algorithm, and routes the flow to the link with lower service carrying capacity so as to improve the service quality of the user, reduce the bottleneck of the route and relieve the network congestion.
2. The invention provides a user and network cooperation mechanism to promote the user and network to disperse the traffic, and by adopting the mechanism, the network cost and the cost of using network service by the user can be effectively reduced, and the load balance of the whole network is realized.
3. The invention provides a process that the user participates in the network flow distribution, and the calculation is dispersed to the client, thereby reducing the calculation amount of the network controller end and effectively improving the operation efficiency of the network.
The present embodiment further provides a traffic distribution system based on a link pricing policy, including:
a flow statistic module for the network controller to periodically count the flow f borne by each link at the current time e ；
The price calculation module is used for judging the current congestion condition by the network controller according to the flow quantity borne by the link, and calculating and updating the price C of the link at the next moment according to the congestion condition e ；
The rule publishing module is used for the network controller to publish the pricing rule of the link and the pricing rule of the route to the user;
the scheme selection module is used for acquiring information issued by the network controller, calculating the price of flow routes from each service source end to a destination end under all paths according to the updated link price, selecting an optimal flow distribution scheme and submitting a selection result to the network controller;
and the link updating module is used for forwarding the user flow and updating the link state and the distribution strategy by the network controller according to the received user flow distribution result.
The traffic distribution system based on the link pricing policy of the embodiment of the invention can execute the traffic distribution method based on the link pricing policy provided by the embodiment of the method of the invention, can execute any combination of the implementation steps of the embodiment of the method, and has corresponding functions and beneficial effects of the method.
The present embodiment further provides a traffic distribution apparatus based on a link pricing policy, including:
at least one processor;
at least one memory for storing at least one program;
when executed by the at least one processor, cause the at least one processor to implement the method of fig. 1.
The traffic distribution device based on the link pricing strategy according to the embodiment of the invention can execute the traffic distribution method based on the link pricing strategy provided by the embodiment of the method of the invention, can execute any combination of the implementation steps of the embodiment of the method, and has corresponding functions and beneficial effects of the method.
The embodiment of the application also discloses a computer program product or a computer program, which comprises computer instructions, and the computer instructions are stored in a computer readable storage medium. The computer instructions may be read by a processor of a computer device from a computer-readable storage medium, and executed by the processor to cause the computer device to perform the method illustrated in fig. 1.
The present embodiment also provides a storage medium, which stores an instruction or a program that can execute the method for allocating traffic based on the link pricing policy provided in the embodiment of the method of the present invention, and when the instruction or the program is executed, any combination of the embodiments of the method can be executed to implement the steps, and the corresponding functions and advantages of the method can be achieved.
In alternative embodiments, the functions/acts noted in the block diagrams may occur out of the order noted in the operational illustrations. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality/acts involved. Furthermore, the embodiments presented and described in the flow charts of the present invention are provided by way of example in order to provide a more comprehensive understanding of the technology. The disclosed methods are not limited to the operations and logic flows presented herein. Alternative embodiments are contemplated in which the order of various operations is changed and in which sub-operations described as part of larger operations are performed independently.
Furthermore, although the present invention is described in the context of functional modules, it should be understood that, unless otherwise stated to the contrary, one or more of the described functions and/or features may be integrated in a single physical device and/or software module, or one or more functions and/or features may be implemented in a separate physical device or software module. It will also be appreciated that a detailed discussion of the actual implementation of each module is not necessary for an understanding of the present invention. Rather, the actual implementation of the various functional modules in the apparatus disclosed herein will be understood within the ordinary skill of an engineer, given the nature, function, and internal relationship of the modules. Accordingly, those skilled in the art can, using ordinary skill, practice the invention as set forth in the claims without undue experimentation. It is also to be understood that the specific concepts disclosed are merely illustrative of and not intended to limit the scope of the invention, which is defined by the appended claims and their full scope of equivalents.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The logic and/or steps represented in the flowcharts or otherwise described herein, e.g., an ordered listing of executable instructions that can be considered to implement logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device.
More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It should be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in memory and executed by a suitable instruction execution system. For example, if implemented in hardware, as in another embodiment, any one or combination of the following techniques, which are known in the art, may be used: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application specific integrated circuit having an appropriate combinational logic gate circuit, a Programmable Gate Array (PGA), a Field Programmable Gate Array (FPGA), or the like.
In the foregoing description of the specification, reference to the description of "one embodiment/example," "another embodiment/example," or "certain embodiments/examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
While embodiments of the present invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. A traffic distribution method based on a link pricing strategy is characterized by comprising the following steps:
network controllerPeriodically counting the flow number f borne by each link at the current moment e ；
The network controller judges the current congestion situation according to the flow number carried by the link, and calculates and updates the link price C at the next moment according to the congestion situation e ；
The network controller publishes pricing rules of the link and pricing rules of the route to a user;
a user acquires information issued by a network controller, calculates the price of flow routes from service source ends to destination ends under all paths according to the updated link price, selects an optimal flow distribution scheme and submits a selection result to the network controller;
the network controller forwards the user flow according to the received user flow distribution result and updates the link state and the distribution strategy;
the pricing rule is a mechanism for promoting a user to distribute traffic and route to a network node with a lower congestion degree so as to realize network load balancing, that is, the larger the user traffic carried by the same network link is, the higher the price of the unit link is.
2. The method according to claim 1, wherein the flow number f is a fixed number of flows e The formula expression of (1) is:
wherein f is e u Representing the traffic value transmitted by user U on link e, U = {1,2, \8230;, n } represents the set of users in the network.
3. The method of claim 1, wherein the link pricing strategy-based traffic distribution method,
the flow number is calculated according to the throughput demand of the user, and the specific calculation mode is as follows:
having a non-negative throughput demand γ for user u u The user needsWill gamma u Source end s of unit flow u To the destination terminal t u (ii) a Source end s u To the destination terminal t u Is represented by the transmission path set
Indicates that user u is on the path
The user can allocate any non-negative value on any path in the path set
Until the flow demand is satisfied, i.e.
The path of traffic transmission consists of multiple links, so the stream transmitted by user u on link e is represented as
4. The method according to claim 1, wherein the link price C is e The calculation formula of (a) is as follows:
C e ＝q e (f e )C e0
wherein w e Is the capacity of the link e, q e (f e ) Is the link utilization, C e0 Is the price of use of link e, fixed relative to e.
5. The method according to claim 1, wherein the selecting an optimal traffic allocation plan comprises:
seeking to meet a user's throughput demand γ u Source end s of u To the destination terminal t u Set of paths between
Calculating the route price of each path in the path set according to the updated link price, and taking the highest link price in the paths as the route unit price of the whole path;
and selecting the path with the lowest price as the optimal flow distribution scheme.
6. The method according to claim 5, wherein the expression of the unit price of the route is as follows:
the pricing rule of the route unit price is determined by the link section with the highest link price, namely, the link section with the highest congestion degree.
7. The method according to claim 5, wherein the selecting an optimal traffic distribution scheme further comprises:
when the user selects the flow distribution scheme, if the redistributed price is lower than the original price, the flow distribution scheme is reselected; otherwise, the original allocation scheme is not changed.
8. A traffic distribution system based on a link pricing policy, comprising:
flow statistics module for network controlPeriodically counting the flow number f borne by each link at the current moment by the aid of the device e ；
The price calculation module is used for judging the current congestion condition by the network controller according to the flow quantity borne by the link, and calculating and updating the price C of the link at the next moment according to the congestion condition e ；
The rule publishing module is used for the network controller to publish the pricing rule of the link and the pricing rule of the route to the user;
the scheme selection module is used for acquiring information issued by the network controller, calculating the price of flow routes from each service source end to a destination end under all paths according to the updated link price, selecting an optimal flow distribution scheme and submitting a selection result to the network controller;
the link updating module is used for forwarding the user flow and updating the link state and the distribution strategy by the network controller according to the received user flow distribution result;
the pricing rule is a mechanism for promoting a user to disperse traffic routing to a network node with a lower congestion degree to realize network load balancing, that is, the larger the user traffic carried by the same network link is, the higher the unit link price is.
9. A traffic distribution apparatus based on a link pricing policy, comprising:
at least one processor;
at least one memory for storing at least one program;
when executed by the at least one processor, cause the at least one processor to implement the method of any one of claims 1-7.
10. A computer-readable storage medium, in which a program executable by a processor is stored, wherein the program executable by the processor is adapted to perform the method according to any one of claims 1 to 7 when executed by the processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210156066.4A CN114448873B (en) | 2022-02-21 | 2022-02-21 | Flow distribution method, system, device and medium based on link pricing strategy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210156066.4A CN114448873B (en) | 2022-02-21 | 2022-02-21 | Flow distribution method, system, device and medium based on link pricing strategy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114448873A CN114448873A (en) | 2022-05-06 |
| CN114448873B true CN114448873B (en) | 2023-03-21 |
Family
ID=81373572
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210156066.4A Active CN114448873B (en) | 2022-02-21 | 2022-02-21 | Flow distribution method, system, device and medium based on link pricing strategy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114448873B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010112853A1 (en) * | 2009-03-31 | 2010-10-07 | British Telecommunications Public Limited Company | Path generation in a packet network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105490941B (en) * | 2015-12-10 | 2018-12-11 | 华南理工大学 | A kind of method for routing based on network Yu user collaboration suspend mode |
| CN105553842B (en) * | 2015-12-10 | 2019-04-09 | 华南理工大学 | A kind of autonomous method for routing of user based on net dormancy |
-
2022
- 2022-02-21 CN CN202210156066.4A patent/CN114448873B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010112853A1 (en) * | 2009-03-31 | 2010-10-07 | British Telecommunications Public Limited Company | Path generation in a packet network |
Non-Patent Citations (1)
| Title |
|---|
| 基于价格调整和流量工程的软件定义数据中心网络传输优化方法;单纯;《电信技术》;20171225(第12期);46-49 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114448873A (en) | 2022-05-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Xie et al. | P4P: explicit communications for cooperative control between P2P and network providers | |
| US8260952B2 (en) | Multi-rate peer-assisted data streaming | |
| EP2171605B1 (en) | Isp-aware peer-to-peer content exchange | |
| CN101543019B (en) | Contribution aware peer-to-peer live streaming service | |
| KR100734846B1 (en) | Method of network resource provisioning for bandwidth guarantee per flow | |
| CN109802998B (en) | Game-based fog network cooperative scheduling excitation method and system | |
| US8977756B2 (en) | SWAN: achieving high utilization in networks | |
| EP0957648A2 (en) | Method and apparatus for distributed control of a multi-class network | |
| KR20060022680A (en) | Method and system for global routing and bandwidth sharing | |
| CN101119308A (en) | Routing device and method of wireless mobile self-organizing network of dynamic assurance service quality | |
| WO2008127574A1 (en) | Available bandwidth estimation | |
| Jiawei et al. | Dynamic and adaptive multi-path routing algorithm based on software-defined network | |
| Wauters et al. | Replica placement in ring based content delivery networks | |
| CN113938394B (en) | Monitoring service bandwidth allocation method and device, electronic equipment and storage medium | |
| CN115834587A (en) | Method and device for selecting target storage server and electronic equipment | |
| JPWO2010109952A1 (en) | Resource allocation request device, resource allocation device, resource allocation request method, and resource allocation method | |
| CN114448873B (en) | Flow distribution method, system, device and medium based on link pricing strategy | |
| Guler et al. | Genetic algorithm enabled virtual multicast tree embedding in Software-Defined Networks | |
| CN109361603B (en) | Method and system for dynamically adjusting equivalent path flow based on programmable switching chip | |
| CN110365588A (en) | Data stream scheduling method, device and SDN controller | |
| Pathan et al. | Priority based energy and load aware routing algorithms for SDN enabled data center network | |
| CN108632066A (en) | A kind of method and apparatus of structure Video Multicast virtual net | |
| CN114448838A (en) | System reliability evaluation method | |
| Seddiki et al. | A non-cooperative game-theoretic framework for resource allocation in network virtualization | |
| CN113949902B (en) | Video distribution control method, system, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |