CPC H04L 47/823 (2013.01) [G06N 3/02 (2013.01); H04L 41/147 (2013.01)]  18 Claims 
1. A method of network resource allocation, comprising:
generating an adjacency matrix of nodes in a metropolitan area network (MAN) according to spatial adjacency relationships of the nodes;
generating a network state feature matrix according to traffic information of each of the nodes;
extracting traffic spatial features of the nodes from the adjacency matrix and the network state feature matrix through a traffic spatial feature extraction model;
obtaining predicted traffic of the nodes from the traffic spatial features through a traffic prediction model; and
performing a network resource allocation according to the predicted traffic of the nodes; wherein,
the generating an adjacency matrix of nodes comprises:
obtaining a dynamic network state graph of the MAN;
dividing the dynamic network state graph into a number of static network state graphs according to a certain time step; wherein, each static network state graph corresponds to a time point;
analyzing a static network state graph to obtain nodes and edges among the nodes corresponds to the time point of the static network state graph; and
obtaining the spatial adjacency relationships of the nodes according to the edges among the nodes; wherein, a spatial adjacency relationship of any two nodes is determined according to a fact whether a physical link exists between the two nodes; and
generating the adjacency matrix of the nodes according to the spatial adjacency relationships of the nodes.
