CPC H04L 41/12 (2013.01) [H04L 41/0816 (2013.01); H04L 41/0896 (2013.01)] | 3 Claims |
1. A method comprising:
predicting a traffic demand that is capable of occurring between nodes present in a target network area under a plurality of conditions, thereby generating a plurality of traffic demand matrices,
generating an average traffic demand matrix from the plurality of traffic demand matrices, where the elements of the average traffic demand matrix are average values obtained from a plurality of demands between the nodes from the plurality of traffic demand;
step a—obtaining a node with a largest traffic demand for each target node present in the target network area by using the average traffic demand matrix;
step b—determining number of links required to accommodate the traffic demand;
step c—determining number of available ports at the obtained node and the target node;
step d—establishing the number of links required to accommodate traffic between the obtained node and the target node and updating available ports at the obtained node and the target if ports are available to support the number of links required;
step e—forego establishing the number of links required to accommodate traffic between the obtained node and the target node if ports are unavailable to support the number of links required; and
repeating steps a-e for all traffic demands.
|