阅读说明：本技术 一种保证延迟的低成本流量分配实现方法 (Low-cost flow distribution implementation method capable of guaranteeing delay ) 是由 王晓梅 李刚 陈彦萍 于 2020-12-09 设计创作，主要内容包括：本发明涉及一种保证延迟的低成本流量分配实现方法,该方法包括：节点收到来自相邻节点的传输业务需求,要求提供带宽和最大保证延时；节点通过发送测试消息,获取链路的可达性信息、链路延迟；获取链路成本和链路带宽；调用业务分配算法SAA；若调用成功,按照算法SAA返回的链路分配流量方案,设置链路的保留流量带宽,并通知相邻节点分配成功和业务需求应使用的流标识号；若调用失败,通知相邻节点失败；结束退出。本发明通过构建业务分配算法SAA,解决了在物联网网络通信中保证延迟的动态流量分配的问题。(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 a link distribution flow scheme returned by the algorithm SAA, and informing the flow identification number which is successfully distributed and used by the adjacent node and is required by the service; 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.)

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_MNOther links send test message to obtain reachability information A of link_X；

Step S300, the node N according to the accessibility information A_XSending 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_XObtaining the link cost C of the link which can reach the node X_XAnd link bandwidth R_X；

Step S500, the node N according to the link cost C_XLink bandwidth R_XAnd link delay d_XCalling 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.

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¹Complementary allocation of traffic bandwidth W²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_DIf W is greater than 0_DIf W is greater than 0, go to step S503_DIf not, go to step S507;

step S503, judging whether the circulation variable j is less than or equal to the dividing link L_MNOtherwise, 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_XjWhether d is less than or equal to the maximum guaranteed delay, if d_XjIf d is less than or equal to d, go to step S505_XjIf d is greater than or equal to d, go to step S506;

step S505, calculating the first allocated flow bandwidth of the jth linkModifying remaining bandwidthGo 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_DIf W is greater than 0_DIf W is greater than 0, go to step S509, if W is_DIf not, go to step S513;

step S509, judging whether the loop variable j is less than or equal to the dividing link L_MNOtherwise, 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_XjWhether d is less than or equal to the maximum guaranteed delay, if d_XjIf d is less than or equal to d, go to step S511_XjIf d is greater than or equal to d, go to step S512;

step S511, calculating the complementary distribution flow bandwidth of the j linkModifying remaining bandwidthGo 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_DIf W is greater than 0_DIf W is greater than 0, go to step S514_DIf 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¹And complementary allocation of traffic bandwidth W²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 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.

5. The service allocation algorithm SAA according to claim 3, wherein said step S501 of allocating traffic bandwidth W for the first time¹Complementary allocation of traffic bandwidth W²And link allocation traffic bandwidth W⁺The method also comprises the following steps:

first allocation of traffic bandwidth W¹Complementary allocation of traffic bandwidth W²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,is the first allocated traffic bandwidth for the ith link of node N that can reach node X,is the supplemental allocated traffic bandwidth for the ith link of node N that can reach node X,the link distribution flow bandwidth of the ith link which can reach the node X of the node N, m is the link L_MNNumber of links, W, beyond that which can reach node X¹、W²And W⁺The initial value of each component is zero.

6. The service allocation algorithm SAA according to claim 3, wherein said step S505 of calculating the bandwidth of the first allocated traffic of the j linkFurther comprising:

calculating the first allocated flow bandwidth of the jth link according to the following formula

Where i and j are the number of links that can reach node X, and m is the number of links other than L_MNNumber of links, W, beyond that which can reach node X_DIs the remaining flow to be allocated, C_XiAnd C_XjIs the link cost, R, of the ith and jth links of node N that can reach node X_XiAnd R_XjIs the link bandwidth of the ith and jth links of node N that can reach node X.

7. The service allocation algorithm SAA according to claim 3, wherein the complementary allocated traffic bandwidth of the j-th link is calculated in step S511Further comprising:

calculating the complementary distribution flow bandwidth of the j link according to the following formula

