SYSTEMS AND METHODS FOR PERFORMING TRAFFIC ENGINEERING IN A COMMUNICATIONS NETWORK

• US 20170289043A1
• Filed: 04/26/2016
• Published: 10/05/2017
• Est. Priority Date: 03/29/2016
• Status: Abandoned Application

• Current Assignee: Huawei Technologies Canada Co., Ltd (Huawei Investment & Holding Co., Ltd.)
• Original Assignee: Huawei Technologies Canada Co., Ltd (Huawei Investment & Holding Co., Ltd.)
• Inventors: Zhang, Nan, Liao, Wei-Cheng, Hong, Mingyi, Farmanbar, Hamidreza, Luo, Zhi-Quan
• Application Number:
  US15/138,973
• Publication Number:
  US 20170289043A1
• Time in Patent Office: Days
• CPC Class Codes: H04L 47/125 by balancing the load, e.g. traffic engineering
• CPC Class Codes: H04L 47/28 in relation to timing considerations
• CPC Class Codes: H04L 47/30 in combination with information about buffer occupancy at either end or at transit nodes
• CPC Class Codes: H04W 28/10 Flow control between communication endpoints
• CPC Class Codes: H04W 40/22 using selective relaying for reaching a BTS [Base Transceiver Station] or an access point

Abstract

A method is disclosed for performing traffic engineering for a flow traversing a communications network having a plurality of nodes communicatively coupled by a plurality of links, with at least one of the plurality of links being a wireless link. The method includes setting an activation factor for the at least one wireless link in accordance with buffer statuses associated with nodes traversed by the flow; and transmitting the activation factor to a scheduling entity for scheduling activation of the at least one wireless link in accordance with the activation factor.

Claims

1. A method for performing traffic engineering for a flow traversing a communications network, the communications network having a plurality of nodes communicatively coupled by a plurality of links, at least one of the plurality of links being a wireless link, the method comprising:

setting an activation factor for the at least one wireless link, in accordance with buffer statuses associated with nodes traversed by the flow; and

transmitting the activation factor to a scheduling entity for scheduling activation of the at least one wireless link in accordance with the activation factor.

2. The method of claim 1 further comprising setting a flow rate on the at least one wireless link traversed by the flow in accordance with the buffer statuses associated with the nodes traversed by the flow.

3. The method of claim 1 further comprising setting a net flow rate for the flow in accordance with the buffer statuses associated with the nodes traversed by the flow.

4. The method of claim 1 wherein the activation factor for the at least one wireless link is determined according to a traffic engineering problem having at least one constraint comprising the buffer statuses associated with the nodes traversed by the flow.

5. The method of claim 4 wherein the traffic engineering problem comprises a plurality of constraints selected from the group consisting of:

link capacity constraint, individual buffer bound constraint, network flow conservation constraint, half-duplex constraint, general interference graph constraint, buffer overflow constraint, an achieved flow rate for commodity constraint, and combinations thereof.

6. The method of claim 4 wherein the traffic engineering problem has at least one constraint comprising the activation factor for the at least one wireless link, wherein the activation factor is relaxed from a Boolean number to a real number.

7. The method of claim 5 wherein the buffer overflow constraint comprises an adaptively updated buffer overflow constraint.

8. The method of claim 4 wherein the traffic engineering problem is solved according to a mathematical programming method.

9. The method of claim 4 wherein the traffic engineering problem comprises a utility function.

10. The method of claim 9 wherein the utility function is selected from the group consisting of sum rate, minimum rate, weighted sum rate, load balancing, and proportional fairness.

11. The method of claim 4 wherein the traffic engineering problem is solved for a long-term operational period, and the activation factor for the at least one wireless link comprises a fraction of the long-term operational period.

12. A method for performing scheduling for a flow traversing a communications network having a plurality of nodes communicatively coupled by a plurality of links, at least one of the plurality of links being a wireless link, the method comprising:

receiving an activation factor, associated with the at least one wireless link, indicative of a suggested amount of time within a defined time window that the at least one wireless link should be active; and

scheduling activation of the at least one wireless link in accordance with the activation factor and one or more buffer statuses associated with nodes at either end of the at least one wireless link.

