CN112600763B - Low-cost flow distribution implementation method capable of guaranteeing delay - Google Patents
Low-cost flow distribution implementation method capable of guaranteeing delay Download PDFInfo
- Publication number
- CN112600763B CN112600763B CN202011424769.8A CN202011424769A CN112600763B CN 112600763 B CN112600763 B CN 112600763B CN 202011424769 A CN202011424769 A CN 202011424769A CN 112600763 B CN112600763 B CN 112600763B
- Authority
- CN
- China
- Prior art keywords
- link
- node
- bandwidth
- flow
- traffic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/52—Queue scheduling by attributing bandwidth to queues
- H04L47/522—Dynamic queue service slot or variable bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/56—Queue scheduling implementing delay-aware scheduling
-
- 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/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention relates to a low-cost flow distribution realization method for ensuring delay, which comprises the following steps: the node receives the transmission service requirement from the adjacent node and requires to provide bandwidth and maximum guarantee delay; the node acquires the reachability information and the link delay of the link by sending the test message; acquiring link cost and link bandwidth; calling a service allocation algorithm SAA; if the calling is successful, setting the reserved flow bandwidth of the link according to the link distribution flow scheme returned by the algorithm SAA, and informing the flow identification number which is successfully distributed and used by the service demand of the adjacent node; if the calling fails, informing the adjacent node of the failure; and finishing exiting. The invention solves the problem of ensuring delayed dynamic flow distribution in the network communication of the Internet of things by constructing a service distribution algorithm SAA.
Description
Technical Field
The invention relates to the technical field of internet of things network communication, in particular to a low-cost flow distribution realization method for guaranteeing delay.
Background
The future internet of things network is composed of a large number of low-cost devices, the devices and access points or adjacent devices are in dynamic communication in multiple communication modes, but the internet of things network has the characteristics of mobility, dynamics, self-organizing property, low power consumption and the like, so that a protocol which plays a great role in the traditional computer network is difficult to apply, particularly certain services in the internet of things are very sensitive to delay, and the minimum delay of data transmission is required to be ensured.
Currently, in the internet of things network, the routing scheme based on the service quality constraint includes two types, namely bandwidth constraint and delay constraint. Existing network routing schemes based on delay constraints are based on so-called "average delay", which is to bring average link delay based on media access such as CSMA into a routing algorithm to find a route meeting the average delay. In the existing hop-by-hop packet forwarding scheme, a scheme for realizing dynamic traffic distribution of services on a plurality of links according to cost under the condition of ensuring delay has not been researched.
It can be seen that there is a problem in the prior art of dynamic traffic allocation that lacks guaranteed delay.
The above drawbacks are expected to be overcome by those skilled in the art.
Disclosure of Invention
Technical problem to be solved
In order to solve the above problems in the prior art, the invention provides a low-cost traffic distribution implementation method for guaranteeing delay, and the problem of guaranteeing delayed dynamic traffic distribution in internet of things network communication is solved by constructing a service distribution algorithm (SAA).
(II) technical scheme
In order to achieve the purpose, the invention adopts the main technical scheme that:
an embodiment of the present invention provides a method for implementing low-cost traffic distribution with guaranteed delay, including the following steps:
step S100, a node N receives a transmission service requirement S from an adjacent node M and requires to provide a bandwidth W and a maximum guarantee delay d reaching a node X;
step S200, the node N is towards the link L MN Other links send test message to obtain reachability information A of link X ；
Step S300, the node N according to the accessibility information A X Sending a delay test message to the link capable of reaching the node X, and acquiring the link delay d of the link capable of reaching the node X X ；
Step S400, the node N according to the accessibility information A X Obtaining the link cost C of the link which can reach the node X X And link bandwidth R X ；
Step S500, the node N according to the link cost C X Link bandwidth R X And link delay d X Calling a service allocation algorithm SAA to meet the link flow allocation of the service requirement S under the condition of maximum guaranteed delay d;
step S600, judging whether the service allocation algorithm SAA is successfully called, if the service allocation algorithm SAA is successfully called, turning to step S700, and if the service allocation algorithm SAA is unsuccessfully called, turning to step S800;
step S700, the node N sets the reserved flow bandwidth of the link which can reach the node X according to the link distribution flow scheme returned by the service distribution algorithm SAA, informs the adjacent node M of the service which can provide the service requirement S and the flow identification number SID, and goes to step S900;
step S800, informing the adjacent node M that the service of the service requirement S can not be provided;
and step S900, ending and exiting.
In an embodiment of the present invention, the transmitting the service requirement S in step S100 further includes:
the transmission service request S is sent by the node M to the node N in the form of a request message, which contains the bandwidth W required to provide the arrival at the node X, the maximum guaranteed delay d, and a unique identifier identifying the request message.
In one embodiment of the present invention, the reachability information a of the link to reach node X in step S200 X The method also comprises the following steps:
for obtaining reachability information A of each link to reach node X X Node N needs to go to link L MN Other links than the link transmitting the test message, generating reachability information A according to whether the response message is answered X ；
Reachability information a X Consists of a number of components, which can be expressed as:
A x ＝(A X1 ，A X2 ，…，A Xk ，…，A Xn )
where k is the link number, A Xk Is the reachability information of node N to node X via the k-th link, N is the division link L MN Number of links other than A Xk Is 0, meaning unreachable, A Xk Is 1, indicating reachable.
In one embodiment of the present invention, the link delay d of the link that can reach the node X in the step S300 X The method also comprises the following steps:
to obtain the link delay d of the link that can reach node X X Node N needs to be based on reachability information A X Sending delay test message to the link which can reach the node X, and generating link delay d according to the time difference between the sending delay test message and the receiving delay test response message X ；
Link delay d X Consists of a number of components, which can be expressed as:
d X ＝(d X1 ，d X2 ，…，d Xi ，…，d Xm )
where i is the number of links that can reach node X, d Xi Is the link delay of the link through which node N can reach node X via the ith link, m is the division of link L MN Number of links beyond that which can reach node X, d Xi The unit of (d) is in microseconds.
In one embodiment of the present invention, the link cost C of the link that can reach the node X in the step S400 X And link bandwidth R X The method also comprises the following steps:
cost of link C X Consists of a number of components, which can be expressed as:
C X ＝(C X1 ，C X2 ，…，C Xi ，…，C Xm )
where i is the number of links that can reach node X, C Xi Is the link cost of the ith link of node N to node X, m is the link cost divided by L MN Number of links other than those that can reach node X, C Xi The value of (b) is a positive integer, and the smaller the value is, the higher the cost is;
link bandwidth R X Consists of a number of components, which can be expressed as:
R X ＝(R X1 ，R X2 ，…，R Xi ，…，R Xm )
where i is the number of links that can reach node X, R Xi Is the link bandwidth of the ith link of node N that can reach node X, m is the division of link L MN Number of links other than that which can reach node X, R Xi The value of (A) is a positive integer, the larger the value, the higher the bandwidth is represented, R Xi The unit of (d) is bits per second.
In an embodiment of the present invention, the service allocation algorithm SAA in step S500 further includes the following steps:
step S501, setting to realize distribution of transmission service requirement S to each linkFirst allocated traffic bandwidth W 1 Complementary allocation of traffic bandwidth W 2 And link allocation traffic bandwidth W + Initializing, setting a circulation variable j to 1, and setting the residual flow W to be distributed D ＝W；
Step S502, judging the residual flow W to be distributed D If W is greater than 0 D If W is greater than 0, go to step S503 D If not, go to step S507;
step S503, judging whether the circulation variable j is less than or equal to the dividing link L MN Otherwise, the number m of links which can reach the node X is determined, if j is less than or equal to m, the step goes to step S504, and if j is greater than m, the step goes to step S507;
step S504, judge j link delay d Xj Whether d is less than or equal to the maximum guaranteed delay, if d Xj If d is less than or equal to d, go to step S505 Xj If d is greater than or equal to d, go to step S506;
step S505, calculating the first distributed flow bandwidth W of the jth link j 1 Modifying the residual bandwidth W D ＝W D -W j 1 Go to step S506;
step S506, increasing the loop variable j by 1, and turning to step S502;
step S507, setting a circulation variable j as 1, and turning to step S508;
step S508, determining the remaining flow W to be distributed D If W is greater than 0 D If W is greater than 0, go to step S509, if W is D If not, go to step S513;
step S509, judging whether the loop variable j is less than or equal to the dividing link L MN Otherwise, the number m of links that can reach node X, if j is less than or equal to m, go to step S510, and if j is greater than m, go to step S513;
step S510, judge the j link delay d Xj Whether d is less than or equal to the maximum guaranteed delay, if d Xj If d is less than or equal to d, go to step S511 Xj If d is greater than or equal to d, go to step S512;
step S511, calculating the complementary distribution flow bandwidth of the j linkW j 2 Modifying the residual bandwidth W D ＝W D -W j 2 Go to step S512;
step S512, increasing the loop variable j by 1, and turning to step S508;
step S513, judging the remaining flow W to be distributed D Whether or not it is greater than 0, if W D If W is greater than 0, go to step S514 D If not, go to step S515;
step S514, returning to the calling failure, notifying the caller that the service allocation algorithm SAA fails, and exiting;
step S515, according to the link, firstly distributing the flow bandwidth W 1 And complementary allocation of traffic bandwidth W 2 Calculating the link allocation traffic bandwidth W + And returning to the calling success and link distribution flow scheme, informing the caller that the SAA is successful, and exiting.
In an embodiment of the present invention, in the step S501, the traffic bandwidth W is allocated for the first time 1 Complementary allocation of traffic bandwidth W 2 And link allocation traffic bandwidth W + The method also comprises the following steps:
first allocation of traffic bandwidth W 1 Complementary allocation of traffic bandwidth W 2 And link allocation traffic bandwidth W + Consists of a number of components, which can be expressed as:
where i is the number of links that can reach node X, W i 1 Is the first allocated traffic bandwidth, W, of the ith link of node N that can reach node X i 2 Is the ith entry of node N can arriveComplementary allocated traffic bandwidth, W, for the link of node X i + The link distribution flow bandwidth of the ith link which can reach the node X of the node N, m is the link L MN Number of links, W, beyond that which can reach node X 1 、W 2 And W + The initial value of each component is zero.
In an embodiment of the present invention, in the step S505, the first allocated traffic bandwidth W of the jth link is calculated j 1 The method also comprises the following steps:
calculating the first distributed flow bandwidth W of the jth link according to the following formula j 1 ：
Where i and j are the number of links that can reach node X, and m is the number of links other than L MN Number of links, W, beyond that which can reach node X D Is the remaining flow to be allocated, C Xi And C Xj The link cost, R, of the ith and jth links to node N that can reach node X Xi And R Xj Is the link bandwidth of the ith and jth links of node N that can reach node X.
In an embodiment of the present invention, the step S511 further allocates the traffic bandwidth W j 2 The method also comprises the following steps:
calculating the complementary distribution flow bandwidth W of the jth link according to the following formula j 2 ：
Where i and j are the number of links that can reach node X, and m is the number of links other than L MN Number of links, W, beyond that which can reach node X D Is the remaining flow to be allocated, C Xi And C Xj The link cost, R, of the ith and jth links to node N that can reach node X Xi And R Xj Is the link bandwidth of the ith and jth links of node N that can reach node X, WT j 2 Is an intermediate variable for temporarily storing the bandwidth W of the supplementary allocated traffic j 2 The intermediate calculation result of (2).
In an embodiment of the present invention, the link allocating flow scheme in step S515 further includes:
the link allocation flow scheme refers to link allocation flow bandwidth W + Calculating the link allocation flow bandwidth W according to the following formula + ：
W i + ＝W i 1 +W i 2
Where i is the number of links that can reach node X, W i 1 Is the first allocated traffic bandwidth, W, of the ith link of node N that can reach node X i 2 Is the supplemental allocated traffic bandwidth for the ith link of node N that can reach node X.
In an embodiment of the present invention, the stream identification number SID in step S700 further includes:
the node N notifies the neighboring node M of the service that can provide the service of the service demand S through a message, where the message includes a stream identifier SID, and all the traffic using the service demand S sent by the node M needs to identify the stream identifier SID in the traffic, so that the node N performs traffic allocation according to the link allocation traffic scheme of the service demand S.
(III) advantageous effects
The beneficial effects of the invention are: the low-cost flow distribution implementation method for guaranteeing the delay provided by the embodiment of the invention solves the problem of guaranteeing the delayed dynamic flow distribution in the internet of things network communication by constructing the service distribution algorithm SAA.
Drawings
Fig. 1 is a flowchart of a method for implementing low-cost traffic distribution with guaranteed delay according to an embodiment of the present invention;
fig. 2 is a flowchart of a service allocation algorithm SAA according to an embodiment of the present invention.
Detailed Description
For the purpose of better explaining the present invention and to facilitate understanding, the present invention will be described in detail by way of specific embodiments with reference to the accompanying drawings.
All technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items
Fig. 1 is a flowchart of a method for implementing guaranteed-delay low-cost traffic allocation according to an embodiment of the present invention, as shown in fig. 1, the method includes the following steps:
as shown in fig. 1, in step S100, a node N receives a transmission service request S from an adjacent node M, and requires to provide a bandwidth W and a maximum guaranteed delay d to reach a node X;
as shown in FIG. 1, in step S200, node N is connected to link L MN Other links send test message to obtain reachability information A of link X ；
As shown in fig. 1, in step S300, the node N is based on the reachability information a X Sending a delay test message to the link which can reach the node X, and acquiring the link delay d of the link which can reach the node X X ；
As shown in fig. 1, in step S400, the node N is based on the reachability information a X Obtaining the link cost C of the link which can reach the node X X And link bandwidth R X ；
As shown in FIG. 1, in step S500, node N depends on the link cost C X Link bandwidth R X And link delay d X Calling a service allocation algorithm SAA to meet the link flow allocation of the service requirement S under the condition of maximum guaranteed delay d;
as shown in fig. 1, in step S600, it is determined whether the service allocation algorithm SAA is successfully called, if the service allocation algorithm SAA is successfully called, the process goes to step S700, and if the service allocation algorithm SAA is unsuccessfully called, the process goes to step S800;
as shown in fig. 1, in step S700, the node N sets a reserved traffic bandwidth of a link that can reach the node X according to a link allocation traffic scheme returned by the service allocation algorithm SAA, notifies the adjacent node M of a service that can provide the service requirement S and a stream identification number SID, and goes to step S900;
as shown in fig. 1, in step S800, the neighboring node M is notified that the service of the service requirement S cannot be provided;
as shown in fig. 1, step S900 is terminated and exited.
In the technical solution provided by the embodiment of the present invention shown in fig. 1, the link cost C of the link that can reach the node X X Is a metric determined by one or more factors and can be selected according to actual needs.
In the technical solution provided by the embodiment of the present invention shown in fig. 1, the problem of guaranteeing delayed dynamic traffic allocation in internet of things network communication is solved by constructing a service allocation algorithm SAA.
The specific implementation of the steps of the embodiment shown in fig. 1 is described in detail below:
in step S100, node N receives a transmission service request S from an adjacent node M, and requests to provide a bandwidth W and a maximum guaranteed delay d to reach node X.
In one embodiment of the invention, the transmission service request S is sent by the node M to the node N in the form of a request message containing the bandwidth W required to provide the arrival at the node X, the maximum guaranteed delay d and a unique identifier identifying the request message.
In step S200, node N is connected to link L MN Other links than the link send test messages to obtain the accessibility information A of the link X 。
In one embodiment of the invention, the reachability information A of each link to reach the node X is acquired X Node N needs to go to link L MN Other links than the one on which the test message is sent,generating reachability information A from response message X ；
Reachability information a X Consists of a number of components, which can be expressed as:
A x ＝(A X1 ，A X2 ，…，A Xk ，…，A Xn )
where k is the link number, A Xk Is the reachability information of node N to node X via the k-th link, N is the division link L MN Number of links other than A Xk Is 0, meaning unreachable, A Xk Is 1, indicating reachable.
In step S300, the node N is based on the reachability information a X Sending a delay test message to the link which can reach the node X, and acquiring the link delay d of the link which can reach the node X X 。
In one embodiment of the invention, the link delay d for obtaining the link that can reach node X is determined X Node N needs to be based on reachability information A X Sending delay test message to the link which can reach the node X, and generating link delay d according to the time difference between the sending delay test message and the receiving delay test response message X ；
Link delay d X Consists of a number of components, which can be expressed as:
d X ＝(d X1 ，d X2 ，…，d Xi ，…，d Xm )
where i is the number of links that can reach node X, d Xi Is the link delay of the link through which node N can reach node X through the ith, m is the division of link L MN Number of links beyond that which can reach node X, d Xi The unit of (d) is in microseconds.
In step S400, the node N is based on the reachability information a X Obtaining the link cost C of the link that can reach the node X X And link bandwidth R X 。
In one embodiment of the invention, the link cost C X Consists of a number of components, which can be expressed as:
C X ＝(C X1 ，C X2 ，…，C Xi ，…，C Xm )
where i is the number of links that can reach node X, C Xi Is the link cost of the ith link of node N to node X, m is the link L MN Number of links other than those that can reach node X, C Xi The value of (A) is a positive integer, and the smaller the value is, the higher the cost is;
link bandwidth R X Consists of a number of components, which can be expressed as:
R X ＝(R X1 ，R X2 ，…，R Xi ，…，R Xm )
where i is the number of links that can reach node X, R Xi Is the link bandwidth of the ith link of node N that can reach node X, m is the division of link L MN Number of links other than that which can reach node X, R Xi The value of (A) is a positive integer, the larger the value, the higher the bandwidth is represented, R Xi The unit of (d) is bits per second;
the link cost C can be obtained by accessing the configuration information of the node N X Link bandwidth R X Link cost C X The adjustment can be performed through manual configuration, and can also be calculated according to other configuration information of the node N.
In step S500, node N bases on link cost C X Link bandwidth R X And link delay d X And calling a service allocation algorithm SAA to meet the link flow allocation of the service requirement S under the condition of maximum guaranteed delay d.
In one embodiment of the invention, a node N needs to call a service allocation algorithm SAA, satisfy the link flow allocation of a service requirement S under the condition of maximum guaranteed delay d, call the service allocation algorithm SAA, and need to input a link cost C X Link bandwidth R X And link delay d X Fig. 2 is a flowchart of a service allocation algorithm SAA according to an embodiment of the present invention, which includes the following steps:
as shown in FIG. 2, inIn step S501, the first allocation of traffic bandwidth W to each link is configured to implement the allocation of the transmission service requirement S 1 Complementary allocation of traffic bandwidth W 2 And link allocation traffic bandwidth W + Initializing, setting a circulation variable j to 1, and setting the residual flow W to be distributed D ＝W；
As shown in fig. 2, in step S502, it is judged that there is a remaining flow rate W to be allocated D Whether or not it is greater than 0, if W D If greater than 0, go to step S503, if W D If not, go to step S507;
as shown in FIG. 2, in step S503, it is determined whether or not the loop variable j is equal to or less than the divide link L MN Otherwise, the number m of links which can reach the node X is determined, if j is less than or equal to m, the step goes to step S504, and if j is greater than m, the step goes to step S507;
as shown in FIG. 2, in step S504, the j link delay d is determined Xj Whether or not d is less than or equal to the maximum guaranteed delay d, if d Xj If d is less than or equal to d, go to step S505 Xj If d is greater than or equal to d, go to step S506;
as shown in fig. 2, in step S505, the first allocated traffic bandwidth W of the jth link is calculated j 1 Modifying the residual bandwidth W D ＝W D -W j 1 Go to step S506;
as shown in fig. 2, in step S506, the loop variable j is incremented by 1, and the process goes to step S502;
as shown in fig. 2, in step S507, a loop variable j is set to 1, and the process goes to step S508;
as shown in fig. 2, in step S508, the remaining flow rate W to be allocated is determined D If W is greater than 0 D If W is greater than 0, go to step S509, if W is D If not, go to step S513;
as shown in FIG. 2, in step S509, it is determined whether or not the loop variable j is equal to or less than the divide link L MN Otherwise, the number m of links that can reach the node X is determined, and if j is less than or equal to m, the process goes to step S510, and if j is greater than m, the process goes to step S513;
as shown in FIG. 2, in step S510, it is determinedJth link delay d Xj Whether d is less than or equal to the maximum guaranteed delay, if d Xj If d is less than or equal to d, go to step S511 Xj If d is greater than or equal to d, go to step S512;
as shown in fig. 2, in step S511, the complementary allocated traffic bandwidth W of the jth link is calculated j 2 Modifying the residual bandwidth W D ＝W D -W j 2 Go to step S512;
as shown in fig. 2, in step S512, the loop variable j is incremented by 1, and the process goes to step S508;
as shown in fig. 2, in step S513, it is determined that there is a remaining flow rate W to be allocated D If W is greater than 0 D If W is greater than 0, go to step S514 D If not, go to step S515;
as shown in fig. 2, in step S514, a call failure is returned, the caller is notified that the service allocation algorithm SAA fails, and the process exits;
as shown in fig. 2, in step S515, the traffic bandwidth W is first allocated according to the link 1 And complementary allocation of traffic bandwidth W 2 Calculating the link allocation traffic bandwidth W + And returning to the calling success and link distribution flow scheme, informing the caller that the SAA is successful, and exiting.
In an embodiment of the present invention, in the step S501, the traffic bandwidth W is allocated for the first time 1 Complementary allocation of traffic bandwidth W 2 And link allocation traffic bandwidth W + The method also comprises the following steps:
first allocation of traffic bandwidth W 1 Complementary allocation of traffic bandwidth W 2 And link allocation traffic bandwidth W + Consists of a number of components, which can be expressed as:
where i is the number of links that can reach node X, W i 1 Is the first allocated traffic bandwidth, W, of the ith link of node N that can reach node X i 2 Is the complementary allocated traffic bandwidth, W, of the ith link of node N that can reach node X i + The link distribution flow bandwidth of the ith link which can reach the node X of the node N, m is the link L MN Number of links, W, beyond that which can reach node X 1 、W 2 And W + The initial value of each component is zero.
In an embodiment of the present invention, in the step S505, the first allocated traffic bandwidth W of the jth link is calculated j 1 The method also comprises the following steps:
calculating the first distributed flow bandwidth W of the jth link according to the following formula j 1 ：
Where i and j are the number of links that can reach node X, and m is the number of links other than L MN Number of links, W, beyond that which can reach node X D Is the remaining flow to be allocated, C Xi And C Xj Is the link cost, R, of the ith and jth links of node N that can reach node X Xi And R Xj Is the link bandwidth of the ith and jth links of node N that can reach node X.
In an embodiment of the present invention, in step S511, the complementary allocated traffic bandwidth W of the jth link is calculated j 2 The method also comprises the following steps:
calculating the supplementary distribution flow bandwidth W of the j link according to the following formula j 2 ：
Where i and j are the number of links that can reach node X, and m is the number of links other than L MN Number of links, W, beyond that which can reach node X D Is the remaining flow to be allocated, C Xi And C Xj Is the link cost, R, of the ith and jth links of node N that can reach node X Xi And R Xj Link bandwidths of the ith and jth links to node X, WT, being node N j 2 Is an intermediate variable for temporarily storing the bandwidth W of the complementary allocation traffic j 2 The intermediate calculation result of (2).
In an embodiment of the present invention, the link allocating flow scheme in step S515 further includes:
the link allocation flow scheme refers to link allocation flow bandwidth W + Calculating the link allocation flow bandwidth W according to the following formula + ：
W i + ＝W i 1 +W i 2
Where i is the number of links that can reach node X, W i 1 Is the first allocated traffic bandwidth, W, of the ith link of node N that can reach node X i 2 Is the complementary allocated traffic bandwidth for the ith link of node N that can reach node X.
In step S600, it is determined whether the service allocation algorithm SAA call is successful, and if the service allocation algorithm SAA call is successful, the process goes to step S700, and if the service allocation algorithm SAA call is failed, the process goes to step S800.
In one embodiment of the present invention, different processing operations need to be taken according to whether the service allocation algorithm SAA call is successful or not. If the calling is successful, the step S700 is required to be carried out, the node N is completed, the reserved flow bandwidth of the link which can reach the node X is set according to the link distribution flow scheme returned by the service distribution algorithm SAA, and the adjacent node M is informed of the service which can provide the service requirement S and the flow identification number SID; if the call fails, the process goes to step S800 to notify the neighboring node M that the service of the service requirement S cannot be provided.
In step S700, the node N sets a reserved traffic bandwidth of a link that can reach the node X according to the link allocation traffic scheme returned by the service allocation algorithm SAA, notifies the neighboring node M of the service that can provide the service requirement S and the stream identifier SID, and proceeds to step S900.
In an embodiment of the present invention, the step is a subsequent processing procedure of successfully invoking the service allocation algorithm SAA in step S500, and step S600 is performed after it is determined that the invocation of the service allocation algorithm SAA is successful, to notify the neighboring node M that the service and the stream identifier SID of the service requirement S can be provided, and reply in the form of a message, where the message is a response to the request message in step S100, and the message must include the unique identifier of the request message in step S100, so that the neighboring node M implements pairing between the request message and the response message.
In an embodiment of the present invention, the streaming identification number SID in step S700 further includes:
the node N notifies the neighboring node M of the service that can provide the service of the service demand S through a message, where the message includes a stream identifier SID, and all the traffic using the service demand S sent by the node M needs to identify the stream identifier SID in the traffic, so that the node N performs traffic allocation according to the link allocation traffic scheme of the service demand S.
In step S800, the neighboring node M is notified that the service of the traffic demand S cannot be provided.
In an embodiment of the present invention, the step is a subsequent processing procedure of calling the service allocation algorithm SAA in failure in step S500, and the step S600 is executed after determining that the calling of the service allocation algorithm SAA fails, to notify the neighboring node M that the service of the service requirement S cannot be provided, and reply is performed in the form of a message, where the message is a response to the request message in step S100, and the message must include a unique identifier of the request message in step S100, so that the neighboring node M implements pairing of the request message and the response message.
In step S900, the process ends and exits.
In one embodiment of the invention, this step is the only exit of the implementation method for low-cost traffic distribution that guarantees delay.
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.
It will be understood that the invention is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the invention is limited only by the appended claims.
Claims (8)
1. A method for implementing low-cost traffic distribution with guaranteed delay, said method comprising the steps of:
step S100, a node N receives a transmission service requirement S from an adjacent node M and requires to provide a bandwidth W and a maximum guarantee delay d reaching a node X;
step S200, the node N is towards the link L MN Other links send test message to obtain reachability information A of link X ；
Step S300, the node N according to the accessibility information A X Sending a delay test message to the link which can reach the node X, and acquiring the link delay d of the link which can reach the node X X ；
Step S400, the node N according to the accessibility information A X Obtaining the link cost C of the link which can reach the node X X And link bandwidth R X ；
Step S500, the node N according to the link cost C X Link bandwidth R X And link delay d X Calling a service allocation algorithm SAA to meet the condition of maximum guaranteed delay dLink traffic distribution of the service requirement S;
step S600, judging whether the service allocation algorithm SAA is successfully called, if the service allocation algorithm SAA is successfully called, turning to step S700, and if the service allocation algorithm SAA is unsuccessfully called, turning to step S800;
step S700, the node N sets the reserved flow bandwidth of the link which can reach the node X according to the link distribution flow scheme returned by the service distribution algorithm SAA, informs the adjacent node M of the service which can provide the service requirement S and the flow identification number SID, and goes to step S900;
step S800, informing the adjacent node M that the service of the service requirement S can not be provided;
and step S900, ending and exiting.
2. The method for implementing guaranteed-delay low-cost traffic allocation according to claim 1, wherein the step S100 of transmitting the traffic demand S further comprises:
the transmission service request S is sent by the node M to the node N in the form of a request message, which contains the bandwidth W required to provide the arrival at the node X, the maximum guaranteed delay d, and a unique identifier identifying the request message.
3. The method for implementing guaranteed-delay low-cost traffic allocation according to claim 1, wherein the service allocation algorithm SAA in step S500 further comprises the following steps:
step S501, setting to realize the first distribution flow bandwidth W distributed to each link by the transmission service requirement S 1 Complementary allocation of traffic bandwidth W 2 And link allocation traffic bandwidth W + And initializing, setting a circulation variable j and initializing to 1, and setting the residual flow W to be distributed D ＝W；
Step S502, judging the residual flow W to be distributed D If W is greater than 0 D If greater than 0, go to step S503, if W D If not, go to step S507;
step S503, judging whether the circulation variable j is less than or equal to the dividing link L MN Is out of reachIf j is less than or equal to m, going to step S504, and if j is greater than m, going to step S507;
step S504, judge j link delay d Xj Whether or not d is less than or equal to the maximum guaranteed delay d, if d Xj If d is less than or equal to d, go to step S505 Xj If d is greater than or equal to d, go to step S506;
step S505, calculating the first distributed flow bandwidth W of the jth link j 1 Modifying the residual bandwidth W D ＝W D -W j 1 Go to step S506;
step S506, increasing the loop variable j by 1, and turning to step S502;
step S507, setting a circulation variable j as 1, and turning to step S508;
step S508, judging the residual flow W to be distributed D Whether or not it is greater than 0, if W D If W is greater than 0, go to step S509, if W is D If not, go to step S513;
step S509, judging whether the circulation variable j is less than or equal to the dividing link L MN Otherwise, the number m of links that can reach the node X is determined, and if j is less than or equal to m, the process goes to step S510, and if j is greater than m, the process goes to step S513;
step S510, judge the j link delay d Xj Whether d is less than or equal to the maximum guaranteed delay, if d Xj If d is less than or equal to d, go to step S511 Xj If d is greater than or equal to d, go to step S512;
step S511, the complementary distribution flow bandwidth W of the j link is calculated j 2 Modifying the residual bandwidth W D ＝W D -W j 2 Go to step S512;
step S512, increasing the loop variable j by 1, and turning to step S508;
step S513, determining the remaining flow W to be distributed D Whether or not it is greater than 0, if W D If greater than 0, go to step S514, if W D If not, go to step S515;
step S514, returning to the calling failure, notifying the caller that the service allocation algorithm SAA fails, and exiting;
step S515, according to the link, firstly allocating the flow bandwidth W 1 And complementary allocation of traffic bandwidth W 2 Calculating the link allocation traffic bandwidth W + And returning to the calling success and link distribution flow scheme, informing the caller that the SAA is successful, and exiting.
4. The method for implementing guaranteed-delay low-cost traffic distribution according to claim 1, wherein the stream identification number SID in step S700 further includes:
the node N informs the adjacent node M of the service capable of providing the service of the service demand S through a message, the message comprises a flow identification number SID, and the flow which uses the service demand S and is sent by the node M all needs to identify the flow identification number SID in the flow so that the node N can carry out flow distribution according to a link distribution flow scheme of the service demand S.
5. The method for implementing guaranteed-delay low-cost traffic allocation according to claim 3, wherein the traffic bandwidth W is allocated for the first time in step S501 1 Complementary allocation of traffic bandwidth W 2 And link allocation traffic bandwidth W + The method also comprises the following steps:
first allocation of traffic bandwidth W 1 Complementary allocation of traffic bandwidth W 2 And link allocation traffic bandwidth W + Consists of a number of components, which can be expressed as:
where i is the number of links that can reach node X, W i 1 Is of node NFirst allocated traffic bandwidth, W, of the ith link that can reach node X i 2 Is the complementary allocated traffic bandwidth, W, of the ith link of node N that can reach node X i + The link distribution flow bandwidth of the ith link which can reach the node X of the node N, m is the link L MN Number of links, W, beyond that which can reach node X 1 、W 2 And W + The initial value of each component is zero.
6. The delay-guaranteed low-cost traffic distribution implementation method according to claim 3, wherein the step S505 of calculating the first-allocated traffic bandwidth W of the j link j 1 The method also comprises the following steps:
calculating the first distributed flow bandwidth W of the jth link according to the following formula j 1 ：
Where i and j are the number of links that can reach node X, and m is the number of links other than L MN Number of links, W, beyond that which can reach node X D Is the remaining flow to be allocated, C Xi And C Xj Is the link cost, R, of the ith and jth links of node N that can reach node X Xi And R Xj Is the link bandwidth of the ith and jth links of node N that can reach node X.
7. The method as claimed in claim 3, wherein the step S511 calculates the complementary allocated traffic bandwidth W of the j link j 2 The method also comprises the following steps:
calculating the supplementary distribution flow bandwidth W of the j link according to the following formula j 2 ：
Where i and j are the number of links that can reach node X, and m is the number of links other than L MN Number of links, W, beyond that which can reach node X D Is the remaining flow to be allocated, C Xi And C Xj Is the link cost, R, of the ith and jth links of node N that can reach node X Xi And R Xj Link bandwidths of the ith and jth links to node X, WT, being node N j 2 Is an intermediate variable for temporarily storing the bandwidth W of the complementary allocation traffic j 2 The intermediate calculation result of (2).
8. The method for implementing guaranteed-delay low-cost traffic distribution according to claim 3, wherein the link distribution traffic scheme in step S515 further includes:
the link allocation flow scheme refers to link allocation flow bandwidth W + Calculating the link allocation flow bandwidth W according to the following formula + ：
W i + ＝W i 1 +W i 2
Where i is the number of links that can reach node X, W i 1 Is the first allocated traffic bandwidth, W, of the ith link of node N that can reach node X i 2 Is the complementary allocated traffic bandwidth for the ith link of node N that can reach node X.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011424769.8A CN112600763B (en) | 2020-12-09 | 2020-12-09 | Low-cost flow distribution implementation method capable of guaranteeing delay |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011424769.8A CN112600763B (en) | 2020-12-09 | 2020-12-09 | Low-cost flow distribution implementation method capable of guaranteeing delay |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112600763A CN112600763A (en) | 2021-04-02 |
| CN112600763B true CN112600763B (en) | 2022-08-19 |
Family
ID=75191135
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011424769.8A Active CN112600763B (en) | 2020-12-09 | 2020-12-09 | Low-cost flow distribution implementation method capable of guaranteeing delay |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112600763B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729430A (en) * | 2010-01-15 | 2010-06-09 | 西安电子科技大学 | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7561526B2 (en) * | 2002-12-17 | 2009-07-14 | Nortel Networks Limited | Communication network route determination |
| US8488490B2 (en) * | 2009-10-14 | 2013-07-16 | At&T Intellectual Property I, L.P. | Methods and apparatus to determine a capacity for a network layer topology |
| JP5716587B2 (en) * | 2011-07-19 | 2015-05-13 | 富士通株式会社 | Route determination device, route determination method, management program, and management device |
| CN106059960B (en) * | 2016-05-24 | 2019-06-04 | 北京交通大学 | A kind of spatial network QoS assurance and administrative center based on software defined network |
| CN107070794B (en) * | 2016-12-08 | 2020-04-10 | 航天东方红卫星有限公司 | Low-orbit information network optimal network benefit time delay constraint routing method |
-
2020
- 2020-12-09 CN CN202011424769.8A patent/CN112600763B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729430A (en) * | 2010-01-15 | 2010-06-09 | 西安电子科技大学 | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty |
Non-Patent Citations (1)
| Title |
|---|
| Dynamic channel allocation scheme with a queue for elastic traffic;G.P. Basharin；等;《2010 International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)》;20101231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112600763A (en) | 2021-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8082361B2 (en) | Method and system for providing a mobile IP network with non-path dependent intra domain quality of service | |
| US6854013B2 (en) | Method and apparatus for optimizing network service | |
| US7496112B1 (en) | Methods and apparatuses for allocating time slots to circuit switched channels | |
| CA2139111C (en) | System and method for call-by-call source routing with rule-based fallbacks | |
| US7035279B2 (en) | Flow allocation in a ring topology | |
| EP1935161B1 (en) | System for dynamic bandwidth adjustment and trading among peers | |
| US8923313B2 (en) | Efficient transmission of data to multiple network nodes | |
| US8572620B2 (en) | Resource management | |
| US7924716B2 (en) | Method and system for coordination of admission control in transport networks | |
| TW201203950A (en) | Method and apparatus for admission control of data in a mesh network | |
| US20110087765A1 (en) | Network bandwidth management system | |
| US7843973B2 (en) | Method and apparatus for constituting transport network based on integrated synch and asynch frame | |
| CN109257282B (en) | Data transmission method and device | |
| CN112600763B (en) | Low-cost flow distribution implementation method capable of guaranteeing delay | |
| CN107251487A (en) | Bandwidth distribution in network | |
| JP2995676B2 (en) | Information communication method | |
| JP2933905B1 (en) | Multicast communication system | |
| US8797853B2 (en) | System and method for checking the permissibility of a use of a service | |
| JP5613261B2 (en) | Method and allocation unit for allocating communication pipes in a communication network | |
| JP5029867B2 (en) | WIRELESS LAN SYSTEM, WIRELESS COMMUNICATION DEVICE, CALL NUMBER ALLOCATION METHOD, AND PROGRAM | |
| US20100067541A1 (en) | Method for reserving bandwidth | |
| KR100372590B1 (en) | Method for allocating link capacity in virtual private networks | |
| CN116232427A (en) | Forward bandwidth allocation method for satellite network | |
| CN114145003A (en) | Enabling data exchange between first and second communication networks having different data communication capabilities | |
| Satoh et al. | An Available Bandwidth Estimation Scheme in Simultaneous Multiple-Pair Connections |
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 |