Where i and j are the number of links that can reach node X, and m is the number of links other than L_MNNumber of links, W, beyond that which can reach node X_DIs the remaining flow to be allocated, C_XiAnd C_XjIs the link cost, R, of the ith and jth links of node N that can reach node X_XiAnd R_XjIs the link bandwidth of the ith and jth links of node N that can reach node X,is an intermediate variable for temporarily storing the bandwidth of the supplementary allocated trafficThe intermediate calculation result of (2).

8. The service allocation algorithm SAA according to claim 3, wherein the link allocation traffic scheme in step S515 further comprises:

the link allocation flow scheme refers to link allocation flow bandwidth W⁺Calculating the link allocation flow bandwidth W according to the following formula⁺：

Where i is the number of links that can reach node X,is the first allocated traffic bandwidth for the ith link of node N that can reach node X,is the complementary allocated traffic bandwidth for the ith link of node N that can reach node X.

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_MNOther links send test message to obtain reachability information A of link_X；

Step S300, the node N according to the accessibility information A_XSending delay test message to link capable of reaching node X to obtain link capable of reaching node XLink delay d_X；

Step S400, the node N according to the accessibility information A_XObtaining the link cost C of the link which can reach the node X_XAnd link bandwidth R_X；

Step S500, the node N according to the link cost C_XLink bandwidth R_XAnd link delay d_XCalling 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_XThe method also comprises the following steps:

for obtaining reachability information A of each link to reach node X_XNode N needs to go to link L_MNOther links than the link transmitting the test message, generating reachability information A according to whether the response message is answered_X；

Reachability information a_XConsists 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_XkIs the reachability information of node N to node X via the k-th link, N is the division link L_MNNumber of links other than A_XkIs 0, meaning unreachable, A_XkIs 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_XThe method also comprises the following steps:

to obtain the link delay d of the link that can reach node X_XNode N needs to be based on reachability information A_XSending 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_XConsists 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_XiIs 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_MNNumber of links beyond that which can reach node X, d_XiThe unit of (d) is in microseconds.

In an embodiment of the present invention, the link cost C of the link that can reach the node X in the step S400 is_XAnd link bandwidth R_XThe method also comprises the following steps:

link cost C_XConsists 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_XiIs the link cost of the ith link of node N to node X, m is the link L_MNNumber of links other than those that can reach node X, C_XiThe smaller the value of (A), the more the cost is expressedHigh;

link bandwidth R_XConsists 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_XiIs the link bandwidth of the ith link of node N that can reach node X, m is the division of link L_MNNumber of links other than that which can reach node X, R_XiThe value of (A) is a positive integer, the larger the value, the higher the bandwidth is represented, R_XiThe 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 the first distribution flow bandwidth W distributed to each link by the transmission service requirement S¹Complementary allocation of traffic bandwidth W²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_DIf W is greater than 0_DIf W is greater than 0, go to step S503_DIf not, go to step S507;

step S503, judging whether the circulation variable j is less than or equal to the dividing link L_MNOtherwise, 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_XjWhether d is less than or equal to the maximum guaranteed delay, if d_XjIf d is less than or equal to d, go to step S505_XjIf d is greater than or equal to d, go to step S506;

step S505, calculating the first allocated flow bandwidth W of the jth link_j ¹Modifying the residual bandwidth W_D＝W_D-W_j ¹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_DIf W is greater than 0_DIf W is greater than 0, go to step S509, if W is_DIf not, go to step S513;

step S509, judging whether the loop variable j is less than or equal to the dividing link L_MNOtherwise, 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_XjWhether d is less than or equal to the maximum guaranteed delay, if d_XjIf d is less than or equal to d, go to step S511_XjIf d is greater than or equal to d, go to step S512;

step S511, calculating the complementary distribution flow bandwidth W of the j link_j ²Modifying the residual bandwidth W_D＝W_D-W_j ²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_DIf W is greater than 0_DIf W is greater than 0, go to step S514_DIf 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¹And complementary allocation of traffic bandwidth W²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¹Complementary allocation of traffic bandwidth W²And link allocation traffic bandwidth W⁺The method also comprises the following steps:

