Methods, apparatus and computer programs for allocating traffic in a telecommunications network
Embodiments of the disclosure provide methods, apparatus and computer programs for allocating traffic in a telecommunications network comprising a plurality of nodes, with pairs of nodes being connected by respective links. A method comprises obtaining a plurality of demands for connectivity between respective first nodes and respective second nodes of the telecommunications network, each demand being subject to a respective constraint associated with the connectivity between the respective first node and the respective second node; for each demand, generating a list of possible paths between the first node and the second node satisfying the constraint; based on the list of possible paths for each demand and an indication of traffic usage for each demand, determining, for each demand, weights in respect of each of the possible paths; and providing the weights to nodes of the telecommunications network, for the distribution of traffic associated with each of the plurality of demands to the possible paths in accordance with the respective weights.
1. A method for allocating traffic in a telecommunications network, the telecommunications network comprising a plurality of nodes, with pairs of nodes being connected by respective links, the method comprising:
obtaining a plurality of demands for connectivity between respective first nodes and respective second nodes of the telecommunications network, each demand being subject to a respective constraint associated with the connectivity between the respective first node and the respective second node;
for each demand:
generating a list of possible paths between the first node and the second node satisfying the constraint; and
determining weights in respect of each of the possible paths based on the list of possible paths for each demand and an indication of traffic usage for each demand; and
providing the weights to nodes of the telecommunications network, for the distribution of traffic associated with each of the plurality of demands to the possible paths in accordance with the respective weights.
2. The method of claim 1 , wherein the determining weights comprises performing a global optimization algorithm, having as input the lists of possible paths for the plurality of demands and the indications of traffic usage for the plurality of demands, to generate the weights.
3. The method of claim 2 , wherein each link has a capacity, and wherein the optimization algorithm seeks to minimize the globally highest ratio of traffic usage to capacity for a link.
4. The method of claim 2 , wherein each link has a capacity, and wherein the optimization algorithm seeks to minimize a sum of the square of the ratio of traffic usage to capacity for the plurality of links.
5. The method of claim 2 , wherein the optimization algorithm comprises a quadratic optimization algorithm or a minimax linear algorithm.
6. The method of claim 1 , wherein the respective constraint for each demand comprises: a maximum latency; a maximum light path length before optical-to-electrical conversion; a maximum number of electro-optic converters per unit path length; a maximum number of nodes; and/or a maximum number of segments used to express path routing.
7. The method of claim 6 , wherein each link is associated with a latency, and wherein the generating the list of possible paths comprises determining all paths through the telecommunications network from the first node to the second node having a cumulative latency which is less than the maximum latency.
8. The method of claim 1 , wherein the generating the list of possible paths comprises performing a breadth-first search or a depth-first search.
9. The method of claim 1 , wherein each of the demands for connectivity is associated with an expected amount of traffic.
10. The method of claim 1 , wherein the telecommunications network comprises a fronthaul network providing connectivity between nodes of a radio access network.
11. The method of claim 1 , wherein the method is performed in a software-defined networking controller for the telecommunications network.
12. A network management node for allocating traffic in a telecommunications network; the telecommunications network comprising a plurality of nodes, with pairs of nodes being connected by respective links; the network management node comprising:
processing circuitry;
memory containing instructions executable by the processing circuitry whereby the network management node is operative to:
obtain a plurality of demands for connectivity between respective first nodes and respective second nodes of the telecommunications network, each demand being subject to a respective constraint associated with the connectivity between the respective first node and the respective second node;
for each demand:
generate a list of possible paths between the first node and the second node satisfying the constraint; and
determine weights in respect of each of the possible paths based on the list of possible paths for each demand and an indication of traffic usage for each demand; and
provide the weights to nodes of the telecommunications network, for the distribution of traffic associated with each of the plurality of demands to the possible paths in accordance with the respective weights.
13. The network management node of claim 12 , wherein the instructions are such that the network management node is operative to determine the weights by performing a global optimization algorithm, having as input the lists of possible paths for the plurality of demands and the indications of traffic usage for the plurality of demands, to generate the weights.
14. The network management node of claim 13 , wherein each link has a capacity, and wherein the optimization algorithm seeks to minimize the globally highest ratio of traffic usage to capacity for a link.
15. The network management node of claim 13 , wherein each link has a capacity, and wherein the optimization algorithm seeks to minimize a sum of the square of the ratio of traffic usage to capacity for the plurality of links.
16. The network management node of claim 13 , wherein the optimization algorithm comprises a quadratic optimization algorithm or a minimax linear algorithm.
17. The network management node of claim 12 , wherein the respective constraint for each demand comprises: a maximum latency; a maximum light path length before optical-to-electrical conversion; a maximum number of electro-optic converters per unit path length; a maximum number of nodes; and/or a maximum number of segments used to express path routing.
18. The network management node of claim 17 , wherein each link is associated with a latency, and wherein the generating the list of possible paths comprises determining all paths through the telecommunications network from the first node to the second node having a cumulative latency which is less than the maximum latency.
19. The network management node of claim 12 , wherein the network management node is caused to generate a list of possible paths by performing a breadth-first search or a depth-first search.
20. The network management node of claim 12 , wherein each of the demands for connectivity is associated with an expected amount of traffic.
21. The network management node of claim 12 , wherein each of the demands for connectivity is associated with a measured amount of traffic.