13. The method of claim 12 wherein the step of scheduling activation of the at least one wireless link is performed in accordance with an edge-coloring method using the one or more buffer statuses.

14. The method claim 12 wherein the activation factor is determined for a long-term operational period, and the step of scheduling activation of the at least one wireless link is performed over a short-term operational period less than or equal to the long-term operational period.

15. A Traffic Engineering (TE) controller comprising:

a processor;

an input interface coupled to the processor, the input interface for receiving buffer statuses associated with nodes traversed by a flow in a communications network;

a memory coupled to the processor and having instructions stored therein, that when executed by the processor causes the TE controller to set an activation factor for at least one wireless link of the communications network in accordance with the buffer statuses; and

an output interface coupled to the processor, the output interface for transmitting the activation factor for the at least one wireless link to a scheduler for scheduling activation of the at least one wireless link in accordance with the activation factor.

16. The TE controller of claim 15 wherein the memory contains further instructions stored therein, which when executed by the processor causes the TE controller to set a flow rate on the at least one wireless link traversed by the flow in accordance with the buffer statuses, and the output interface is further for providing the flow rate to the communications network.

17. The TE controller of claim 15 wherein the memory contains further instructions stored therein, which when executed by the processor causes the TE controller to determine a net flow rate for the flow in the communications network in accordance with the buffer statuses, and the output interface is further for providing the net flow rate to the communications network.

18. The TE controller of claim 15 wherein the activation factor for the at least one wireless link of the communications network is determined according to a traffic engineering problem having at least one constraint comprising the buffer statuses associated with the nodes traversed by the flow.

19. The TE controller of claim 18 wherein the traffic engineering problem comprises a plurality of constraints, wherein the constraints are selected from the group consisting of:

link capacity constraint, individual buffer bound constraint, network flow conservation constraint, half-duplex constraint, general interference graph constraint, buffer overflow constraint, an achieved flow rate for commodity constraint, and combinations thereof.

20. The TE controller of claim 18 wherein the traffic engineering problem has at least one constraint comprising the activation factor for the at least one wireless link, wherein the activation factor is relaxed from a Boolean number to a real number.

21. The TE controller of claim 19 wherein the buffer overflow constraint comprises an adaptively updated buffer overflow constraint.

22. The TE controller of claim 18 wherein the traffic engineering problem is solved according to a mathematical programming method.

23. The TE controller of claim 18 wherein the traffic engineering problem comprises a utility function.

24. The TE controller of claim 23 wherein the utility function is selected from the group consisting of sum rate, minimum rate, weighted sum rate, load balancing, and proportional fairness.

25. The TE controller of claim 18 wherein the traffic engineering problem is solved for a long-term operational period, and the activation factor for each link comprises a fraction of the long-term operational period.

26. A scheduler for scheduling activation of links for a flow traversing a communications network, the scheduler comprising:

a processor;

an input interface coupled to the processor, the input interface for receiving an activation factor for at least one wireless link of the communications network indicative of a suggested amount of time within a defined time window that the at least one wireless link should be active, and buffer statuses associated with nodes traversed by the flow in the communications network;

a memory coupled to the processor and having instructions stored therein that when executed by the processor causes the scheduler to set scheduling of the at least one wireless link according to the activation factor and the buffer statuses associated with the nodes traversed by the flow; and

an output interface coupled to the processor, the output interface for transmitting signals to activate the at least one wireless link in accordance with the set scheduling.

27. The scheduler of claim 26 wherein the scheduling activation of the links is determined in accordance with an edge-coloring method using the buffer statuses associated with the nodes traversed by the flow.

28. The scheduler of claim 26 wherein the activation factor is determined for a long-term operational period, and determining scheduling of the at least one wireless link is performed over a short-term operational period less than or equal to the long-term operational period.

29. A computer readable memory having recorded thereon statements and instructions for execution by a computer for performing traffic engineering for a flow traversing a communications network, the communications network having a plurality of nodes communicatively coupled by a plurality of links, at least one of the plurality of links being a wireless link, the statements and instructions comprising:

setting an activation factor for the at least one wireless link in accordance with buffer statuses associated with nodes traversed by the flow; and

transmitting the activation factor to a scheduling entity for scheduling activation of the at least one wireless link in accordance with the activation factor.