first allocation of traffic bandwidth W¹Complementary allocation of traffic bandwidth W²And link allocation traffic bandwidth W⁺Composed of a plurality of componentsIt can be expressed as:

where i is the number of links that can reach node X, W_i ¹Is the first allocated traffic bandwidth, W, of the ith link of node N that can reach node X_i ²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_MNNumber of links, W, beyond that which can reach node X¹、W²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 ¹The method also comprises the following steps:

calculating the first allocated flow bandwidth W of the jth link according to the following formula_j ¹：

Where i and j are the number of links that can reach node X, and m is the number of links other than L_MNNumber of links, W, beyond that which can reach node X_DIs the remaining flow to be allocated, C_XiAnd C_XjIs the link cost, R, of the ith and jth links of node N that can reach node X_XiAnd R_XjI and j links to node XThe link bandwidth of (c).

In an embodiment of the present invention, the step S511 further allocates the traffic bandwidth W_j ²The method also comprises the following steps:

calculating the supplementary distribution flow bandwidth W of the j link according to the following formula_j ²：

Where i and j are the number of links that can reach node X, and m is the number of links other than L_MNNumber of links, W, beyond that which can reach node X_DIs the remaining flow to be allocated, C_XiAnd C_XjIs the link cost, R, of the ith and jth links of node N that can reach node X_XiAnd R_XjIs the link bandwidth of the ith and jth links of node N that can reach node X, WT_j ²Is an intermediate variable for temporarily storing the bandwidth W of the supplementary allocated traffic_j ²The intermediate calculation result of (2).

In an embodiment of the present invention, the link allocation 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 ¹+W_i ²

Where i is the number of links that can reach node X, W_i ¹Is the first allocated traffic bandwidth, W, of the ith link of node N that can reach node X_i ²Is the complementary 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 invention has the beneficial effects that: 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 an implementation method of guaranteeing delayed low-cost traffic distribution 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_MNChains other thanSending test information by way, obtaining accessibility information A of link_X；

As shown in fig. 1, in step S300, the node N is based on the reachability information a_XSending 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_XObtaining the link cost C of the link which can reach the node X_XAnd link bandwidth R_X；

As shown in FIG. 1, in step S500, node N depends on link cost C_XLink bandwidth R_XAnd link delay d_XCalling 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 neighboring node M of a service that can provide the service requirement S and a stream identifier 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_XIs 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_MNOther links send test message to obtain reachability information A of link_X。

In one embodiment of the invention, the reachability information A of each link to reach the node X is acquired_XNode N needs to go to link L_MNOther links than the link transmitting the test message, generating reachability information A according to whether the response message is answered_X；

Reachability information a_XConsists 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_XkIs the reachability information of node N to node X via the k-th link, N is the division link L_MNNumber of links other than A_XkIs 0, meaning unreachable, A_XkIs 1, indicating reachable.

In step S300, the node N is based on the reachability information a_XSending 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_XNode N needs to be based on reachability information A_XSending 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_XConsists 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_XiIs 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_MNNumber of links beyond that which can reach node X, d_XiThe unit of (d) is in microseconds.

In step S400, the node N is based on the reachability information a_XObtaining the link cost C of the link which can reach the node X_XAnd link bandwidth R_X。

In one embodiment of the invention, the link cost C_XConsists 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_XiIs the link cost of the ith link of node N to node X, m is the link L_MNNumber of links other than those that can reach node X, C_XiThe value of (A) is a positive integer, and the smaller the value is, the higher the cost is;

link bandwidth R_XConsists 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_XiIs the link bandwidth of the ith link of node N that can reach node X, m is the division of link L_MNNumber of links other than that which can reach node X, R_XiThe value of (A) is a positive integer, the larger the value, the higher the bandwidth is represented, R_XiThe unit of (d) is bits per second;

the link cost C can be obtained by accessing the configuration information of the node N_XLink bandwidth R_XLink cost C_XThe adjustment can be carried out through manual configuration and can also be carried out according to nodesAnd calculating other configuration information of N.

In step S500, node N bases on link cost C_XLink bandwidth R_XAnd link delay d_XAnd calling a service allocation algorithm SAA to meet the link flow allocation of the service requirement S under the condition of the maximum guaranteed delay d.

In an embodiment of the present invention, a node N needs to invoke a service allocation algorithm SAA, satisfy link traffic allocation of a service requirement S under a condition of a maximum guaranteed delay d, invoke the service allocation algorithm SAA, and need to input a link cost C_XLink bandwidth R_XAnd link delay d_XFig. 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, in step S501, it is configured to implement the first allocation traffic bandwidth W of the transmission service requirement S to each link¹Complementary allocation of traffic bandwidth W²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；

As shown in fig. 2, in step S502, the remaining flow rate W to be allocated is determined_DIf W is greater than 0_DIf W is greater than 0, go to step S503_DIf 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_MNOtherwise, 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_XjWhether d is less than or equal to the maximum guaranteed delay, if d_XjIf d is less than or equal to d, go to step S505_XjIf 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 ¹Modifying the residual bandwidth W_D＝W_D-W_j ¹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_DIf W is greater than 0_DIf W is greater than 0, go to step S509, if W is_DIf 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_MNOtherwise, 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, the j link delay d is determined_XjWhether d is less than or equal to the maximum guaranteed delay, if d_XjIf d is less than or equal to d, go to step S511_XjIf 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 ²Modifying the residual bandwidth W_D＝W_D-W_j ²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_DIf W is greater than 0_DIf W is greater than 0, go to step S514_DIf 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 assignment 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¹And complementary allocation of traffic bandwidth W²Calculating the link allocation traffic bandwidth W⁺Returning to the calling success and link distribution flow scheme to inform the caller of SAA algorithmAnd (6) working and exiting.

In an embodiment of the present invention, in the step S501, the traffic bandwidth W is allocated for the first time¹Complementary allocation of traffic bandwidth W²And link allocation traffic bandwidth W⁺The method also comprises the following steps:

first allocation of traffic bandwidth W¹Complementary allocation of traffic bandwidth W²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 ¹Is the first allocated traffic bandwidth, W, of the ith link of node N that can reach node X_i ²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_MNNumber of links, W, beyond that which can reach node X¹、W²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 ¹The method also comprises the following steps:

calculating the first allocated flow bandwidth W of the jth link according to the following formula_j ¹：

Where i and j are the number of links that can reach node X, and m is the number of links other than L_MNNumber of links, W, beyond that which can reach node X_DIs the remaining flow to be allocated, C_XiAnd C_XjIs the link cost, R, of the ith and jth links of node N that can reach node X_XiAnd R_XjIs 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 ²The method also comprises the following steps:

calculating the supplementary distribution flow bandwidth W of the j link according to the following formula_j ²：

Where i and j are the number of links that can reach node X, and m is the number of links other than L_MNNumber of links, W, beyond that which can reach node X_DIs the remaining flow to be allocated, C_XiAnd C_XjIs the link cost, R, of the ith and jth links of node N that can reach node X_XiAnd R_XjIs the link bandwidth of the ith and jth links of node N that can reach node X, WT_j ²Is an intermediate variable for temporarily storing the bandwidth W of the supplementary allocated traffic_j ²The intermediate calculation result of (2).

In an embodiment of the present invention, the link allocation 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 ¹+W_i ²

Where i is the number of links that can reach node X, W_i ¹Is the first allocated traffic bandwidth, W, of the ith link of node N that can reach node X_i ²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 the step S600 is shifted after determining that the invocation of the service allocation algorithm SAA is successful, and notifies the neighboring node M that the service and the stream identifier SID of the service requirement S can be provided, and replies 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 of the request message and the response message.

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.

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.